SOLVER7 Study. Nothing Else.
2024 Board Paper Q32

A relation R on set \(A=\{– 4, – 3, – 2, – 1, 0, 1, 2, 3, 4\}\) be defined as \(R=\{(x, y) : x + y\) is an integer divisible by \(2\}.\) Show that \(R\) is an equivalence relation. Also, write the equivalence class \([2].\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting socks into two piles — odd-patterned and even-patterned. Two socks belong together when they match the same pile. Here, two numbers are "friends" when their sum is even. A number plus itself is always even, so every number is its own friend. If 2 and 4 are friends, then 4 and 2 are friends too. All even numbers in the set form one group together. The number 2 belongs to the group of all even numbers in the set, which is \( \{-4, -2, 0, 2, 4\} \).

Answer: R is an equivalence relation, and the equivalence class \( [2] = \{-4, -2, 0, 2, 4\} \).

📖 Proving R is an Equivalence Relation and Finding [2]

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 rule is that \( x + y \) must be an even integer (divisible by 2). Note that \( x + y \) is even exactly when \( x \) and \( y \) have the same parity (both even or both odd). The equivalence class \( [a] \) is the set of all elements of \( A \) that are related to \( a \).

Formula Used

\( (x, y) \in R \iff x + y \) is divisible by 2. Equivalence class: \( [a] = \{ x \in A : (a, x) \in R \} \).

Solution

  1. Step 1: Check reflexivity. Take any \( a \in A \). Then \( a + a = 2a \), which is always divisible by 2. 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 divisible by 2. Since addition is commutative, \( b + a = a + b \) is also divisible by 2. 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 \) is even and \( b + c \) is even. Adding these, \( (a + b) + (b + c) = a + c + 2b \) is even. Since \( 2b \) is even, \( a + c \) must also be even, so \( a + c \) is divisible by 2. 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 the equivalence class \( [2] \). We need all \( x \in A \) such that \( 2 + x \) is divisible by 2. This happens only when \( x \) is even (so that the sum is even). The even elements of \( A = \{-4, -3, -2, -1, 0, 1, 2, 3, 4\} \) are \( -4, -2, 0, 2, 4 \).
  6. Step 6: Therefore \( [2] = \{-4, -2, 0, 2, 4\} \).

Final Answer

R is an equivalence relation, and the equivalence class \( [2] = \{-4, -2, 0, 2, 4\} \).

Common Mistake

