Let f:X→Yf: \mathrm{X} \rightarrow \mathrm{Y} be a function. Define a relation R\mathrm{R} in X\mathrm{X} given by R={(a,b):f(a)=f(b)}\mathrm{R}=\{(a, b): f(a)=f(b)\}. Examine whether R\mathrm{R} is an equivalence relation or not.

Answer: The relation R is an equivalence relation.

Step-by-step solution

Step 1: Check for Reflexivity

For a relation to be reflexive, every element must be related to itself. This means for any element aa in set XX, the pair (a,a)(a, a) must be in RR. Since f(a)f(a) is always equal to f(a)f(a), the condition f(a)=f(a)f(a) = f(a) is always true for any a∈Xa \in X.

Step 2: Conclusion on Reflexivity

Since f(a)=f(a)f(a) = f(a) is always true, it implies that (a,a)∈R(a, a) \in R for all a∈Xa \in X. Therefore, the relation RR is reflexive.

Step 3: Check for Symmetry

For a relation to be symmetric, if (a,b)(a, b) is in RR, then (b,a)(b, a) must also be in RR. If (a,b)∈R(a, b) \in R, it means f(a)=f(b)f(a) = f(b). Since equality is symmetric, f(b)f(b) must also be equal to f(a)f(a). This implies that (b,a)∈R(b, a) \in R.

Step 4: Conclusion on Symmetry

Since f(a)=f(b)f(a) = f(b) implies f(b)=f(a)f(b) = f(a), the relation RR is symmetric.

Step 5: Check for Transitivity

For a relation to be transitive, if (a,b)(a, b) is in RR and (b,c)(b, c) is in RR, then (a,c)(a, c) must also be in RR. If (a,b)∈R(a, b) \in R, then f(a)=f(b)f(a) = f(b). If (b,c)∈R(b, c) \in R, then f(b)=f(c)f(b) = f(c). By the transitive property of equality, if f(a)=f(b)f(a) = f(b) and f(b)=f(c)f(b) = f(c), then f(a)=f(c)f(a) = f(c). This implies that (a,c)∈R(a, c) \in R.

Step 6: Conclusion on Transitivity

Since f(a)=f(b)f(a) = f(b) and f(b)=f(c)f(b) = f(c) implies f(a)=f(c)f(a) = f(c), the relation RR is transitive.

More from this chapter

All Relations and Functions solutions →

Solve your own maths question free →