SOLVER7 Study. Nothing Else.
2026 Board Paper Q5

A relation \(R\) on set \(A =\) \(\{1, 2, 3\}\) is defined as \(R =\{(1, 3), (3, 3), (1, 1), (2, 2), (3, 1)\}\) is (A)only reflexive and symmetric (B) reflexive only (C)only reflexive and transitive (D) reflexive, symmetric and transitive

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a group of three friends: 1, 2, and 3. A relation is like a list of friendships. We check three things: does everyone like themselves? Yes — 1 likes 1, 2 likes 2, and 3 likes 3. If 1 likes 3, does 3 like 1 back? Yes! So the friendship is two-way. Finally, if 1 likes 3 and 3 likes 1, does 1 like 1? Yes again! All three rules pass, so this relation is the friendliest kind possible.

Answer: Option (D): \( R \) is reflexive, symmetric and transitive.

📖 Checking Reflexive, Symmetric and Transitive for R on {1,2,3}

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). To classify it we check three properties. Reflexive: every element must relate to itself, so \( (a,a) \in R \) for all \( a \in A \). Symmetric: whenever \( (a,b) \in R \), we must also have \( (b,a) \in R \). Transitive: whenever \( (a,b) \in R \) and \( (b,c) \in R \), we must also have \( (a,c) \in R \). We test each property against the given pairs and see which ones hold.

Formula Used

Reflexive: \( (a,a) \in R \ \forall a \in A \). Symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \). Transitive: \( (a,b) \in R,\ (b,c) \in R \Rightarrow (a,c) \in R \).

Solution

  1. Step 1: Write down the set and the relation. \[ A = \{1, 2, 3\} \] \[ R = \{(1,3),\ (3,3),\ (1,1),\ (2,2),\ (3,1)\} \]
  2. Step 2: Check reflexive. We need all of \( (1,1) \), \( (2,2) \), \( (3,3) \) to be present. All three pairs \( (1,1) \), \( (2,2) \), \( (3,3) \) are in \( R \). So \( R \) is reflexive.
  3. Step 3: Check symmetric. For each ordered pair, the reversed pair must also be in \( R \). We have \( (1,3) \in R \) and its reverse \( (3,1) \in R \). The pairs \( (3,3) \), \( (1,1) \), \( (2,2) \) are their own reverses. So every pair's reverse is present, and \( R \) is symmetric.
  4. Step 4: Check transitive. Take pairs where the second element of one matches the first element of another. From \( (1,3) \) and \( (3,1) \), we need \( (1,1) \), which is present. From \( (3,1) \) and \( (1,3) \), we need \( (3,3) \), which is present. From \( (1,3) \) and \( (3,3) \), we need \( (1,3) \), present. From \( (3,1) \) and \( (1,1) \), we need \( (3,1) \), present. Every required pair exists, so \( R \) is transitive.
  5. Step 5: Since \( R \) satisfies all three properties, it is reflexive, symmetric and transitive. This means \( R \) is an equivalence relation.

Final Answer

Option (D): \( R \) is reflexive, symmetric and transitive.

Common Mistake

A common mistake is skipping the transitive check because it looks tedious. Students often stop after seeing reflexive and symmetric hold and wrongly pick option (A). You must verify every chained pair, especially the combination of \( (1,3) \) and \( (3,1) \), which forces \( (1,1) \) and \( (3,3) \) to be present for transitivity.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and the relation. The set is \( A = \{1, 2, 3\} \) and the relation is \[ R = \{(1,3),\ (3,3),\ (1,1),\ (2,2),\ (3,1)\}. \] — Reason: Listing everything clearly before testing any property prevents confusion and missed pairs.
  2. Step 2: Check reflexivity. For \( R \) to be reflexive, every element of \( A \) must appear as a self-pair. We need \( (1,1) \), \( (2,2) \), and \( (3,3) \) to all belong to \( R \). Scanning the relation: \( (1,1) \in R \), \( (2,2) \in R \), \( (3,3) \in R \). All three self-pairs are present, so \( R \) is reflexive. — Reason: If even one self-pair were missing, reflexivity would fail immediately.
  3. Step 3: Check symmetry by verifying that the reverse of every pair is also in \( R \). The self-pairs \( (1,1) \), \( (2,2) \), \( (3,3) \) are their own reverses, so they cause no issue. For the non-trivial pairs: \( (1,3) \in R \) and its reverse \( (3,1) \in R \). \( (3,1) \in R \) and its reverse \( (1,3) \in R \). Every pair has its reverse present, so \( R \) is symmetric. — Reason: Symmetry requires us to check only the pairs whose two elements differ; self-pairs are automatically symmetric.
  4. Step 4: Check transitivity by finding every combination where the second element of one pair equals the first element of another. Consider \( (1,3) \in R \) and \( (3,1) \in R \): we need \( (1,1) \in R \). It is present. Consider \( (3,1) \in R \) and \( (1,3) \in R \): we need \( (3,3) \in R \). It is present. Consider \( (1,3) \in R \) and \( (3,3) \in R \): we need \( (1,3) \in R \). It is present. Consider \( (3,1) \in R \) and \( (1,1) \in R \): we need \( (3,1) \in R \). It is present. All chains produce pairs that are already in \( R \), so \( R \) is transitive. — Reason: Every chain of length two must be completable to a direct pair; missing even one required pair would break transitivity.
  5. Step 5: Combine the results. \( R \) passed all three tests: reflexive (all self-pairs present), symmetric (every reverse present), and transitive (every chain closes). — Reason: Only after confirming all three properties can we assign the complete classification to the relation.

