Example 1
Question: A relation R is defined on \( \mathbb{N} \times \mathbb{N} \) (where \( \mathbb{N} \) is the set of natural numbers) as: \((a, b)\, R\, (c, d) \iff a + d = b + c\). Show that R is an equivalence relation.
Solution: We need to verify that R is reflexive, symmetric, and transitive. Reflexivity: Let \( (a, b) \in \mathbb{N} \times \mathbb{N} \) be arbitrary. We check whether \( (a, b)\, R\, (a, b) \). The condition requires \( a + b = b + a \), which is true by commutativity of addition. 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 write \( c + b = b + c = a + d = d + a \). Hence \( c + b = d + a \), so R is symmetric. Transitivity: Suppose \( (a, b)\, R\, (c, d) \) and \( (c, d)\, R\, (e, f) \). Then \( a + d = b + c \) and \( c + f = d + e \). We need to show \( (a, b)\, R\, (e, f) \), i.e., \( a + f = b + e \). Adding the two given equations: \[ (a + d) + (c + f) = (b + c) + (d + e) \] Simplifying: \[ a + d + c + f = b + c + d + e \] Cancelling \( c \) and \( d \) from both sides: \[ a + f = b + e \] Hence \( (a, b)\, R\, (e, f) \), so R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: R is an equivalence relation on \( \mathbb{N} \times \mathbb{N} \) since it is reflexive, symmetric, and transitive.
Example 2
Question: A relation R is defined on \( \mathbb{N} \times \mathbb{N} \) (where \( \mathbb{N} \) is the set of natural numbers) as: \((a, b)\, R\, (c, d) \iff ad = bc\). Show that R is an equivalence relation.
Solution: We need to verify that R is reflexive, symmetric, and transitive. Reflexivity: Let \( (a, b) \in \mathbb{N} \times \mathbb{N} \). We check whether \( (a, b)\, R\, (a, b) \). The condition requires \( a \cdot b = b \cdot a \), which is always true. Hence R is reflexive. Symmetry: Suppose \( (a, b)\, R\, (c, d) \). Then \( ad = bc \). We need to show \( (c, d)\, R\, (a, b) \), i.e., \( cb = da \). Since \( ad = bc \), we have \( cb = bc = ad = da \). Hence \( cb = da \), so R is symmetric. Transitivity: Suppose \( (a, b)\, R\, (c, d) \) and \( (c, d)\, R\, (e, f) \). Then \( ad = bc \) and \( cf = de \). We need to show \( (a, b)\, R\, (e, f) \), i.e., \( af = be \). Multiplying the two equations: \[ (ad)(cf) = (bc)(de) \] \[ acdf = bcde \] Since \( c \in \mathbb{N} \), we have \( c \ne 0 \). Since \( d \in \mathbb{N} \), we have \( d \ne 0 \). Dividing both sides by \( cd \): \[ af = be \] Hence \( (a, b)\, R\, (e, f) \), so R is transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation.
Answer: R is an equivalence relation on \( \mathbb{N} \times \mathbb{N} \) since it is reflexive, symmetric, and transitive.