Sets And Relations Question 3
Question 3 - 2024 (01 Feb Shift 2)
Consider the relations $R_{1}$ and $R_{2}$ defined as $a R_{1} b \Leftrightarrow a^{2}+b^{2}=1$ for all $a, b, \in R$ and $(a, b) R_{2}(c, d)$ $\Leftrightarrow a+d=b+c$ for all $(a, b),(c, d) \in N \times N$. Then
(1) Only $R_{1}$ is an equivalence relation
(2) Only $R_{2}$ is an equivalence relation
(3) $R_{1}$ and $R_{2}$ both are equivalence relations
(4) Neither $R_{1}$ nor $R_{2}$ is an equivalence relation
Show Answer
Answer (2)
Solution
$a R_{1} b \Leftrightarrow a^{2}+b^{2}=1 ; a, b \in R$
$(a, b) R_{2}(c, d) \Leftrightarrow a+d=b+c ;(a, b),(c, d) \in N$
for $R_{1}$ : Not reflexive symmetric not transitive
for $R_{2}: R_{2}$ is reflexive, symmetric and transitive Hence only $R_{2}$ is equivalence relation.
