Q.Give an example of a relation. Which is
🔒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 →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 |
The idea is that reflexivity, symmetry and transitivity are independent, so we can pick small relations on A={1,2,3} that satisfy exactly the combination asked for.
- Symmetric, not reflexive, not transitive R={(1,2),(2,1)} — symmetric (each pair reversed); not reflexive ((1,1) absent); not transitive ((1,2),(2,1) need (1,1), which is missing).
- Transitive, not reflexive, not symmetric R={(1,2)} — transitive (no chain to violate it); not reflexive; not symmetric ((2,1) absent).
- Reflexive and symmetric, not transitive R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)} — reflexive and symmetric, but (1,2),(2,3) need (1,3), which is absent.
- Reflexive and transitive, not symmetric R={(1,1),(2,2),(3,3),(1,2)} — reflexive; transitive (no chain forces a missing pair); not symmetric ((2,1) absent). …
Reflexive, symmetric and transitive are independent properties, so on A={1,2,3} we can hand-build a small relation for each of the five required combinations.
The trick for every part is the same: put in exactly the pairs that give the properties you want, and deliberately leave out a pair to kill the property you don't want. A single missing pair is enough to break reflexivity, symmetry or transitivity. Take A={1,2,3} throughout.
(i) Symmetric but neither reflexive nor transitive
R={(1,2),(2,1)}
- Symmetric: the only pair (1,2) has its reverse (2,1).
- Not reflexive: (1,1) is missing.
- Not transitive: (1,2) and (2,1) would force (1,1), which is absent.
(ii) Transitive but neither reflexive nor symmetric
R={(1,2)}
- Transitive: there is no pair of the form (1,2),(2,c), so the transitivity condition is never triggered — it holds vacuously.
- Not reflexive: (1,1) is missing.
- Not symmetric: (1,2) is present but (2,1) is not.
(iii) Reflexive and symmetric but not transitive
R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}
- Reflexive: all of (1,1),(2,2),(3,3) are present.
- Symmetric: (1,2)↔(2,1) and (2,3)↔(3,2).
- Not transitive: (1,2) and (2,3) would force (1,3), which is missing.
(iv) Reflexive and transitive but not symmetric
R={(1,1),(2,2),(3,3),(1,2)}
- Reflexive: all three self-pairs are present.
- Transitive: the only non-self pair is (1,2); the sole chain (1,2),(2,2) needs (1,2), already present. No pair is forced. …
Method: Constructing Relations with a Prescribed Combination of Properties
Use this when asked to build an example relation that has some properties but deliberately lacks others. Work on a small set such as A={1,2,3}.
Steps
Step 1: Add pairs to create the properties you want
For symmetry, add both (a,b) and (b,a); for reflexivity, add all self-pairs (1,1),(2,2),(3,3).
Step 2: Omit one pair to remove the property you don't want
Leave out a self-pair to break reflexivity, a reverse pair to break symmetry, or the "closing" pair of a chain to break transitivity.
Step 3: Use vacuous truth for the single-property cases …
Common Mistakes
Mistake 1: Building a symmetric and transitive relation that is accidentally reflexive
Why it's wrong: once (a,b) and (b,a) are present, transitivity forces (a,a) and (b,b); if every element appears, the relation becomes reflexive. Correct approach: exclude at least one element (e.g. 3) entirely to keep it non-reflexive.
Mistake 2: Adding a pair that unintentionally completes a transitive chain …
- 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. …
- 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. …
-
- 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. …
-
- 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). …
-
- 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. …
- 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. …
-
- 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. …
🎓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.