Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Click to Chat

1800-5470-145

+91 7353221155

CART 0

• 0
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

If ~ be an equivalence relation on a non-empty set A, then A can be expressed as a union of mutually disjoint equivalence classes in A

Abhishek Singh
104 Points
one month ago
Yes, This is a very fundamental Theorem in Set Theory. Expressing A as union of mutually disjoint classes is known as PARTITIONING the set.

Equivalence Class of an element a (denoted by [a]) is defined as the set of element equivalent to a.
[a] = {x | x ~ a }

Ex Let us define xRy (x is related to y ) if 2 divides x-y
Now Checking Equivalence relation ship
1. Reflecxivity :  Clearly, x-x = 0 & 2 divides 0
2. Symmetery:  xRy ==> 2 divides x-y ==> 2 divides y-x ==> yRx
3. Transitivity  xRy & yRz ==> 2 divides x-y & 2 divides y-z  ==> 2 divides [(x-y ) + (y-z)]=x-z ==> xRz
Hence R is equivalence relation ship
Checking the equivalence class we can see [0] = set of all even numbers  & [1] = set of all odd numbers
Thus the set integers is partitioned in  mututually disjoint (watertight) equivalence classes.