SOLVER7 Study. Nothing Else.
Exercise 1.1 Q8

Show that the relation R in the set \(A=\{1, 2, 3, 4, 5\}\) given by \(R=\{(a,b):|a-b| \) is even\(\},\) is an equivalence relation. Show that all the elements of \(\{1, 3, 5\}\) are related to each other and all the elements of \(\{2,4\}\) are related to each other. But no element of \(\{1, 3, 5\}\) is related to any element of \(\{2,4\}.\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting your friends into two clubs: an odd club and an even club. Two numbers are 'related' when their difference is even — that only happens when both are odd or both are even. The number \( |a - b| \) acts like a test: same type of number means even difference, different types means odd difference. Odd numbers \( 1, 3, 5 \) always pass the test with each other. Even numbers \( 2, 4 \) always pass with each other. But mix one odd and one even and the test fails every time.

Answer: The relation \( R = \{(a,b) : |a-b| \text{ is even}\} \) is reflexive, symmetric and transitive, hence it is an equivalence relation. All elements of \( \{1,3,5\} \) (the odd numbers) are related to each other, all elements of \( \{2,4\} \) (the even numbers) are related to each other, but no element of \( \{1,3,5\} \) is related to any element of \( \{2,4\} \), since an odd number and an even number differ by an odd amount.

📖 Equivalence Relation on A = {1,2,3,4,5}

Detailed Explanation

A relation \( R \) on a set \( A \) is called an equivalence relation if it satisfies three properties: reflexive, symmetric and transitive. Reflexive means \( (a,a) \in R \) for every \( a \in A \). Symmetric means whenever \( (a,b) \in R \), then \( (b,a) \in R \). Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Here the relation is defined as \( R = \{(a,b) : |a-b| \text{ is even}\} \). The key idea is that \( |a-b| \) is even exactly when \( a \) and \( b \) are both odd or both even. This is why the odd numbers group together and the even numbers group together, forming two separate equivalence classes.

Formula Used

\( R \) is an equivalence relation if it is reflexive: \( (a,a) \in R \), symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \), and transitive: \( (a,b) \in R \text{ and } (b,c) \in R \Rightarrow (a,c) \in R \). Here \( (a,b) \in R \iff |a-b| \) is even.

Solution

  1. Step 1: Check Reflexivity: For any \( a \in A \), consider \( |a-a| = 0 \). Since \( 0 \) is even, \( (a,a) \in R \) for every \( a \in A \). Therefore \( R \) is reflexive.
  2. Step 2: Check Symmetry: Suppose \( (a,b) \in R \). Then \( |a-b| \) is even. Since \( |b-a| = |a-b| \), it follows that \( |b-a| \) is also even. Hence \( (b,a) \in R \). Therefore \( R \) is symmetric.
  3. Step 3: Check Transitivity: Suppose \( (a,b) \in R \) and \( (b,c) \in R \). Then \( |a-b| \) is even and \( |b-c| \) is even. This means \( a \) and \( b \) have the same parity (both odd or both even), and \( b \) and \( c \) have the same parity. So \( a \) and \( c \) also have the same parity, which makes \( |a-c| \) even. Hence \( (a,c) \in R \). Therefore \( R \) is transitive.
  4. Step 4: Conclude Equivalence Relation: Since \( R \) is reflexive, symmetric and transitive, \( R \) is an equivalence relation on \( A \).
  5. Step 5: Elements of {1,3,5} are related to each other: Take any two elements from \( \{1,3,5\} \). Since they are all odd, their difference is even. For example, \( |1-3| = 2 \), \( |3-5| = 2 \), \( |1-5| = 4 \), all even. Hence every pair among \( 1, 3, 5 \) belongs to \( R \), so all elements of \( \{1,3,5\} \) are related to each other.
  6. Step 6: Elements of {2,4} are related to each other: Take the elements of \( \{2,4\} \). Since both are even, \( |2-4| = 2 \), which is even. Hence \( (2,4) \in R \) and \( (4,2) \in R \), so all elements of \( \{2,4\} \) are related to each other.
  7. Step 7: No element of {1,3,5} is related to any element of {2,4}: Take one odd element from \( \{1,3,5\} \) and one even element from \( \{2,4\} \). Their difference is odd, so \( |a-b| \) is odd. For example, \( |1-2| = 1 \), \( |3-4| = 1 \), \( |5-2| = 3 \), all odd. Therefore no element of \( \{1,3,5\} \) is related to any element of \( \{2,4\} \).

