Q.Show that the relation R in the set R of real numbers, defined as R={(a,b):a≤b2} is neither reflexive nor symmetric nor transitive.
Concept understanding — Relation Properties
Properties of a Relation
A relation R on a set A pairs elements of A with one another. Some relations behave in regular, predictable ways, and we name these behaviours properties. Three matter most for CBSE Class 12 — reflexive, symmetric, transitive (together they build an equivalence relation); a fourth, antisymmetric, is worth knowing for order relations.
Reflexive — everything relates to itself
R is reflexive if aRa for every a∈A. "Has the same age as" is reflexive; "is taller than" is not. If even one element misses its self-pair, reflexivity fails: on {1,2,3}, {(1,1),(2,2)} is not reflexive because (3,3) is absent.
Symmetric — the relation runs both ways
R is symmetric if aRb⟹bRa. "Is married to" is symmetric; "is taller than" is not. Symmetry does not demand that every pair be related — only that any pair which appears also appears reversed. So {(1,2),(2,1),(3,3)} is symmetric, but {(1,2),(2,1),(1,3)} is not, since (3,1) is missing.
Transitive — relations chain
R is transitive if aRb and bRc together force aRc. "Is an ancestor of" is transitive; "is a friend of" is not. A single broken chain breaks the property: {(1,2),(2,3)} is not transitive because (1,3) is missing.
Antisymmetric — two-way ties force equality
R is antisymmetric if aRb and bRa together force a=b. The order relation ≤ is antisymmetric: a≤b and b≤a give a=b. It does not ban self-pairs like (1,1); it only rules out distinct elements related both ways.
Test the properties in order of ease — reflexivity first, then symmetry, transitivity. A single counterexample is enough to disprove any of them.
| Property | Condition |
|---|---|
| Reflexive | ∀a, aRa |
| Symmetric | aRb⟹bRa |
| Transitive | aRb∧bRc⟹aRc |
| Antisymmetric | aRb∧bRa⟹a=b |
The famous combinations are the equivalence relation (reflexive + symmetric + transitive), which sorts a set into disjoint classes of "equivalent" elements, and the partial order (reflexive + antisymmetric + transitive), which arranges elements in a hierarchy.
The reflexive, symmetric, transitive, and antisymmetric properties of a relation are introduced in CBSE Class 11 Relations and Functions and revisited more formally at the start of the CBSE Class 12 Mathematics syllabus. "Reflexive symmetric transitive relation examples" is one of the most searched topics in this unit, since correctly testing all three properties is a near-guaranteed board exam question.
Test each property of R={(a,b):a≤b2} on R with a single counterexample each.
Not reflexive: need a≤a2 for all a. Take a=21: 21≤41 is false. So (21,21)∈/R.
Not symmetric: (1,2)∈R since 1≤22=4, but (2,1) needs 2≤12=1, which is false.
Not transitive: (9,3)∈R since 9≤32=9, and (3,2)∈R since 3≤22=4, but (9,2) needs 9≤22=4, which is false.
R is neither reflexive, nor symmetric, nor transitive.
R={(a,b):a≤b2} on R fails all three: not reflexive (a=21), not symmetric ((1,2)∈R but (2,1)∈/R), not transitive ((9,3),(3,2)∈R but (9,2)∈/R).
The idea
The condition a≤b2 treats the two entries very differently — the right side is a square (always ≥0), the left side is unrestricted. That asymmetry is exactly why the relation behaves badly. To disprove a property it is enough to produce one counterexample.
Step 1 — reflexive?
Reflexivity needs (a,a)∈R, i.e. a≤a2, for every real a. This fails on the interval (0,1): rewriting, a≤a2⟺a(a−1)≥0, which is false for 0<a<1.
Concretely take a=21: then a2=41, and 21≤41 is false. So (21,21)∈/R and R is not reflexive.
Step 2 — symmetric?
Symmetry needs: if a≤b2 then b≤a2. Choose a=1, b=2:
- (1,2): 1≤22=4 — true, so (1,2)∈R.
- (2,1): 2≤12=1 — false, so (2,1)∈/R.
A pair is in R but its reverse is not, so R is not symmetric.
Step 3 — transitive?
Transitivity needs: if a≤b2 and b≤c2 then a≤c2. Choose a=9, b=3, c=2:
- (9,3): 9≤32=9 — true.
- (3,2): 3≤22=4 — true.
- (9,2): 9≤22=4 — false.
Both links hold but the conclusion fails, so R is not transitive.
Summary
| Property | Counterexample | Why it fails |
|---|---|---|
| Reflexive | a=21 | 21≤41 |
| Symmetric | (1,2) | 1≤4 but 2≤1 |
| Transitive | (9,3),(3,2) | 9≤9, 3≤4, but 9≤4 |
R is neither reflexive, nor symmetric, nor transitive.
Method: Testing a Relation Defined by an Inequality
Use this for relations like aRb⟺a≤b2, where you must check reflexive / symmetric / transitive. The asymmetry between the two sides is the key to finding counterexamples.
Steps
Step 1: Reflexive — test a≤a2 generally
Check whether the self-condition holds for every a. Fractions in (0,1) often break inequalities involving squares, e.g. a=21 gives 21≤41, which is false.
Step 2: Symmetric — pick unequal a,b
Find a pair with a≤b2 true but b≤a2 false. Large-vs-small pairs like (1,2) expose the asymmetry.
Step 3: Transitive — build a two-step chain that breaks
Choose a,b,c with a≤b2 and b≤c2 both true but a≤c2 false, e.g. (9,3) and (3,2) but not (9,2).
Step 4: One counterexample per property is enough
Since a single failing case disproves a property, one counterexample for each shows the relation is neither reflexive, symmetric, nor transitive.
Common Mistakes
Mistake 1: Testing reflexivity only with integers ≥1
Why it's wrong: a≤a2 holds for a≥1, so integers hide the failure; the property breaks for 0<a<1. Correct approach: test values across the whole domain, including fractions.
Mistake 2: Treating a≤b2 like the order relation a≤b
Why it's wrong: the square on one side destroys symmetry, since 1≤22 does not give 2≤12. Correct approach: substitute an explicit unequal pair rather than assuming order-like behaviour.
Mistake 3: Believing "a≤b2 and b≤c2" chains to "a≤c2"
Why it's wrong: the bound weakens through the chain, so it can fail, as (9,3),(3,2) show. Correct approach: verify the direct pair (a,c) explicitly instead of assuming transitivity.
- COMEDK 2021Set 2021-B1 markMCQQ.The relative R on Real numbers, defined as R={(a,b):a>b} is (A) reflexive and symmetric but not transitive (B) transitive and symmetric but not reflexive (C) transitive but neither reflexive nor symmetric (D) equivalence relation
›Reveal solutionSolution
The strict inequality relation is transitive only.
Reflexive? Need a>a for all a — false. Not reflexive.
Symmetric? If a>b then b>a is false. Not symmetric.
Transitive? If a>b and b>c then a>c — true. Transitive.
✓Final answerThe correct option is (C) — transitive but neither reflexive nor symmetric
- COMEDK 2025Set 2025-A1 markMCQQ.For real numbers x and y,xRy⇔x−y+2 is an irrational number. Then the relation R is: (A) Reflexive (B) Symmetric (C) Transitive (D) Equivalence
›Reveal solutionSolution
The relation is defined by xRy iff x−y+2 is irrational. It is reflexive but neither symmetric nor transitive, so the correct option is (A).
Concept and Intuition
We are checking whether a relation defined by a specific algebraic condition is reflexive, symmetric, transitive, or all three (equivalence). The key is to test each property using simple numbers, especially rational and irrational ones. The presence of 2 is a deliberate trap: it shifts the usual "difference is rational" idea into something that behaves differently under sign changes and addition.
Step-by-step reasoning
-
Reflexive property
For reflexivity, we need xRx for every real x.
Compute x−x+2=2, which is irrational.
So xRx holds for all x.
Result: R is reflexive.
-
Symmetric property
For symmetry, if xRy then we must have yRx.
Suppose xRy means x−y+2 is irrational.
Then yRx requires y−x+2 to be irrational.
Notice that y−x+2=−(x−y)+2.
If x−y is rational, then x−y+2 is irrational (since 2 is irrational), but −(x−y)+2 is also irrational (same reasoning). So that case works.
But what if x−y is irrational? Then x−y+2 could be rational. Example: let x−y=1−2. Then x−y+2=1, which is rational — so xRy fails. But we need a counterexample where xRy holds but yRx fails.
Choose x=2, y=0. Then x−y+2=2+2=22, irrational → xRy holds.
Now check yRx: y−x+2=0−2+2=0, which is rational → yRx fails.
Result: R is not symmetric.
-
Transitive property
For transitivity, if xRy and yRz, we need xRz.
Let x=0, y=2, z=22.
Check xRy: 0−2+2=0, rational → xRy fails. So this triple doesn't test transitivity.
We need a triple where both xRy and yRz hold.
Try x=0, y=1, z=2.
xRy: 0−1+2=2−1, irrational → holds.
yRz: 1−2+2=2−1, irrational → holds.
xRz: 0−2+2=2−2, irrational → holds. That works, but we need a counterexample.
Let’s try x=0, y=2, z=22 again but adjust so xRy holds.
Actually, pick x=0, y=1−2, z=2−22.
xRy: 0−(1−2)+2=−1+22, irrational → holds.
yRz: (1−2)−(2−22)+2=−1+22, irrational → holds.
xRz: 0−(2−22)+2=−2+32, irrational → holds. Still works.
We need a case where the sum of two irrationals becomes rational.
Let x=0, y=2, z=0.
xRy: 0−2+2=0, rational → fails.
Better: Let x=0, y=1, z=1+2.
xRy: 0−1+2=2−1, irrational → holds.
yRz: 1−(1+2)+2=0, rational → fails.
Try x=0, y=2, z=22.
xRy: 0−2+2=0, rational → fails.
Let’s construct: We want x−y+2 irrational and y−z+2 irrational, but x−z+2 rational.
Let x−y=a, y−z=b, then x−z=a+b.
We need a+2 irrational, b+2 irrational, but (a+b)+2 rational.
Choose a=1, b=−1+2. Then a+2=1+2 (irrational), b+2=−1+22 (irrational), but a+b=2, so (a+b)+2=22 (irrational) — not rational.
Choose a=2, b=−2. Then a+2=22 (irrational), b+2=0 (rational) — fails.
Choose a=1−2, b=2. Then a+2=1 (rational) — fails.
Choose a=2, b=1−2. Then a+2=22 (irrational), b+2=1 (rational) — fails.
The trick: Let a=2, b=1. Then a+2=22 (irrational), b+2=1+2 (irrational), a+b=1+2, so (a+b)+2=1+22 (irrational) — not rational.
We need a+b=k−2 for some rational k so that (a+b)+2=k is rational.
Let a=2, b=1−22. Then a+2=22 (irrational), b+2=1−2 (irrational), a+b=1−2, so (a+b)+2=1 (rational). Perfect!
Now pick concrete numbers: Let x=0, then y=−a=−2, and z=y−b=−2−(1−22)=−2−1+22=2−1.
Check: xRy: 0−(−2)+2=22 (irrational) → holds.
yRz: (−2)−(2−1)+2=−2−2+1+2=1−2 (irrational) → holds.
xRz: 0−(2−1)+2=1 (rational) → fails.
So transitivity fails.
-
Equivalence property
Since the relation is not symmetric and not transitive, it cannot be an equivalence relation.
Watch outA common mistake is to assume that because 2 is irrational, adding it always keeps things irrational. But x−y can cancel it, as in y−x+2=0 when x=y+2. Always test with specific numbers.
TipTo quickly test symmetry and transitivity, try setting one variable to zero and another to 2; the cancellations often reveal counterexamples.
✓Final answerThe correct option is (A).
ANSWER: A
-
- COMEDK 2025Set 2025-E1 markMCQQ.The relation R={(1,1),(2,2),(3,3)} on the set {1,2,3} is (A) symmetric only (B) an equivalence relation (C) transitive only (D) reflexive only
›Reveal solutionSolution
The relation contains only the three reflexive pairs, so it is reflexive, symmetric, and transitive — thus it is an equivalence relation. The correct option is (B).
The key here is to check each property — reflexivity, symmetry, transitivity — against the given set. Many students mistakenly think a relation must have more pairs to be symmetric or transitive, but the definitions are about conditions on the pairs that are present, not about having extra ones.
-
Reflexivity requires every element to be related to itself. The set is {1,2,3}, and R contains (1,1), (2,2), and (3,3). Every element appears, so R is reflexive.
-
Symmetry requires that whenever (a,b) is in R, (b,a) must also be in R. Here, every pair is of the form (x,x). For such a pair, the reverse is the same pair, so it is automatically present. Thus R is symmetric.
-
Transitivity requires that whenever (a,b) and (b,c) are in R, then (a,c) must also be in R. In R, the only pairs are (1,1), (2,2), (3,3). So the only possible "chain" is something like (1,1) and (1,1) — which would require (1,1), and it is there. No other chains exist, so the condition holds vacuously. Hence R is transitive.
TipA relation consisting only of reflexive pairs is always an equivalence relation — it's the "identity relation" on the set. It satisfies all three properties trivially.
Since R is reflexive, symmetric, and transitive, it is an equivalence relation. The options list "symmetric only", "transitive only", and "reflexive only" — but R is all three, so only option (B) fits.
Watch outA common mistake is to think symmetry or transitivity require multiple distinct pairs. But symmetry only cares about the reverse of each existing pair, and transitivity only cares about if a chain exists. No chain, no violation.
✓Final answerThe correct option is (B).
ANSWER: B
-
- COMEDK 2025Set 2025-M1 markMCQQ.Let R be a relation on natural numbers defined by x+2y=8,x,y∈N. The domain of R is (A) {2,4,6,8} (B) {2,4,6} (C) {2,4,8} (D) {1,2,3}
›Reveal solutionSolution
The relation is defined by x+2y=8 with x,y∈N (natural numbers, usually starting from 1). The domain is the set of all possible x values that pair with some natural y. Solving x=8−2y for y∈N gives x∈{2,4,6}, so the correct option is (B).
The key idea is that the domain of a relation is the set of all first coordinates (here x) that actually appear in some ordered pair satisfying the given condition. Since y must be a natural number, we can't just pick any x — we need x=8−2y to be positive (natural numbers are usually 1,2,3,…) and y itself must be natural.
Let's work through it:
-
Rewrite the equation for x in terms of y:
From x+2y=8, we get x=8−2y.
For x to be a natural number, 8−2y must be a positive integer (usually ≥1).
-
Find the possible natural values of y:
Since y∈N, the smallest y is 1.
- If y=1, then x=8−2(1)=6.
- If y=2, then x=8−4=4.
- If y=3, then x=8−6=2.
- If y=4, then x=8−8=0, but 0 is not a natural number (in most conventions).
- For y≥4, x becomes 0 or negative, which are not natural.
-
Collect the x values:
The valid (x,y) pairs are (6,1), (4,2), and (2,3).
So the domain (set of all x that appear) is {2,4,6}.
Watch outA common mistake is to include x=8 (by mistakenly taking y=0) or x=0 (by taking y=4). But natural numbers typically start at 1, so y=0 and x=0 are excluded. Always check the definition of N used in your course — here it's {1,2,3,…}.
TipYou can also think: x must be even (since 8−2y is even) and positive. The only positive even numbers less than 8 that work are 2,4,6. Quick mental check: x=8 would require y=0, not allowed; x=0 would require y=4, also not allowed.
✓Final answerThe correct option is (B).
ANSWER: B
-
- KCET 2024Set A-11 markMCQQ.Let A={2,3,4,5,…16,17,18}. Let R be the relation on the set A of ordered pairs of positive integers defined by (a,b) R (c,d) if and only if ad=bc for all (a,b),(c,d) in A×A. Then the number of ordered pairs of the equivalence class of (3,2) is (A) 4 (B) 5 (C) 6 (D) 7
›Reveal solutionSolution
ad=bc means the two pairs represent the same ratio, so the class of (3,2) is every pair (3k,2k) whose entries stay inside A={2,…,18}.
Step 1 — Understand the relation.
(a,b)R(c,d)⟺ad=bc.
Since all elements of A are positive, we may divide by bd:
ad=bc⟺ba=dc.
So R says: the two ordered pairs have the same ratio. (This is precisely why R is an equivalence relation — equality of ratios is reflexive, symmetric and transitive.)
Step 2 — Write the class.
The equivalence class of (3,2) is
[(3,2)]={(c,d)∈A×A: dc=23}.
In lowest terms gcd(3,2)=1, so every such pair is a common multiple:
(c,d)=(3k,2k),k∈N.
Step 3 — Impose the constraint that BOTH entries lie in A.
A={2,3,4,…,18}, so we need 2≤3k≤18 and 2≤2k≤18, i.e. k≤6 (from 3k≤18) and k≥1 (from 2k≥2).
Step 4 — List them.
k (3k,2k) Both in A? 1 (3,2) ✓ 2 (6,4) ✓ 3 (9,6) ✓ 4 (12,8) ✓ 5 (15,10) ✓ 6 (18,12) ✓ 7 (21,14) ✗ — 21∈/A Each passes the check ad=bc: e.g. (3,2)R(18,12) since 3⋅12=36=2⋅18 ✓.
Step 5 — Count.
There are exactly 6 ordered pairs in the class.
✓Final answerThe correct option is (C) — 6.
ANSWER: C
- COMEDK 2024Set 2024-A1 markMCQQ.A relation R is defined from {2,3,4} to {3,6,7,10}. If xRy⇔x and y are co prime numbers. Then range of R is (A) {2,3,4} (B) {3,7} (C) {3,7,10} (D) {3,6,7,10}
›Reveal solutionSolution
The relation pairs elements from the first set with co-prime elements from the second set; the range (the set of all second coordinates that actually appear) is {3, 7, 10}, so the correct option is (C).
Concept & Intuition
Two numbers are co-prime (or relatively prime) if their greatest common divisor (GCD) is 1. Here, we have a relation from set A = {2, 3, 4} to set B = {3, 6, 7, 10}. For each x in A, we find all y in B such that gcd(x, y) = 1. The range of R is the set of all y that are paired with at least one x. So we simply check each y: does it have any co-prime partner in A? If yes, it belongs to the range.
Step-by-step reasoning
-
Check y = 3
- gcd(2, 3) = 1 → co-prime.
- So 3 is in the range (paired with 2, also with 4 since gcd(4,3)=1).
-
Check y = 6
- gcd(2, 6) = 2 → not co-prime.
- gcd(3, 6) = 3 → not co-prime.
- gcd(4, 6) = 2 → not co-prime.
- No x in A is co-prime with 6, so 6 is not in the range.
-
Check y = 7
- gcd(2, 7) = 1 → co-prime.
- So 7 is in the range.
-
Check y = 10
- gcd(3, 10) = 1 → co-prime.
- So 10 is in the range (also gcd(7,10)=1 but 7 is not in A; the point is at least one x works).
Thus the range = {3, 7, 10}.
Watch outA common mistake is to think the range is the whole set B, forgetting that 6 shares factors with every element of A (2, 3, 4 all divide 6 or share a factor >1). Always test each y individually.
TipYou can quickly spot that 6 is the only composite in B that is a multiple of both 2 and 3, so it cannot be co-prime with 2, 3, or 4. The other numbers (3, 7, 10) each have at least one co-prime partner in A.
✓Final answerThe correct option is (C).
ANSWER: C
-
- KCET 2026Set UNKNOWN1 markMCQQ.Let R be the relation in the set N given by R={(a,b):a=b−2,b>6}. Which of the following is the correct answer? (A) (2,4)∈R (B) (3,8)∈R (C) (6,8)∈R (D) (8,7)∈R
›Reveal solutionSolution
Test each ordered pair against both defining conditions of R: a=b−2 and b>6.
Step 1 — State the conditions
R={(a,b):a=b−2, b>6}, so a pair (a,b) belongs to R only if both a=b−2 and b>6 hold.
Step 2 — Test each option
- (A) (2,4): a=b−2⇒2=4−2=2 ✓, but b>6⇒4>6 ✗. Rejected.
- (B) (3,8): a=b−2⇒3=?8−2=6 ✗. Rejected.
- (C) (6,8): a=b−2⇒6=8−2=6 ✓, and b>6⇒8>6 ✓. Both hold.
- (D) (8,7): a=b−2⇒8=?7−2=5 ✗. Rejected.
Step 3 — Conclusion
Only (6,8) satisfies both conditions.
✓Final answerThe correct option is (C) — (6,8)∈R.
🎓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.