Example 1
Question: A sports club selects 6 members for an inter-school tournament. The members are divided into two teams: Team P (players) \ \( = \{P_1, P_2, P_3\} \) and Team Q (substitutes) \ \( = \{Q_1, Q_2, Q_3\} \). Let the relation R on set P be defined as \ \( R = \{(x, y) : x, y \in P, \text{ x and y play the same sport}\} \). Given that \ \( P_1 \) and \ \( P_2 \) play cricket, while \ \( P_3 \) plays football, verify whether R is an equivalence relation.
Solution: The relation on set \ \( P = \{P_1, P_2, P_3\} \) is defined by \ \( R = \{(x, y) : x \text{ and } y \text{ play the same sport}\} \). Since \ \( P_1, P_2 \) play cricket and \ \( P_3 \) plays football, the relation R in roster form is: \[ R = \{(P_1, P_1),\ (P_2, P_2),\ (P_3, P_3),\ (P_1, P_2),\ (P_2, P_1)\} \] Step 1: Check Reflexivity. Every player plays the same sport as themselves. So \ \( (P_1, P_1) \in R \), \ \( (P_2, P_2) \in R \), and \ \( (P_3, P_3) \in R \). Since \ \( (x, x) \in R \) for all \ \( x \in P \), R is reflexive. Step 2: Check Symmetry. Suppose \ \( (x, y) \in R \). Then x and y play the same sport, which means y and x also play the same sport. So \ \( (y, x) \in R \). We verify: \ \( (P_1, P_2) \in R \Rightarrow (P_2, P_1) \in R \). Hence R is symmetric. Step 3: Check Transitivity. Suppose \ \( (x, y) \in R \) and \ \( (y, z) \in R \). Then x and y play the same sport, and y and z play the same sport. Therefore x and z also play the same sport, so \ \( (x, z) \in R \). We verify the non-trivial case: \ \( (P_1, P_2) \in R \) and \ \( (P_2, P_1) \in R \Rightarrow (P_1, P_1) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: R is an equivalence relation on set P.
Example 2
Question: A library committee shortlists 5 students for a reading programme. The students are categorized into two groups: Group A \ \( = \{A_1, A_2, A_3\} \) (senior students) and Group B \ \( = \{B_1, B_2\} \) (junior students). Define a relation R on Group A as \ \( R = \{(x, y) : x, y \in A, \text{ x and y have read the same number of books this year}\} \). Given that \ \( A_1 \) has read 5 books, \ \( A_2 \) has read 5 books, and \ \( A_3 \) has read 8 books, verify whether R is an equivalence relation.
Solution: The relation on set \ \( A = \{A_1, A_2, A_3\} \) is defined by \ \( R = \{(x, y) : x \text{ and } y \text{ have read the same number of books}\} \). Since \ \( A_1 \) and \ \( A_2 \) have each read 5 books, and \ \( A_3 \) has read 8 books, the relation R in roster form is: \[ R = \{(A_1, A_1),\ (A_2, A_2),\ (A_3, A_3),\ (A_1, A_2),\ (A_2, A_1)\} \] Step 1: Check Reflexivity. Every student has read the same number of books as themselves. So \ \( (A_1, A_1) \in R \), \ \( (A_2, A_2) \in R \), and \ \( (A_3, A_3) \in R \). Since \ \( (x, x) \in R \) for all \ \( x \in A \), R is reflexive. Step 2: Check Symmetry. Let \ \( (x, y) \in R \). Then x and y have read the same number of books. This immediately means y and x have also read the same number of books, so \ \( (y, x) \in R \). We verify: \ \( (A_1, A_2) \in R \Rightarrow (A_2, A_1) \in R \). Hence R is symmetric. Step 3: Check Transitivity. Let \ \( (x, y) \in R \) and \ \( (y, z) \in R \). Then x and y have read the same number of books, and y and z have read the same number of books. By equality, x and z have also read the same number of books. So \ \( (x, z) \in R \). We verify: \ \( (A_1, A_2) \in R \) and \ \( (A_2, A_1) \in R \Rightarrow (A_1, A_1) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: R is an equivalence relation on set A.