Equivalence Classes and Partitions
Equivalence Classes
Definitions
Let R be an equivalence relation on a set A, and let a ∈ A. The equivalence class of a is called the set of all elements of A which are equivalent to a.
The equivalence class of an element a is denoted by [a]. Thus, by definition,
If b ∈ [a] then the element b is called a representative of the equivalence class [a]. Any element of an equivalence class may be chosen as a representative of the class.
The set of all equivalence classes of
Properties of Equivalence Classes
If
- Every element
is a member of the equivalence class - Two elements
are equivalent if and only if they belong to the same equivalence class. - Every two equivalence classes
and are either equal or disjoint.
Example
A well-known sample equivalence relation is Congruence Modulo
Consider, for example, the relation of congruence modulo
The possible remainders for
Similarly, one can show that the relation of congruence modulo
Partitions
Let
- The union of the subsets in
is equal to - The partition
does not contain the empty set - The intersection of any distinct subsets in
is empty.
There is a direct link between equivalence classes and partitions. For any equivalence relation on a set
The converse is also true. Given a partition