0% found this document useful (0 votes)
0 views

Unit 1

Classical Mechanics

Uploaded by

subhash32
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
0 views

Unit 1

Classical Mechanics

Uploaded by

subhash32
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

UNIT - I

Fuzzy Sets : Basic Concepts

INTRODUCTION :
Fuzzy sets were introduced in 1965 by Lotfi Zadeh to model ambiguity and
vagueness. Any realistic process is not perfect and ambiguity may arise from the
interpretation of inputs or in the formulation of relationship between various attributes.
Fuzzy sets is a tool which can be used to relate human reasoning capabilities to the
knowledge based systems. Fuzzy logic provides mathematical base to transform certain
perceptual and linguistic attributes for further computational and decision process.

1.1 Fuzzy Sets


There are three basic methods of describing a subset of X. First is listing the
elements of the set. e.g. A = {x1, x2 , x3 ,.......} , xi ∈ X for all i = 1, 2, 3, ......

Secondly, a subset of X can be defined by the property of its members, e.g.


A = {x ∈ X | p( x)} where p ( x) is the property about x.

Third method is by characteristic function. If A ⊆ X then it is represented by a


function χ A : X → {0,1} such that χ A ( x ) = 0 if x ∉ A and χ A ( x ) = 1 if x ∈ A . This
method of describing subsets of X can be generalied to define Fuzzy subsets of X. In
characteristic function 1 represents full membership and 0 represents non-membership
value of the element x in A. Characteristic function allows these two membership values
to every element of X. Fuzzy sets allows the membership values between 0 and 1. We
define Fuzzy subset of X formally as follows.

1. Fuzzy Set
Let, X be any set. A Fuzzy subset of X is defined by a membership function,

A : X → [ 0,1]

1
The Fuzzy set is identified by its membership function.
Following are some of the examples of Fuzzy set.

2. Example
A class of real numbers close to 12 is a Fuzzy set.

1 1 1

O 11 12 13 O 11 12 13 O 11 12 13

° ¡ → I = [ 0,1] may be defined by various types of functions.


12:

3. Example
Obtain a Fuzzy set which represents the property
(1) Highly educated, (2) Little educated
Ans. : We assume the following levels of education
0 - No education
1 - Elementary education
2 - Highschool education
3 - Junior college
4 - Degree college
5 - Masters degree
6 - M.Phil. / Ph.D.

2
1
Highly educated

Medium educated
Little educated
O 1 2 3 4 5 6

4. Example : Represent the following linguistic concepts as fuzzy sets -


(1) Very low temperature
(2) Low temperature
(3) Medium temperature
(4) High temperature
(5) Very high temperature
in a temperature range 0–100°C.
Ans. :

VL L M H VH
1

O 10 20 30 40 50 60 70 80 90 100

3
1.2 Basic Concepts
The concepts of α -cuts and strong α -cuts play an important role in the
relationship between fuzzy sets and crisp sets (classical sets).
1. Definition
α -cut of a fuzzy set : Let, A : X → I be a fuzzy subset of X, then α -cut of A
is defined as, α
A = {x ∈ X | A ( x ) ≥ α } , α ∈ [ 0,1]

The strong α -cut of A is defined as, α+


A = {x ∈ X | A ( x ) > α } , α ∈ [ 0,1]
2. Note
α+
1) A⊆ αA
2) If α = 0 , then
0
A = {x ∈ X | A ( x ) ≥ 0}

⇒ 0A = X
And if α = 1 then
1
A = {x ∈ X | A ( x ) ≥ 1}
1
A = {x ∈ X | A ( x ) = 1} (Qα ∈[ 0,1] )
1
A is called the coree of the fuzzy set A.
3. Example

A
α <β
1
⇒αA ⊇ βA
β

[ [ ] ]
O α A βA x

4
4. Example
Let M be the fuzzy of middle aged persons defined by,