A common mistake is including odd numbers in \( [2] \). Since \( 2 \) is even, \( 2 + x \) is even only when \( x \) is even, so odd elements like \( -3, -1, 1, 3 \) do NOT belong to \( [2] \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Verify Reflexivity: Pick any element \( a \in A \) and check whether \( (a, a) \in R \). We compute \( a + a = 2a \), which is clearly divisible by 2 for every integer \( a \). Therefore \( (a, a) \in R \) for all \( a \in A \). — Reason: Reflexivity requires every element to be related to itself, and since \( 2a \) is always even, this condition holds universally.
  2. Step 2: Verify Symmetry: Assume \( (a, b) \in R \), meaning \( a + b \) is divisible by 2. We need to show \( (b, a) \in R \), i.e. that \( b + a \) is also divisible by 2. Since addition is commutative, \( b + a = a + b \), so \( b + a \) is divisible by 2 as well. Hence \( (b, a) \in R \). — Reason: Symmetry demands that the relation works in both directions; commutativity of addition makes this automatic here.
  3. Step 3: Verify Transitivity: Assume \( (a, b) \in R \) and \( (b, c) \in R \). This means \( a + b \) is even and \( b + c \) is even. Add the two quantities: \[ (a + b) + (b + c) = a + 2b + c \] Since both \( (a+b) \) and \( (b+c) \) are even, their sum is even, so \( a + 2b + c \) is even. Subtracting the even number \( 2b \) gives \( a + c \), which must also be even. Therefore \( (a, c) \in R \). — Reason: Transitivity requires the chain \( a \to b \to c \) to imply \( a \to c \); combining and simplifying the two divisibility conditions achieves this.
  4. Step 4: Conclude R is an Equivalence Relation: Because R has been shown to be reflexive (Step 1), symmetric (Step 2), and transitive (Step 3), all three required conditions are met. — Reason: All three properties together are exactly the definition of an equivalence relation, so R qualifies as one.
  5. Step 5: Identify the Set A and Find the Equivalence Class [2]: The set is \( A = \{-4, -3, -2, -1, 0, 1, 2, 3, 4\} \). The equivalence class \( [2] \) consists of every \( x \in A \) such that \( 2 + x \) is divisible by 2, i.e. \( x \) must have the same parity as 2 (both even). The even integers in \( A \) are \( -4, -2, 0, 2, 4 \). — Reason: Two integers sum to an even number precisely when they share the same parity, so we collect all even elements of \( A \).
  6. Step 6: Confirm Each Element Belongs to [2]: Check each candidate: \( 2 + (-4) = -2 \) (even), \( 2 + (-2) = 0 \) (even), \( 2 + 0 = 2 \) (even), \( 2 + 2 = 4 \) (even), \( 2 + 4 = 6 \) (even). All five values are divisible by 2, confirming every element belongs to \( [2] \). The odd elements of \( A \) each give an odd sum with 2, so none of them belong to \( [2] \). — Reason: Direct verification ensures no element is incorrectly included or excluded from the equivalence class.

Final Answer

R is an equivalence relation, and the equivalence class \( [2] = \{-4, -2, 0, 2, 4\} \).

Common Mistake

One common mistake: students check transitivity by testing only a few specific pairs rather than proving it for arbitrary \( a, b, c \in A \); this is insufficient — transitivity must be established for all possible triples satisfying the hypothesis.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexive: For any \( a \in A \): \( a + a = 2a \), so \( 2 \mid (a + a) \). Thus \( (a, a) \in R \). R is reflexive.
  2. Symmetric: \( (a, b) \in R \Rightarrow 2 \mid (a + b) \Rightarrow 2 \mid (b + a) \Rightarrow (b, a) \in R \). R is symmetric.
  3. Transitive: \( (a,b) \in R \) and \( (b,c) \in R \Rightarrow 2 \mid (a+b) \) and \( 2 \mid (b+c) \Rightarrow 2 \mid \left[(a+b)+(b+c)\right] = (a+c)+2b \Rightarrow 2 \mid (a+c) \Rightarrow (a,c) \in R \). R is transitive.
  4. Equivalence Class [2]: \( [2] = \{ x \in A : 2 \mid (2 + x) \} = \{-4, -2, 0, 2, 4\} \)

Answer: R is an equivalence relation, and the equivalence class \( [2] = \{-4, -2, 0, 2, 4\} \).

➕ More Examples

More Examples

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

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5\} \) and a relation R on A be 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

  1. Step 1: State the Relation: We have \( A = \{-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5\} \) and \( R = \{(x, y) : 3 \mid (x - y)\} \), meaning \( x - y \) is an integer divisible by 3.
  2. Step 2: Check Reflexivity: For any \( a \in A \), consider \( a - a = 0 \). Since \( 0 = 3 \times 0 \), it is divisible by 3. Therefore \( (a, a) \in R \) for all \( a \in A \), so R is reflexive.
  3. Step 3: Check Symmetry: Let \( (a, b) \in R \). Then \( a - b \) is divisible by 3, so \( a - b = 3k \) for some integer \( k \). Then \( b - a = -3k = 3(-k) \), which is also divisible by 3. Therefore \( (b, a) \in R \), so R is symmetric.
  4. Step 4: Check 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 these: \( a - c = (a - b) + (b - c) = 3k + 3m = 3(k + m) \), which is divisible by 3. Therefore \( (a, c) \in R \), so 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 the Equivalence Class [1]: The equivalence class \( [1] \) consists of all elements \( x \in A \) such that \( (x, 1) \in R \), i.e., \( x - 1 \) is divisible by 3. We check each element of A: \( -5 - 1 = -6 = 3 \times (-2) \) ✓, \( -4 - 1 = -5 \) ✗, \( -3 - 1 = -4 \) ✗, \( -2 - 1 = -3 = 3 \times (-1) \) ✓, \( -1 - 1 = -2 \) ✗, \( 0 - 1 = -1 \) ✗, \( 1 - 1 = 0 = 3 \times 0 \) ✓, \( 2 - 1 = 1 \) ✗, \( 3 - 1 = 2 \) ✗, \( 4 - 1 = 3 = 3 \times 1 \) ✓, \( 5 - 1 = 4 \) ✗. Therefore the equivalence class is \( [1] = \{-5, -2, 1, 4\} \).

Answer: R is an equivalence relation, and the equivalence class \( [1] = \{-5, -2, 1, 4\} \).

Everything you get with Solver7

More questions in Relations and Functions