SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q20

Let \(X=\{1, 2, 3, 4, 5, 6, 7, 8, 9\}.\) Let \(R_1\) be a relation in \(X\) given by \(R_1 =\{(x,y):x-y\) is divisible by \(3\}\) and \(R_2\) be another relation on \(X\) given by \(R_2=\{(x,y):\{x,y\}\subset \{1, 4, 7\}\}\) or \(\{x,y\}\subset \{2, 5, 8\}\) or \(\{x,y\}\subset \{3, 6, 9\}\}.\) Show that \(R_1=R_2.\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting numbers into three buckets based on what is left over after dividing by 3. Numbers like 1, 4, and 7 all land in the same bucket. Numbers 2, 5, and 8 share another bucket. Numbers 3, 6, and 9 fill the last bucket. Two relations are equal when every pair in one is also in the other. Both relations here pair numbers from the same bucket, so they are secretly the same rule written two different ways.

Answer: By showing \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\), both relations consist of exactly the pairs whose entries share the same remainder modulo \(3\). Hence \(R_1 = R_2\).

📖 Showing Two Relations Are Equal: R1 = R2

Detailed Explanation

A relation on a set \(X\) is just a set of ordered pairs \((x,y)\) taken from \(X \times X\). Two relations \(R_1\) and \(R_2\) are equal when they contain exactly the same ordered pairs, that is \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\). Here \(R_1\) groups elements by the condition that \(x - y\) is divisible by \(3\). Two numbers differ by a multiple of \(3\) exactly when they leave the same remainder on division by \(3\). The remainder classes of \(X = \{1,2,3,4,5,6,7,8,9\}\) are: remainder \(1 \to \{1,4,7\}\), remainder \(2 \to \{2,5,8\}\), remainder \(0 \to \{3,6,9\}\). This is precisely how \(R_2\) groups the elements, so the two relations must coincide.

Formula Used

\(R_1 = R_2 \iff R_1 \subseteq R_2 \text{ and } R_2 \subseteq R_1\); and \(3 \mid (x-y) \iff x, y\) leave the same remainder on division by \(3\).

Solution

  1. Step 1: Understand the meaning of divisibility by 3. For \((x,y) \in R_1\) we need \(x - y\) to be divisible by \(3\). This happens exactly when \(x\) and \(y\) leave the same remainder when divided by \(3\), because if \(x = 3a + r\) and \(y = 3b + r\) with the same remainder \(r\), then \(x - y = 3(a - b)\), a multiple of \(3\).
  2. Step 2: Split \(X\) into remainder classes. Dividing each element of \(X = \{1,2,3,4,5,6,7,8,9\}\) by \(3\): elements with remainder \(1\) are \(\{1,4,7\}\), elements with remainder \(2\) are \(\{2,5,8\}\), and elements with remainder \(0\) are \(\{3,6,9\}\). These are exactly the three subsets used to define \(R_2\).
  3. Step 3: Prove \(R_1 \subseteq R_2\). Take any \((x,y) \in R_1\), so \(3 \mid (x-y)\). Then \(x\) and \(y\) have the same remainder, so both lie in the same one of the sets \(\{1,4,7\}\), \(\{2,5,8\}\), or \(\{3,6,9\}\). Hence \(\{x,y\}\) is a subset of one of these sets, which means \((x,y) \in R_2\).
  4. Step 4: Prove \(R_2 \subseteq R_1\). Take any \((x,y) \in R_2\). Then \(\{x,y\}\) is contained in one of \(\{1,4,7\}\), \(\{2,5,8\}\), or \(\{3,6,9\}\), so \(x\) and \(y\) share the same remainder on division by \(3\). Therefore \(x - y\) is a multiple of \(3\), giving \(3 \mid (x-y)\), so \((x,y) \in R_1\).
  5. Step 5: Conclude equality. Since \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\), both relations contain exactly the same ordered pairs. Therefore \(R_1 = R_2\).

Final Answer

By showing \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\), both relations consist of exactly the pairs whose entries share the same remainder modulo \(3\). Hence \(R_1 = R_2\).

Common Mistake

