SOLVER7 Study. Nothing Else.
Exercise 1.1 Q9(i)

Show that each of the relation R in the set \(A=\{x\in Z:0\le x \le 12\},\) given by \(R=\{(a, b) : |a – b| \) is a multiple of \(4\}\) is an equivalence relation. Find the set of all elements related to 1 in each case.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a group of lockers numbered 0 to 12. Two lockers are 'friends' if their numbers differ by exactly 4, 8, or 0 (any multiple of 4). Every locker is its own friend (reflexive). If locker A is friends with locker B, then locker B is also friends with locker A (symmetric). If A is friends with B, and B is friends with C, then A and C are friends too (transitive). Locker 1 is friends with locker 5 (difference 4) and locker 9 (difference 8), giving the friend group \( \{1, 5, 9\} \).

Answer: R is an equivalence relation (reflexive, symmetric, transitive). The set of all elements related to 1 is \( \{1, 5, 9\} \).

📖 Equivalence Relation: |a - b| is a Multiple of 4

Detailed Explanation

A relation \( R \) on a set \( A \) is called an equivalence relation if it satisfies three properties. Reflexive: every element is related to itself, i.e. \( (a,a) \in R \) for all \( a \in A \). Symmetric: if \( (a,b) \in R \) then \( (b,a) \in R \). Transitive: if \( (a,b) \in R \) and \( (b,c) \in R \) then \( (a,c) \in R \). Here the set is \( A = \{0,1,2,\dots,12\} \) and two elements are related when \( |a-b| \) is a multiple of 4. To find all elements related to 1, we look for every \( x \in A \) such that \( |x-1| \) is a multiple of 4.

Formula Used

\( R = \{(a,b) : |a-b| \text{ is a multiple of } 4\} \). Equivalence relation \( \Leftrightarrow \) R is reflexive, symmetric and transitive.

Solution

  1. Step 1: Check reflexivity. For any \( a \in A \), consider \( |a-a| = 0 \). Since \( 0 = 4 \times 0 \), it is a multiple of 4. So \( (a,a) \in R \) for every \( a \in A \). Hence R is reflexive.
  2. Step 2: Check symmetry. Suppose \( (a,b) \in R \). Then \( |a-b| \) is a multiple of 4. Since \( |b-a| = |a-b| \), it follows that \( |b-a| \) is also a multiple of 4. Therefore \( (b,a) \in R \). Hence R is symmetric.
  3. Step 3: Check transitivity. Suppose \( (a,b) \in R \) and \( (b,c) \in R \). Then \( |a-b| = 4m \) and \( |b-c| = 4n \) for some integers \( m, n \). This means \( a-b = \pm 4m \) and \( b-c = \pm 4n \). Adding, \( a-c = (a-b) + (b-c) \), which is a sum of multiples of 4, so \( a-c \) is a multiple of 4, and hence \( |a-c| \) is a multiple of 4. Therefore \( (a,c) \in R \). Hence R is transitive.
  4. Step 4: Since R is reflexive, symmetric and transitive, R is an equivalence relation on \( A \).
  5. Step 5: Find all elements related to 1. We need \( x \in A \) such that \( |x-1| \) is a multiple of 4, i.e. \( |x-1| \in \{0, 4, 8, 12, \dots\} \). Checking values: \( |1-1| = 0 \) (yes), \( |5-1| = 4 \) (yes), \( |9-1| = 8 \) (yes). For \( x = 13 \) we would get \( 12 \), but \( 13 \notin A \).
  6. Step 6: Collect the valid elements from \( A = \{0,1,\dots,12\} \). The elements related to 1 are \( 1, 5, 9 \).

Final Answer

R is an equivalence relation (reflexive, symmetric, transitive). The set of all elements related to 1 is \( \{1, 5, 9\} \).

Common Mistake

A common mistake is including values like 13 (since \( |13-1| = 12 \) is a multiple of 4) without checking that they belong to \( A \). Only elements from \( \{0,1,\dots,12\} \) are allowed, so 13 is excluded.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the Relation: Two elements \( a \) and \( b \) in \( A = \{0, 1, 2, \dots, 12\} \) are related whenever \( |a - b| \) is divisible by 4. — Reason: This gives us the exact condition to test for each property of an equivalence relation.
  2. Step 2: Verify Reflexivity: Pick any \( a \in A \). Then \( |a - a| = 0 \), and since \( 0 = 4 \times 0 \), the value 0 is a multiple of 4. Therefore \( (a, a) \in R \) for every element, so R is reflexive. — Reason: Reflexivity requires every element to be related to itself; zero is always divisible by 4.
  3. Step 3: Verify Symmetry: Assume \( (a, b) \in R \), meaning \( |a - b| \) is a multiple of 4. Because the absolute value satisfies \( |b - a| = |a - b| \), it follows immediately that \( |b - a| \) is also a multiple of 4, giving \( (b, a) \in R \). Hence R is symmetric. — Reason: Symmetry requires that if \( a \) relates to \( b \), then \( b \) must relate back to \( a \); absolute value makes this automatic.
  4. Step 4: Verify Transitivity: Assume \( (a, b) \in R \) and \( (b, c) \in R \). Then there exist integers \( m \) and \( n \) such that \( a - b = \pm 4m \) and \( b - c = \pm 4n \). Adding these two equations: \( a - c = (a - b) + (b - c) \), which is a sum of multiples of 4, so \( a - c \) itself is a multiple of 4. Therefore \( |a - c| \) is a multiple of 4, giving \( (a, c) \in R \). Hence R is transitive. — Reason: Transitivity requires the property to carry through a chain; sums of multiples of 4 remain multiples of 4.
  5. Step 5: Conclude Equivalence: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on A. — Reason: All three conditions must hold together for a relation to qualify as an equivalence relation.
  6. Step 6: Find All Elements Related to 1: We need every \( x \in A \) such that \( |x - 1| \) is a multiple of 4. Check each candidate: \( |1 - 1| = 0 \) (multiple of 4 ✓), \( |5 - 1| = 4 \) (multiple of 4 ✓), \( |9 - 1| = 8 \) (multiple of 4 ✓), \( |13 - 1| = 12 \) but 13 is not in A. No other element in \( \{0, 1, \dots, 12\} \) gives a difference divisible by 4. — Reason: Finding the equivalence class of 1 means listing all elements that share the same remainder when divided by 4 (remainder 1 here).

Final Answer

R is an equivalence relation (reflexive, symmetric, transitive). The set of all elements related to 1 is \( \{1, 5, 9\} \).

Common Mistake

One common mistake: students often forget to check all three properties and conclude equivalence after verifying only reflexivity and symmetry, omitting the transitivity check entirely.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexive: For all \( a \in A \): \( |a - a| = 0 = 4 \times 0 \), so \( (a,a) \in R \). R is reflexive.
  2. Symmetric: \( (a,b) \in R \Rightarrow |a-b| \) is a multiple of 4, and \( |b-a| = |a-b| \), so \( (b,a) \in R \). R is symmetric.
  3. Transitive: \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow |a-b| = 4m,\; |b-c| = 4n \Rightarrow |a-c| = |(a-b)+(b-c)| \) is a multiple of 4, so \( (a,c) \in R \). R is transitive.
  4. Elements related to 1: Find \( x \in A \) with \( |x-1| \) a multiple of 4: \( x = 1 \) gives \( 0 \), \( x = 5 \) gives \( 4 \), \( x = 9 \) gives \( 8 \). Set \( = \{1, 5, 9\} \).

Answer: R is an equivalence relation (reflexive, symmetric, transitive). The set of all elements related to 1 is \( \{1, 5, 9\} \).

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{x \in \mathbb{Z} : 0 \le x \le 14\} \). Show that the relation \( R = \{(a, b) : |a - b| \text{ is a multiple of } 5\} \) is an equivalence relation on A. Also find the set of all elements related to 2.

Solution: We have \( A = \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14\} \) and \( R = \{(a, b) : 5 \mid (a - b)\} \). Step 1 — Reflexivity: For any \( a \in A \), we check whether \( (a, a) \in R \). We have \( |a - a| = 0 \), and 0 is a multiple of 5 (since \( 0 = 5 \times 0 \)). Hence \( (a, a) \in R \) for all \( a \in A \). So R is reflexive. Step 2 — Symmetry: Let \( (a, b) \in R \). Then \( |a - b| \) is a multiple of 5, say \( |a - b| = 5k \) for some non-negative integer k. Then \( |b - a| = |a - b| = 5k \), which is also a multiple of 5. Hence \( (b, a) \in R \). So R is symmetric. Step 3 — Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( |a - b| = 5m \) and \( |b - c| = 5n \) for some non-negative integers m and n. Now, \( |a - c| = |(a - b) + (b - c)| \le |a - b| + |b - c| = 5m + 5n = 5(m + n) \). More precisely, \( a - c = (a - b) + (b - c) \), so \( |a - c| \) is a multiple of 5 (since both \( a - b \) and \( b - c \) are multiples of 5, their sum is also a multiple of 5). Hence \( (a, c) \in R \). So R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Elements related to 2: We need all \( a \in A \) such that \( |a - 2| \) is a multiple of 5, i.e., \( |a - 2| \in \{0, 5, 10, 15, \ldots\} \). Case \( |a - 2| = 0 \): \( a = 2 \). Check: \( 2 \in A \). ✓ Case \( |a - 2| = 5 \): \( a = 7 \) or \( a = -3 \). Since \( -3 \notin A \), only \( a = 7 \). ✓ Case \( |a - 2| = 10 \): \( a = 12 \) or \( a = -8 \). Since \( -8 \notin A \), only \( a = 12 \). ✓ Case \( |a - 2| = 15 \): \( a = 17 \) or \( a = -13 \). Neither belongs to A. The set of all elements related to 2 is \( \{2, 7, 12\} \).

