Let and be a relation on . Let be the equivalence relation on such that and the number of elements in is . Then, the minimum value of is:
- A
- B
- C
- D
Let and be a relation on . Let be the equivalence relation on such that and the number of elements in is . Then, the minimum value of is:
Correct answer:A
Standard Method
Given: and with , where is an equivalence relation on .
Find: The minimum number of elements in .
An equivalence relation must be reflexive, symmetric, and transitive.
For reflexivity, add all pairs of the form
For symmetry, from
we must also add
Now use transitivity:
and by symmetry also
Again, using transitivity with the obtained relations,
and by symmetry also
Similarly, the remaining required pairs are
Thus, the smallest equivalence relation is
Hence, the total number of elements is . Therefore, the correct option is A.
Equivalence Class View
Given: and .
Find: The minimum size of an equivalence relation containing .
In an equivalence relation, if , , and , then by transitivity all four elements become equivalent. So there is only one equivalence class:
An equivalence relation on one class of size contains every ordered pair from that class, so the number of pairs is
Therefore, the minimum value of is and the correct option is A.
Adding only the reflexive pairs and stopping there is incorrect because an equivalence relation must satisfy all three properties: reflexive, symmetric, and transitive. After adding diagonal pairs, you must still check what new pairs symmetry and transitivity force.
Adding symmetric pairs but not closing the relation under transitivity is wrong. From and , you must include ; similarly more pairs then follow. Always continue until no new pair is required.
Treating the relation as if only the original pairs matter is a mistake. In the equivalence closure, all fall into the same equivalence class, so the final relation contains every ordered pair among these four elements, not just the visibly listed ones.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.