A relation R is defined on Z, the set of integers, as \(R=\{(x, y) : |x – y| \) is divisible by a prime number \(‘p’, x, y \in Z\}\) check whether R is an equivalence relation or not.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine sorting all integers into groups based on a special rule involving a prime number \( p \). Two numbers belong together if their difference is a multiple of \( p \). Every number is in its own group because its difference with itself is zero. If number \( a \) belongs with \( b \), then \( b \) belongs with \( a \) too, just like two friends always recognise each other. Also, if \( a \) matches \( b \) and \( b \) matches \( c \), then \( a \) must match \( c \). These three friendly rules make the relation an equivalence relation.
Answer: The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).
A relation \( R \) on a set is called an equivalence relation if it satisfies three properties: it must be reflexive (every element is related to itself), symmetric (if \( a \) is related to \( b \), then \( b \) is related to \( a \)), and transitive (if \( a \) is related to \( b \) and \( b \) is related to \( c \), then \( a \) is related to \( c \)). Here the relation is \( R = \{(x, y) : |x - y| \text{ is divisible by a prime } p,\ x, y \in Z\} \). We must test all three properties. A key idea is that if \( p \) divides \( |a| \) and \( p \) divides \( |b| \), then \( p \) divides their sum. We treat \( 0 \) as divisible by any prime since \( 0 = p \times 0 \).
R is an equivalence relation if it is: Reflexive: \( (x,x) \in R \) for all \( x \). Symmetric: \( (x,y) \in R \Rightarrow (y,x) \in R \). Transitive: \( (x,y) \in R \) and \( (y,z) \in R \Rightarrow (x,z) \in R \).
The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).
A common mistake is thinking R fails reflexivity because \( |x - x| = 0 \) and assuming \( 0 \) is not divisible by \( p \). In fact \( 0 \) is divisible by every prime since \( 0 = p \times 0 \), so R is indeed reflexive.
The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).
One common mistake: Students often forget to verify all three properties and stop after checking only reflexivity and symmetry, thereby missing the transitivity step which is essential for the conclusion.
Answer: The relation R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( Z \).
Question: A relation R is defined on \( \mathbb{Z} \), the set of all integers, as \( R = \{(x, y) : x - y \text{ is an even integer}, \, x, y \in \mathbb{Z}\} \). Check whether R is an equivalence relation.
Solution: We check the three properties of an equivalence relation. Step 1 — Reflexivity: For any \( x \in \mathbb{Z} \), we compute \( x - x = 0 \). Since 0 is an even integer, \( (x, x) \in R \) for all \( x \in \mathbb{Z} \). Hence R is reflexive. Step 2 — Symmetry: Let \( (x, y) \in R \). Then \( x - y \) is an even integer, so \( x - y = 2k \) for some \( k \in \mathbb{Z} \). Now, \( y - x = -(x - y) = -2k = 2(-k) \). Since \( -k \in \mathbb{Z} \), \( y - x \) is also even. Therefore \( (y, x) \in R \). Hence R is symmetric. Step 3 — Transitivity: Let \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y = 2m \) and \( y - z = 2n \) for some \( m, n \in \mathbb{Z} \). Adding these: \( x - z = (x - y) + (y - z) = 2m + 2n = 2(m + n) \). Since \( m + n \in \mathbb{Z} \), \( x - z \) is even, so \( (x, z) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{Z} \).
Answer: R is an equivalence relation on \( \mathbb{Z} \).
Question: A relation R is defined on \( \mathbb{N} \), the set of natural numbers, as \( R = \{(a, b) : 3 \mid (a^2 - b^2), \, a, b \in \mathbb{N}\} \), where \( 3 \mid (a^2 - b^2) \) means 3 divides \( a^2 - b^2 \). Check whether R is an equivalence relation.
Solution: We check the three properties of an equivalence relation. Step 1 — Reflexivity: For any \( a \in \mathbb{N} \), \( a^2 - a^2 = 0 \). Since \( 3 \mid 0 \) (as \( 0 = 3 \times 0 \)), we have \( (a, a) \in R \). Hence R is reflexive. Step 2 — Symmetry: Let \( (a, b) \in R \). Then \( 3 \mid (a^2 - b^2) \), so \( a^2 - b^2 = 3k \) for some \( k \in \mathbb{Z} \). Now, \( b^2 - a^2 = -(a^2 - b^2) = -3k = 3(-k) \). Since \( -k \in \mathbb{Z} \), we get \( 3 \mid (b^2 - a^2) \), so \( (b, a) \in R \). Hence R is symmetric. Step 3 — Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a^2 - b^2 = 3m \) and \( b^2 - c^2 = 3n \) for some \( m, n \in \mathbb{Z} \). Adding: \( a^2 - c^2 = (a^2 - b^2) + (b^2 - c^2) = 3m + 3n = 3(m + n) \). Since \( m + n \in \mathbb{Z} \), we get \( 3 \mid (a^2 - c^2) \), so \( (a, c) \in R \). Hence R is transitive. Conclusion: Since R is reflexive, symmetric, and transitive, R is an equivalence relation on \( \mathbb{N} \).
Answer: R is an equivalence relation on \( \mathbb{N} \).
Question: A relation R is defined on the set of natural numbers \( \mathbb{N} \) as \( R = \{(a, b) : 3 \mid (a^2 - b^2),\; a, b \in \mathbb{N}\} \), where \( 3 \mid (a^2 - b^2) \) means 3 divides \( a^2 - b^2 \). Check whether R is an equivalence relation or not.
Answer: R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation on \( \mathbb{N} \). However, unlike the original relation (which holds for any prime p and partitions \( \mathbb{Z} \) into p classes), this relation partitions \( \mathbb{N} \) into exactly 2 equivalence classes: multiples of 3, and non-multiples of 3, because \( a^2 - b^2 \) is divisible by 3 if and only if \( a \) and \( b \) have the same residue class modulo 3 (residue 0 or residue 1/2).