To determine if the given relations R1 and R2 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 R1:
Reflexivity: A relation R on a set S is reflexive if every element is related to itself, that is, for every a∈S, the pair (a,a) is in R. In the case of R1, for an arbitrary a∈R, we need to check if aR1a holds, which translates to checking if a2+a2=1. This would mean 2a2=1 or a2=21. Since this is not true for every real number a, R1 is not reflexive.
Symmetry: A relation R is symmetric if whenever aRb, then bRa. For R1, if a2+b2=1, then it is also true that b2+a2=1. Thus, R1 is symmetric.
Transitivity: A relation R is transitive if whenever aRb and bRc, then aRc. For R1, suppose aR1b and bR1c, this means a2+b2=1 and b2+c2=1. However, if we add these two, we get a2+2b2+c2=2. There is no guarantee that a2+c2=1. Therefore, R1 is not transitive.
Conclusion: Relation R1 is not reflexive or transitive, and hence it is not an equivalence relation.
Now let's consider R2:
Reflexivity: For any (a,b)∈N×N, it's clear that a+b=b+a, which is just a reiteration of the commutative property of addition. Therefore, (a,b)R2(a,b), and R2 is reflexive.
Symmetry: If (a,b)R2(c,d), meaning a+d=b+c, then by reordering the terms we can similarly have c+b=d+a, which means (c,d)R2(a,b), so R2 is symmetric.
Transitivity: Suppose (a,b)R2(c,d) and (c,d)R2(e,f), i.e., a+d=b+c and c+f=d+e, we want to show that (a,b)R2(e,f). Adding the two equations, we get a+d+c+f=b+c+d+e. By rearranging and simplifying, we get a+f=b+e, thus, (a,b)R2(e,f).
So R2 is reflexive, symmetric, and transitive, and therefore it is an equivalence relation.
Conclusion: According to the above examination, only R2 is an equivalence relation. Thus, the correct answer is:
Option C: Only R2 is an equivalence relation.