Let . How many relations on are both reflexive and symmetric?
Practice Questions · Question 11 of 30
Let A = 1, 2, 3 . How many relations on A are both reflexive and symmetric?
(A)
- Correct answer
(B)
(C)
(D)
Option (B) is correct.
A relation on is a subset of , and has ordered pairs. Sort those nine pairs into the three diagonal pairs and the three mirror-image couples:
Reflexivity settles the diagonal. Reflexive means for every , so all three of , , must be in . No freedom is left there.
Symmetry ties each couple together. Symmetry says implies , so for a couple such as you cannot take one member without the other: the couple is either wholly in or wholly out. Symmetry imposes nothing extra on the diagonal, since is its own mirror image.
Count the free choices. That leaves exactly independent in-or-out decisions, one per couple:
So relations on are both reflexive and symmetric.
The distractors are the counts that sit either side of this one. There are relations on altogether, and of them are reflexive (the diagonal is forced, the six off-diagonal pairs are free). Adding symmetry cuts down to , and adding transitivity on top cuts down to the equivalence relations.