Final Answer

Option (D): \( R \) is reflexive, symmetric and transitive.

Common Mistake

One common mistake: Students often forget to check transitivity for chains involving self-pairs, such as \( (1,3) \) followed by \( (3,3) \), and mistakenly conclude transitivity fails without verifying every valid combination.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \[A = \{1, 2, 3\}, \quad R = \{(1,1),\ (2,2),\ (3,3),\ (1,3),\ (3,1)\}\]
  2. Step 2: Reflexive: \((1,1),\ (2,2),\ (3,3) \in R\) — Reflexive: Yes.
  3. Step 3: Symmetric: \((1,3) \in R \Rightarrow (3,1) \in R\); diagonal pairs are self-reverse — Symmetric: Yes.
  4. Step 4: Transitive: \((1,3),(3,1) \Rightarrow (1,1) \in R\); \((3,1),(1,3) \Rightarrow (3,3) \in R\); \((1,3),(3,3) \Rightarrow (1,3) \in R\) — Transitive: Yes.

Answer: Option (D): \( R \) is reflexive, symmetric and transitive.

➕ More Examples

More Examples

Example 1

Question: A relation R on set A = \{1, 2, 3, 4\} is defined as \[R = \{(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)\}\] Determine whether R is (A) reflexive only, (B) reflexive and symmetric only, (C) reflexive and transitive only, or (D) reflexive, symmetric and transitive.

Solution: We check each property on A = \{1, 2, 3, 4\}. Reflexivity: We need (a, a) in R for all a in A. Checking: \((1,1), (2,2), (3,3), (4,4)\) are all in R. So R is reflexive. Symmetry: For every (a, b) in R, we check whether (b, a) is in R. \((1,2) \in R\) and \((2,1) \in R\) — satisfied. \((3,4) \in R\) and \((4,3) \in R\) — satisfied. All diagonal pairs are self-symmetric. So R is symmetric. Transitivity: We check all pairs (a, b) and (b, c) in R to see if (a, c) is in R. Consider \((1,2) \in R\) and \((2,1) \in R\). For transitivity, we need \((1,1) \in R\). Yes, it is present. Consider \((3,4) \in R\) and \((4,3) \in R\). We need \((3,3) \in R\). Yes, it is present. Consider \((1,2) \in R\) and \((2,2) \in R\). We need \((1,2) \in R\). Yes, it is present. Consider \((3,4) \in R\) and \((4,4) \in R\). We need \((3,4) \in R\). Yes, it is present. Consider \((2,1) \in R\) and \((1,2) \in R\). We need \((2,2) \in R\). Yes, it is present. No pair leads to a missing element. So R is transitive. Therefore, R is reflexive, symmetric and transitive, making it an equivalence relation.

Answer: (D) Reflexive, symmetric and transitive

Example 2

Question: A relation R on set A = \{1, 2, 3\} is defined as \[R = \{(1,1),(2,2),(3,3),(1,2),(2,3)\}\] Determine whether R is (A) reflexive only, (B) reflexive and symmetric only, (C) reflexive and transitive only, or (D) reflexive, symmetric and transitive.

Solution: We check each property on A = \{1, 2, 3\}. Reflexivity: We need (a, a) in R for all a in A. Checking: \((1,1), (2,2), (3,3)\) are all in R. So R is reflexive. Symmetry: For every (a, b) in R, we check whether (b, a) is in R. \((1,2) \in R\), but we need \((2,1) \in R\). Looking at R, \((2,1) \notin R\). So R is NOT symmetric. Transitivity: We check all pairs (a, b) and (b, c) in R to see if (a, c) is in R. Consider \((1,2) \in R\) and \((2,3) \in R\). For transitivity, we need \((1,3) \in R\). Looking at R, \((1,3) \notin R\). So R is NOT transitive. Therefore, R satisfies reflexivity only.

Answer: (A) Reflexive only

🎯 Try a Similar Question

Try a Similar Question

Question: A relation \( R \) on set \( A = \{1, 2, 3, 4\} \) is defined as \( R = \{(1,1), (2,2), (3,3), (4,4), (1,2), (2,3)\} \). Which of the following best describes \( R \)? (A) Reflexive only (B) Reflexive and symmetric only (C) Reflexive and transitive only (D) Reflexive, symmetric and transitive

Solution

  1. Step 1: Check Reflexivity: A relation is reflexive if \( (a, a) \in R \) for every \( a \in A \). Here \( A = \{1, 2, 3, 4\} \). We check: \( (1,1) \in R \), \( (2,2) \in R \), \( (3,3) \in R \), \( (4,4) \in R \). All four pairs are present, so \( R \) is reflexive.
  2. Step 2: Check Symmetry: A relation is symmetric if whenever \( (a, b) \in R \), then \( (b, a) \in R \). Consider the pair \( (1, 2) \in R \). For symmetry we need \( (2, 1) \in R \). But \( (2, 1) \notin R \). Therefore \( R \) is NOT symmetric.
  3. Step 3: Check Transitivity: A relation is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Consider \( (1, 2) \in R \) and \( (2, 3) \in R \). For transitivity we need \( (1, 3) \in R \). But \( (1, 3) \notin R \). Therefore \( R \) is NOT transitive.
  4. Step 4: Conclusion: Since \( R \) is reflexive but neither symmetric nor transitive, the correct answer is Option (A): Reflexive only.

Answer: Option (A): \( R \) is reflexive only.

Everything you get with Solver7

More questions in Relations and Functions