SOLVER7 Study. Nothing Else.
Exercise 1.1 Q1(v)d

Determine whether each of the following relations are reflexive, symmetric and transitive: Relation R in the set A of human beings in a town at a particular time given by \(R=\{(x, y) : x \) is wife of \(y\}\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a list of married couples in a town. The rule says: x is on the list with y only if x is y's wife. Can anyone be their own wife? No! Can a husband also be called a wife? No! So the list is neither self-referencing nor reversible. But what about a chain — if x is wife of y, and y is wife of z? A man cannot be someone's wife, so that chain can never form. Since the tricky situation never happens, the rule passes the chain test automatically.

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).

📖 Wife-of Relation: Reflexive, Symmetric, Transitive

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

  1. 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.
  2. 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.
  3. 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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the relation clearly. Let \( A \) be the set of all human beings in a town, and the relation is defined as \( R = \\{(x, y) : x \text{ is the wife of } y\\} \). — Reason: Before testing any property, we must be precise about what the relation actually means, so we can apply each definition correctly.
  2. Step 2: Test Reflexivity. For R to be reflexive, we need \( (x, x) \in R \) for every \( x \in A \), which would mean every person is their own wife. This is biologically and socially impossible — no person can be the wife of themselves. Therefore \( (x, x) \notin R \) for any \( x \in A \), and R is NOT reflexive. — Reason: Reflexivity requires the relation to loop back on every element; since 'wife of' can never apply to the same person, this fails immediately.
  3. Step 3: Test Symmetry. Assume \( (x, y) \in R \), so x is the wife of y. This tells us x is female and y is her husband (male). For symmetry, we would also need \( (y, x) \in R \), meaning y is the wife of x. But y is male and cannot be anyone's wife. Hence \( (y, x) \notin R \), so R is NOT symmetric. — Reason: Symmetry demands the relation work in both directions; since 'wife of' has a fixed gender direction, the reverse ordered pair can never belong to R.
  4. Step 4: Set up the transitivity test. For transitivity, we need: whenever \( (x, y) \in R \) and \( (y, z) \in R \), it must follow that \( (x, z) \in R \). Suppose both conditions hold simultaneously. Then \( (x, y) \in R \) means x is the wife of y, so y is male (a husband). But \( (y, z) \in R \) would mean y is the wife of z, which requires y to be female. — Reason: We try to construct a scenario that would test whether the transitive condition can ever be violated.
  5. Step 5: Conclude about transitivity. The two conditions \( (x, y) \in R \) and \( (y, z) \in R \) together require y to be simultaneously male (as x's husband) and female (as z's wife). This is a contradiction — no such y can exist. Since the premise \( (x, y) \in R \) and \( (y, z) \in R \) can never both be true at the same time, the transitive condition is never put to the test. A conditional statement with a false premise is always true, so R IS transitive (vacuously). — Reason: When the hypothesis of an implication is always false, the implication itself is vacuously true, meaning transitivity holds without any actual cases to check.

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

One common mistake: Students often conclude that R is also NOT transitive, forgetting that transitivity is vacuously true when no pair of ordered pairs \( (x, y) \) and \( (y, z) \) can simultaneously belong to R — always check whether the hypothesis of the transitive condition can actually be satisfied before declaring the property fails.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: \( (x, x) \in R \) requires x to be their own wife — impossible. So \( (x, x) \notin R \) for any \( x \). R is NOT reflexive.
  2. Symmetry: \( (x, y) \in R \Rightarrow \) x is wife of y \( \Rightarrow \) y is male \( \Rightarrow (y, x) \notin R \). R is NOT symmetric.
  3. Transitivity: \( (x, y) \in R \) and \( (y, z) \in R \Rightarrow \) y is simultaneously male (husband of x) and female (wife of z) — a contradiction. So no such pair exists; transitivity holds vacuously. R IS transitive.

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).

➕ More Examples

More Examples

Example 1

Question: Let A be the set of all human beings in a city. Define a relation R on A by: \( R = \{(x, y) : x \text{ is the father of } y\} \). Determine whether R is reflexive, symmetric, and/or transitive.

Solution: We check the three properties one by one. Reflexivity: For R to be reflexive, we need \( (x, x) \in R \) for every \( x \in A \), meaning x is the father of x. No person can be their own father. Hence R is NOT reflexive. Symmetry: For R to be symmetric, \( (x, y) \in R \) should imply \( (y, x) \in R \). If x is the father of y, then y is the child of x, so y cannot be the father of x. Hence R is NOT symmetric. Transitivity: For R to be transitive, \( (x, y) \in R \) and \( (y, z) \in R \) should together imply \( (x, z) \in R \). Suppose x is the father of y and y is the father of z. Then x is the grandfather of z, so x is NOT the father of z. Hence R is NOT transitive. Conclusion: R is neither reflexive, nor symmetric, nor transitive.

Answer: R is neither reflexive, nor symmetric, nor transitive.

Example 2

Question: Let A be the set of all students in a school. Define a relation R on A by: \( R = \{(x, y) : x \text{ and } y \text{ study in the same class}\} \). Determine whether R is reflexive, symmetric, and/or transitive.

Solution: We check each property. Reflexivity: For any student \( x \in A \), x studies in the same class as themselves. So \( (x, x) \in R \) for all \( x \in A \). Hence R IS reflexive. Symmetry: Suppose \( (x, y) \in R \), meaning x and y study in the same class. Then clearly y and x also study in the same class, so \( (y, x) \in R \). Hence R IS symmetric. Transitivity: Suppose \( (x, y) \in R \) and \( (y, z) \in R \). This means x and y are in the same class, and y and z are in the same class. Since both x and z are in the same class as y, x and z are in the same class, so \( (x, z) \in R \). Hence R IS transitive. Conclusion: R is reflexive, symmetric, and transitive. Therefore R is an equivalence relation.

Answer: R is reflexive, symmetric, and transitive (an equivalence relation).

🎯 Try a Similar Question

Try a Similar Question

Question: Let A be the set of all human beings in a town at a particular time. Define a relation R on A by: \[ R = \{(x, y) : x \text{ is the father of } y\} \] Determine whether R is reflexive, symmetric, and/or transitive.

Solution

  1. Step 1: Check Reflexivity: R is reflexive if \( (x, x) \in R \) for every \( x \in A \), i.e., if every person is the father of themselves. A person cannot be their own father. Therefore \( (x, x) \notin R \) for any \( x \in A \). Hence R is NOT reflexive.
  2. Step 2: Check Symmetry: R is symmetric if \( (x, y) \in R \Rightarrow (y, x) \in R \). Suppose \( (x, y) \in R \), meaning x is the father of y. Can y be the father of x? No, because a child cannot be the father of their own father. Therefore \( (y, x) \notin R \). Hence R is NOT symmetric.
  3. Step 3: Check Transitivity: R is transitive if whenever \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \). Suppose \( (x, y) \in R \) and \( (y, z) \in R \). This means x is the father of y, and y is the father of z. That would make x the grandfather of z, not the father of z. So \( (x, z) \notin R \). Since a specific pair violates transitivity, R is NOT transitive.
  4. Step 4: Conclusion: The relation R defined by 'x is the father of y' is neither reflexive, nor symmetric, nor transitive.

Answer: The relation R is NOT reflexive (no one is their own father), NOT symmetric (if x is the father of y, then y cannot be the father of x), and NOT transitive (if x is the father of y and y is the father of z, then x is the grandfather of z, not the father of z).

Everything you get with Solver7

More questions in Relations and Functions