A common mistake is to check only a few sample pairs and claim equality, instead of proving both inclusions \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\). Equality of relations requires showing every pair of one belongs to the other, not just verifying a handful of examples.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Recall what each relation means. The relation \(R_1\) on \(X = \\{1,2,3,4,5,6,7,8,9\\}\) is defined by \(R_1 = \\{(x,y) : 3 \mid (x - y)\\}\). The relation \(R_2\) groups elements into three clusters: \(\\{1,4,7\\}\), \(\\{2,5,8\\}\), and \(\\{3,6,9\\}\), so \(R_2\) contains exactly those pairs \((x,y)\) where both \(x\) and \(y\) belong to the same cluster. — Reason: Clearly understanding the definitions of both relations is the essential starting point before any comparison can be made.
  2. Step 2: Connect divisibility by 3 to remainders. Write any element as \(x = 3a + r\) and another as \(y = 3b + r\) where \(r\) is the common remainder. Then \[x - y = 3a + r - (3b + r) = 3(a - b)\] which is clearly divisible by 3. Conversely, if \(3 \mid (x - y)\), then \(x\) and \(y\) must share the same remainder modulo 3. — Reason: This equivalence is the bridge between the algebraic definition of \(R_1\) and the set-based definition of \(R_2\).
  3. Step 3: Partition \(X\) into remainder classes. Divide each element of \(X = \\{1,2,3,4,5,6,7,8,9\\}\) by 3 and record the remainder: elements giving remainder 1 are \(\\{1,4,7\\}\), elements giving remainder 2 are \(\\{2,5,8\\}\), and elements giving remainder 0 are \(\\{3,6,9\\}\). — Reason: Identifying these classes makes it visually clear that the partition used in \(R_2\) is identical to the partition generated by the divisibility condition in \(R_1\).
  4. Step 4: Show \(R_1 \subseteq R_2\). Take any arbitrary pair \((x, y) \in R_1\), so \(3 \mid (x - y)\). By Step 2, \(x\) and \(y\) share the same remainder modulo 3, meaning they fall in the same cluster of \(R_2\). Therefore \((x, y) \in R_2\). — Reason: Proving containment in one direction is the first half of establishing equality of two relations.
  5. Step 5: Show \(R_2 \subseteq R_1\). Take any arbitrary pair \((x, y) \in R_2\), so \(x\) and \(y\) belong to the same cluster, meaning they share the same remainder modulo 3. By Step 2, \(3 \mid (x - y)\), so \((x, y) \in R_1\). — Reason: Proving containment in the reverse direction completes the double-inclusion argument required for equality.
  6. Step 6: Conclude equality. Since \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\), we conclude \(R_1 = R_2\). Both relations consist of exactly those ordered pairs \((x, y)\) from \(X \times X\) in which \(x\) and \(y\) belong to the same remainder class modulo 3. — Reason: The definition of set equality requires mutual inclusion; having proved both directions, equality follows immediately.

Final Answer

By showing \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\), both relations consist of exactly the pairs whose entries share the same remainder modulo \(3\). Hence \(R_1 = R_2\).

Common Mistake

One common mistake: Students often try to list all elements of both relations explicitly and match them, which is tedious and error-prone; the cleaner approach is the double-inclusion proof using the remainder equivalence, which works generally without exhaustive listing.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Key fact: \(3 \mid (x - y) \iff x\) and \(y\) share the same remainder mod \(3\).
  2. Step 2: Remainder classes of \(X = \\{1,2,3,4,5,6,7,8,9\\}\): remainder \(0 \to \\{3,6,9\\}\), remainder \(1 \to \\{1,4,7\\}\), remainder \(2 \to \\{2,5,8\\}\).
  3. Step 3: \((x,y) \in R_1 \Rightarrow 3 \mid (x-y) \Rightarrow x,y\) in same remainder class \(\Rightarrow (x,y) \in R_2\); so \(R_1 \subseteq R_2\). Conversely, \((x,y) \in R_2 \Rightarrow x,y\) in same remainder class \(\Rightarrow 3 \mid (x-y) \Rightarrow (x,y) \in R_1\); so \(R_2 \subseteq R_1\).

Answer: By showing \(R_1 \subseteq R_2\) and \(R_2 \subseteq R_1\), both relations consist of exactly the pairs whose entries share the same remainder modulo \(3\). Hence \(R_1 = R_2\).

➕ More Examples

More Examples

Example 1

Question: Let \( X = \{1, 2, 3, 4, 5, 6, 7, 8\} \). Let \( R_1 \) be a relation on \( X \) defined by \( R_1 = \{(x, y) : x - y \text{ is divisible by } 4\} \) and let \( R_2 \) be another relation on \( X \) defined by \( R_2 = \{(x, y) : \{x, y\} \subseteq \{1, 5\} \text{ or } \{x, y\} \subseteq \{2, 6\} \text{ or } \{x, y\} \subseteq \{3, 7\} \text{ or } \{x, y\} \subseteq \{4, 8\}\} \). Show that \( R_1 = R_2 \).

