Let be a relation defined on the set . Then the minimum number of elements needed to be added in so that becomes an equivalence relation, is:
- A
- B
- C
- D
Let be a relation defined on the set . Then the minimum number of elements needed to be added in so that becomes an equivalence relation, is:
Correct answer:D
Standard Method
Given: on the set .
Find: The minimum number of ordered pairs to be added so that becomes an equivalence relation.
For an equivalence relation, must be reflexive, symmetric, and transitive.
For reflexivity, all pairs must be present. Since is already present, we need to add . This contributes 3 new elements.
For symmetry:
This contributes 2 more new elements.
For transitivity:
This contributes 2 more new elements.
Thus the total added pairs are
So the number of elements added is
Therefore, the minimum number of elements to be added is . Hence, the correct option is D.
Closure View
Given: on .
Find: The least number of pairs needed to make an equivalence relation.
The pairs and show that the elements must lie in the same equivalence class. Therefore, among , every ordered pair must be present in the final relation.
Hence, on the class , we need all ordered pairs:
Among these, the given relation already contains .
So for the class , the missing pairs are
which are 6 pairs.
The element is unrelated to any other element, so to satisfy reflexivity it must at least have . This adds 1 more pair.
Therefore, the minimum number of pairs to be added is
So the correct option is D.
Adding only reflexive pairs and stopping there is incorrect, because an equivalence relation must also satisfy symmetry and transitivity. After making the relation reflexive, you must still check reverse pairs and implied pairs.
Adding for transitivity but forgetting is incorrect. Once symmetry gives and , transitivity forces as well.
Treating element as irrelevant is incorrect. Since the relation is defined on the set , reflexivity requires even if has no other connections.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.