Example 1
Question: Two students Priya and Arjun are playing a number game. They use the set \( C = \{2, 4, 6, 8\} \). Define a relation \( R \) on \( C \) as \( R = \{(x, y) : x \text{ divides } y\} \). Check whether \( R \) is symmetric or transitive.
Solution: First, we list all pairs \( (x, y) \) in \( C \times C \) such that \( x \) divides \( y \). The set is \( C = \{2, 4, 6, 8\} \). Going through all pairs: \( 2 \mid 2 \), \( 2 \mid 4 \), \( 2 \mid 6 \), \( 2 \mid 8 \), \( 4 \mid 4 \), \( 4 \mid 8 \), \( 6 \mid 6 \), \( 8 \mid 8 \) So: \[ R = \{(2,2),(2,4),(2,6),(2,8),(4,4),(4,8),(6,6),(8,8)\} \] Checking Symmetry: For \( R \) to be symmetric, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). Consider \( (2, 4) \in R \). This means 2 divides 4. For symmetry, we need \( (4, 2) \in R \), i.e., 4 must divide 2. But 4 does not divide 2. Since \( (2, 4) \in R \) but \( (4, 2) \notin R \), the relation \( R \) is NOT symmetric. Checking Transitivity: For \( R \) to be transitive, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Take any pair \( (x, y) \in R \) and \( (y, z) \in R \). This means \( x \mid y \) and \( y \mid z \). If \( x \mid y \), then \( y = kx \) for some integer \( k \). If \( y \mid z \), then \( z = my \) for some integer \( m \). Therefore \( z = m \cdot kx = (mk)x \), so \( x \mid z \), which means \( (x, z) \in R \). Let us verify with an example from \( R \): \( (2, 4) \in R \) and \( (4, 8) \in R \). We check: is \( (2, 8) \in R \)? Yes, because \( 2 \mid 8 \). \( \checkmark \) Since the divisibility property is preserved in all such cases, \( R \) is transitive.
Answer: R is NOT symmetric (counterexample: \( (2,4) \in R \) but \( (4,2) \notin R \)). R IS transitive.
Example 2
Question: A teacher asks students to consider the set \( D = \{1, 2, 3, 4, 5\} \) of marks scored in a quiz. Define a relation \( R \) on \( D \) as \( R = \{(x, y) : x + y \le 6,\ x, y \in D\} \). Check whether \( R \) is symmetric or transitive.
Solution: We list all pairs \( (x, y) \) from \( D \times D \) such that \( x + y \le 6 \). \[ R = \{(1,1),(1,2),(1,3),(1,4),(1,5),(2,1),(2,2),(2,3),(2,4),(3,1),(3,2),(3,3),(4,1),(4,2),(5,1)\} \] Checking Symmetry: For \( R \) to be symmetric, whenever \( (x, y) \in R \), we need \( (y, x) \in R \). If \( (x, y) \in R \), then \( x + y \le 6 \). Since addition is commutative, \( y + x = x + y \le 6 \), so \( (y, x) \in R \) as well. This holds for every pair in \( R \). Therefore, \( R \) IS symmetric. Checking Transitivity: For \( R \) to be transitive, whenever \( (x, y) \in R \) and \( (y, z) \in R \), we need \( (x, z) \in R \). Consider \( (1, 5) \in R \) since \( 1 + 5 = 6 \le 6 \). Also, \( (5, 1) \in R \) since \( 5 + 1 = 6 \le 6 \). For transitivity, we need \( (1, 1) \in R \). Check: \( 1 + 1 = 2 \le 6 \). \( \checkmark \) Now try \( (3, 3) \in R \) since \( 3 + 3 = 6 \le 6 \). Also, \( (3, 3) \in R \). For transitivity, we need \( (3, 3) \in R \). Check: \( 3 + 3 = 6 \le 6 \). \( \checkmark \) Now try \( (4, 2) \in R \) since \( 4 + 2 = 6 \le 6 \). Also, \( (2, 4) \in R \) since \( 2 + 4 = 6 \le 6 \). For transitivity, we need \( (4, 4) \in R \). Check: \( 4 + 4 = 8 > 6 \). So \( (4, 4) \notin R \). Since \( (4, 2) \in R \) and \( (2, 4) \in R \) but \( (4, 4) \notin R \), the relation \( R \) is NOT transitive.
Answer: R IS symmetric (since \( x + y = y + x \)). R is NOT transitive (counterexample: \( (4,2) \in R \) and \( (2,4) \in R \) but \( (4,4) \notin R \)).