Crisp Sets

1
 Classical (Crisp)Sets

X  Universe of discourse  set of all objects with the same

characteristics
x – individual element of X
Let A & B be sets defined on X, then
A  B  A is fully contained in B (Proper Subset)
(i.e. if xA then xB)
A  B  A is contained in or is equivalent to B (Subset)
A = B  A  B and B  A
No elements, Null set  

Collection of elements in the universe, Whole set  X

2
Contd…

Cardinality number, X  total number of elements in X

Power set: The set which consists of all possible subsets of
a given set A
P(A) = {x|x  A}

Cardinality of Power set: The family of all subsets of a

given set.

Assignment: Find the power set and cardinality of the

given set X = {a,b,c}.
Also find cardinality of power set.

3
Contd…

Solution: Since set X contains three elements, so its

Cardinality number, X = 3
Power set, P(X) = { , {a}, {b}, {c}, {a, b}, {a, c}, {b, c},
{a,b,c}}
Cardinality of power set P(X)
 P ( X )  2  23  8
X

4
 Operations on Crisp Sets

Let A & B be two sets on universe X.

Union: AB = {x|xA or xB}
Intersection: AB = {x|xA and xB}

X X
A B A B

AB AB
Venn diagram representing different operations through shaded regions
5
Contd…
Complement: A = {x|xA and xX}
Difference: A\B, or A – B = {x|xA and xB}

X X

A A B

A A\B

Venn diagram representing different operations through shaded regions

6
 PROPERTIES OF CRISP SET
• Commutativity: AB =B A
AB =B  A

• Associativity: A  (B  C) = (A  B)  C
A  (B  C) = (A  B)  C

• Distributivity: A  (B  C) = (A  B)  (A  C)
A  (B  C) = (A  B)  (A  C)

• Idempotency: AA=A
AA=A

• Identity: A   = A and A   = 
A  X = X and A  X = A
7
Cont…

• Transitivity: If A  B  C, then A  C

• Involution: A =A

• Law of excluded middle: AA = X

• Law of contradiction: AA = 

• DeMorgan’s Law: ( A  B ) = A  B and ( A  B ) = A  B

8
 MAPPING OF CRISP SETS TO FUNCTIONS
• X and Y are two different universes of discourse. Mapping from X to Y i.e.
f: X Y means an element x in X corresponds to an element y in Y.

• A set is defined by a function, called a characteristic function that declare

which element of X are the members of the set and which are not.

1, x 𝐴
• Set A is defined by its characteristic function A (x) =
0, x𝐴

• That is the characteristic function maps elements of X to elements of the

set {0,1} which is formally represented by A : X {0,1}

• For each x  X, when A (x) = 1, x is declared to be a member of A; when

A (x) = 0, x is declared as a non-member of A;

• Mapping from x in X to 0 or 1 in Y A

• V(A) Value set under the mapping A

9
Cont…

Assignment: Let X = {a, b, c} & Y = {0,1}

Find V(P(X))

10
Cont…

Solution: Given X = {a, b, c} & Y = {0,1}

 Power set, P(X) = { , {a}, {b}, {c}, {a, b}, {a, c}, {b, c},
{a, b, c}}

V(P(X)) = { {0, 0, 0}, {1, 0, 0}, {0, 1, 0}, {0, 0, 1}, {1, 1, 0},
{1, 0, 1}, {0, 1, 1}, {1, 1, 1}}

11
 Operations on Crisp Set
If A & B are defined on X then operations performed
between these two sets are:
• Union: A  B A  B (x) = max { A(x),  B(x)} =
 A(x)   B(x)

• Intersection: A  B  A  B (x) = min { A(x),  B(x)} =

 A(x)   B(x)

• Complement: A  A (x) = 1 -  A(x)

• Containment: If A  B then  A(x)   B(x)

Here  is the maximum operator and  is the minimum

operator.  Chi is Greek letter .
12