Detailed Explanation
A relation \( R \) on a set is called an equivalence relation if it satisfies three properties. First, reflexivity: every element must relate to itself, that is \( (a, a) \in R \) for all \( a \). Second, symmetry: if \( (a, b) \in R \) then \( (b, a) \in R \). Third, transitivity: if \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Here the relation is defined on integers \( Z \) by the rule that \( a - b \) is divisible by 2. Recall that a number is divisible by 2 means it can be written as \( 2k \) for some integer \( k \). We must verify all three properties to conclude that \( R \) is an equivalence relation.
Formula Used
\( R = \{(a, b) : 2 \text{ divides } (a - b)\} \), where "2 divides \( x \)" means \( x = 2k \) for some integer \( k \).
Solution
- Step 1: Check Reflexivity: Take any integer \( a \in Z \). Consider \( a - a = 0 \). Since \( 0 = 2 \times 0 \), the number \( 0 \) is divisible by 2. Therefore \( (a, a) \in R \) for every integer \( a \). Hence \( R \) is reflexive.
- Step 2: Check Symmetry: Suppose \( (a, b) \in R \). This means 2 divides \( a - b \), so \( a - b = 2k \) for some integer \( k \). Then \( b - a = -(a - b) = -2k = 2(-k) \). Since \( -k \) is also an integer, 2 divides \( b - a \). Therefore \( (b, a) \in R \). Hence \( R \) is symmetric.
- Step 3: Check Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then 2 divides \( a - b \) and 2 divides \( b - c \), so \( a - b = 2k_1 \) and \( b - c = 2k_2 \) for some integers \( k_1 \) and \( k_2 \). Adding these gives \[ (a - b) + (b - c) = 2k_1 + 2k_2 \] which simplifies to \[ a - c = 2(k_1 + k_2). \] Since \( k_1 + k_2 \) is an integer, 2 divides \( a - c \). Therefore \( (a, c) \in R \). Hence \( R \) is transitive.
- Step 4: Conclusion: Since \( R \) is reflexive, symmetric, and transitive, it satisfies all three conditions of an equivalence relation.
Final Answer
The relation \( R = \{(a, b) : 2 \text{ divides } (a - b)\} \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( Z \).
Common Mistake
A common mistake is to only test the properties on a few specific numbers instead of using a general integer \( a \) or general expressions like \( a - b = 2k \). Checking examples does not prove the relation for all integers; you must argue generally.