Verified Solution • 2025–26 Session moderate

QJEEM24Ma6c30: JEE Main 2024 Mathematics - Class 11 JEEM24Ma6c30 Solution: Consider the relations and defined as for all and for all .…

Consider the relations R1R_1 and R2R_2 defined as aR1b⇔a2+b2=1a R_1 b \Leftrightarrow a^2+b^2=1 for all a,b∈Ra, b \in \mathbf{R} and (a,b)R2(c,d)⇔(a, b) R_2(c, d) \Leftrightarrow a+d=b+ca+d=b+c for all (a,b),(c,d)∈N×N(a, b),(c, d) \in \mathbf{N} \times \mathbf{N} . Then :

Multiple Choice Options

  • A R1R_1 and R2R_2 both are equivalence relations
  • B Only R1R_1 is an equivalence relation
  • C Only R2R_2 is an equivalence relation
  • D Neither R1R_1 nor R2R_2 is an equivalence relation

Step-by-Step Verified Solution

To determine if the given relations R1R_1 and R2R_2 are equivalence relations, we need to check whether each of them satisfies the three defining properties of an equivalence relation: reflexivity, symmetry, and transitivity.

Let's start by analysing R1R_1 :

Reflexivity: A relation RR on a set SS is reflexive if every element is related to itself, that is, for every a∈Sa \in S , the pair (a,a)(a,a) is in RR . In the case of R1R_1 , for an arbitrary a∈Ra \in \mathbf{R} , we need to check if aR1aa R_1 a holds, which translates to checking if a2+a2=1a^2 + a^2 = 1 . This would mean 2a2=12a^2 = 1 or a2=12a^2 = \frac{1}{2} . Since this is not true for every real number aa , R1R_1 is not reflexive.

Symmetry: A relation RR is symmetric if whenever aRba R b , then bRab R a . For R1R_1 , if a2+b2=1a^2 + b^2 = 1 , then it is also true that b2+a2=1b^2 + a^2 = 1 . Thus, R1R_1 is symmetric.

Transitivity: A relation RR is transitive if whenever aRba R b and bRcb R c , then aRca R c . For R1R_1 , suppose aR1ba R_1 b and bR1cb R_1 c , this means a2+b2=1a^2 + b^2 = 1 and b2+c2=1b^2 + c^2 = 1 . However, if we add these two, we get a2+2b2+c2=2a^2 + 2b^2 + c^2 = 2 . There is no guarantee that a2+c2=1a^2 + c^2 = 1 . Therefore, R1R_1 is not transitive.

Conclusion: Relation R1R_1 is not reflexive or transitive, and hence it is not an equivalence relation.

Now let's consider R2R_2 :

Reflexivity: For any (a,b)∈N×N(a, b) \in \mathbf{N} \times \mathbf{N} , it's clear that a+b=b+aa + b = b + a , which is just a reiteration of the commutative property of addition. Therefore, (a,b)R2(a,b)(a, b) R_2 (a, b) , and R2R_2 is reflexive.

Symmetry: If (a,b)R2(c,d)(a, b) R_2 (c, d) , meaning a+d=b+ca + d = b + c , then by reordering the terms we can similarly have c+b=d+ac + b = d + a , which means (c,d)R2(a,b)(c, d) R_2 (a, b) , so R2R_2 is symmetric.

Transitivity: Suppose (a,b)R2(c,d)(a, b) R_2 (c, d) and (c,d)R2(e,f)(c, d) R_2 (e, f) , i.e., a+d=b+ca + d = b + c and c+f=d+ec + f = d + e , we want to show that (a,b)R2(e,f)(a, b) R_2 (e, f) . Adding the two equations, we get a+d+c+f=b+c+d+ea + d + c + f = b + c + d + e . By rearranging and simplifying, we get a+f=b+ea + f = b + e , thus, (a,b)R2(e,f)(a, b) R_2 (e, f) .

So R2R_2 is reflexive, symmetric, and transitive, and therefore it is an equivalence relation.

Conclusion: According to the above examination, only R2R_2 is an equivalence relation. Thus, the correct answer is:

Option C: Only R2R_2 is an equivalence relation.

Related Learning Resources & Exam Preparation