If \(N\) denotes the set of all natural numbers and R is the relation on \(N\times N\) defined by \((a, b)\ R (c, d),\) if \(ad(b + c) = bc(a + d).\) Show that \(R\) is an equivalence relation.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Think of pairs of numbers like two friends sharing a secret code. The relation R checks if two pairs of numbers share the same secret. Every pair shares its own secret with itself, so it is reflexive. If one pair shares its secret with another, that other pair shares back, so it is symmetric. If pair A shares with pair B and pair B shares with pair C, then pair A and pair C also share, so it is transitive. When all three friendship rules hold, mathematicians call it an equivalence relation.
Answer: The relation \( R \) is reflexive, symmetric, and transitive, hence \( R \) is an equivalence relation on \( N \times N \).
A relation \( R \) on a set is called an equivalence relation if it satisfies three properties: reflexive, symmetric, and transitive. Here the set is \( N \times N \) (ordered pairs of natural numbers), and \( (a,b) \, R \, (c,d) \) means \( ad(b+c) = bc(a+d) \). A useful trick is to simplify this condition. Expanding gives \( adb + adc = bca + bcd \). Dividing both sides by \( abcd \) (all natural numbers, so nonzero) gives \( \frac{1}{c} + \frac{1}{b} = \frac{1}{d} + \frac{1}{a} \), which rearranges to \( \frac{1}{b} - \frac{1}{a} = \frac{1}{d} - \frac{1}{c} \). This clean equivalent form makes the three checks much easier.
\( (a,b) \, R \, (c,d) \iff ad(b+c) = bc(a+d) \iff \frac{1}{b} - \frac{1}{a} = \frac{1}{d} - \frac{1}{c} \)
The relation \( R \) is reflexive, symmetric, and transitive, hence \( R \) is an equivalence relation on \( N \times N \).
A common mistake is trying to verify symmetry and transitivity directly from the messy form \( ad(b+c) = bc(a+d) \) without first simplifying it to \( \frac{1}{b} - \frac{1}{a} = \frac{1}{d} - \frac{1}{c} \). Working with the unsimplified condition leads to complicated algebra and errors; simplifying first makes all three checks straightforward.
The relation \( R \) is reflexive, symmetric, and transitive, hence \( R \) is an equivalence relation on \( N \times N \).
One common mistake: students attempt to verify the three properties directly using the original form ad(b+c) = bc(a+d) without first simplifying it, leading to messy algebra; always reduce the condition to \( \frac{1}{b} - \frac{1}{a} = \frac{1}{d} - \frac{1}{c} \) before proceeding with the checks.
Answer: The relation \( R \) is reflexive, symmetric, and transitive, hence \( R \) is an equivalence relation on \( N \times N \).
Question: Let N be the set of all natural numbers and let R be a relation on N × N defined by: (a, b) R (c, d) if and only if a + d = b + c. Show that R is an equivalence relation.
Solution: We verify the three properties of an equivalence relation. Reflexivity: Let (a, b) ∈ N × N be arbitrary. We check whether (a, b) R (a, b). The condition requires a + b = b + a, which holds since addition is commutative. Hence R is reflexive. Symmetry: Suppose (a, b) R (c, d). Then a + d = b + c. We need to show (c, d) R (a, b), i.e., c + b = d + a. Since a + d = b + c, we can rewrite this as c + b = d + a, which is exactly d + a = b + c rearranged. Hence (c, d) R (a, b) and R is symmetric. Transitivity: Suppose (a, b) R (c, d) and (c, d) R (e, f). Then: From (a, b) R (c, d): \[ a + d = b + c \quad \text{...(1)} \] From (c, d) R (e, f): \[ c + f = d + e \quad \text{...(2)} \] Adding (1) and (2): \[ a + d + c + f = b + c + d + e \] Simplifying (cancelling c + d from both sides): \[ a + f = b + e \] This means (a, b) R (e, f). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on N × N.
Answer: R is an equivalence relation on N × N.
Question: Let N be the set of all natural numbers and let R be a relation on N × N defined by: (a, b) R (c, d) if and only if a \cdot d = b \cdot c. Show that R is an equivalence relation.
Solution: We verify the three properties of an equivalence relation. Reflexivity: Let (a, b) ∈ N × N. We need to check (a, b) R (a, b), i.e., whether a · b = b · a. This is true by commutativity of multiplication. Hence R is reflexive. Symmetry: Suppose (a, b) R (c, d). Then a · d = b · c. We need to show (c, d) R (a, b), which requires c · b = d · a. Since a · d = b · c, we have c · b = b · c = a · d = d · a. Hence (c, d) R (a, b) and R is symmetric. Transitivity: Suppose (a, b) R (c, d) and (c, d) R (e, f). Then: From (a, b) R (c, d): \[ ad = bc \quad \text{...(1)} \] From (c, d) R (e, f): \[ cf = de \quad \text{...(2)} \] From (1), we get \[ \frac{a}{b} = \frac{c}{d} \] From (2), we get \[ \frac{c}{d} = \frac{e}{f} \] Therefore \[ \frac{a}{b} = \frac{e}{f} \] which gives a · f = b · e, i.e., (a, b) R (e, f). Alternatively, multiplying (1) and (2): \[ ad \cdot cf = bc \cdot de \] Simplifying (dividing both sides by d · c, since c, d ∈ N so c, d ≠ 0): \[ af = be \] This means (a, b) R (e, f). Hence R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation on N × N.
Answer: R is an equivalence relation on N × N.
Question: Let N denote the set of all natural numbers and let R be a relation on N \(\times\) N defined by \((a, b)\, R\, (c, d)\) if and only if \(ad(b + c) = bc(a + d)\) is replaced by the condition \(a + d = b + c\). Show that R is an equivalence relation on N \(\times\) N. Also interpret what this relation means geometrically.
Answer: The relation R defined by \((a, b)\, R\, (c, d)\) iff \(a + d = b + c\) is reflexive (since \(a + b = b + a\)), symmetric (since \(a + d = b + c \Rightarrow c + b = d + a\)), and transitive (verified by adding the two given equalities). Hence R is an equivalence relation on \(N \times N\). Each equivalence class groups all pairs \((a, b)\) with the same value of \(a - b\).