Q.Let us define a relation in as if . Then is
(A) an equivalence relation
(B) reflexive, transitive but not symmetric
(C) symmetric, transitive but not reflexive
(D) neither transitive nor reflexive but symmetric
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The relation defined by is reflexive (every number is itself) and transitive (if and , then ), but it is not symmetric (e.g., does not imply ). So the correct classification is reflexive, transitive but not symmetric.
The core of this problem is checking three properties — reflexivity, symmetry, and transitivity — against the definition . Each property tests a different logical condition, and the key is to apply them to real numbers without overcomplicating.
Let’s go step by step.
-
Reflexivity: A relation on a set is reflexive if every element is related to itself. For to hold when , we need . Since any real number is equal to itself, is always true. So is reflexive.
-
Symmetry: A relation is symmetric if whenever holds, then must also hold. Here, means . Does always imply ? Only if . For a counterexample, take and : is true, but is false. So symmetry fails.
A common mistake is to think that because and can both be true (when ), the relation is symmetric. But symmetry requires the implication to hold for all pairs — one counterexample is enough to break it. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.