M : X → [ 0,1]
where, X = {0, 1, 2, 3, ....., 100}
and M (x) = 0 if x ≤ 20 or x ≥ 60

x − 20
= if 20 ≤ x ≤ 35
15

60 − x
= if 40 ≤ x ≤ 60
15
=1 if 35 ≤ x ≤ 45
Find, 1M, 0.5M, 0.8M and 0+M.
Ans. : Here,
M : X → I , X = {0, 1, 2, ....., 100}

0.8

0.5

O 2.5 0.5
10 20 30 40 50 60 70 80 90 100

For x ∈ [ 20,35] ,

x − 20
M ( x) = ,
15

5
For x ∈ [ 45,60 ]

60 − x
M ( x) = ,
15
Now,

1) 1
M = { x ∈ X | M ( x) = 1}

⇒ 1M = {35,36,37,........,45}

2) 0.5
M = { x ∈ X | M ( x) ≥ 0.5}
But, M ( x ) ≥ 0.5

x − 20 1 60 − x 1
⇒ ≥ or ≥
15 2 15 2
⇒ 2 x − 40 ≥ 15 or 120 − 2 x ≥ 15
55 105
⇒x≥ or x ≤
2 2

55 105
⇒ ≤ x≤
2 2
Thus,
0.5
M = {28,29,30,.....,51,52}

3) 0.8
M = { x ∈ X | M ( x) ≥ 0.8}
But, M ( x ) ≥ 0.8

x − 20 4 60 − x 4
⇒ ≥ or ≥
15 5 15 5
⇒ x ≥ 32 or x ≤ 48
⇒ 32 ≤ x ≤ 48
Thus,
0.8
M = {32,33,34,.......,48}

6
4) 0+
M = {x ∈ X | M (x ) > 0}

But, M ( x ) > 0

x − 20 60 − x
⇒ > 0 or <0
15 15
⇒ x > 20 or x < 60
Thus,
0+
M = {21,22,23,.......,59}

5. The set of all levels x ∈ [ 0,1] that represents distinct α -cuts of a given fuzzy
set A is called a level set of A denoted by ∧ ( A) . i.e.

∧ ( A) = {α | A ( x ) = α for some x ∈ X }

6. Note

For any fuzzy set A and for distinct values α1 , α 2 ∈ [ 0,1] , α1 < α 2 ⇒ α1
A ⊇ α2 A
α1 +
and A ⊇ α 2 + A . Thus all α -cuts and strong α -cuts forms a families of nested crisp
sets. i.e. if α1 < α2 < α 3 < ......... then
α1 α2 α3
A⊇ A⊇ A ⊇ ........

7. Convex Sets
A set A in ¡ n is called a convex set if for any two elements r , s ∈ A , the
element.

t = λ r + (1 − λ ) s ∈ A for all 0 ≤ λ ≤ 1
i.e.for any two points r and s in A, the line segment joining r and s also lies
in A.

7
8. Convex Fuzzy Set
Let A : X → I be a fuzzy set defined on X. The fuzzy set A is called a convex
fuzzy set if every level cut of A is convex set.

9. Theorem
A fuzzy set A on ¡ is convex ifff

A ( λ x1 + (1 − λ ) x2 ) ≥ min ( A ( x1 ) , A( x2 ) ) , ∀x1, x2 ∈¡

Proof :

Let A : ¡ → I be a convex fuzzy set, I = [0, 1]

Let x1, x2 ∈¡ be arbitrary and let A ( x1 ) ≤ A ( x2 )

Let A ( x1 ) = α where, α ∈ [ 0,1]

Then, A ( x1 ) ≥ α ⇒ x1 ∈ α A

Also, A ( x2 ) ≥ A ( x1 ) = α

⇒ A ( x2 ) ≥ α

⇒ x2 ∈ α A

Thus, x1, x2 ∈ α A and α


A is a convex set (Q A is convex fuzzy set)
We get,

