Example 1
Question: A group of students is playing a board game using a die. The set of all possible outcomes is \( B = \{1, 2, 3, 4, 5, 6\} \). A relation \( R_2 : B \to B \) is defined as \( R_2 = \{(x, y) : y = 3x,\; x, y \in B\} \). Check whether \( R_2 \) is reflexive, symmetric, or transitive.
Solution: First, list all pairs \( (x, y) \) in \( B \times B \) satisfying \( y = 3x \). When \( x = 1 \): \( y = 3 \in B \), so \( (1,3) \in R_2 \). When \( x = 2 \): \( y = 6 \in B \), so \( (2,6) \in R_2 \). When \( x = 3 \): \( y = 9 \notin B \). When \( x = 4,5,6 \): \( y \notin B \). So \( R_2 = \{(1,3),(2,6)\} \). Checking Reflexivity: For \( R_2 \) to be reflexive, \( (x,x) \in R_2 \) for every \( x \in B \). This requires \( x = 3x \), i.e., \( 2x = 0 \), which is impossible for \( x \in B \). For example, \( (1,1) \notin R_2 \). Therefore \( R_2 \) is NOT reflexive. Checking Symmetry: For symmetry, if \( (x,y) \in R_2 \) then \( (y,x) \in R_2 \). We have \( (1,3) \in R_2 \). Check if \( (3,1) \in R_2 \): this requires \( 1 = 3 \times 3 = 9 \), which is false. So \( (3,1) \notin R_2 \). Therefore \( R_2 \) is NOT symmetric. Checking Transitivity: For transitivity, if \( (x,y) \in R_2 \) and \( (y,z) \in R_2 \) then \( (x,z) \in R_2 \). The pairs are \( (1,3) \) and \( (2,6) \). There is no pair of the form \( (x,y) \) and \( (y,z) \) both in \( R_2 \) (since \( 3 \) and \( 6 \) do not appear as first elements). Hence the transitivity condition is vacuously satisfied. Therefore \( R_2 \) IS transitive.
Answer: \( R_2 \) is neither reflexive nor symmetric, but it is transitive.
Example 2
Question: In a classroom activity, a teacher uses a spinner with outcomes \( C = \{1, 2, 3, 4, 5, 6, 7, 8\} \). A relation \( R_3 : C \to C \) is defined as \( R_3 = \{(x,y) : x + y = 8,\; x, y \in C\} \). Check whether \( R_3 \) is reflexive, symmetric, or transitive.
Solution: First, list all pairs \( (x,y) \in C \times C \) such that \( x + y = 8 \). \( (1,7),\,(2,6),\,(3,5),\,(4,4),\,(5,3),\,(6,2),\,(7,1) \). Note: \( x=8 \) gives \( y=0 \notin C \), so \( (8,y) \notin R_3 \). So \( R_3 = \{(1,7),(2,6),(3,5),(4,4),(5,3),(6,2),(7,1)\} \). Checking Reflexivity: We need \( (x,x) \in R_3 \) for all \( x \in C \), i.e., \( x + x = 8 \Rightarrow x = 4 \). So only \( (4,4) \in R_3 \). But \( (1,1) \notin R_3 \), \( (2,2) \notin R_3 \), etc. Therefore \( R_3 \) is NOT reflexive. Checking Symmetry: If \( (x,y) \in R_3 \) then \( x + y = 8 \), which also means \( y + x = 8 \), so \( (y,x) \in R_3 \). This holds for every pair. For instance, \( (1,7) \in R_3 \) and \( (7,1) \in R_3 \). Therefore \( R_3 \) IS symmetric. Checking Transitivity: Suppose \( (x,y) \in R_3 \) and \( (y,z) \in R_3 \). Then \( x + y = 8 \) and \( y + z = 8 \). Subtracting: \( x - z = 0 \Rightarrow x = z \). So we need \( (x,x) \in R_3 \), i.e., \( 2x = 8 \Rightarrow x = 4 \). Consider \( (1,7) \in R_3 \) and \( (7,1) \in R_3 \). For transitivity we need \( (1,1) \in R_3 \), but \( 1+1 = 2 \ne 8 \). So \( (1,1) \notin R_3 \). Therefore \( R_3 \) is NOT transitive.
Answer: \( R_3 \) is symmetric only. It is neither reflexive nor transitive.