RankRizz
JEE MAIN 2025 · 07 APR S1+4 / −1HARDTRANSCRIBED

JEE Main 2025 Mathematics question — Reflexive, symmetric and transitive relations

The number of relations on the set A={1,2,3}A = \{1, 2, 3\} containing at most 6 elements including (1, 2), which are reflexive and transitive but not symmetric, is ______.

SOLUTION

The set has three elements, so there are 32=93^2 = 9 ordered pairs in the universal relation on AA.
For a relation RR to be

• reflexive   ⇒\Rightarrow   (1,1),(2,2),(3,3)∈R(1,1),(2,2),(3,3) \in R (always present)
• required   ⇒\Rightarrow   (1,2)∈R(1,2) \in R (given in the question)
• of size ≤6\le 6   ⇒\Rightarrow   we may choose at most two more pairs
• not symmetric   ⇒\Rightarrow   there exists at least one ordered pair whose reverse is absent
• transitive   ⇒\Rightarrow   whenever (a,b),(b,c)∈R(a,b),(b,c)\in R, then (a,c)∈R(a,c)\in R.

Let

R0={(1,1),(2,2),(3,3),(1,2)}(4 mandatory pairs)R_0=\{(1,1),(2,2),(3,3),(1,2)\} \qquad\text{(4 mandatory pairs)}

The five remaining off-diagonal pairs are

P={(2,1),(1,3),(3,1),(2,3),(3,2)}.P=\{(2,1),(1,3),(3,1),(2,3),(3,2)\}.

We may add 0, 1 or 2 of them. Each choice is examined below.

Case 1: 0 extra pairs (size 4)

Only R0R_0 itself. No new two-step paths are created, so R0R_0 is transitive. Because (2,1)∉R0(2,1)\notin R_0, it is not symmetric. Hence one relation is obtained.

Case 2: exactly 1 extra pair (size 5)

Test every single pair from PP.

1. Add (2,1)(2,1) ⇒\Rightarrow (1,2),(2,1)(1,2),(2,1) are both present, so the relation becomes symmetric ⇒\Rightarrow reject.

2. Add (1,3)(1,3). Two-step paths are
    (1,3) (3,_)(1,3)\,(3,\_) gives only loops, and (1,2) (2,_)(1,2)\,(2,\_) gives existing pairs. Hence transitive and not symmetric ⇒\Rightarrow accept.

3. Add (3,1)(3,1). Path (3,1),(1,2)(3,1),(1,2) demands (3,2)(3,2), which is missing ⇒\Rightarrow violates transitivity ⇒\Rightarrow reject.

4. Add (2,3)(2,3). Path (1,2),(2,3)(1,2),(2,3) demands (1,3)(1,3), missing ⇒\Rightarrow reject.

5. Add (3,2)(3,2). Path (1,2)(1,2) is unchanged; path (3,2)(3,2) followed by loops requires nothing new. Relation is transitive and not symmetric ⇒\Rightarrow accept.

Thus two relations are obtained in this case.

Case 3: exactly 2 extra pairs (size 6)

Choose two pairs from PP (there are (52)=10\binom{5}{2}=10 possibilities). Only the following three choices satisfy transitivity and lack of symmetry.

(i) {(1,3),(2,3)}\{(1,3),(2,3)\} : path (1,2),(2,3)(1,2),(2,3) already gives (1,3)(1,3), present ⇒\Rightarrow transitive.

(ii) {(1,3),(3,2)}\{(1,3),(3,2)\} : path (1,3),(3,2)(1,3),(3,2) already gives (1,2)(1,2), present ⇒\Rightarrow transitive.

(iii) {(3,1),(3,2)}\{(3,1),(3,2)\} : path (3,1),(1,2)(3,1),(1,2) gives (3,2)(3,2), present ⇒\Rightarrow transitive.

In each of the three relations at least one ordered pair lacks its reverse, so none is symmetric.

No other pair-sets work: each of the remaining seven choices either forces a missing third pair (breaking transitivity) or makes the relation symmetric.

Hence three relations arise in this case.

Adding up all cases: 1+2+3=6.1 + 2 + 3 = 6.

Therefore, the number of required relations is 6.\mathbf{6}.

Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicReflexive, symmetric and transitive relations
TypeNumerical answer