RankRizz
JEE MAIN 2018 · 15 APR S1+4 / −1EASYTRANSCRIBED

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

Consider the following two binary relations on the set A={a,b,c}A = \{a, b, c\}: R1={(c,a),(b,b),(a,c),(c,c),(b,c),(a,a)}R_1 = \{(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)\} and R2={(a,b),(b,a),(c,c),(c,a),(a,a),(b,b),(a,c)}R_2 = \{(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)\}. Then:

SOLUTION

We recall the definitions first. A binary relation RR on a set AA is called

symmetric  ⟺  ∀(x,y)∈R,  (y,x)∈R\text{symmetric} \iff \forall (x,y)\in R,\; (y,x)\in R

transitive  ⟺  ∀(x,y)∈R and (y,z)∈R,  (x,z)∈R\text{transitive} \iff \forall (x,y)\in R \text{ and } (y,z)\in R,\; (x,z)\in R

Now we inspect the two relations given on the set A={a,b,c}A=\{a,b,c\}:

R1={(c,a),(b,b),(a,c),(c,c),(b,c),(a,a)}R_1=\{(c,a),(b,b),(a,c),(c,c),(b,c),(a,a)\} R2={(a,b),(b,a),(c,c),(c,a),(a,a),(b,b),(a,c)}R_2=\{(a,b),(b,a),(c,c),(c,a),(a,a),(b,b),(a,c)\}

Checking symmetry of R1R_1.

• The pair (c,a)(c,a) is present, and its reverse (a,c)(a,c) is in R1R_1.
• (b,b)(b,b) is self-symmetric.
• (a,c)(a,c) is present, and its reverse (c,a)(c,a) we already have.
• (c,c)(c,c) is self-symmetric.
• (b,c)(b,c) is present, but its reverse (c,b)(c,b) is not in R1R_1.

Because (c,b)∉R1(c,b)\notin R_1, we conclude that R1R_1 is not symmetric.

Checking transitivity of R1R_1.

To apply the definition, we look at every ordered pair whose second component matches the first component of another pair and then verify the required third pair.

1. Take (c,a)(c,a) and combine with every pair beginning with aa:

  • (c,a),(a,c)  ⇒  (c,c)(c,a),(a,c) \;\Rightarrow\; (c,c) and (c,c)∈R1(c,c)\in R_1 ✔️
  • (c,a),(a,a)  ⇒  (c,a)(c,a),(a,a) \;\Rightarrow\; (c,a) and (c,a)∈R1(c,a)\in R_1 ✔️

2. Take (b,b)(b,b) and combine with every pair beginning with bb:

  • (b,b),(b,b)  ⇒  (b,b)(b,b),(b,b) \;\Rightarrow\; (b,b) present ✔️
  • (b,b),(b,c)  ⇒  (b,c)(b,b),(b,c) \;\Rightarrow\; (b,c) present ✔️

3. Take (a,c)(a,c) and combine with every pair beginning with cc:

  • (a,c),(c,a)  ⇒  (a,a)(a,c),(c,a) \;\Rightarrow\; (a,a) present ✔️
  • (a,c),(c,c)  ⇒  (a,c)(a,c),(c,c) \;\Rightarrow\; (a,c) present ✔️

4. Take (c,c)(c,c) and combine with every pair beginning with cc:

  • (c,c),(c,a)  ⇒  (c,a)(c,c),(c,a) \;\Rightarrow\; (c,a) present ✔️
  • (c,c),(c,c)  ⇒  (c,c)(c,c),(c,c) \;\Rightarrow\; (c,c) present ✔️

5. Take (b,c)(b,c) and combine with every pair beginning with cc:

  • (b,c),(c,a)  ⇒  (b,a)(b,c),(c,a) \;\Rightarrow\; (b,a) but (b,a)∉R1(b,a)\notin R_1 ❌

Because the pair (b,a)(b,a) that is required by transitivity is missing, R1R_1 is not transitive.

Checking symmetry of R2R_2.

We list each pair and its reverse:

• (a,b)(a,b) has reverse (b,a)(b,a) which is in R2R_2.
• (b,a)(b,a) has reverse (a,b)(a,b) in R2R_2.
• (c,a)(c,a) has reverse (a,c)(a,c) in R2R_2.
• (c,c),(a,a),(b,b)(c,c),(a,a),(b,b) are all self-symmetric.

All required reverse pairs are present, so R2R_2 is symmetric.

Checking transitivity of R2R_2.

We again search for a violating instance. Consider

(b,a)∈R2and(a,c)∈R2(b,a)\in R_2 \quad\text{and}\quad (a,c)\in R_2

The definition of transitivity demands (b,c)(b,c) to be in R2R_2 because the second element of the first pair equals the first element of the second pair. But the ordered pair (b,c)(b,c) is absent from R2R_2.

Therefore, R2R_2 is not transitive.

Summarising the properties we have derived:

R1: not symmetric, not transitiveR_1: \text{ not symmetric, not transitive}
R2: symmetric, not transitiveR_2: \text{ symmetric, not transitive}

Only the statement “R2R_2 is symmetric but it is not transitive” is true.

Hence, the correct answer is Option A.

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