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

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 father of \(y\}\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Think about the word 'father.' Can anyone be their own father? No! That breaks the first rule called reflexivity. Now flip it around — if your dad is your father, are you his father? Of course not! That breaks the second rule called symmetry. What about a grandfather? If Ram is Shyam's father, and Shyam is Raju's father, Ram is Raju's grandfather — not his father. That breaks the third rule called transitivity. So the relation \( R = \{ (x, y) : x \text{ is father of } y \} \) fails all three tests.

Answer: The relation \( R = \{ (x, y) : x \text{ is father of } y \} \) is neither reflexive, nor symmetric, nor transitive.

📖 Checking Reflexive, Symmetric, Transitive for 'is father of'

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs \( (x, y) \) that satisfy a given condition. We test three key 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 \), then \( (y, x) \in R \) too. It is transitive if whenever \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \). Here the condition is 'x is the father of y'. We check each property by asking whether the fatherhood relationship logically forces the required pairs to also belong to R.

Formula Used

Reflexive: \( (x, x) \in R \ \forall x \in A \). Symmetric: \( (x, y) \in R \Rightarrow (y, x) \in R \). Transitive: \( (x, y) \in R \ \text{and} \ (y, z) \in R \Rightarrow (x, z) \in R \).

Solution

  1. Step 1: Understand the relation. We have \( R = \{ (x, y) : x \text{ is father of } y \} \) on the set \( A \) of human beings in a town. So \( (x, y) \in R \) means x is the father of y.
  2. Step 2: Check reflexivity. Reflexivity needs \( (x, x) \in R \), meaning x would have to be the father of himself. No person can be his own father, so \( (x, x) \notin R \). Therefore R is NOT reflexive.
  3. Step 3: Check symmetry. Suppose \( (x, y) \in R \), so x is the father of y. For symmetry we would need \( (y, x) \in R \), meaning y is the father of x. But if x is y's father, then y is x's child, not x's father. So \( (y, x) \notin R \). Therefore R is NOT symmetric.
  4. Step 4: Check transitivity. Suppose \( (x, y) \in R \) and \( (y, z) \in R \), so x is the father of y and y is the father of z. For transitivity we need \( (x, z) \in R \), meaning x is the father of z. But x is actually the grandfather of z, not the father. So \( (x, z) \notin R \). Therefore R is NOT transitive.
  5. Step 5: Combine the results. Since none of the three properties hold, R is neither reflexive, nor symmetric, nor transitive.

Final Answer

The relation \( R = \{ (x, y) : x \text{ is father of } y \} \) is neither reflexive, nor symmetric, nor transitive.

Common Mistake

A common mistake is thinking R is transitive because x, y, z are related through a family chain. But x being father of y and y being father of z makes x the grandfather of z, not the father, so \( (x, z) \notin R \) and transitivity fails.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the relation clearly. The relation is defined as \( R = \\{ (x, y) : x \text{ is father of } y \\} \) on the set \( A \) of all human beings in a town. So a pair \( (x, y) \in R \) precisely when x is the biological father of y. — Reason: Stating the meaning of the relation precisely prevents confusion during each property check.
  2. Step 2: Test for Reflexivity. Reflexivity requires \( (x, x) \in R \) for every \( x \in A \), which would mean x is the father of himself. Since no person can father himself, we have \( (x, x) \notin R \) for any \( x \). Therefore R is NOT reflexive. — Reason: We check whether every element is paired with itself, because that is the precise definition of a reflexive relation.
  3. Step 3: Test for Symmetry. Symmetry requires that if \( (x, y) \in R \) then \( (y, x) \in R \). Suppose x is the father of y, so \( (x, y) \in R \). For symmetry we would also need y to be the father of x, i.e. \( (y, x) \in R \). But if x is the father of y, then y is a child of x, not the father. So \( (y, x) \notin R \). Therefore R is NOT symmetric. — Reason: We check whether reversing the pair keeps it inside R, because that is exactly what symmetry demands.
  4. Step 4: Test for Transitivity. Transitivity requires that if \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \in R \). Suppose x is the father of y, so \( (x, y) \in R \), and y is the father of z, so \( (y, z) \in R \). For transitivity we would need x to also be the father of z. But x is actually the grandfather of z, not the father. So \( (x, z) \notin R \). Therefore R is NOT transitive. — Reason: We trace a two-step chain to see whether the endpoint pair must also belong to R, which is the definition of transitivity.
  5. Step 5: Summarise all three results. Reflexivity fails because no person is his own father. Symmetry fails because a father–child relationship cannot be reversed. Transitivity fails because a grandfather is not a father. Hence the relation \( R = \\{ (x, y) : x \text{ is father of } y \\} \) is neither reflexive, nor symmetric, nor transitive. — Reason: Collecting all three conclusions in one place gives the complete answer required.