λ x1 + (1 − λ ) x2 ∈ α A ∀λ ∈ [ 0,1]

⇒ A ( λ x1 + (1 − λ ) x2 ) ≥ α ∀λ ∈ [ 0,1] .... (1)

Also,

A ( x2 ) ≥ A ( x1 ) = α

8
⇒ min {A ( x1 ) , A ( x2 )} = A ( x1 ) = α ..... (2)

Thus, from (1) and (2), we get,

A ( λ x1 + (1 − λ ) x2 ) ≥ min { A ( x1 ) , A ( x2 )} ∀0 ≤ λ ≤ 1 , ∀x1, x2 ∈¡

Conversely,

Let, A be a fuzzy set on ¡ s.t., ∀x1, x2 ∈¡ and ∀0 ≤ λ ≤ 1

A ( λ x1 + (1 − λ ) x2 ) ≥ min { A ( x1 ) , A ( x2 )}

We will prove that,


A is a convex fuzzt set.
i.e. we will show that, every α -cut of A is a convex set.
Let, α be arbitrary and α > 0 . i.e. 0 < α ≤ 1
(For α = 0 , 0 A = ¡ which is convex)
For, 0 < α ≤ 1 we have,
α
A = {x ∈ ¡ | A ( x ) ≥ α }

Let, x1, x2 ∈ α A . Then,

⇒ A ( x1 ) ≥ α and A ( x2 ) ≥ α

For any λ , 0 ≤ λ ≤ 1 , we have,

A ( λ x1 + (1 − λ ) x2 ) ≥ min { A ( x1 ) , A ( x2 )} (assumption)

≥α

( A ( x1 ) ≥ α , A ( x2 ) ≥ α ⇒ min { A ( x1 ) , A ( x2 )} ≥ α )
⇒ A ( λ x1 + (1 − λ ) x2 ) ≥ α
Thus,

⇒ λ x1 + (1 − λ ) x2 ∈ α A ∀0 ≤ λ ≤ 1

9
⇒ α A is a convex set.
Thus,
α
A is a convex set for all α ∈ [ 0,1]
Hence, A is a convex fuzzy set.
Thus,

A is a convex fuzzy set iff ∀x1, x2 ∈¡ and ∀λ ∈ [ 0,1]

A ( λ x1 + (1 − λ ) x2 ) ≥ min { A ( x1 ) , A ( x2 )}

10. Examples
If A is a convex set, then we may have the following representation.

1 A 1 A 1 A

α α α

[ ] [ ] [ ]
O α
O α O α
A A A

11. Example

1 A
α

[]
O α
A

α
A is not a convex set. Hence, A is not a convex fuzzy set.

10
12. Support of a Fuzzy Set
Let, A be a fuzzy set defined on X. The set of all elements whose “membership
values are non-zero” is called the support of A.
Thus,
Support of A = Supp A

= {x ∈ X | A ( x ) > 0}
i.e. Supp A = 0+A

13. Core of A
The set of all elements whose “membership value is 1” is called the core of A.

Thus, core of A = {x ∈ X | A ( x ) = 1}

i.e. Core of A = 1A.

14. Height of Fuzzy Set


Let, A be a fuzzy set defined on X. The “maximal membership value” of the
elements of X is called the height of A.

i.e. Height of A = h (A) = sup A ( x )


x∈X

If h(A) = 1, then A is called normal fuzzy set. Otherwise it is called subnormal


fuzzy set.

15. Notation For Representation of Fuzzy Sets


Let A be a fuzzy set on X, A : X → I

If X = {x1, x2 ,...., xn} . Then,

A ( x1 ) A ( x2 ) A ( xn )
A= + ..... +
x1 x2 xn

11
A ( xn )
i.e. A = ∑
n xn

If X = {x1, x2 , x3 ,....}
Then, we write

A ( x1 ) A ( x2 )
A= + + ......
x1 x2

