1.4 Equivalence classes
Let’s recall the definition of an equivalence relation:
A relation R on a set A is termed an equivalence relation if it is simultaneously reflexive, symmetric and transitive.
Let’s look at more examples:
Example One: Let
be a set with the following relation:
The relation described by R is termed “the same parity.” Elements x and y are said to have the same parity if they are both odd or both even. In our case, the elements 11 and 17 are both odd – hence have the same parity. Similarly, 20 and 2 have the same parity because they are both even. An element will always have the same parity as itself.
The elements that share the same parity as 11 can be grouped together to form a set: This is the set of all odd elements from A.
Similarly, the even elements can be grouped together to form the set:
The new sets, O and E, form the equivalence classes of the relation R on set A.…