Example 1
Question: Let A be the set of all lines in the XY-plane. Define a relation R on A by: \( R = \{(l_1, l_2) : l_1 \text{ is parallel to } l_2\} \). Show that R is an equivalence relation. Further, describe the equivalence class of the line \( y = 2x + 3 \).
Solution: We check the three properties of an equivalence relation. Reflexivity: Let \( l \) be any line in A. Every line is parallel to itself (trivially, since they coincide), so \( (l, l) \in R \) for all \( l \in A \). Hence R is reflexive. Symmetry: Let \( (l_1, l_2) \in R \), meaning \( l_1 \) is parallel to \( l_2 \). By the definition of parallel lines, if \( l_1 \parallel l_2 \) then \( l_2 \parallel l_1 \), so \( (l_2, l_1) \in R \). Hence R is symmetric. Transitivity: Let \( (l_1, l_2) \in R \) and \( (l_2, l_3) \in R \), meaning \( l_1 \parallel l_2 \) and \( l_2 \parallel l_3 \). Two lines parallel to the same line are parallel to each other, so \( l_1 \parallel l_3 \), giving \( (l_1, l_3) \in R \). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Equivalence class of \( y = 2x + 3 \): A line is related to \( y = 2x + 3 \) if and only if it has the same slope, namely slope \( = 2 \). The set of all such lines is \[ [y = 2x + 3] = \{ y = 2x + c : c \in \mathbb{R} \} \] This is the family of all lines with slope 2, i.e., all lines parallel to \( y = 2x + 3 \), including \( y = 2x + 3 \) itself.
Answer: R is an equivalence relation. The equivalence class of \( y = 2x + 3 \) is the set of all lines of the form \( y = 2x + c \) for \( c \in \mathbb{R} \), i.e., the family of all lines parallel to \( y = 2x + 3 \).
Example 2
Question: Let \( A = \mathbb{Z} \) (the set of all integers). Define a relation R on A by \( R = \{(a, b) : 3 \mid (a - b)\} \), meaning 3 divides \( (a - b) \). Show that R is an equivalence relation. Also, find the equivalence class of the integer 1.
Solution: We verify reflexivity, symmetry, and transitivity. Reflexivity: For any \( a \in \mathbb{Z} \), we have \( a - a = 0 \) and \( 3 \mid 0 \), so \( (a, a) \in R \). Hence R is reflexive. Symmetry: Let \( (a, b) \in R \), so \( 3 \mid (a - b) \). Then \( a - b = 3k \) for some integer \( k \). This gives \( b - a = 3(-k) \), so \( 3 \mid (b - a) \), meaning \( (b, a) \in R \). Hence R is symmetric. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 3k \) and \( b - c = 3m \) for integers \( k, m \). Adding: \[ a - c = (a - b) + (b - c) = 3k + 3m = 3(k + m) \] Since \( k + m \in \mathbb{Z} \), we get \( 3 \mid (a - c) \), so \( (a, c) \in R \). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Equivalence class of 1: The equivalence class \( [1] \) consists of all integers \( a \) such that \( (a, 1) \in R \), i.e., \( 3 \mid (a - 1) \), i.e., \( a - 1 = 3k \) for some \( k \in \mathbb{Z} \), i.e., \( a = 3k + 1 \). \[ [1] = \{ \ldots, -5, -2, 1, 4, 7, 10, \ldots \} \] This is the set of all integers that leave remainder 1 when divided by 3.
Answer: R is an equivalence relation. The equivalence class of 1 is \( [1] = \{\ldots, -5, -2, 1, 4, 7, 10, \ldots\} \), i.e., all integers of the form \( 3k + 1 \) for \( k \in \mathbb{Z} \).