Let S be a finite set. A binary relation on S is simply a collection R of ordered pairs (x, y) ϵ S × S. For instance, S might be a set of people, and each such pair (x, y) ϵ R might mean “x knows y.”
An equivalence relation is a binary relation which satisfies three properties:
• Reflexivity: (x, x) ∈ R for all x ∈ S
• Symmetry: if (x, y) ∈ R then (y, x) ∈ R
• Transitivity: if (x, y) ∈ R and (y, z) e R then (x, z) ∈ R
For instance, the binary relation “has the same birthday as” is an equivalence relation, whereas “is the father of” is not, since it violates all three properties.
Show that an equivalence relation partitions set S into disjoint groups S1, S2 , . . . , Sk (in other words, S = S1 ∪ S2 ∪…∪ Sk and Si ∩ Sj = ➢ for all i ≠ j) such that:
• Any two members of a group are related, that is, (x, y) e R for any x, y e Si, for any i.
• Members of different groups are not related, that is, for all i ≠ j, for all x ϵ Si and y ϵ Sj, we have (x, y) ∉ R.
(Hint: Represent an equivalence relation by an undirected graph.)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.