A relation in set is defined as . Which of the following ordered pair in shall be removed to make it an equivalence relation in ?
Previous Year Questions · Question 6 of 37
A relation R in set A = 1, 2, 3 is defined as R = (1, 1), (1, 2), (2, 2), (3, 3) .
(A)
- Correct answer
(B)
(C)
(D)
Option (B) is correct.
Explanation:
We are given on . Test the three properties on as it stands.
Reflexive? Yes. The loops , and are all present, so every element of is related to itself.
Symmetric? No. but . This is the only ordered pair that breaks the property.
Transitive? Yes. Apart from the loops, the only chain we can form through a common middle element is followed by , and it requires — which is already there. Nothing is missing, so is transitive as given.
So fails exactly one property, symmetry, and the single pair responsible is . Deleting it leaves , the identity relation on , which is reflexive, symmetric and transitive — an equivalence relation.
Here is what each choice would leave behind:
| Pair removed | What is left | Verdict |
|---|---|---|
| (A) | is gone, so not reflexive | |
| (B) | reflexive, symmetric and transitive | |
| (C) | not reflexive, and still not symmetric | |
| (D) | not reflexive, and still not symmetric |
Options (A), (C) and (D) each delete a loop, which destroys reflexivity, and none of them repairs the missing . Only (B) works.