Final Answer

The relation \( R = \{(a,b) : |a-b| \text{ is even}\} \) is reflexive, symmetric and transitive, hence it is an equivalence relation. All elements of \( \{1,3,5\} \) (the odd numbers) are related to each other, all elements of \( \{2,4\} \) (the even numbers) are related to each other, but no element of \( \{1,3,5\} \) is related to any element of \( \{2,4\} \), since an odd number and an even number differ by an odd amount.

Common Mistake

A common mistake is forgetting that \( 0 \) is even, so students wrongly conclude that \( (a,a) \) may not belong to \( R \). Since \( |a-a| = 0 \) and \( 0 \) is even, reflexivity always holds. Another error is confusing 'even difference' with 'same number' instead of realising it means 'same parity'.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the Relation: The set is \( A = \\{1, 2, 3, 4, 5\\} \) and the relation is defined as \( R = \\{(a,b) : |a - b| \text{ is even}\\} \). The key observation is that \( |a - b| \) is even precisely when \( a \) and \( b \) are both odd or both even — Reason: Two integers have an even difference if and only if they share the same parity (both odd or both even).
  2. Step 2: Verify Reflexivity: For any element \( a \in A \), compute \( |a - a| = 0 \). Since \( 0 \) is even, we have \( (a, a) \in R \) for every \( a \in A \), so \( R \) is reflexive — Reason: Every element has an even difference with itself (zero), so it is always related to itself.
  3. Step 3: Verify Symmetry: Suppose \( (a, b) \in R \), meaning \( |a - b| \) is even. Since \( |b - a| = |a - b| \), it follows immediately that \( |b - a| \) is also even, so \( (b, a) \in R \). Therefore \( R \) is symmetric — Reason: The absolute value is unchanged when you swap the two elements, so the parity of the difference is also unchanged.
  4. Step 4: Verify Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( |a - b| \) is even and \( |b - c| \) is even, which means \( a, b \) have the same parity and \( b, c \) have the same parity. Therefore \( a \) and \( c \) also share the same parity, so \( |a - c| \) is even and \( (a, c) \in R \). Thus \( R \) is transitive — Reason: Parity is a transitive property; if \( a \) matches \( b \) and \( b \) matches \( c \) in parity, then \( a \) must match \( c \) as well.
  5. Step 5: Conclude Equivalence and Identify Equivalence Classes: Since \( R \) is reflexive, symmetric, and transitive, it is an equivalence relation. The equivalence classes are formed by grouping elements of the same parity. The odd elements \( \\{1, 3, 5\\} \) form one class (any two of them differ by an even number), and the even elements \( \\{2, 4\\} \) form another class. No odd element is related to any even element because an odd number minus an even number always yields an odd difference — Reason: Elements fall into exactly two parity groups, and the relation clusters each group together while keeping the two groups completely separate.

Final Answer

The relation \( R = \{(a,b) : |a-b| \text{ is even}\} \) is reflexive, symmetric and transitive, hence it is an equivalence relation. All elements of \( \{1,3,5\} \) (the odd numbers) are related to each other, all elements of \( \{2,4\} \) (the even numbers) are related to each other, but no element of \( \{1,3,5\} \) is related to any element of \( \{2,4\} \), since an odd number and an even number differ by an odd amount.

Common Mistake

One common mistake: Students often check only reflexivity and symmetry and forget to verify transitivity, or they assume transitivity is obvious without explicitly showing that shared parity of \( (a,b) \) and \( (b,c) \) guarantees the same parity for \( (a,c) \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For all \( a \in A \): \( |a - a| = 0 \), which is even, so \( (a,a) \in R \). Hence \( R \) is reflexive.
  2. Symmetry: \( (a,b) \in R \Rightarrow |a-b| \) is even \( \Rightarrow |b-a| = |a-b| \) is even \( \Rightarrow (b,a) \in R \). Hence \( R \) is symmetric.
  3. Transitivity: \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow |a-b| \) even and \( |b-c| \) even \( \Rightarrow (a-b) + (b-c) = a-c \) is even \( \Rightarrow |a-c| \) is even \( \Rightarrow (a,c) \in R \). Hence \( R \) is transitive.

