Equivalence Classes Form a Partition
The equivalence classes of an equivalence relation on form a partition of .
Theorem 2.34
Proof
Since is reflexive, for all , so the classes cover . It remains to show that for all , either or . Suppose ; then , so by symmetry, and , so by transitivity. Now any satisfies , hence , so and ; by symmetry . Therefore , and the equivalence classes form a partition of .
Converse
Conversely, given any partition of , there is an equivalence relation whose equivalence classes are precisely the parts of the partition: define when and lie in the same part.
Related
Stated in
- Theorem 2.34ยง2.3 Relations
