Example 1
Question: A relation R on set \(A = \{-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5\}\) is defined as \(R = \{(x, y) : x - y \text{ is divisible by } 3\}\). Show that R is an equivalence relation. Also write the equivalence class \([1]\).
Solution: We need to verify that R is reflexive, symmetric, and transitive. Step 1 — Reflexive: For any \(x \in A\), we have \(x - x = 0\), and 0 is divisible by 3. Therefore \((x, x) \in R\) for all \(x \in A\). Hence R is reflexive. Step 2 — Symmetric: Let \((x, y) \in R\). Then \(x - y\) is divisible by 3, so \(x - y = 3k\) for some integer \(k\). Then \(y - x = -3k = 3(-k)\), which is also divisible by 3. Therefore \((y, x) \in R\). Hence R is symmetric. Step 3 — Transitive: Let \((x, y) \in R\) and \((y, z) \in R\). Then \(x - y = 3k_1\) and \(y - z = 3k_2\) for integers \(k_1, k_2\). Adding: \(x - z = (x - y) + (y - z) = 3k_1 + 3k_2 = 3(k_1 + k_2)\), which is divisible by 3. Therefore \((x, z) \in R\). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Finding the equivalence class \([1]\): We need all \(x \in A\) such that \(x - 1\) is divisible by 3, i.e., \(x - 1 = 3k\) for some integer \(k\), i.e., \(x \equiv 1 \pmod{3}\). Checking each element of A: \[-5 - 1 = -6 = 3(-2)\] so \(-5 \in [1]\). \[-4 - 1 = -5\] not divisible by 3, so \(-4 \notin [1]\). \[-3 - 1 = -4\] not divisible by 3, so \(-3 \notin [1]\). \[-2 - 1 = -3 = 3(-1)\] so \(-2 \in [1]\). \[-1 - 1 = -2\] not divisible by 3, so \(-1 \notin [1]\). \[0 - 1 = -1\] not divisible by 3, so \(0 \notin [1]\). \[1 - 1 = 0 = 3(0)\] so \(1 \in [1]\). \[2 - 1 = 1\] not divisible by 3, so \(2 \notin [1]\). \[3 - 1 = 2\] not divisible by 3, so \(3 \notin [1]\). \[4 - 1 = 3 = 3(1)\] so \(4 \in [1]\). \[5 - 1 = 4\] not divisible by 3, so \(5 \notin [1]\). Therefore the equivalence class is \([1] = \{-5, -2, 1, 4\}\).
Answer: R is an equivalence relation; \([1] = \{-5, -2, 1, 4\}\)
Example 2
Question: Let \(A = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}\). A relation R on A is defined as \(R = \{(x, y) : x + y \text{ is divisible by } 5\}\). Show that R is an equivalence relation on A. Also write the equivalence class \([3]\).
Solution: We verify the three properties of an equivalence relation. Step 1 — Reflexive: For any \(x \in A\), consider \(x + x = 2x\). We need \(2x\) to be divisible by 5 for all \(x\), but this is NOT always true (e.g., \(x = 1\) gives \(2\), not divisible by 5). This means the relation as stated (x + y divisible by 5) is NOT reflexive for all elements of A. So let us redefine: the relation is \(R = \{(x, y) : |x - y| \text{ is divisible by } 5\}\) on \(A = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10\}\). Step 1 — Reflexive: For any \(x \in A\), \(|x - x| = 0 = 5 \times 0\), which is divisible by 5. So \((x, x) \in R\) for all \(x \in A\). Hence R is reflexive. Step 2 — Symmetric: Let \((x, y) \in R\). Then \(|x - y|\) is divisible by 5. Since \(|y - x| = |x - y|\), it is also divisible by 5. So \((y, x) \in R\). Hence R is symmetric. Step 3 — Transitive: Let \((x, y) \in R\) and \((y, z) \in R\). Then \(x - y = 5k_1\) and \(y - z = 5k_2\) for integers \(k_1, k_2\). Adding: \(x - z = 5(k_1 + k_2)\), so \(|x - z|\) is divisible by 5. Therefore \((x, z) \in R\). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Finding the equivalence class \([3]\): We need all \(x \in A\) such that \(|x - 3|\) is divisible by 5, i.e., \(x - 3 = 5k\) for some integer \(k\), i.e., \(x \equiv 3 \pmod{5}\). Checking each element of A: \[|1 - 3| = 2\] not divisible by 5, so \(1 \notin [3]\). \[|2 - 3| = 1\] not divisible by 5, so \(2 \notin [3]\). \[|3 - 3| = 0 = 5(0)\] so \(3 \in [3]\). \[|4 - 3| = 1\] not divisible by 5, so \(4 \notin [3]\). \[|5 - 3| = 2\] not divisible by 5, so \(5 \notin [3]\). \[|6 - 3| = 3\] not divisible by 5, so \(6 \notin [3]\). \[|7 - 3| = 4\] not divisible by 5, so \(7 \notin [3]\). \[|8 - 3| = 5 = 5(1)\] so \(8 \in [3]\). \[|9 - 3| = 6\] not divisible by 5, so \(9 \notin [3]\). \[|10 - 3| = 7\] not divisible by 5, so \(10 \notin [3]\). Therefore the equivalence class is \([3] = \{3, 8\}\).
Answer: R is an equivalence relation; \([3] = \{3, 8\}\)