SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q5

Show that the relation R in the set \(Z\) of integers given by
\(R=\{(a, b) : \) 2 divides \(a-b\}\) is an equivalence relation.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting all whole numbers into two groups: even and odd. Any two even numbers, when subtracted, give an even result. Same for two odd numbers. This relation groups numbers that behave the same way when divided by 2. Every number pairs with itself, pairs swap both ways, and chains of pairs stay connected. Because it treats numbers fairly and consistently in all three ways, it qualifies as an equivalence relation — like sorting socks by colour, where every sock belongs to exactly one colour group.

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 \).

📖 Proving R is an Equivalence Relation on Z

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

  1. 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.
  2. 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.
  3. 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.
  4. 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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Recall What Must Be Verified: To prove \( R \) is an equivalence relation, we must check three properties: (i) Reflexivity — \( (a, a) \in R \) for every \( a \in Z \); (ii) Symmetry — if \( (a, b) \in R \) then \( (b, a) \in R \); (iii) Transitivity — if \( (a, b) \in R \) and \( (b, c) \in R \) then \( (a, c) \in R \). — Reason: All three conditions together are necessary and sufficient for a relation to be called an equivalence relation.
  2. Step 2: Check Reflexivity: Pick any arbitrary integer \( a \in Z \) and compute \( a - a \). We get \( a - a = 0 \), and since \( 0 = 2 \times 0 \), the number \( 0 \) is divisible by 2. Therefore \( (a, a) \in R \) for every \( a \in Z \), which means \( R \) is reflexive. — Reason: Divisibility by 2 requires writing the difference as \( 2k \) for an integer \( k \); here \( k = 0 \) works.
  3. Step 3: Check Symmetry — Setup: Assume \( (a, b) \in R \) for some integers \( a, b \in Z \). By the definition of \( R \), this means 2 divides \( a - b \), so we can write \( a - b = 2k \) for some integer \( k \in Z \). — Reason: We start from the hypothesis to derive a useful algebraic form that can be manipulated.
  4. Step 4: Check Symmetry — Conclusion: Starting from \( a - b = 2k \), we multiply both sides by \( -1 \) to get \( b - a = -2k = 2(-k) \). Since \( -k \) is also an integer (the integers are closed under negation), it follows that 2 divides \( b - a \), so \( (b, a) \in R \). Therefore \( R \) is symmetric. — Reason: Showing \( b - a \) is expressible as \( 2 \times \text{(an integer)} \) is exactly what the definition of membership in \( R \) requires.
  5. Step 5: Check Transitivity — Setup: Now assume both \( (a, b) \in R \) and \( (b, c) \in R \) for integers \( a, b, c \in Z \). Translating using the definition of \( R \): \( a - b = 2k_1 \) for some integer \( k_1 \), and \( b - c = 2k_2 \) for some integer \( k_2 \). — Reason: Writing both conditions in algebraic form allows us to combine them in the next step.
  6. Step 6: Check Transitivity — Conclusion: Add the two equations: \[ (a - b) + (b - c) = 2k_1 + 2k_2 \] The left side simplifies to \( a - c \), and the right side factors as \( 2(k_1 + k_2) \). Since \( k_1 + k_2 \) is an integer, 2 divides \( a - c \), giving \( (a, c) \in R \). Therefore \( R \) is transitive. — Reason: Adding the two differences eliminates the intermediate element \( b \), directly linking \( a \) and \( c \).
  7. Step 7: State the Final Conclusion: Since \( R \) has been shown to be reflexive (Step 2), symmetric (Steps 3–4), and transitive (Steps 5–6), all three conditions for an equivalence relation are satisfied. — Reason: Meeting all three properties simultaneously is the complete definition 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

One common mistake: Students often forget to verify all three properties and stop after checking only reflexivity and symmetry, incorrectly concluding that the relation is an equivalence relation without confirming transitivity.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: For any \( a \in \mathbb{Z} \): \( a - a = 0 = 2 \times 0 \), so 2 divides \( a - a \), giving \( (a, a) \in R \). Hence \( R \) is reflexive.
  2. Symmetry: Let \( (a, b) \in R \), so \( a - b = 2k \) for some \( k \in \mathbb{Z} \). Then \( b - a = 2(-k) \), so \( (b, a) \in R \). Hence \( R \) is symmetric.
  3. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \), so \( a - b = 2k_1 \) and \( b - c = 2k_2 \). Adding: \( a - c = 2(k_1 + k_2) \), so \( (a, c) \in R \). Hence \( R \) is transitive.

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 \).

➕ More Examples

More Examples

Example 1

Question: Show that the relation R in the set \( \mathbb{Z} \) of integers defined by \( R = \{(a, b) : 3 \text{ divides } a - b\} \) is an equivalence relation.

Solution: We need to verify Reflexivity, Symmetry, and Transitivity. Step 1 — Reflexivity: Let \( a \in \mathbb{Z} \). Then \( a - a = 0 = 3 \times 0 \), so 3 divides \( a - a \). Hence \( (a, a) \in R \) for all \( a \in \mathbb{Z} \). Thus R is reflexive. Step 2 — Symmetry: Let \( (a, b) \in R \). Then 3 divides \( a - b \), so \( a - b = 3k \) for some integer \( k \). Then \( b - a = 3(-k) \), and since \( -k \in \mathbb{Z} \), 3 divides \( b - a \). Hence \( (b, a) \in R \). Thus R is symmetric. Step 3 — Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then 3 divides \( a - b \) and 3 divides \( b - c \), so \( a - b = 3k \) and \( b - c = 3m \) for some integers \( k, m \). Adding: \[ (a - b) + (b - c) = 3k + 3m \] which simplifies to \[ a - c = 3(k + m). \] Since \( k + m \in \mathbb{Z} \), 3 divides \( a - c \). Hence \( (a, c) \in R \). Thus R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{Z} \).

Answer: R is an equivalence relation on \( \mathbb{Z} \) since it is reflexive, symmetric, and transitive.

Example 2

Question: Let \( T \) be the set of all triangles in a plane. Show that the relation \( R = \{(T_1, T_2) : T_1 \text{ is similar to } T_2\} \) is an equivalence relation on \( T \).

Solution: We need to verify Reflexivity, Symmetry, and Transitivity. Step 1 — Reflexivity: Let \( T_1 \in T \). Every triangle is similar to itself (all corresponding angles are equal and sides are proportional with ratio 1). Hence \( (T_1, T_1) \in R \) for all \( T_1 \in T \). Thus R is reflexive. Step 2 — Symmetry: Let \( (T_1, T_2) \in R \), meaning \( T_1 \) is similar to \( T_2 \). By the symmetric property of similarity of triangles, \( T_2 \) is also similar to \( T_1 \). Hence \( (T_2, T_1) \in R \). Thus R is symmetric. Step 3 — Transitivity: Let \( (T_1, T_2) \in R \) and \( (T_2, T_3) \in R \). Then \( T_1 \) is similar to \( T_2 \) and \( T_2 \) is similar to \( T_3 \). By the transitive property of similarity of triangles, \( T_1 \) is similar to \( T_3 \). Hence \( (T_1, T_3) \in R \). Thus R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on the set \( T \) of all triangles.

Answer: R is an equivalence relation on \( T \) since similarity of triangles is reflexive, symmetric, and transitive.

🎯 Try a Similar Question

Try a Similar Question

Question: Show that the relation \( R \) in the set \( \mathbb{Z} \) of integers, defined by \( R = \{(a, b) : 3 \text{ divides } (a - b)\} \), is an equivalence relation.

Solution

  1. Step 1: State What Needs to Be Proved: We need to show that \( R \) is reflexive, symmetric, and transitive. Here, \( (a, b) \in R \) means \( 3 \mid (a - b) \), i.e., \( a - b = 3k \) for some integer \( k \).
  2. Step 2: Reflexivity: Let \( a \in \mathbb{Z} \) be any integer. Then \( a - a = 0 = 3 \times 0 \). Since \( 3 \mid 0 \), we have \( (a, a) \in R \) for every \( a \in \mathbb{Z} \). Hence R is reflexive.
  3. Step 3: Symmetry: Let \( (a, b) \in R \). Then \( 3 \mid (a - b) \), so \( a - b = 3k \) for some integer \( k \). Therefore \( b - a = 3(-k) \), and since \( -k \in \mathbb{Z} \), we get \( 3 \mid (b - a) \), which means \( (b, a) \in R \). Hence R is symmetric.
  4. Step 4: Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 3k \) and \( b - c = 3m \) for some integers \( k, m \). Adding: \( a - c = (a - b) + (b - c) = 3k + 3m = 3(k + m) \). Since \( k + m \in \mathbb{Z} \), we have \( 3 \mid (a - c) \), so \( (a, c) \in R \). Hence R is transitive.
  5. Step 5: Conclusion: Since \( R \) is reflexive, symmetric, and transitive, \( R \) is an equivalence relation on \( \mathbb{Z} \). The equivalence classes under this relation are the three residue classes modulo 3: the set of integers leaving remainder 0, 1, and 2 when divided by 3.

Answer: The relation \( R = \{(a, b) : 3 \text{ divides } (a - b)\} \) is reflexive, symmetric, and transitive, and therefore it is an equivalence relation on \( \mathbb{Z} \). Its three distinct equivalence classes are the residue classes modulo 3.

Everything you get with Solver7

More questions in Relations and Functions