The number of equivalence relations that can be defined on the set is
Practice Questions · Question 3 of 30
The number of equivalence relations that can be defined on the set A = 1, 2, 3 is
(A)
(B)
(C)
- Correct answer
(D)
Option (D) is correct.
An equivalence relation on a set splits that set into disjoint, non-empty equivalence classes whose union is the whole set — that is, into a partition. Conversely every partition gives exactly one equivalence relation, in which two elements are related precisely when they lie in the same block. So counting equivalence relations on is the same as counting partitions of .
For list the partitions by the sizes of their blocks.
| Block sizes | Partition | Equivalence relation it induces |
|---|---|---|
| the identity relation | ||
| and related | ||
| and related | ||
| and related | ||
| the universal relation |
There is partition into singletons, partitions with one pair and one singleton (choose which element is left out, in ways), and partition into a single block:
Hence exactly equivalence relations can be defined on .
Why the other options are wrong
- Option (A), , counts only one relation, such as the identity relation, and misses the other four.
- Option (B), , is only the number of equivalence relations containing : those from and from .
- Option (C), , counts only the three partitions of type and leaves out the identity relation and the universal relation.

