MCQMediumJEE 2024Relations

JEE Mathematics 2024 Question with Solution

Let A={1,2,3,4}A = \{1, 2, 3, 4\} and R={(1,2),(2,3),(1,4)}R = \{(1, 2), (2, 3), (1, 4)\} be a relation on AA. Let SS be the equivalence relation on AA such that RSR \subset S and the number of elements in SS is nn. Then, the minimum value of nn is:

  • A

    1616

  • B

    1818

  • C

    2020

  • D

    2424

Answer

Correct answer:A

Step-by-step solution

Standard Method

Given: A={1,2,3,4}A = \{1, 2, 3, 4\} and R={(1,2),(2,3),(1,4)}R = \{(1, 2), (2, 3), (1, 4)\} with RSR \subset S, where SS is an equivalence relation on AA.

Find: The minimum number of elements nn in SS.

An equivalence relation must be reflexive, symmetric, and transitive.

For reflexivity, add all pairs of the form

(1,1),(2,2),(3,3),(4,4)(1,1), (2,2), (3,3), (4,4)

For symmetry, from

(1,2),(2,3),(1,4)(1,2), (2,3), (1,4)

we must also add

(2,1),(3,2),(4,1)(2,1), (3,2), (4,1)

Now use transitivity:

(1,2),(2,3)    (1,3)(1,2), (2,3) \implies (1,3)

and by symmetry also

(3,1)(3,1)

Again, using transitivity with the obtained relations,

(3,1),(1,4)    (3,4)(3,1), (1,4) \implies (3,4)

and by symmetry also

(4,3)(4,3)

Similarly, the remaining required pairs are

(2,4),(4,2)(2,4), (4,2)

Thus, the smallest equivalence relation is

{(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(2,3),(3,2),(1,4),(4,1),(1,3),(3,1),(3,4),(4,3),(4,2),(2,4)}\{(1,1), (2,2), (3,3), (4,4), (1,2), (2,1), (2,3), (3,2), (1,4), (4,1), (1,3), (3,1), (3,4), (4,3), (4,2), (2,4)\}

Hence, the total number of elements is 1616. Therefore, the correct option is A.

Equivalence Class View

Given: A={1,2,3,4}A = \{1,2,3,4\} and R={(1,2),(2,3),(1,4)}R = \{(1,2), (2,3), (1,4)\}.

Find: The minimum size of an equivalence relation SS containing RR.

In an equivalence relation, if 121 \sim 2, 232 \sim 3, and 141 \sim 4, then by transitivity all four elements become equivalent. So there is only one equivalence class:

{1,2,3,4}\{1,2,3,4\}

An equivalence relation on one class of size 44 contains every ordered pair from that class, so the number of pairs is

42=164^2 = 16

Therefore, the minimum value of nn is 1616 and the correct option is A.

Common mistakes

  • Adding only the reflexive pairs and stopping there is incorrect because an equivalence relation must satisfy all three properties: reflexive, symmetric, and transitive. After adding diagonal pairs, you must still check what new pairs symmetry and transitivity force.

  • Adding symmetric pairs but not closing the relation under transitivity is wrong. From (1,2)(1,2) and (2,3)(2,3), you must include (1,3)(1,3); similarly more pairs then follow. Always continue until no new pair is required.

  • Treating the relation as if only the original pairs matter is a mistake. In the equivalence closure, 1,2,3,41,2,3,4 all fall into the same equivalence class, so the final relation contains every ordered pair among these four elements, not just the visibly listed ones.

Practice more Relations questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions