SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q6

Let R be the relation defined in the set \(A=\{1, 2, 3, 4, 5, 6, 7\}\) by \(R=\{(a,b):\)both a and b are either odd or even \(\}. \) Show that R is an equivalence relation. Further, show that all the elements of the subset \(\{1, 3, 5, 7\}\) are related to each other and all the elements of the subset \(\{2, 4, 6\}\) are related to each other, but no element of the subset \(\{1, 3, 5, 7\}\) is related to any element of the subset \(\{2, 4, 6\}.\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sorting numbers into two groups: odd and even. Numbers in the same group are 'friends' with each other. Every number is its own friend too. If number A is friends with B, then B is also friends with A. And if A is friends with B and B is friends with C, then A and C are friends too. The odd numbers \( 1, 3, 5, 7 \) form one friend group, and the even numbers \( 2, 4, 6 \) form another. No one from different groups becomes friends.

Answer: \( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation. All elements of \( \{1,3,5,7\} \) are related to one another (all odd), all elements of \( \{2,4,6\} \) are related to one another (all even), but no odd element is related to any even element since they have different parity.

📖 Equivalence Relation on {1,2,3,4,5,6,7} — Detailed Solution

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 every element is related to itself, that is \( (a,a) \in R \) for all \( a \in A \). Symmetric means if \( (a,b) \in R \) then \( (b,a) \in R \). Transitive means if \( (a,b) \in R \) and \( (b,c) \in R \) then \( (a,c) \in R \). Here the relation says two numbers are related if they have the same parity (both odd or both even). Because 'having the same parity' is a natural grouping rule, we expect the odd numbers to form one class and the even numbers to form another. These groups are called equivalence classes, and elements from different classes are never related.

Formula Used

\( R \) is an equivalence relation if and only if \( R \) 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 \).

Solution

  1. Step 1: Understand the relation. We have \( A = \{1,2,3,4,5,6,7\} \) and \( R = \{(a,b) : \text{both } a \text{ and } b \text{ are either odd or even}\} \). So \( (a,b) \in R \) exactly when \( a \) and \( b \) have the same parity. The odd elements are \( 1,3,5,7 \) and the even elements are \( 2,4,6 \).
  2. Step 2 — Reflexive: Take any element \( a \in A \). Clearly \( a \) has the same parity as itself (it is either odd or even). So \( (a,a) \in R \) for every \( a \in A \). Hence \( R \) is reflexive.
  3. Step 3 — Symmetric: Suppose \( (a,b) \in R \). Then \( a \) and \( b \) are both odd or both even. This automatically means \( b \) and \( a \) are both odd or both even, so \( (b,a) \in R \). Hence \( R \) is symmetric.
  4. Step 4 — Transitive: Suppose \( (a,b) \in R \) and \( (b,c) \in R \). Then \( a \) and \( b \) have the same parity, and \( b \) and \( c \) have the same parity. Therefore \( a \) and \( c \) must also have the same parity (they both match \( b \)). So \( (a,c) \in R \). Hence \( R \) is transitive.
  5. Step 5 — Conclusion of equivalence: Since \( R \) is reflexive, symmetric, and transitive, \( R \) is an equivalence relation on \( A \).
  6. Step 6 — Odd elements related to each other: Consider the subset \( \{1,3,5,7\} \). All of these numbers are odd, so any two of them have the same parity. Hence \( (a,b) \in R \) for every pair \( a,b \) chosen from \( \{1,3,5,7\} \). Therefore all elements of \( \{1,3,5,7\} \) are related to each other.
  7. Step 7 — Even elements related to each other: Consider the subset \( \{2,4,6\} \). All of these numbers are even, so any two of them have the same parity. Hence \( (a,b) \in R \) for every pair \( a,b \) chosen from \( \{2,4,6\} \). Therefore all elements of \( \{2,4,6\} \) are related to each other.
  8. Step 8 — No cross relation between the subsets: Now take one element from \( \{1,3,5,7\} \), which is odd, and one element from \( \{2,4,6\} \), which is even. An odd number and an even number never have the same parity, so such a pair does not belong to \( R \). Hence no element of \( \{1,3,5,7\} \) is related to any element of \( \{2,4,6\} \).

Final Answer

\( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation. All elements of \( \{1,3,5,7\} \) are related to one another (all odd), all elements of \( \{2,4,6\} \) are related to one another (all even), but no odd element is related to any even element since they have different parity.

Common Mistake

A common mistake is to only check the relation on a few sample pairs instead of arguing generally, and to forget the reflexive property by assuming symmetry and transitivity are enough. Reflexivity must be checked for every element of the set, not skipped.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and relation. The set is \( A = \{1, 2, 3, 4, 5, 6, 7\} \) and the relation is \( R = \{(a, b) : a \text{ and } b \text{ are both odd or both even}\} \). In other words, \( (a,b) \in R \) precisely when \( a \) and \( b \) share the same parity. The odd members of \( A \) are \( 1, 3, 5, 7 \) and the even members are \( 2, 4, 6 \). — Reason: Clearly stating the relation's rule makes it easier to check each property without confusion.
  2. Step 2: Check Reflexivity. Take any arbitrary element \( a \in A \). Since every number has a fixed parity (either odd or even), \( a \) trivially shares its parity with itself, so \( (a, a) \in R \) for every \( a \in A \). Therefore \( R \) is reflexive. — Reason: Reflexivity requires that every element be related to itself; same-parity with oneself is always true.
  3. Step 3: Check Symmetry. Suppose \( (a, b) \in R \). Then \( a \) and \( b \) have the same parity. But if \( a \) and \( b \) have the same parity, then \( b \) and \( a \) clearly have the same parity too, which means \( (b, a) \in R \). Hence \( R \) is symmetric. — Reason: The phrase 'same parity' is a mutual relationship — if \( a \) matches \( b \), then \( b \) automatically matches \( a \).
  4. Step 4: Check Transitivity. Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a \) and \( b \) have the same parity, and \( b \) and \( c \) have the same parity. Since parity has only two values (odd or even), \( a \) must have the same parity as \( c \), giving \( (a, c) \in R \). Hence \( R \) is transitive. — Reason: If two numbers each match a common middle number in parity, they must match each other, because parity equality is transitive just like numerical equality.
  5. Step 5: Conclude that \( R \) is an equivalence relation. Since \( R \) has been shown to be reflexive, symmetric, and transitive, all three conditions of an equivalence relation are satisfied. — Reason: All three properties together are exactly the definition of an equivalence relation.
  6. Step 6: Identify the equivalence classes. The relation groups elements by parity, producing exactly two classes. The set of odd elements is \( \{1, 3, 5, 7\} \): every pair within this set has the same (odd) parity, so they are all mutually related. The set of even elements is \( \{2, 4, 6\} \): every pair within this set has the same (even) parity, so they are all mutually related. Any pair consisting of one odd and one even element (for example \( (1, 2) \)) has different parity and therefore does NOT belong to \( R \). — Reason: Equivalence classes reveal the partition created by the relation; elements in different classes are never related to each other.

Final Answer

\( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation. All elements of \( \{1,3,5,7\} \) are related to one another (all odd), all elements of \( \{2,4,6\} \) are related to one another (all even), but no odd element is related to any even element since they have different parity.

Common Mistake

One common mistake: Students often verify only a few specific pairs (e.g. checking that \( (1,3) \in R \) and \( (3,1) \in R \)) instead of arguing generally for all \( a, b \in A \), which leads to an incomplete proof of symmetry or transitivity.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Reflexive: For any \( a \in A \), \( a \) and \( a \) share the same parity, so \( (a,a) \in R \). Hence \( R \) is reflexive.
  2. Step 2: Symmetric: If \( (a,b) \in R \) then \( a,b \) have the same parity, which immediately gives \( b,a \) the same parity, so \( (b,a) \in R \). Hence \( R \) is symmetric.
  3. Step 3: Transitive: If \( (a,b) \in R \) and \( (b,c) \in R \) then \( a,b \) share parity and \( b,c \) share parity, so \( a,c \) share parity, giving \( (a,c) \in R \). Hence \( R \) is transitive.
  4. Step 4: Equivalence Classes: Odd subset: \( \{1,3,5,7\} \). Even subset: \( \{2,4,6\} \). No element from one subset is related to any element of the other.

Answer: \( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation. All elements of \( \{1,3,5,7\} \) are related to one another (all odd), all elements of \( \{2,4,6\} \) are related to one another (all even), but no odd element is related to any even element since they have different parity.

➕ More Examples

More Examples

Example 1

Question: Let \ \( A = \{1, 2, 3, 4, 5, 6, 8, 9\} \). Define a relation R on A by \ \( R = \{(a, b) : a - b \text{ is divisible by } 3\} \). Show that R is an equivalence relation. Further, show that the elements of \ \( \{1, 4, 7\} \cap A = \{1, 4\} \), the elements of \ \( \{2, 5, 8\} \cap A = \{2, 5, 8\} \), and the elements of \ \( \{3, 6, 9\} \cap A = \{3, 6, 9\} \) are each mutually related within their own group, but no element from one group is related to any element from a different group.

Solution: We verify the three properties of an equivalence relation. Reflexivity: For any \ \( a \in A \), we have \ \( a - a = 0 \), and 0 is divisible by 3. Hence \ \( (a, a) \in R \) for all \ \( a \in A \). So R is reflexive. Symmetry: Let \ \( (a, b) \in R \). Then \ \( 3 \mid (a - b) \), which means \ \( a - b = 3k \) for some integer \ \( k \). Then \ \( b - a = 3(-k) \), so \ \( 3 \mid (b - a) \), giving \ \( (b, a) \in R \). So R is symmetric. Transitivity: Let \ \( (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 \). So R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. Now we identify the equivalence classes by remainder when divided by 3. Class 1 (remainder 1): \ \( \{1, 4\} \) — For any two elements \ \( a, b \) in this set, \ \( a - b \) is divisible by 3 (e.g., \ \( 4 - 1 = 3 \)), so all elements are mutually related. Class 2 (remainder 2): \ \( \{2, 5, 8\} \) — For any two elements \ \( a, b \) in this set, \ \( a - b \) is divisible by 3 (e.g., \ \( 8 - 2 = 6 \), \ \( 5 - 2 = 3 \)), so all elements are mutually related. Class 3 (remainder 0): \ \( \{3, 6, 9\} \) — For any two elements \ \( a, b \) in this set, \ \( a - b \) is divisible by 3 (e.g., \ \( 6 - 3 = 3 \), \ \( 9 - 3 = 6 \)), so all elements are mutually related. Cross-class check: Take \ \( a = 1 \) (Class 1) and \ \( b = 2 \) (Class 2). Then \ \( a - b = -1 \), which is not divisible by 3, so \ \( (1, 2) \notin R \). In general, if \ \( a \) and \ \( b \) belong to different classes, their remainders on division by 3 differ, so \ \( a - b \) is not divisible by 3, and hence \ \( (a, b) \notin R \). Thus no element of one class is related to any element of a different class.

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

Example 2

Question: Let \ \( B = \{2, 4, 6, 8, 10, 12\} \). Define a relation R on B by \ \( R = \{(a, b) : \frac{a}{b} \text{ or } \frac{b}{a} \text{ is a power of } 2 \text{ (including } 2^0 = 1)\} \). Instead, consider the simpler relation: \ \( R = \{(a, b) : a + b \text{ is divisible by } 4\} \) on the set \ \( B = \{2, 4, 6, 8, 10, 12\} \). Show that R is an equivalence relation and identify the equivalence classes.

Solution: We check the three properties for R defined on \ \( B = \{2, 4, 6, 8, 10, 12\} \) by \ \( (a, b) \in R \) if and only if \ \( 4 \mid (a + b) \). Reflexivity: For any \ \( a \in B \), we need \ \( 4 \mid (a + a) = 2a \). The elements of B are all even, so \ \( a \in \{2, 4, 6, 8, 10, 12\} \). Check: \ \( 2a \in \{4, 8, 12, 16, 20, 24\} \). Each of these is divisible by 4. Hence \ \( (a, a) \in R \) for all \ \( a \in B \). R is reflexive. Symmetry: If \ \( (a, b) \in R \), then \ \( 4 \mid (a + b) \). Since \ \( a + b = b + a \), we also have \ \( 4 \mid (b + a) \), so \ \( (b, a) \in R \). 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: \ \( a + 2b + c = 4(k + m) \), so \ \( a + c = 4(k + m) - 2b \). For \ \( 4 \mid (a + c) \) we need \ \( 4 \mid 2b \), i.e., \ \( 2 \mid b \). Since all elements of B are even, \ \( b \) is even, so \ \( 2b \) is divisible by 4. Hence \ \( 4 \mid (a + c) \) and \ \( (a, c) \in R \). R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on B. Identifying equivalence classes by checking which pairs \ \( (a + b) \) are divisible by 4: For \ \( a = 2 \): \ \( 2 + 2 = 4 \checkmark \), \ \( 2 + 4 = 6 \) (no), \ \( 2 + 6 = 8 \checkmark \), \ \( 2 + 8 = 10 \) (no), \ \( 2 + 10 = 12 \checkmark \), \ \( 2 + 12 = 14 \) (no). So 2 is related to \ \( \{2, 6, 10\} \). For \ \( a = 4 \): \ \( 4 + 4 = 8 \checkmark \), \ \( 4 + 8 = 12 \checkmark \), \ \( 4 + 12 = 16 \checkmark \), others not divisible by 4. So 4 is related to \ \( \{4, 8, 12\} \). Thus the two equivalence classes are \ \( \{2, 6, 10\} \) and \ \( \{4, 8, 12\} \). Within \ \( \{2, 6, 10\} \): \ \( 2+6=8 \), \ \( 2+10=12 \), \ \( 6+10=16 \) — all divisible by 4, so all elements are mutually related. Within \ \( \{4, 8, 12\} \): \ \( 4+8=12 \), \ \( 4+12=16 \), \ \( 8+12=20 \) — all divisible by 4, so all elements are mutually related. Across classes: Take \ \( a = 2 \) and \ \( b = 4 \). Then \ \( a + b = 6 \), which is not divisible by 4, so \ \( (2, 4) \notin R \). In general, if \ \( a \in \{2, 6, 10\} \) and \ \( b \in \{4, 8, 12\} \), then \ \( a \equiv 2 \pmod{4} \) and \ \( b \equiv 0 \pmod{4} \), so \ \( a + b \equiv 2 \pmod{4} \), which is not divisible by 4. Hence no element of \ \( \{2, 6, 10\} \) is related to any element of \ \( \{4, 8, 12\} \).

Answer: R is an equivalence relation. The two equivalence classes are \( \{2, 6, 10\} \) and \( \{4, 8, 12\} \). Elements within each class are mutually related, and no element of one class is related to any element of the other 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) : \text{both } a \text{ and } b \text{ are divisible by } 3, \text{ or neither } a \text{ nor } b \text{ is divisible by } 3\} \). Show that \( R \) is an equivalence relation. Further, show that all elements of the subset \( \{3, 6, 9\} \) are related to each other and all elements of the subset \( \{1, 2, 4, 5, 7, 8\} \) are related to each other, but no element of \( \{3, 6, 9\} \) is related to any element of \( \{1, 2, 4, 5, 7, 8\} \).

Solution

  1. Step 1: Identify the two groups in A: In \( A = \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \), the elements divisible by 3 are \( \{3, 6, 9\} \) and the elements not divisible by 3 are \( \{1, 2, 4, 5, 7, 8\} \). Two elements \( a \) and \( b \) are related under \( R \) if and only if they belong to the same group.
  2. Step 2: Check Reflexivity: For any \( a \in A \), \( a \) and \( a \) are trivially either both divisible by 3 or both not divisible by 3. Hence \( (a, a) \in R \) for all \( a \in A \). Therefore \( R \) is reflexive.
  3. Step 3: Check Symmetry: Suppose \( (a, b) \in R \). Then \( a \) and \( b \) are in the same group (both divisible by 3, or both not). This condition is symmetric in \( a \) and \( b \), so \( (b, a) \in R \). Therefore \( R \) is symmetric.
  4. Step 4: Check Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a \) and \( b \) are in the same group, and \( b \) and \( c \) are in the same group. Hence \( a \) and \( c \) are in the same group, so \( (a, c) \in R \). Therefore \( 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: Elements of {3, 6, 9} are mutually related: Every element of \( \{3, 6, 9\} \) is divisible by 3. So for any \( a, b \in \{3, 6, 9\} \), both \( a \) and \( b \) are divisible by 3, giving \( (a, b) \in R \). Explicitly: \( (3,6), (3,9), (6,9) \in R \) (and their reverses). Hence all elements of \( \{3, 6, 9\} \) are related to each other.
  7. Step 7: Elements of {1, 2, 4, 5, 7, 8} are mutually related: No element of \( \{1, 2, 4, 5, 7, 8\} \) is divisible by 3. So for any \( a, b \in \{1, 2, 4, 5, 7, 8\} \), neither \( a \) nor \( b \) is divisible by 3, giving \( (a, b) \in R \). Hence all elements of \( \{1, 2, 4, 5, 7, 8\} \) are related to each other.
  8. Step 8: No cross-group relation exists: Take any \( a \in \{3, 6, 9\} \) and any \( b \in \{1, 2, 4, 5, 7, 8\} \). Then \( a \) is divisible by 3 but \( b \) is not. They do not belong to the same group, so \( (a, b) \notin R \). Thus no element of \( \{3, 6, 9\} \) is related to any element of \( \{1, 2, 4, 5, 7, 8\} \).

Answer: \( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation on \( A \). The set \( A \) is partitioned into two equivalence classes: \( \{3, 6, 9\} \) (multiples of 3) and \( \{1, 2, 4, 5, 7, 8\} \) (non-multiples of 3). All elements within each class are mutually related, and no element of \( \{3, 6, 9\} \) is related to any element of \( \{1, 2, 4, 5, 7, 8\} \).

Everything you get with Solver7

More questions in Relations and Functions