Solution: We will show \( R_1 \subseteq R_2 \) and \( R_2 \subseteq R_1 \). First, note that divisibility by 4 partitions \( X = \{1,2,3,4,5,6,7,8\} \) into residue classes modulo 4. The residue classes are: Residue 1: \( \{1, 5\} \) (since \( 1 \equiv 1 \pmod{4} \) and \( 5 \equiv 1 \pmod{4} \)) Residue 2: \( \{2, 6\} \) (since \( 2 \equiv 2 \pmod{4} \) and \( 6 \equiv 2 \pmod{4} \)) Residue 3: \( \{3, 7\} \) (since \( 3 \equiv 3 \pmod{4} \) and \( 7 \equiv 3 \pmod{4} \)) Residue 0: \( \{4, 8\} \) (since \( 4 \equiv 0 \pmod{4} \) and \( 8 \equiv 0 \pmod{4} \)) Proof that \( R_1 \subseteq R_2 \): Let \( (x, y) \in R_1 \). Then \( 4 \mid (x - y) \), which means \( x \equiv y \pmod{4} \). So \( x \) and \( y \) belong to the same residue class modulo 4. Examining the four classes above: If \( x \equiv y \equiv 1 \pmod{4} \), then \( \{x, y\} \subseteq \{1, 5\} \), so \( (x, y) \in R_2 \). If \( x \equiv y \equiv 2 \pmod{4} \), then \( \{x, y\} \subseteq \{2, 6\} \), so \( (x, y) \in R_2 \). If \( x \equiv y \equiv 3 \pmod{4} \), then \( \{x, y\} \subseteq \{3, 7\} \), so \( (x, y) \in R_2 \). If \( x \equiv y \equiv 0 \pmod{4} \), then \( \{x, y\} \subseteq \{4, 8\} \), so \( (x, y) \in R_2 \). In every case \( (x, y) \in R_2 \), hence \( R_1 \subseteq R_2 \). Proof that \( R_2 \subseteq R_1 \): Let \( (x, y) \in R_2 \). Then \( \{x, y\} \) is contained in one of the four subsets listed in the definition of \( R_2 \). Case 1: \( \{x, y\} \subseteq \{1, 5\} \). Then \( x, y \in \{1, 5\} \), so \( x - y \in \{0, 4, -4\} \), each divisible by 4. Hence \( (x, y) \in R_1 \). Case 2: \( \{x, y\} \subseteq \{2, 6\} \). Then \( x - y \in \{0, 4, -4\} \), divisible by 4. Hence \( (x, y) \in R_1 \). Case 3: \( \{x, y\} \subseteq \{3, 7\} \). Then \( x - y \in \{0, 4, -4\} \), divisible by 4. Hence \( (x, y) \in R_1 \). Case 4: \( \{x, y\} \subseteq \{4, 8\} \). Then \( x - y \in \{0, 4, -4\} \), divisible by 4. Hence \( (x, y) \in R_1 \). In every case \( (x, y) \in R_1 \), hence \( R_2 \subseteq R_1 \). Since \( R_1 \subseteq R_2 \) and \( R_2 \subseteq R_1 \), we conclude \( R_1 = R_2 \).

Answer: R1 = R2, since both relations group elements of X into the same four equivalence classes: {1,5}, {2,6}, {3,7}, and {4,8}, determined by congruence modulo 4.

Example 2

Question: Let \( Y = \{1, 2, 3, 4, 5, 6\} \). Define a relation \( R_1 \) on \( Y \) by \( R_1 = \{(x, y) : x - y \text{ is divisible by } 2\} \) and another relation \( R_2 \) on \( Y \) by \( R_2 = \{(x, y) : \{x, y\} \subseteq \{1, 3, 5\} \text{ or } \{x, y\} \subseteq \{2, 4, 6\}\} \). Show that \( R_1 = R_2 \).

Solution: We will show \( R_1 \subseteq R_2 \) and \( R_2 \subseteq R_1 \). Observe that divisibility by 2 partitions \( Y = \{1, 2, 3, 4, 5, 6\} \) into two residue classes modulo 2: Odd (residue 1): \( \{1, 3, 5\} \) Even (residue 0): \( \{2, 4, 6\} \) Proof that \( R_1 \subseteq R_2 \): Let \( (x, y) \in R_1 \). Then \( 2 \mid (x - y) \), so \( x \equiv y \pmod{2} \). This means \( x \) and \( y \) have the same parity. If both are odd, then \( x, y \in \{1, 3, 5\} \), so \( \{x, y\} \subseteq \{1, 3, 5\} \) and \( (x, y) \in R_2 \). If both are even, then \( x, y \in \{2, 4, 6\} \), so \( \{x, y\} \subseteq \{2, 4, 6\} \) and \( (x, y) \in R_2 \). In both cases \( (x, y) \in R_2 \), so \( R_1 \subseteq R_2 \). Proof that \( R_2 \subseteq R_1 \): Let \( (x, y) \in R_2 \). Then \( \{x, y\} \) is contained in one of the two subsets listed. Case 1: \( \{x, y\} \subseteq \{1, 3, 5\} \). Both \( x \) and \( y \) are odd, so \( x - y \) is even, i.e., \( 2 \mid (x - y) \). For example, the possible differences are \( 1-1=0, 1-3=-2, 1-5=-4, 3-1=2, \) etc., all divisible by 2. Hence \( (x, y) \in R_1 \). Case 2: \( \{x, y\} \subseteq \{2, 4, 6\} \). Both \( x \) and \( y \) are even, so \( x - y \) is even. For example, \( 2-4=-2, 4-6=-2, 2-6=-4 \), all divisible by 2. Hence \( (x, y) \in R_1 \). In both cases \( (x, y) \in R_1 \), so \( R_2 \subseteq R_1 \). Since \( R_1 \subseteq R_2 \) and \( R_2 \subseteq R_1 \), we conclude \( R_1 = R_2 \).

