Q.A relation on set is defined as . Check whether the relation is reflexive, symmetric and transitive.
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 is reflexive and symmetric but not transitive. The condition is satisfied for all pairs where the numbers are close enough, but transitivity fails because a chain of small differences can add up to a large one.
We need to check three properties for on .
Why this approach works. Instead of blindly testing all 25 ordered pairs, we can think geometrically: measures how far apart the squares of two numbers are. Since squares grow rapidly, only numbers that are close together will satisfy the inequality. This gives us a quick way to see which pairs belong to without exhaustive enumeration.
Let's work through each property.
-
Reflexive. A relation is reflexive if for every . Here for any , so every element is related to itself. Reflexive holds.
-
Symmetric. If , then . But , so the same inequality holds for . Thus whenever , we also have . Symmetric holds.
-
Transitive. This is where things get interesting. We need: if and , does it follow that ? Let's test with actual numbers.
First, let's list all pairs in to see the pattern. For :
- → and in
- — not less than 8, so not in
- , — none of these
- → and in
- → not in
- → and in
- → not in
So contains only the pairs where the numbers differ by exactly 1 (plus all reflexive pairs). That is:
Now check transitivity. Take , , : …
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.