Answer: The relation \( R = \{(a,b) : |a-b| \text{ is even}\} \) is reflexive, symmetric and transitive, hence it is an equivalence relation. All elements of \( \{1,3,5\} \) (the odd numbers) are related to each other, all elements of \( \{2,4\} \) (the even numbers) are related to each other, but no element of \( \{1,3,5\} \) is related to any element of \( \{2,4\} \), since an odd number and an even number differ by an odd amount.

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{1, 2, 3, 4, 5, 6\} \). Define a relation R on A by \( R = \{(a, b) : 3 \mid (a - b)\} \) (i.e., 3 divides \( a - b \)). Show that R is an equivalence relation. Also identify the equivalence classes and show that elements within each class are related to one another but no element of one class is related to any element of another class.

Solution: We check the three properties. Reflexivity: For any \( a \in A \), we have \( a - a = 0 \) and \( 3 \mid 0 \), so \( (a, a) \in R \). Hence R is reflexive. Symmetry: Suppose \( (a, b) \in R \). Then \( 3 \mid (a - b) \), so \( a - b = 3k \) for some integer \( k \). Then \( b - a = 3(-k) \), so \( 3 \mid (b - a) \), giving \( (b, a) \in R \). Hence R is symmetric. Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 3k \) and \( b - c = 3m \) for integers \( k, m \). Adding: \( a - c = 3(k + m) \), so \( 3 \mid (a - c) \), giving \( (a, c) \in R \). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Equivalence classes: We list the elements of A modulo 3. Class of 1: elements \( a \in A \) with \( 3 \mid (a - 1) \), i.e., \( a \equiv 1 \pmod{3} \): \( \{1, 4\} \). Class of 2: elements with \( a \equiv 2 \pmod{3} \): \( \{2, 5\} \). Class of 3: elements with \( a \equiv 0 \pmod{3} \): \( \{3, 6\} \). Within \( \{1, 4\} \): \( 4 - 1 = 3 \), so \( 3 \mid 3 \). Both \( (1,4) \) and \( (4,1) \) are in R. Similarly every pair in \( \{2, 5\} \) and \( \{3, 6\} \) satisfies the relation. Across classes: Take \( 1 \in \{1,4\} \) and \( 2 \in \{2,5\} \). Then \( 1 - 2 = -1 \) and \( 3 \nmid (-1) \), so \( (1,2) \notin R \). In general, if \( a \) and \( b \) belong to different classes they have different residues mod 3, so \( 3 \nmid (a - b) \) and \( (a, b) \notin R \). Hence no element of one class is related to any element of another class.

Answer: R is an equivalence relation. The three equivalence classes are \( \{1, 4\} \), \( \{2, 5\} \), and \( \{3, 6\} \). Elements within each class are mutually related; no element of one class is related to any element of a different class.

Example 2

Question: Let \( A = \{0, 1, 2, 3, 4, 5, 6, 7\} \). Define a relation R on A by \( R = \{(a, b) : 4 \mid (a - b)\} \). Show that R is an equivalence relation. Identify all equivalence classes and verify that elements within the same class are related to each other but no element of one class is related to any element of a different class.

Solution: We verify all three properties of an equivalence relation. Reflexivity: For any \( a \in A \), \( a - a = 0 \) and \( 4 \mid 0 \), so \( (a, a) \in R \) for every \( a \in A \). Hence R is reflexive. Symmetry: Let \( (a, b) \in R \). Then \( a - b = 4k \) for some integer \( k \). So \( b - a = 4(-k) \), which means \( 4 \mid (b - a) \), giving \( (b, a) \in R \). Hence R is symmetric. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 4k \) and \( b - c = 4m \) for integers \( k, m \). Adding these: \( a - c = 4(k + m) \), so \( 4 \mid (a - c) \), giving \( (a, c) \in R \). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Equivalence classes (residues mod 4 within A): Class of 0: \( a \equiv 0 \pmod{4} \): \( \{0, 4\} \). Class of 1: \( a \equiv 1 \pmod{4} \): \( \{1, 5\} \). Class of 2: \( a \equiv 2 \pmod{4} \): \( \{2, 6\} \). Class of 3: \( a \equiv 3 \pmod{4} \): \( \{3, 7\} \). Verification within classes: In \( \{0, 4\} \): \( 4 - 0 = 4 \) and \( 4 \mid 4 \), so \( (0, 4) \in R \). Likewise for each pair in the other classes (e.g. \( 5 - 1 = 4 \), \( 6 - 2 = 4 \), \( 7 - 3 = 4 \)). All such pairs satisfy the relation. Verification across classes: Take \( 0 \in \{0, 4\} \) and \( 1 \in \{1, 5\} \). Then \( 0 - 1 = -1 \) and \( 4 \nmid (-1) \), so \( (0, 1) \notin R \). In general, elements from different classes have different residues mod 4, so their difference is never divisible by 4. Hence no element of one class is related to any element of another class. The four equivalence classes \( \{0,4\} \), \( \{1,5\} \), \( \{2,6\} \), \( \{3,7\} \) partition A completely, confirming the equivalence relation structure.

