Detailed Explanation
A relation \( R \) on a set \( A \) is a collection of ordered pairs \( (x, y) \) that satisfy a given rule. To classify a relation we test three properties. A relation is reflexive if every element is related to itself, that is \( (x, x) \in R \) for all \( x \in A \). It is symmetric if whenever \( (x, y) \in R \), we also have \( (y, x) \in R \). It is transitive if whenever \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \). Here \( A \) is the set of human beings in a town, and \( R = \{(x, y) : x \text{ is wife of } y\} \). We check each property by testing whether the definition of 'wife of' can satisfy it.
Formula Used
Reflexive: \( (x, x) \in R \) for all \( x \in A \). Symmetric: \( (x, y) \in R \Rightarrow (y, x) \in R \). Transitive: \( (x, y) \in R \) and \( (y, z) \in R \Rightarrow (x, z) \in R \).
Solution
- Step 1: Check reflexivity. Reflexive means \( (x, x) \in R \) for every \( x \in A \), i.e. every person is their own wife. But no person can be the wife of themselves. So \( (x, x) \notin R \). Hence R is NOT reflexive.
- Step 2: Check symmetry. Suppose \( (x, y) \in R \), meaning x is the wife of y. Then x is female and y is her husband (male). For symmetry we would need \( (y, x) \in R \), i.e. y is the wife of x. But y is male, so y cannot be the wife of x. Hence \( (y, x) \notin R \), and R is NOT symmetric.
- Step 3: Check transitivity. Suppose \( (x, y) \in R \) and \( (y, z) \in R \). Then x is the wife of y, so y is male, and y is the wife of z, so y is female. A single person y cannot be both male and female at once, so such pairs \( (x, y) \) and \( (y, z) \) cannot both exist. The condition for transitivity is never triggered, so it is never violated. Hence R is trivially (vacuously) transitive.
Final Answer
The relation R is NOT reflexive (no one is their own wife), NOT symmetric (if x is wife of y, y cannot be wife of x), but it IS transitive (the situation forcing y to be both a husband and a wife never arises, so transitivity is vacuously satisfied).
Common Mistake
A common mistake is to declare R not transitive just because the situation seems impossible. In fact, when the hypothesis \( (x, y) \in R \) and \( (y, z) \in R \) can never both hold, the transitivity condition is vacuously true, so R IS transitive.