∞ A ( xn )
=∑
n =1 xn

For an interval X, we denote the fuzzy set A by,

A( x)
A= ∫ x
X

16. Example :

x
Let, X = {0, 1, 2, ....., 10} and A ( x ) = . Then,
x+4

1 2 3 5
0 5 6 7
A= + + + + ...... + 7
0 1 2 3 10
Thus,

5
(1) h ( A) = = 0.71
7

⇒ h( A) ≠ 1
Therefore, A is not normal fuzzy set. (subnormal)
(2) Core of A = φ
(3) Supp (A) = {1, 2, ...., 10}

12
17. Scalar Cardinality of Fuzzy Set
If A is a fuzzy set defined on X, then, scalar cardinality of A is defined by

A= ∑ A( x)
x∈X

18. Example
Let X = {0, 1, 2, ....., 10}.

x
Define A : X → I by A ( x ) = . Then
x+4

A= ∑ A( x)
x∈X

= A(0) + A(1) + A(2) + ...... + A(10)

1 2 3 10
= 0 + + + + ....... + +
5 6 7 14
= 0.2 + 0.33 + ..... + 0.71 = 5.31

1.3 Operations on Fuzzy Set


1. Fuzzy Intersection
Let A and B be the two fuzzy sets defined on a set X ( A : X → I , B : X → I ).
( A ∩ B ) X → I defined by

( A ∩ B ) ( x ) = min { A ( x ) , B ( x )} = A ( x ) ∧ B ( x )
This is called standard Fuzzy intersection.

2. Fuzzy Union
Let A and B be the two fuzzy sets defined on a set X, then,
( A ∪ B ) : X → I defined by

13
( A ∪ B ) ( x ) = max { A ( x ) , B ( x )} = A ( x ) ∨ B ( x )
This is called standard fuzzy union.

3. Standard Fuzzy Complement


Let A be a fuzzy set on X. The standard fuzzy complement of A is defined by,

A: X → I

A ( x) = 1− A ( x)

4. Definition : Fuzzy Power Set


The family of all fuzzy sets defined on X is called a fuzzy power set of X and it
is denoted by F (X).
F (X) is a complemented, distributive complete lattice.

5. Note
Law of contradiction and law of excluded middle are not true for the fuzzy sets.
i.e. AI A ≠φ ..... (Law of contradiction)

and AU A ≠ X .... (Law of excluded middle)


where,
φ:X →I s.t. φ ( x) = 0 ∀x

and X:X →I s.t X (x) = 1 ∀x

6. Example
Prove that, for any Fuzzy sets A and B defined on X, the following properties
holds,
(1) AU ( A I B) = A
} (Law of Absorption)
(2) AI ( A U B) = A

14
Proof :
(1) For any x ∈ X ,

[ A U ( A I B)] ( x ) = A ( x ) ∨ ( A I B ) ( x ) S.F.U. definition

= A ( x ) ∨ [ A ( x ) ∧ B ( x )] S.F.I. deinition

Now, A ( x ) , B ( x ) ∈ [ 0,1]
Then,

either A ( x ) ≤ B ( x ) or B ( x ) ≤ A ( x )

Case (i) : If A ( x ) ≤ B ( x ) . Then,

A ( x) ∧ B ( x ) = A ( x )
And∴ A ( x ) ∨ [ A ( x ) ∧ B ( x ) ] = A ( x ) ∨ A ( x ) = A ( x )

i.e. [ A U ( A I B) ] ( x ) = A ( x ) , ∀x ∈ X

⇒ A U( A I B) = A

Case(ii) : Similarly,

if B ( x ) ≤ A ( x ) . Then,

A ( x) ∧ B ( x ) = B ( x )
and A ( x ) ∨ [ A ( x ) ∧ B ( x )] = A ( x ) ∨ B ( x )

= A( x)

