MCQMediumJEE 2023Relations

JEE Mathematics 2023 Question with Solution

Let RR be a relation on N×N\mathbb{N} \times \mathbb{N} defined by

(a,b)R(c,d)if and only ifad(bc)=bc(ad).(a, b) \, R \, (c, d) \quad \text{if and only if} \quad ad(b - c) = bc(a - d).

Then RR is:

  • A

    Symmetric but neither reflexive nor transitive

  • B

    Transitive but neither reflexive nor symmetric

  • C

    Reflexive and symmetric but not transitive

  • D

    Symmetric and transitive but not reflexive

Answer

Correct answer:B

Step-by-step solution

Standard Method

Given: RR is defined on N×N\mathbb{N} \times \mathbb{N} by

(a,b)R(c,d)    ad(bc)=bc(ad)(a,b)R(c,d) \iff ad(b-c)=bc(a-d)

Find: Which properties among reflexive, symmetric and transitive are satisfied.

From the solution:

(a,b)R(c,d)ad(bc)=bc(ad)(a,b)R(c,d) \Rightarrow ad(b-c)=bc(a-d)

For symmetry, it checks

(c,d)R(a,b)cb(da)=da(cb)(c,d)R(a,b) \Rightarrow cb(d-a)=da(c-b)

which is the same condition written after interchanging the ordered pairs. Hence the relation is symmetric.

For reflexivity, the solution tests

(a,b)R(a,b)ab(ba)ba(ab)(a,b)R(a,b) \Rightarrow ab(b-a) \neq ba(a-b)

and concludes that the relation is not reflexive.

For transitivity, the solution gives a counterexample:

(2,3)R(3,2)and(3,2)R(5,30)(2,3)R(3,2) \quad \text{and} \quad (3,2)R(5,30)

but

((2,3),(5,30))R((2,3),(5,30)) \notin R

Therefore the relation is not transitive.

So, based on the extracted solution working, RR is symmetric but neither reflexive nor transitive. The source solution states The Correct Option is B, but this conflicts with the listed options. Among the given options, the statement matches option A.

Property-wise Check

Given: ad(bc)=bc(ad)ad(b-c)=bc(a-d). Find: The correct classification of the relation.

  1. Symmetry If
(a,b)R(c,d)(a,b)R(c,d)

then

ad(bc)=bc(ad)ad(b-c)=bc(a-d)

After swapping the two ordered pairs, the checked form in the solution is

cb(da)=da(cb)cb(d-a)=da(c-b)

which is equivalent to the same relation. So the relation is symmetric.

  1. Reflexivity For reflexivity, we must have
(a,b)R(a,b)(a,b)R(a,b)

for every (a,b)N×N(a,b) \in \mathbb{N} \times \mathbb{N}. The solution evaluates this as

ab(ba)ba(ab)ab(b-a) \neq ba(a-b)

and therefore concludes not reflexive.

  1. Transitivity To test transitivity, the solution uses specific pairs:
(2,3)R(3,2),(3,2)R(5,30)(2,3)R(3,2), \qquad (3,2)R(5,30)

but

(2,3)R(5,30)(2,3)R(5,30)

does not hold. Hence the relation is not transitive.

Therefore the correct description is: symmetric but neither reflexive nor transitive. Hence the defensible answer from the given options is A.

Common mistakes

  • Assuming symmetry automatically implies reflexivity. These are different properties; you must test (a,b)R(a,b)(a,b)R(a,b) separately for reflexivity.

  • Checking transitivity only symbolically and not using a counterexample. A single valid counterexample is enough to show that a relation is not transitive.

  • Trusting the displayed option letter in the solution without matching it to the option text. Here the solution text and option letter conflict, so the property statement must be matched carefully with the listed choices.

Practice more Relations questions

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

Related questions