Some properties of Fuzzy set.

1. Commutative:
A∪B = B∪A
A∩B = B∩A
2. Associative:
A ∪ (B ∪ C) = (A ∪ B) ∪ C
A ∩ (B ∩ C) = (A ∩ B) ∩ C
3. Distributive:
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

4. Idempotence:
A ∪ A =A
A∩A= A
A∪∅ = A
A∩∅ = ∅

5. Transitivity:
If A ⊆ B, B ⊆ C then A ⊆ C

6. Involution:
(Ac )c = A
7. De-Morgan’s law:

(A ∩ B)c = Ac ∪ Bc
(A ∪ B)c = Ac ∩ Bc
Some examples on Fuzzy Set

µB µA
3

1. Membership Function of Set A

2. Membership Function of Set B
3. Combine
4. A union B
5. A intersection B
 Two fuzzy sets A and B with membership functions µA(x ) and µB(x ), respectively
defined as below.
A = Cold climate with µA(x ) as the MF.
B = Hot climate with µB(x ) as the M.F.

µA µB

-15 -10 -5 0 5 10 15 20 25 30 35 40 45 50

What are the fuzzy sets representing the following?

Not cold climate

Not hold climate

Extreme climate

Pleasant climate

Pleasant climate
Extreme climate
1.0
 To understand the fuzzy relations, it is better to discuss first crisp relation.
Suppose, A and B are two (crisp) sets. Then Cartesian product denoted as A × B is
a collection of order pairs, such that
A × B = {(a, b)|a  A and b  B}
Note :
(1) A × B  B × A
(2) |A × B| = |A| × |B|
(3)A × B provides a mapping from a  A to b  B. The mapping

so mentioned is called a relation.

Example 1:
Consider the two crisp sets A and B as given below. A ={ 1, 2, 3, 4}
B = {3, 5, 7 }.
Then, A × B = {(1, 3), (1, 5), (1, 7), (2, 3), (2, 5), (2, 7), (3, 3), (3, 5),
(3, 7), (4, 3), (4, 5), (4, 7)}
Let us define a relation R as R = {(a, b)|b = a + 1, (a, b)  A × B}
Then, R = {(2, 3), (4, 5)} in this case.
We can represent the relation R in a matrix form as follows.
1 0 0 0
2 1 0 
  0

3 0 0 0
4 0 1 0


Suppose, R(x, y ) and S(x, y ) are the two relations define over two crisp sets x  A
and y  B
Union :
R(x, y )  S(x, y ) = max (R(x, y ), S(x, y ));

Intersection:

R(x, y ) ∩ S(x, y ) = min(R(x, y ), S(x, y ));

Complement:

R(x, y ) = 1 − R(x, y )
Suppose, R(x; y) and S(x; y) are the two relations define over two crisp sets x  A and y  B

0 1 0 0 
0 0 1 0 
R = 
0 0 0 1 
 
0 0 0 0 

1 0 0 0 
0 1 0 0 
And S =  
0 0 1 0 
 
0 0 0 1 

Find the following:

(1). R(x, y )  S(x, y )

(2) R(x, y ) ∩ S(x, y )

(3) R(x, y )