Answer: R is an equivalence relation. The four equivalence classes are \( \{0, 4\} \), \( \{1, 5\} \), \( \{2, 6\} \), and \( \{3, 7\} \). Elements within the same class are mutually related, while no element of one class is related to any element of a different class.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \). Define a relation R on A by \( R = \{(a, b) : 3 \mid (a - b)\} \), i.e., \( (a, b) \in R \) if and only if \( (a - b) \) is divisible by 3. Show that R is an equivalence relation. Also show that the elements of \( \{1, 4, 7\} \) are all related to each other, the elements of \( \{2, 5, 8\} \) are all related to each other, and the elements of \( \{3, 6, 9\} \) are all related to each other, but no element of one group is related to any element of another group.

Solution

  1. Step 1: Verify Reflexivity: We need to check that \( (a, a) \in R \) for every \( a \in A \). Consider \( a - a = 0 \). Since 3 divides 0, we have \( 3 \mid (a - a) \) for all \( a \in A \). Therefore R is reflexive.
  2. Step 2: Verify Symmetry: Suppose \( (a, b) \in R \), so \( 3 \mid (a - b) \). This means \( a - b = 3k \) for some integer \( k \). Then \( b - a = 3(-k) \), so \( 3 \mid (b - a) \), which gives \( (b, a) \in R \). Therefore R is symmetric.
  3. Step 3: Verify Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 3k \) and \( b - c = 3m \) for some integers \( k \) and \( m \). Adding these: \( a - c = 3k + 3m = 3(k + m) \), so \( 3 \mid (a - c) \), giving \( (a, c) \in R \). Therefore R is transitive.
  4. Step 4: Conclusion — R is an Equivalence Relation: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on A.
  5. Step 5: Elements of {1, 4, 7} are all related to each other: Check all pairs from \( \{1, 4, 7\} \): \( 4 - 1 = 3 \), \( 7 - 1 = 6 \), and \( 7 - 4 = 3 \). Each difference is divisible by 3. So \( (1,4), (4,1), (1,7), (7,1), (4,7), (7,4) \in R \). All elements of \( \{1, 4, 7\} \) are related to each other; they all leave remainder 1 when divided by 3.
  6. Step 6: Elements of {2, 5, 8} are all related to each other: Check all pairs from \( \{2, 5, 8\} \): \( 5 - 2 = 3 \), \( 8 - 2 = 6 \), and \( 8 - 5 = 3 \). Each difference is divisible by 3. So all elements of \( \{2, 5, 8\} \) are related to each other; they all leave remainder 2 when divided by 3.
  7. Step 7: Elements of {3, 6, 9} are all related to each other: Check all pairs from \( \{3, 6, 9\} \): \( 6 - 3 = 3 \), \( 9 - 3 = 6 \), and \( 9 - 6 = 3 \). Each difference is divisible by 3. So all elements of \( \{3, 6, 9\} \) are related to each other; they all leave remainder 0 when divided by 3.
  8. Step 8: No element of one group is related to any element of another group: Elements of \( \{1, 4, 7\} \) satisfy \( a \equiv 1 \pmod{3} \), elements of \( \{2, 5, 8\} \) satisfy \( a \equiv 2 \pmod{3} \), and elements of \( \{3, 6, 9\} \) satisfy \( a \equiv 0 \pmod{3} \). If \( a \) and \( b \) belong to different groups, their remainders on division by 3 differ, so \( a - b \) is NOT divisible by 3. For example, \( 4 - 2 = 2 \), \( 7 - 3 = 4 \), \( 1 - 5 = -4 \) — none are divisible by 3. Hence no element of one equivalence class is related to any element of a different equivalence class.

Answer: R is an equivalence relation on \( A = \{1,2,3,4,5,6,7,8,9\} \). The three equivalence classes are \( \{1, 4, 7\} \) (remainder 1 mod 3), \( \{2, 5, 8\} \) (remainder 2 mod 3), and \( \{3, 6, 9\} \) (remainder 0 mod 3). All elements within each class are related to each other, but no element from one class is related to any element from a different class, since their difference is not divisible by 3.

Everything you get with Solver7

More questions in Relations and Functions