The equivalence class of is . By the reflexivity of the equivalence relation, , so every equivalence class is nonempty and their union is .
Suppose , and choose in this intersection. We have and . Symmetry and transitivity give . If , then , so ; interchanging proves the reverse inclusion. Thus two equivalence classes are either identical or disjoint. The distinct equivalence classes therefore form a set partition of . This also covers , whose family of equivalence classes is empty.

Articles by others on the same topic (0)

There are currently no matching articles.