⇒ [ A U ( A I B )] ( x) = A ( x ) ∀x ∈ X
Thus,

AU ( A I B) = A

15
(2) For any x ∈ X ,

[ A I ( A U B)] ( x ) = A ( x ) ∧ [ ( A U B ) ( x )]
= A ( x ) ∧[ A ( x ) ∨ B ( x ) ]

Now, A ( x ) , B ( x ) ∈ [ 0,1] . Then

either, A ( x ) ≤ B ( x ) or B ( x ) ≤ A ( x ) .

Case (i) : If A ( x ) ≤ B ( x ) . Then,

A ( x) ∨ B ( x ) = B ( x )

⇒ A ( x ) ∧ [ A ( x ) ∨ B ( x )]= A ( x ) ∧ B ( x )

= A( x)

⇒ [ A I ( A U B )] ( x) = A ( x ) , ∀x ∈ X

⇒ A I( A U B) = A
Therefore,

Case (ii) : If B ( x ) ≤ A ( x ) . Then,

A ( x) ∨ B ( x ) = A ( x )

⇒ A ( x ) ∧ [ A ( x ) ∨ B ( x )]= A ( x ) ∧ A ( x )

= A( x)

⇒ [ A I ( A U B )] ( x) = A ( x ) ∀x ∈ X

⇒ A I( A U B) = A
Therefore,

7. Definition : Subset
Let, A, B ∈ F ( X ) , we say that, A ⊆ B if A ( x ) ≤ B ( x ) , ∀x ∈ X .

16
8. Example
Prove that, A ⊆ B iff A I B = A and A U B = B ,

where, A, B ∈ F ( X ) .

Ans. : Let, A ⊆ B

i.e. A ( x) ≤ B ( x ) ∀x ∈ X
Then,

( A I B) ( x ) = A( x ) ∧ B ( x) By definition of fuzzy intersection

i.e. ( A I B) ( x ) = A( x ) ∀x ∈ X (Q A ( x ) ≤ B ( x ) )
⇒ AI B = A
Similarly

( A U B) ( x ) = A( x ) ∨ B ( x) By definition of fuzzy union

⇒ ( AU B) ( x ) = B ( x ) ∀x ∈ X (Q A ( x ) ≤ B ( x ) )
⇒ AU B = B
Conversely,
Let, A U B = B and A I B = A
Then, for any x ∈ X ,

( A U B ) ( x ) = B ( x ) and ( A I B ) ( x ) = A ( x )

⇒ A ( x ) ∨ B ( x ) = B ( x ) and A ( x ) ∧ B ( x ) = A ( x )

⇒ A( x ) ≤ B ( x ) ∀x ∈ X
⇒ A⊆ B

9. Example
If A and B are Fuzzy sets defined on X. Then, Show that

A + B = A U B + AI B

17
Ans. : For any x ∈ X ,

A ( x) , B ( x ) ∈ I
Since, ‘I is totally ordered’
either A ( x ) ≤ B ( x ) or B ( x ) ≤ A ( x ) holds ∀x ∈ X
Thus,
Case (1) : If, A ( x ) ≤ B ( x ) holds, then,

( A U B) ( x) = A ( x) ∨ B ( x) = B ( x )
and ( A I B) ( x) = A ( x) ∧ B ( x) = A ( x )
Therefore

( A U B) ( x) + ( A I B) ( x) = A ( x) + B ( x )

Case (2) : If B ( x ) ≤ A ( x ) holds. Then,

( A U B ) ( x ) = A ( x ) ∨ B ( x ) = A ( x ) and
( A I B) ( x) = A ( x) ∧ B ( x) = B ( x )
Thus

( A U B) ( x) + ( A I B) ( x) = A ( x) + B ( x )
Thus, ∀x ∈ X ,

( A U B) ( x) + ( A I B) ( x) = A ( x) + B ( x )
Taking summation over x ∈ X ,

