Let \(n\) be a fixed positive integer. A relation \(R\) is defined in set \(Z\) such that \(R=\{(x,y):(x-y)\) is divisible by \(n,\ x,y\in Z\}\). Determine if \(R\) is an equivalence relation.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine you sort all whole numbers into groups where every two numbers in the same group have a difference that a chosen number divides evenly. Numbers in the same group always pair with themselves, always pair back the other way, and always connect through a third member. Think of it like friends sharing the same locker row — every student belongs to their own row, the friendship goes both ways, and connected students stay connected through a common friend. Because these three friendly rules always hold, this sorting rule is called an equivalence relation.
Answer: The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.
A relation \( R \) on a set is called an equivalence relation if it satisfies three properties: reflexive (every element is related to itself), symmetric (if \( x \) is related to \( y \), then \( y \) is related to \( x \)), and transitive (if \( x \) is related to \( y \) and \( y \) is related to \( z \), then \( x \) is related to \( z \)). Here the relation is defined on the set of integers \( Z \) by \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \). Saying that \( (x-y) \) is divisible by \( n \) means \( x - y = nk \) for some integer \( k \). To prove \( R \) is an equivalence relation, we verify all three properties one by one using this idea.
\( (x,y) \in R \iff x - y = nk \) for some integer \( k \), i.e. \( n \mid (x-y) \).
The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.
A common mistake is proving symmetry incorrectly by claiming \( y - x \) is divisible by \( n \) without justification. You must show \( y - x = -(x-y) = n(-k) \), so that the divisibility clearly carries over. Simply writing 'obviously symmetric' loses marks.
The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.
One common mistake: When verifying symmetry, students forget to check that \( -k \) is still an integer. Since the integers are closed under negation, \( -k \in Z \) automatically, but skipping this justification leads to an incomplete proof.
Answer: The relation \( R = \{(x,y) : (x-y) \text{ is divisible by } n\} \) is reflexive, symmetric, and transitive on \( Z \). Therefore \( R \) is an equivalence relation.
Question: Let m be a fixed positive integer. A relation R is defined on the set of integers \( \mathbb{Z} \) by \[ R = \{(a, b) : m \mid (a^2 - b^2),\ a, b \in \mathbb{Z}\} \] where \( m \mid (a^2 - b^2) \) means \( m \) divides \( (a^2 - b^2) \). Determine whether R is an equivalence relation.
Solution: We check all three properties of an equivalence relation. Reflexivity: Let \( a \in \mathbb{Z} \). Consider \( a^2 - a^2 = 0 \). Since \( m \mid 0 \) for any positive integer m, we have \( (a, a) \in R \) for all \( a \in \mathbb{Z} \). Hence R is reflexive. Symmetry: Let \( (a, b) \in R \). Then \( m \mid (a^2 - b^2) \). This means \( a^2 - b^2 = mk \) for some integer k. Therefore \( b^2 - a^2 = m(-k) \), and since \( -k \in \mathbb{Z} \), we get \( m \mid (b^2 - a^2) \). Hence \( (b, a) \in R \), so R is symmetric. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( m \mid (a^2 - b^2) \) and \( m \mid (b^2 - c^2) \). So there exist integers \( k_1, k_2 \) such that \[ a^2 - b^2 = mk_1 \quad \text{and} \quad b^2 - c^2 = mk_2. \] Adding these two equations: \[ a^2 - c^2 = m(k_1 + k_2). \] Since \( k_1 + k_2 \in \mathbb{Z} \), we get \( m \mid (a^2 - c^2) \), so \( (a, c) \in R \). Hence 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} \).
Question: A relation R is defined on the set \( \mathbb{R} \) of real numbers as follows: \[ R = \{(x, y) : x - y \in \mathbb{Z},\ x, y \in \mathbb{R}\} \] where \( \mathbb{Z} \) denotes the set of all integers. Determine whether R is an equivalence relation.
Solution: We verify all three properties. Reflexivity: Let \( x \in \mathbb{R} \). Then \( x - x = 0 \in \mathbb{Z} \). So \( (x, x) \in R \) for all \( x \in \mathbb{R} \). Hence R is reflexive. Symmetry: Let \( (x, y) \in R \). Then \( x - y \in \mathbb{Z} \). Let \( x - y = k \) where \( k \in \mathbb{Z} \). Then \( y - x = -k \). Since \( -k \in \mathbb{Z} \), we have \( y - x \in \mathbb{Z} \), so \( (y, x) \in R \). Hence R is symmetric. Transitivity: Let \( (x, y) \in R \) and \( (y, z) \in R \). Then \( x - y \in \mathbb{Z} \) and \( y - z \in \mathbb{Z} \). Let \( x - y = k_1 \) and \( y - z = k_2 \) where \( k_1, k_2 \in \mathbb{Z} \). Adding: \[ x - z = (x - y) + (y - z) = k_1 + k_2. \] Since \( k_1 + k_2 \in \mathbb{Z} \), we have \( x - z \in \mathbb{Z} \), so \( (x, z) \in R \). Hence R is transitive. Since R satisfies all three properties, R is an equivalence relation on \( \mathbb{R} \). Note: The equivalence class of any \( x \in \mathbb{R} \) under this relation is \( [x] = \{x + k : k \in \mathbb{Z}\} \), i.e., all real numbers that differ from x by an integer.
Answer: R is an equivalence relation on \( \mathbb{R} \).
Question: A relation \( R \) is defined on the set of integers \( \mathbb{Z} \) by \( R = \{(a, b) : 3 \mid (2a - 2b),\ a, b \in \mathbb{Z}\} \). Determine whether \( R \) is an equivalence relation. If it is, describe the equivalence classes.
Answer: The relation \( R = \{(a, b) : 3 \mid (2a - 2b)\} \) simplifies to \( 3 \mid (a - b) \) and is reflexive, symmetric, and transitive on \( \mathbb{Z} \). Therefore \( R \) is an equivalence relation, and it partitions \( \mathbb{Z} \) into exactly three equivalence classes: \( [0], [1], \) and \( [2] \) (the residue classes modulo 3).