Tutorial, MA2103

Autumn Semester 2017

Tutorial 3

1. Let ρ be an equivalence relation on a set X such that in X the complement

of every singleton subset is a union of some equivalence classes. Then show
that every equivalence class is singleton.
2. Let S = {a, b, c, d, e}. Define a relation ρ on S such that
(a) ρ is an equivalence relation.
(b) ρ is reflexive and symmetric but not transitive.
3. Find the number of reflexive relations on a set containing n elements.
4. Let S be a finite set containing two elements. How many different binary
relations can be defined on S? How many of these are reflexive?
5. Let ρ be a relation on a set A. Then ρ is reflexive iff δA ⊂ ρ, where
δA = {(a, a) : a ∈ A}, i.e., δA is the set of all diagonal elements of A × A.
6. Let ρ be a relation on a set A. Then ρ is an equivalence relation iff
(a) δ ⊂ ρ, where δ = {(a, a) : a ∈ A}.
(b) ρ−1 = ρ.
(c) ρ ◦ ρ ⊂ ρ.
7. Show that:
(a) The inverse of an equivalence relation is an equivalence relation.
(b) The intersection of two equivalence relations on a set is an equivalence
relation.
(c) The union of two reflexive relations on a set is a reflexive relation.
(d) The union of two symmetric relations on a set is a symmetric relation.
8. Let ρ be an equivalence relation on a set X and a, b ∈ X. Then show that
cl(a) = cl(b) iff aρb.
9. Let ρ be an equivalence relation on a set X and a, b ∈ X. If aρb then show
that cl(a) and cl(b) are disjoint.
10. Let ρ be an equivalence relation on a set X and a, b ∈ X. Then show that
the classes cl(a) and cl(b) are either equal and disjoint.

1
11. Show that an equivalence relation ρ on a set X determines a partition of
X. Conversely, each partition of X yields an equivalence relation on X.
12. A relation β on Z is defined by xβy iff x2 − y 2 is divisible by 5 for all
x, y ∈ Z. Prove that β is an equivalence relation on Z. Show that there
are three distinct equivalence classes.