Answer: R is an equivalence relation. The set of all elements related to 2 is \( \{2, 7, 12\} \).

Example 2

Question: Let \( A = \{x \in \mathbb{Z} : 0 \le x \le 17\} \). Show that the relation \( R = \{(a, b) : |a - b| \text{ is a multiple of } 6\} \) is an equivalence relation on A. Also find the set of all elements related to 3.

Solution: We have \( A = \{0, 1, 2, 3, \ldots, 17\} \) and \( R = \{(a, b) : 6 \mid (a - b)\} \). Step 1 — Reflexivity: For any \( a \in A \), \( |a - a| = 0 = 6 \times 0 \), which is a multiple of 6. Hence \( (a, a) \in R \) for all \( a \in A \). So R is reflexive. Step 2 — Symmetry: Suppose \( (a, b) \in R \). Then \( |a - b| = 6k \) for some non-negative integer k. Now \( |b - a| = |a - b| = 6k \), so \( (b, a) \in R \). Hence R is symmetric. Step 3 — Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 6m \) and \( b - c = 6n \) for integers m, n. Therefore \( a - c = (a - b) + (b - c) = 6m + 6n = 6(m + n) \). Since \( m + n \) is an integer, \( |a - c| \) is a multiple of 6. Hence \( (a, c) \in R \). So R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on A. Elements related to 3: We need all \( a \in A \) such that \( |a - 3| \) is a multiple of 6, i.e., \( |a - 3| \in \{0, 6, 12, 18, \ldots\} \). Case \( |a - 3| = 0 \): \( a = 3 \). Since \( 3 \in A \). ✓ Case \( |a - 3| = 6 \): \( a = 9 \) or \( a = -3 \). Since \( -3 \notin A \), only \( a = 9 \). ✓ Case \( |a - 3| = 12 \): \( a = 15 \) or \( a = -9 \). Since \( -9 \notin A \), only \( a = 15 \). ✓ Case \( |a - 3| = 18 \): \( a = 21 \) or \( a = -15 \). Neither belongs to A. The set of all elements related to 3 is \( \{3, 9, 15\} \).

Answer: R is an equivalence relation. The set of all elements related to 3 is \( \{3, 9, 15\} \).

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{ x \in \mathbb{Z} : 0 \le x \le 14 \} \). A relation R on A is defined by \( R = \{ (a, b) : |a - b| \text{ is a multiple of } 5 \} \). Show that R is an equivalence relation. Also, find the set of all elements related to 2.

Solution

  1. Step 1: Identify the Set and Relation: The set is \( A = \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14\} \) and the relation is \( R = \{(a, b) : |a - b| \text{ is a multiple of } 5\} \), i.e., \( 5 \mid (a - b) \).
  2. Step 2: Check Reflexivity: For any \( a \in A \), we have \( |a - a| = 0 \), and 0 is a multiple of 5 (since \( 0 = 5 \times 0 \)). Therefore \( (a, a) \in R \) for all \( a \in A \). Hence R is reflexive.
  3. Step 3: Check Symmetry: Let \( (a, b) \in R \). Then \( |a - b| \) is a multiple of 5. Since \( |b - a| = |a - b| \), it follows that \( |b - a| \) is also a multiple of 5, so \( (b, a) \in R \). Hence R is symmetric.
  4. Step 4: Check Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( 5 \mid (a - b) \) and \( 5 \mid (b - c) \). Adding these: \( 5 \mid \left[(a - b) + (b - c)\right] \), i.e., \( 5 \mid (a - c) \), which means \( |a - c| \) is a multiple of 5. So \( (a, c) \in R \). Hence R is transitive.
  5. Step 5: Conclude R is an Equivalence Relation: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on A.
  6. Step 6: Find All Elements Related to 2: We need all \( x \in A \) such that \( |x - 2| \) is a multiple of 5. This means \( x - 2 = 0, \pm 5, \pm 10, \pm 15, \ldots \) Solving: \( x = 2, 7, 12, -3, -8, 17, \ldots \) Keeping only values in \( A = \{0, 1, \ldots, 14\} \): \( x = 2, 7, 12 \). Therefore the set of all elements related to 2 is \( \{2, 7, 12\} \).

Answer: R is an equivalence relation (reflexive, symmetric, and transitive). The set of all elements in A related to 2 is \( \{2, 7, 12\} \).

Everything you get with Solver7

More questions in Relations and Functions