1 (((9999999

Given R is a relation on X ,Y and S is another relation on Y ,Z . Then R S is called a

composition of relation on X and Z which is defined as follows.

R ◦ S = {(x, z)|(x, y )  R and (y, z)  S and ∀y  Y }

Max-Min Composition
Given the two relation matrices R and S, the max-min composition is defined as T = R ◦ S ;
T (x, z) = max{min{R(x, y ), S(y, z) and ∀y  Y }}

Given
X = {1, 3, 5}; Y = {1, 3, 5}; R = {(x, y )|y = x + 2}; S = {(x, y )|x < y }
Here, R and S is on X × Y.
Thus, we have
R = {(1, 3), (3, 5)}
S = {(1, 3), (1, 5), (3, 5)}

1 0 1 0  1 0 1 1  1 0 0 1 
  
R = 3 0 0 1 
 and S= 3 0 0 1 ,
 T= 3 0 0 0 

5 0 0 0 5 0 0 0 5 0 0 0
        
 Fuzzy relation is a fuzzy set defined on the Cartesian product of crisp set X1, X2, ..., Xn
Here, n-tuples (x1, x2, ..., xn) may have varying degree of memberships
within the relationship.
The membership values indicate the strength of the relation between the
tuples.
Example:
X = { corona, viral, cold } and Y = { dry cough, high temp, mussle-pain}
The fuzzy relation R is defined as

0.1 0.9 0.8 

0.2 0.9 0.7 
 
0.9 0.4 0.6 

A is a fuzzy set on the universe of discourse X with µA(x )|x ∈ X

B is a fuzzy set on the universe of discourse Y with µB(y )|y ∈ Y
Then R = A × B ⊂ X × Y ; where R has its membership function given by µ R (x, y ) = µA×B(x,
y ) = min{µA(x ), µ B(y )}

Caretsian Product (A × B):

µA×B(x, y ) = min{µA(x ), µB(y )
Example:
A(x) = {(x1, 0.2), (x2, 0.3), (x3, 0.5), (x4, 0.6)}
B(y) = {(y1, 0.8), (y2, 0.6), (y3, 0.3)}

0.2 0.2 0.2 

0.3 0.3 0.3 
A × B = min{µA(x ), µB(y )} =  , x in row, y in column
0.5 0.5 0.3 
 
0.6 0.6 0.3 

A = {(a1 , 0.2), (a2 , 0.7), (a3 , 0.4)}and B = {(b1 , 0.5), (b2 , 0.6)}

0.2 0.2 
0.5 0.6 
 
0.4 0.4 
Operations on Fuzzy Relations

Let R and S be two fuzzy relations on A X B

Union:
R S (a, b) = max ( R (a, b) , S (a, b) );

Intersection:

R S (a, b) = min( R (a, b) , S (a, b) );

Complement:

R (a, b) = 1 − R (a, b)

Composition: T = R S
T ( x, z ) = max min ( R ( x, y), S ( y, z ) ) = max ( R (a, b) , S (a, b) );
yY

X = (x1; x2; x3); Y = (y1; y2); Z = (z1; z2; z3);

0.5 0.1 
  0.6 0.4 0.7 
R = 0.2 0.9 , S= 
  0.5 0.8 0.9 
0.8 0.6 

0.5 0.4 0.5 

T = R S = 0.5 0.8 0.9 
0.6 0.6 0.7 
 0.5 0.1 0.8 0.6  0.3 0.3 0.4 0.6 
0.2 0.9 0.7 
0.3  0.4 0.7 0.3 0.8 
R = , S= 
0.8 0.6 0.2 0.3  0.8 0.8 0.7 0.5 
   
0.4 0.7 0.2 0.6  0.2 0.1 0.9 0.7 

Find T = R S

Fuzzy multi- valued logic

a b ∧ ∨ ¬a =⇒ =
0 0 0 0 1 1 1
1 1 1
0 2 0 2 1 1 2
0 1 0 1 1 1 0
1 1 1 1 1
2 0 0 2 2 2 2
1 1 1 1 1 1
2 2 2 2 2 2 1
1 1 1 1
2 1 2 1 2 1 2
1 0 0 1 0 0 0
1 1 1 1
1 2 2 1 0 2 2
1 1 1 1 0 1 1

Symbol Connective Usage Definition

¬ NOT ¬P 1 − T (P)
∨ OR P∨Q max{T(P), T(Q) }
∧ AND P∧Q min{ T(P),T(Q) }
 IMPLICATION (P  Q) or max{(1 - T(P)),
(¬P ∨ Q) T(Q) }
= EQUALITY (P = Q) or 1 − |T (P) − T (Q)|
[(P =⇒ Q) ∧
(Q =⇒ P)]
 P : The person is honest

T(P) = 0.0 : Absolutely false

T(P) = 0.2 : Partially false

T(P) = 0.4 : May be false or not false

T(P) = 0.6 : May be true or not true

T(P) = 0.8 : Partially true

T(P) = 1.0 : Absolutely true.

P : P is efficient ; T(P) = 0.4;

Q : Q is efficient ; T(Q) = 0.8

P is not efficient.
T (¬P) = 1 − T (P) = 0.6
P is efficient and so is Q
T (P ∧ Q) = min{T (P), T (Q)} = 0.4
Either P or Q is efficient
T (P ∨ Q) = max T (P), T (Q) = 0.8
If P is efficient then so is Q
T (P  Q) = max{1 − T (P), T (Q)} = 0.8