RankRizz
JEE MAIN 2013 · 22 APR ONLINE+4 / −1EASYTRANSCRIBED

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

Let R={(3,3)(5,5),(9,9),(12,12),(5,12),(3,9),(3,12),(3,5)}R = \{(3,3)(5,5),(9,9),(12,12),(5,12),(3,9),(3,12),(3,5)\} be a relation on the set A={3,5,9,12}A = \{3, 5, 9, 12\}. Then, R is :

SOLUTION

We are given a relation R={(3,3),(5,5),(9,9),(12,12),(5,12),(3,9),(3,12),(3,5)}R = \{(3,3), (5,5), (9,9), (12,12), (5,12), (3,9), (3,12), (3,5)\} on the set A={3,5,9,12}A = \{3, 5, 9, 12\}. We need to determine whether RR is reflexive, symmetric, and transitive.

First, recall the definitions:

  • A relation is reflexive if every element in AA is related to itself, i.e., (a,a)∈R(a, a) \in R for all a∈Aa \in A.
  • A relation is symmetric if whenever (a,b)∈R(a, b) \in R, then (b,a)∈R(b, a) \in R.
  • A relation is transitive if whenever (a,b)∈R(a, b) \in R and (b,c)∈R(b, c) \in R, then (a,c)∈R(a, c) \in R.

Now, let's check each property step by step.

Reflexivity: The set A={3,5,9,12}A = \{3, 5, 9, 12\}. Check if each element has a pair with itself in RR:

  • For 3: (3,3)∈R(3,3) \in R (given).
  • For 5: (5,5)∈R(5,5) \in R (given).
  • For 9: (9,9)∈R(9,9) \in R (given).
  • For 12: (12,12)∈R(12,12) \in R (given).
Since all elements in AA have self-pairs, RR is reflexive.

Symmetry: Check for every pair (a,b)∈R(a, b) \in R, if (b,a)∈R(b, a) \in R. List all pairs:

  • (3,3)(3,3): Reverse is (3,3)(3,3), which is in RR.
  • (5,5)(5,5): Reverse is (5,5)(5,5), which is in RR.
  • (9,9)(9,9): Reverse is (9,9)(9,9), which is in RR.
  • (12,12)(12,12): Reverse is (12,12)(12,12), which is in RR.
  • (5,12)(5,12): Reverse is (12,5)(12,5). Is (12,5)∈R(12,5) \in R? Looking at the given pairs, (12,5)(12,5) is not listed. So, (12,5)∉R(12,5) \notin R.
  • (3,9)(3,9): Reverse is (9,3)(9,3). Is (9,3)∈R(9,3) \in R? Not listed, so (9,3)∉R(9,3) \notin R.
  • (3,12)(3,12): Reverse is (12,3)(12,3). Is (12,3)∈R(12,3) \in R? Not listed, so (12,3)∉R(12,3) \notin R.
  • (3,5)(3,5): Reverse is (5,3)(5,3). Is (5,3)∈R(5,3) \in R? Not listed, so (5,3)∉R(5,3) \notin R.
Since (5,12)∈R(5,12) \in R but (12,5)∉R(12,5) \notin R, and similarly for others, RR is not symmetric.

Transitivity: Check if whenever (a,b)∈R(a, b) \in R and (b,c)∈R(b, c) \in R, then (a,c)∈R(a, c) \in R. We need to verify all possible chains:

  • Consider (3,5)(3,5) and (5,12)(5,12): Both are in RR. Then (3,12)(3,12) should be in RR, and it is (given).
  • Consider (3,3)(3,3) and (3,5)(3,5): Both in RR. Then (3,5)(3,5) should be in RR, and it is.
  • Consider (3,3)(3,3) and (3,9)(3,9): Both in RR. Then (3,9)(3,9) should be in RR, and it is.
  • Consider (3,3)(3,3) and (3,12)(3,12): Both in RR. Then (3,12)(3,12) should be in RR, and it is.
  • Consider (3,5)(3,5) and (5,5)(5,5): Both in RR. Then (3,5)(3,5) should be in RR, and it is.
  • Consider (5,5)(5,5) and (5,12)(5,12): Both in RR. Then (5,12)(5,12) should be in RR, and it is.
  • Consider (5,12)(5,12) and (12,12)(12,12): Both in RR. Then (5,12)(5,12) should be in RR, and it is.
  • Consider (3,9)(3,9) and (9,9)(9,9): Both in RR. Then (3,9)(3,9) should be in RR, and it is.
  • Consider (3,12)(3,12) and (12,12)(12,12): Both in RR. Then (3,12)(3,12) should be in RR, and it is.

Now, check other possible chains:

  • Is there a pair starting with 9? Only (9,9)(9,9), so no chain with another element.
  • Is there a pair starting with 12? Only (12,12)(12,12), so no chain with another element.
  • We have (3,9)(3,9) but no pair starting with 9 except (9,9)(9,9), so no issue.
  • Similarly, (3,12)(3,12) and (12,12)(12,12) is covered.

No counterexample is found. Thus, RR is transitive.

In summary:

  • Reflexive: Yes
  • Symmetric: No
  • Transitive: Yes
Therefore, RR is reflexive and transitive but not symmetric.

Now, compare with the options:

  • A: reflexive, symmetric but not transitive →\rightarrow Incorrect, as RR is not symmetric.
  • B: symmetric, transitive but not reflexive →\rightarrow Incorrect, as RR is reflexive and not symmetric.
  • C: an equivalence relation →\rightarrow Incorrect, as equivalence requires all three properties, but symmetry fails.
  • D: reflexive, transitive but not symmetric →\rightarrow Correct.
Hence, the correct answer is Option D.

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

TopicReflexive, symmetric and transitive relations
TypeMultiple choice