Consider the relations R1 and R2 defined as aR1b⇔a2+b2=1 for all a,b∈R and (a,b)R2(c,d)⇔a+d=b+c for all (a,b),(c,d)∈N×N. Then [2024]
(3)
Consider, (x,x)∈R1
Then, x2+x2≠1 for any x∈R
∴ R1 is not reflexive
Hence, R1 is not an equivalence relation.
For R2
(i) Let (x,y)R(x,y)⇒x+y=y+x, which is true for all x,y∈N.
∴ R2 is reflexive.
(ii) Let (x,y)R(z,p)⇒x+p=y+z⇒p+x=z+y
⇒z+y=p+x⇒(z,p)R(x,y)
∴ R2 is symmetric.
(iii) Let (a,b)R(c,d)⇒a+d=b+c ...(i)
(c,d)R(e,f)⇒c+f=d+e ...(ii)
From (i) and (ii), we have a+d+c+f=b+c+d+e
a+f=b+e⇒(a,b)R(e,f)
∴ R2 is transitive.
So, R2 is an equivalence relation.