Final Answer

The relation \( R = \{ (x, y) : x \text{ is father of } y \} \) is neither reflexive, nor symmetric, nor transitive.

Common Mistake

One common mistake: Students sometimes confuse transitivity with the grandfather relationship and incorrectly conclude that R is transitive, forgetting that 'grandfather of' and 'father of' are different relations — transitivity would require x to be the father (not grandfather) of z.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Not Reflexive: \( (x, x) \notin R \) since no person is their own father.
  2. Not Symmetric: \( (x, y) \in R \Rightarrow x \) is father of \( y \), but \( y \) is not father of \( x \), so \( (y, x) \notin R \).
  3. Not Transitive: \( (x, y) \in R \) and \( (y, z) \in R \Rightarrow x \) is father of \( y \), \( y \) is father of \( z \), so \( x \) is grandfather (not father) of \( z \), hence \( (x, z) \notin R \).

Answer: The relation \( R = \{ (x, y) : x \text{ is father of } y \} \) is neither reflexive, nor symmetric, nor transitive.

➕ More Examples

More Examples

Example 1

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

Solution: We check each property one by one. Reflexivity: For R to be reflexive, we need (x, x) ∈ R for every x ∈ A, meaning x must be a brother of himself. A person cannot be his own brother, so (x, x) ∉ R for any x. Hence R is NOT reflexive. Symmetry: Suppose (x, y) ∈ R, meaning x is a brother of y. Does this imply y is a brother of x? Not necessarily — y could be a sister of x (i.e., y could be female). For example, if x is the brother of y and y is a girl, then y is a sister of x, not a brother. So (y, x) ∉ R in general. Hence R is NOT symmetric. Transitivity: Suppose (x, y) ∈ R and (y, z) ∈ R, meaning x is a brother of y and y is a brother of z. Then x and z share the same parents as y, so x is also a brother of z, giving (x, z) ∈ R. Hence R IS transitive. To summarise: R is neither reflexive nor symmetric, but it is transitive.

Answer: R is not reflexive, not symmetric, but is 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 and y have the same date of birth}. Determine whether R is reflexive, symmetric, and transitive.

Solution: We check each property one by one. Reflexivity: For any student x ∈ A, x shares the same date of birth as himself, so (x, x) ∈ R for all x ∈ A. Hence R IS reflexive. Symmetry: Suppose (x, y) ∈ R, meaning x and y have the same date of birth. Then clearly y and x also have the same date of birth, so (y, x) ∈ R. Hence R IS symmetric. Transitivity: Suppose (x, y) ∈ R and (y, z) ∈ R. This means x and y have the same date of birth, and y and z have the same date of birth. Therefore x and z also have the same date of birth, giving (x, z) ∈ R. Hence R IS transitive. Since R is reflexive, symmetric, and transitive, R is an equivalence relation. To summarise: R is reflexive, symmetric, and transitive.

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

🎯 Try a Similar Question

Try a Similar Question

Question: Determine whether the relation R defined on the set A of all human beings in a town is reflexive, symmetric, and/or transitive, where R = \{(x, y) : x is an ancestor of y\}.

Solution

  1. Step 1: Check Reflexivity: A relation R is reflexive if for every element x in A, we have \( (x, x) \in R \), i.e., x must be an ancestor of itself. Since no person can be their own ancestor, \( (x, x) \notin R \) for any x in A. Therefore, R is NOT reflexive.
  2. Step 2: Check Symmetry: A relation R is symmetric if \( (x, y) \in R \) implies \( (y, x) \in R \). Suppose x is an ancestor of y. This means x lived in an earlier generation than y. Then y cannot be an ancestor of x (y is a descendant of x, not the other way around). So \( (x, y) \in R \) does NOT imply \( (y, x) \in R \). Therefore, R is NOT symmetric.
  3. Step 3: Check Transitivity: A relation R is transitive if \( (x, y) \in R \) and \( (y, z) \in R \) together imply \( (x, z) \in R \). Suppose x is an ancestor of y, and y is an ancestor of z. Since x is in an earlier generation than y, and y is in an earlier generation than z, it follows that x is also in an earlier generation than z. Therefore, x is an ancestor of z, which means \( (x, z) \in R \). Hence, R is transitive.
  4. Step 4: Conclusion: Summarising the results: R is not reflexive (no one is their own ancestor), R is not symmetric (if x is an ancestor of y, y cannot be an ancestor of x), and R is transitive (if x is an ancestor of y and y is an ancestor of z, then x is an ancestor of z). Therefore, R is only transitive.

Answer: The relation \( R = \{(x, y) : x \text{ is an ancestor of } y\} \) is neither reflexive nor symmetric, but it IS transitive.

Everything you get with Solver7

More questions in Relations and Functions