Determine whether each of the following relations are reflexive, symmetric and transitive: Relation R in the set \(Z\) of all integers defined as \(R=\{(x,y): x – y\)is an integer \(\}\)
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine every whole number is a person in a big club. Two people are "connected" if you subtract one from the other and get a whole number. Since all members are already whole numbers, subtracting any two always gives a whole number. So everyone is connected to themselves, connections go both ways, and if person A connects to B and B connects to C, then A connects to C too. A relation with all three of these friendly properties is called an equivalence relation.
Answer: The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).
A relation on a set connects certain pairs of elements. To classify it, we test three properties. A relation \( R \) on a set \( A \) is reflexive if \( (x, x) \in R \) for every \( x \in A \). It is symmetric if \( (x, y) \in R \) implies \( (y, x) \in R \). It is transitive if \( (x, y) \in R \) and \( (y, z) \in R \) together imply \( (x, z) \in R \). Here the set is \( Z \), the set of all integers, and \( R = \{(x, y) : x - y \text{ is an integer}\} \). A key fact we use is that the sum, difference, and negative of integers are always integers. Since \( x \) and \( y \) are already integers, \( x - y \) is automatically an integer for every pair, which makes this relation very special.
\( R \) is reflexive if \( (x,x) \in R \); symmetric if \( (x,y) \in R \Rightarrow (y,x) \in R \); transitive if \( (x,y) \in R \) and \( (y,z) \in R \Rightarrow (x,z) \in R \). Rule used: difference of two integers is always an integer.
The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).
A common mistake is confusing this relation with one like \( x - y \) being divisible by some number, or thinking the condition sometimes fails. Since both \( x \) and \( y \) are integers, \( x - y \) is ALWAYS an integer, so no pair is ever left out — students often overlook this and try to find counterexamples that do not exist.
The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).
One common mistake: Students sometimes assume that because the set is \( Z \) (integers) and the condition involves a difference, the relation might not be symmetric — forgetting that \( -(x - y) = y - x \) is still an integer, so symmetry holds automatically.
Answer: The relation \( R \) is reflexive, symmetric, and transitive. Therefore \( R \) is an equivalence relation on \( Z \).
Question: Determine whether the relation R defined on the set \( \mathbb{Q} \) of all rational numbers as \( R = \{(x, y) : x - y \in \mathbb{Z}\} \) is reflexive, symmetric, and transitive.
Solution: We are given \( R = \{(x, y) : x - y \in \mathbb{Z}\} \) on \( \mathbb{Q} \). Reflexivity: Let \( x \in \mathbb{Q} \). Then \( x - x = 0 \), and \( 0 \in \mathbb{Z} \). So \( (x, x) \in R \) for all \( x \in \mathbb{Q} \). Hence R is reflexive. Symmetry: Let \( (x, y) \in R \). Then \( x - y \in \mathbb{Z} \). Since the negative of an integer is also an integer, \( y - x = -(x - y) \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} \). The sum of two integers is an integer, so \( x - z = (x - y) + (y - z) \in \mathbb{Z} \). Thus \( (x, z) \in R \). Hence R is transitive.
Answer: R is reflexive, symmetric, and transitive, so R is an equivalence relation on \( \mathbb{Q} \).
Question: Let \( R \) be a relation defined on the set \( \mathbb{Z} \) of all integers by \( R = \{(a, b) : 3 \mid (a - b)\} \), meaning \( 3 \) divides \( (a - b) \). Determine whether R is reflexive, symmetric, and transitive.
Solution: We are given \( R = \{(a, b) : 3 \mid (a - b)\} \) on \( \mathbb{Z} \). Reflexivity: Let \( a \in \mathbb{Z} \). Then \( a - a = 0 \), and \( 3 \mid 0 \) since \( 0 = 3 \times 0 \). So \( (a, a) \in R \) for every \( a \in \mathbb{Z} \). Hence R is reflexive. Symmetry: Let \( (a, b) \in R \). Then \( 3 \mid (a - b) \), so \( a - b = 3k \) for some \( k \in \mathbb{Z} \). Then \( b - a = 3(-k) \) where \( -k \in \mathbb{Z} \), so \( 3 \mid (b - a) \). Thus \( (b, a) \in R \). Hence R is symmetric. Transitivity: Let \( (a, b) \in R \) and \( (b, c) \in R \). Then \( a - b = 3k \) and \( b - c = 3m \) for some \( k, m \in \mathbb{Z} \). Adding these: \[ a - c = (a - b) + (b - c) = 3k + 3m = 3(k + m). \] Since \( k + m \in \mathbb{Z} \), we have \( 3 \mid (a - c) \), so \( (a, c) \in R \). Hence R is transitive.
Answer: R is reflexive, symmetric, and transitive, so R is an equivalence relation on \( \mathbb{Z} \).
Question: Let \( R \) be a relation defined on the set \( \mathbb{Z} \) of all integers as \( R = \{(x, y) : 2 \mid (x - y)\} \), i.e., \( x - y \) is divisible by 2. Determine whether \( R \) is reflexive, symmetric, and transitive. Is \( R \) an equivalence relation?
Answer: The relation \( R \) is reflexive, symmetric, and transitive, so \( R \) is an equivalence relation on \( \mathbb{Z} \). It partitions \( \mathbb{Z} \) into exactly two equivalence classes: the set of all even integers and the set of all odd integers.