∑ ( A U B) ( x) + ∑ ( A I B ) ( x ) = ∑ A ( x) + ∑ B ( x )
x∈X x∈X x∈X x∈X

⇒ A U B + AI B = A + B

18
10. Example
If A, B, C are Fuzzy sets on ¡ + defined by,,

1 2
1  1  2  1 
A( x) = , B ( x) =   and C ( x ) =  
1 + 10 x  1 + 10 x   1 +10 x 
Order the Fuzzy sets A, B and C by inclusion.

1
Ans. : Since, 0 ≤ ≤1
1 + 10 x
2 1
 1  1  1  2
⇒  ≤ ≤ 
 1 + 10 x  1 + 10 x  1 + 10 x 

⇒ C ( x) ≤ A ( x ) ≤ B ( x ) for all x ∈ ¡+

⇒C⊆ A⊆ B

11. Definition : Degree of Subset-Hood


Let A and B be the two Fuzzy sets, the degree of subset-hood S (A, B) of A in B
is defined by,

AI B
S (A , B ) =
A
12. Example

For a Fuzzy sets A and B defined on X = {x1, x2, x3, x4, x5} by,,

0.1 0.7 0.9 1


A= + + +
x1 x3 x4 x5

0.3 0.1 0.6 1 0.5


B= + + + +
x1 x2 x3 x4 x5
Find
1) A

2) B

19
3) A U B
4) A I B

5) A U B

6) A I B

7) A U B

8) A I B

9) A U A

10) A I A
11) S (A, B)
12) S (B, A)

13) A∆B ( = ( A − B ) U ( B − A ) = ( A I B ) U ( B I A ) )

Ans. :

0.9 1 0.3 0.1 0


1) A= + + + +
x1 x2 x3 x4 x5

0.7 0.9 0.4 0 0.5


2) B= + + + +
x1 x2 x3 x4 x5

0.3 0.1 0.7 1 1


3) AU B = + + + +
x1 x2 x 3 x 4 x 5

0.1 0 0.6 0.9 0.5


4) AI B = + + + +
x1 x2 x3 x4 x5

0.7 0.9 0.3 0 0


5) AU B = + + + + (By 3)
x1 x2 x3 x4 x5

0.9 1 0.4 0.1 0.5


6) AI B = + + + + (By 4)
x1 x2 x3 x4 x5

20
0.9 1 0.4 0.1 0.5
7) AU B = + + + + (By 1, 2)
x1 x2 x3 x4 x5

0.7 0.9 0.3 0 0


8) AI B = + + + + (By 1, 2)
x1 x2 x3 x4 x5

0.9 1 0.7 0.9 1


9) AU A = + + + +
x1 x2 x3 x4 x5

0.1 0 0.3 0.1 0


10) AI A = + + + +
x1 x2 x3 x4 x5

AI B
11) S (A , B ) =
A
But, |A| = 0.1 + 0.7 + 0.9 + 1 = 2.7
and, A I B = 0.1 + 0 + 0.6 + 0.9 + 0.5 = 2.1

A I B 2.1
Hence, S ( A, B ) = = = 0.77
A 2.7

BI A AI B
12) S (B , A ) = =
B B
Now, |B| = 0.3 + 0.1 + 0.6 + 1 + 0.5 = 2.5
and A I B = 2.1

2.1
Thus, S (B , A ) = = 0.84
2.5
13) For A∆B
We know that,

A∆B = ( A − B ) U ( B − A)

= ( A I B) U ( B I A)

21
Now,

0.1 0 0.4 0 0.5


AI B = + + + + ( min ( A, B ) )
x1 x2 x3 x4 x5

and

0.3 0.1 0.3 0.1 0


BI A = + + + + ( min ( B, A) )
x1 x2 x3 x4 x5
Then,

A∆B = ( A I B ) U ( B I A ) =
0.3 0.1 0.4 0.1 0.5
+ + + + ( max {( A I B ) , (B I A )} )
x1 x2 x3 x4 x5