Answer: R1 = R2, since both relations partition Y into exactly the same two equivalence classes: the odd numbers {1,3,5} and the even numbers {2,4,6}, corresponding to congruence modulo 2.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( X = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\} \). Let \( R_1 \) be a relation on \( X \) defined by \( R_1 = \{(x, y) : x - y \text{ is divisible by } 4\} \), and let \( R_2 \) be another relation on \( X \) defined by \( R_2 = \{(x, y) : \{x, y\} \subseteq \{1, 5, 9\} \text{ or } \{x, y\} \subseteq \{2, 6, 10\} \text{ or } \{x, y\} \subseteq \{3, 7, 11\} \text{ or } \{x, y\} \subseteq \{4, 8, 12\}\} \). Show that \( R_1 = R_2 \).

Solution

  1. Step 1: Understand the structure of R₁: \( R_1 = \{(x, y) : 4 \mid (x - y)\} \). This means \( x \) and \( y \) leave the same remainder when divided by 4. The possible remainders modulo 4 are 0, 1, 2, and 3, giving four residue classes within \( X = \{1, 2, \ldots, 12\} \): Remainder 1: \( \{1, 5, 9\} \) Remainder 2: \( \{2, 6, 10\} \) Remainder 3: \( \{3, 7, 11\} \) Remainder 0: \( \{4, 8, 12\} \)
  2. Step 2: Understand the structure of R₂: \( R_2 \) collects all pairs \( (x, y) \) such that both \( x \) and \( y \) belong to one of the four groups \( \{1,5,9\} \), \( \{2,6,10\} \), \( \{3,7,11\} \), or \( \{4,8,12\} \). Notice these four groups are exactly the four residue classes modulo 4 listed in Step 1.
  3. Step 3: Prove R₁ ⊆ R₂: Let \( (x, y) \in R_1 \). Then \( 4 \mid (x - y) \), so \( x \equiv y \pmod{4} \). This means \( x \) and \( y \) belong to the same residue class modulo 4. The residue classes within \( X \) are precisely \( \{1,5,9\} \), \( \{2,6,10\} \), \( \{3,7,11\} \), and \( \{4,8,12\} \). Therefore \( \{x, y\} \subseteq \{1,5,9\} \) or \( \{x, y\} \subseteq \{2,6,10\} \) or \( \{x, y\} \subseteq \{3,7,11\} \) or \( \{x, y\} \subseteq \{4,8,12\} \), which means \( (x, y) \in R_2 \). Since \( (x, y) \) was arbitrary, \( R_1 \subseteq R_2 \).
  4. Step 4: Prove R₂ ⊆ R₁: Let \( (x, y) \in R_2 \). Then \( x \) and \( y \) both belong to one of the four groups. Consider each case: Case 1: \( x, y \in \{1, 5, 9\} \). Each element leaves remainder 1 on division by 4, so \( x - y \equiv 0 \pmod{4} \), i.e., \( 4 \mid (x - y) \). Case 2: \( x, y \in \{2, 6, 10\} \). Each leaves remainder 2, so \( 4 \mid (x - y) \). Case 3: \( x, y \in \{3, 7, 11\} \). Each leaves remainder 3, so \( 4 \mid (x - y) \). Case 4: \( x, y \in \{4, 8, 12\} \). Each leaves remainder 0, so \( 4 \mid (x - y) \). In every case \( (x, y) \in R_1 \), so \( R_2 \subseteq R_1 \).
  5. Step 5: Conclude R₁ = R₂: Since \( R_1 \subseteq R_2 \) and \( R_2 \subseteq R_1 \), we conclude \( R_1 = R_2 \).

Answer: By proving \( R_1 \subseteq R_2 \) and \( R_2 \subseteq R_1 \), we show that both relations consist of exactly the pairs whose elements share the same remainder modulo 4 — the four residue classes being \( \{1,5,9\} \), \( \{2,6,10\} \), \( \{3,7,11\} \), and \( \{4,8,12\} \). Hence \( R_1 = R_2 \).

Everything you get with Solver7

More questions in Relations and Functions