A relation is defined on as: if and only if .
Then, is:
Confirming your payment
Previous Year Questions · Question 15 of 37
A relation is defined on as: if and only if .
Then, is:
(A) reflexive and symmetric
(B) symmetric but not reflexive
(C) transitive but not reflexive
(D) reflexive but not symmetric
Option (D) is correct.
Explanation: Factorise the defining condition first — it turns a quadratic into two simple cases.
Check the expansion: . Correct.
A product is zero exactly when one of its factors is zero, so
Reflexive. For any the first case applies: , so . Hence for every integer , and is reflexive.
Not symmetric. Take , . Then
so . Now swap them and test :
so . One pair in whose reverse is not in is all it takes: is not symmetric.
The reason behind that counterexample is worth seeing. Swapping and turns into , which is a different polynomial — the coefficients of and are and , not equal. So the condition is not symmetric in its two letters, even though the middle term is.
Reflexive but not symmetric is exactly option (D).
Why the other options tempt:
| Option | The mistake |
|---|---|
| (A) reflexive and symmetric | Assuming the expression is symmetric because is. The and terms are not interchangeable, and while . |
| (B) symmetric but not reflexive | Both halves are wrong: symmetry fails, and always satisfies the condition so reflexivity holds. |
| (C) transitive but not reflexive | Reflexivity holds, so the second half is false. Transitivity fails too: since , and since , but because is neither nor . |