Let \(R\) be a relation from \(Q\) to \(Q\) defined by \(R=\{(a,b): a,b \in Q\) and \(a-b \in Z\}.\) Show that \((a,a) \in R\) for all \(a \in Q\)
CBSE Class 11 Maths · Relations and Functions
CBSE Class 11 Maths · Relations and Functions
Think of a relation like a rule that pairs up numbers. This rule says: two rational numbers are paired if their difference is a whole number. Now, what happens when a number is paired with itself? The difference is zero, like saying your height minus your own height is zero. Zero is a whole number, so every number qualifies as its own partner. A relation where every element pairs with itself is called reflexive. This one passes that test easily.
Answer: For every rational number \( a \), we have \( a - a = 0 \in \mathbb{Z} \), so \( (a, a) \in R \) for all \( a \in \mathbb{Q} \). Thus the relation \( R \) is reflexive.
A relation \( R \) from a set to itself is just a collection of ordered pairs \( (a, b) \) that satisfy some given rule. Here the set is \( \mathbb{Q} \) (the set of all rational numbers), and the rule for a pair \( (a, b) \) to belong to \( R \) is that the difference \( a - b \) must be an integer, that is \( a - b \in \mathbb{Z} \). To show that \( (a, a) \in R \) for every rational number \( a \), we must check that the pair \( (a, a) \) satisfies this defining condition. Proving \( (a, a) \in R \) for all \( a \) is exactly what it means to say the relation is reflexive. The key idea is to substitute the second coordinate equal to the first and see whether the resulting difference is an integer.
\( (a, b) \in R \iff a - b \in \mathbb{Z} \), where \( a, b \in \mathbb{Q} \).
For every rational number \( a \), we have \( a - a = 0 \in \mathbb{Z} \), so \( (a, a) \in R \) for all \( a \in \mathbb{Q} \). Thus the relation \( R \) is reflexive.
A common mistake is to think that \( 0 \) is not an integer or to forget to state that \( 0 \in \mathbb{Z} \). Remember that \( 0 \) is indeed an integer, which is exactly what makes \( a - a = 0 \) satisfy the condition.
For every rational number \( a \), we have \( a - a = 0 \in \mathbb{Z} \), so \( (a, a) \in R \) for all \( a \in \mathbb{Q} \). Thus the relation \( R \) is reflexive.
One common mistake: Students sometimes try to check reflexivity by picking a specific rational number (e.g. \( a = 2 \)) and verifying only that one case, instead of proving the result for an arbitrary \( a \in \mathbb{Q} \). A single example is never sufficient to establish a property for all elements.
Answer: For every rational number \( a \), we have \( a - a = 0 \in \mathbb{Z} \), so \( (a, a) \in R \) for all \( a \in \mathbb{Q} \). Thus the relation \( R \) is reflexive.
Question: Let \( R \) be a relation from \( \mathbb{R} \) to \( \mathbb{R} \) defined by \[ R = \{(a, b) : a, b \in \mathbb{R} \text{ and } a - b \in \mathbb{Q}\}. \] Show that \( (a, a) \in R \) for all \( a \in \mathbb{R} \).
Solution: We need to show that for every \( a \in \mathbb{R} \), the pair \( (a, a) \) belongs to \( R \). By the definition of \( R \), a pair \( (a, b) \) belongs to \( R \) if and only if \( a - b \in \mathbb{Q} \). For the pair \( (a, a) \), compute \( a - a \): \[ a - a = 0. \] Now, \( 0 \) is a rational number, i.e., \( 0 \in \mathbb{Q} \). Therefore, the condition \( a - a \in \mathbb{Q} \) is satisfied for every \( a \in \mathbb{R} \). Hence, \( (a, a) \in R \) for all \( a \in \mathbb{R} \).
Answer: Since \( a - a = 0 \in \mathbb{Q} \) for every \( a \in \mathbb{R} \), we have \( (a, a) \in R \) for all \( a \in \mathbb{R} \).
Question: Let \( R \) be a relation on \( \mathbb{Z} \) defined by \[ R = \{(a, b) : a, b \in \mathbb{Z} \text{ and } 3 \mid (a - b)\}. \] Show that \( (a, a) \in R \) for all \( a \in \mathbb{Z} \). (Here \( 3 \mid (a-b) \) means \( 3 \) divides \( a - b \).)
Solution: We need to show that for every \( a \in \mathbb{Z} \), the pair \( (a, a) \) belongs to \( R \). By the definition of \( R \), a pair \( (a, b) \) belongs to \( R \) if and only if \( 3 \mid (a - b) \), meaning \( a - b \) is divisible by \( 3 \). For the pair \( (a, a) \), compute \( a - a \): \[ a - a = 0. \] Now, \( 0 = 3 \times 0 \), so \( 3 \mid 0 \). That is, \( 3 \) divides \( 0 \). Therefore, the condition \( 3 \mid (a - a) \) is satisfied for every \( a \in \mathbb{Z} \). Hence, \( (a, a) \in R \) for all \( a \in \mathbb{Z} \).
Answer: Since \( a - a = 0 \) and \( 3 \mid 0 \), the condition is satisfied, so \( (a, a) \in R \) for all \( a \in \mathbb{Z} \).
Question: Let R be a relation from \( \mathbb{Q} \) to \( \mathbb{Q} \) defined by \( R = \{(a, b) : a, b \in \mathbb{Q} \text{ and } a - b \in \mathbb{Z}\} \). Show that if \( (a, b) \in R \), then \( (b, a) \in R \) for all \( a, b \in \mathbb{Q} \). (That is, show that R is symmetric.)
Answer: For any \( a, b \in \mathbb{Q} \), if \( (a, b) \in R \) then \( a - b \in \mathbb{Z} \). Since \( b - a = -(a - b) \) and the integers are closed under negation, \( b - a \in \mathbb{Z} \), so \( (b, a) \in R \). Thus R is symmetric.