13. Example
For Fuzzy sets A and B defined on X, prove that,
1) A I B = A U B

2) A U B = A I B
Ans. :
1) For any x ∈ X ,

( A I B ) ( x ) = 1 − ( A I B ) ( x ) − SFC
⇒ ( A I B ) ( x ) = 1 − ( A ( x ) ∧ B ( x ) ) − SFI

⇒ = (1 − A ( x ) ) ∨ (1 − B ( x ) )

⇒ = A ( x ) ∨ B ( x ) − SFC

⇒ = ( A U B ) ( x ) − SFU
Thus,

( A I B) ( x ) = ( A U B ) (x) ∀x ∈ X

⇒ AI B = A U B

22
2) Now, for any x ∈ X ,

⇒ ( A U B ) ( x ) = 1 − ( A U B ) ( x ) − SFC

⇒ = 1 − ( A ( x ) ∨ B ( x ) ) − SFU

⇒ = (1 − A ( x ) ) ∧ (1 − B ( x ) )

⇒ = A ( x ) ∧ B ( x ) − SFC

⇒ = ( A I B ) ( x ) − SFI
Thus,

( A U B) ( x ) = ( A I B ) (x) ∀x ∈ X

⇒ AU B = A I B

14. Definition
If A and B are Fuzzy sets defined on X the difference A – B is defined by

A− B= A IB
And the symmetric difference of A and B is define by,

A∆B = ( A − B ) U ( B − A) .

15. Example : Prove that

A∆B∆C = ( A I B I C ) U ( A I B I C ) U ( A I B I C ) U ( A I B I C )
Proof : Consider

A∆ ( B ∆C ) = ( B∆C ) ∆ A

= [( B − C ) U ( C − B ) ] ∆A (Q By definition)

=  ( B I C ) U ( C I B ) ∆A

{ } {
= ( B I C ) U ( C I B )  − A U A − ( B I C ) U ( C I B )  }
23
{ } {
= ( B I C ) U ( C I B )  I A U A I  ( B I C ) U ( C I B ) }
{ } {
= A I ( B I C ) U ( C I B )  U A I  ( B I C ) I ( C I B ) }
{ } {
= A I ( B I C ) U ( B I C )  U A I  ( B U C ) I ( C U B ) }
= {( A I ( B I C )) ( A I ( B I C ))} U { A I (( B U C ) I C ) U (( B U C ) I B )}
{ }
= {( A I B I C ) U ( A I B I C )} U A I  ( B I C ) U ( C I C ) U ( B I B ) U ( C U B )  ..(1)

Case (i) B ( x ) ≤ C ( x ) , B ( x) ≥ C ( x )

⇒ ( B I C ) ( x) = B ( x) ( B I C ) ( x) = C ( x)
⇒ BI C = B, BI C = C
Consider,

( B I C ) U (C I C ) U ( B I B ) U (C I B )
= C U (C I C ) U ( B I B ) U B

= C UB (Q A U ( A I B ) = A and ( C I C ) ≠ φ .)

= ( B I C) U ( B I C )

Case (ii) B ( x ) ≥ C ( x ) , B ( x ) ≤ C ( x )

⇒ BI C = C , BI C = B

⇒ ( B I C ) U (C I C ) U ( B I B ) U (C I B )

= B U (C I C ) U ( B I B ) U C

= C UB

= ( B I C) U ( B I C )

24
With this value, equation (1) becomes

{
A∆ ( B ∆C ) = {( A I B I C ) U ( A I B I C )} U A I ( B I C ) U ( B I C ) }
= ( A I B I C )U ( AI B IC ) U ( A I B I C) U ( AI B IC )

A∆ ( B ∆C ) = ( A I B I C ) U ( A I B I C ) U ( A I B I C ) U ( A I B I C )

❅❅❅

25

You might also like