SOLVER7 Study. Nothing Else.
2026 Board Paper Q23(b)

A relation \(R\) on \(A=\{1,2,3\}\) is defined as \(R=\{(1, 1) (3, 3), (1, 2)\}.\) Is \(R\) a symmetric relation ? Justify. Write the smallest relation set \(R_1\) such that \(R\cup R_1\)becomes an equivalence relation on the set \(\{1,2,3\}.\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine sending a birthday card to a friend. If you send one to them, but they never send one back, that is not a two-way friendship — it is one-sided. A symmetric relation is like a two-way friendship: every card sent must come back. Here, the pair \( (1,2) \) is in the relation, but \( (2,1) \) is missing, so the relation is not symmetric. Adding the pair \( (2,2) \) and \( (2,1) \) fixes everything, making the relation perfectly balanced and complete.

Answer: \( R \) is NOT symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). The smallest relation is \( R_1 = \{(2,2),\ (2,1)\} \), giving \( R \cup R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \), which is an equivalence relation on \( \{1,2,3\} \).

📖 Symmetry Check and Building an Equivalence Relation

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). Three key properties are: Reflexive means \( (a,a) \in R \) for every \( a \in A \). Symmetric means whenever \( (a,b) \in R \), then \( (b,a) \in R \) too. Transitive means whenever \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). A relation that is reflexive, symmetric and transitive all at once is called an equivalence relation. To answer this question we first test symmetry, then add the minimum number of pairs needed to fix all three properties for the set \( \{1,2,3\} \).

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 \text{ and } (b,c) \in R \Rightarrow (a,c) \in R \).

Solution

  1. Step 1: Write down the given relation clearly. \[ R = \{(1,1),\ (3,3),\ (1,2)\} \] on the set \( A = \{1,2,3\} \).
  2. Step 2: Test symmetry. For symmetry, every pair \( (a,b) \) must have its reverse \( (b,a) \) present. Here \( (1,2) \in R \), but \( (2,1) \notin R \).
  3. Step 3: Conclude about symmetry. Since \( (1,2) \in R \) while \( (2,1) \notin R \), the condition fails. Therefore \( R \) is NOT a symmetric relation.
  4. Step 4: Now find the smallest set \( R_1 \) so that \( R \cup R_1 \) is an equivalence relation on \( \{1,2,3\} \). We must make the union reflexive, symmetric and transitive. Check reflexivity: we need \( (1,1), (2,2), (3,3) \). We already have \( (1,1) \) and \( (3,3) \); the pair \( (2,2) \) is missing, so it must be added.
  5. Step 5: Check symmetry needs. We have \( (1,2) \) but not \( (2,1) \), so \( (2,1) \) must be added to make the relation symmetric.
  6. Step 6: Check transitivity. After adding \( (2,1) \) and \( (2,2) \), the relevant pairs are \( (1,1),(2,2),(3,3),(1,2),(2,1) \). Test: \( (1,2) \) and \( (2,1) \Rightarrow (1,1) \) present; \( (2,1) \) and \( (1,2) \Rightarrow (2,2) \) present. Element \( 3 \) relates only to itself, so no new pairs are forced. Transitivity holds without adding anything more.
  7. Step 7: Collect only the pairs we actually added. These are \( (2,2) \) and \( (2,1) \). Hence the smallest set is \[ R_1 = \{(2,2),\ (2,1)\}. \] Then \[ R \cup R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \] which is reflexive, symmetric and transitive, i.e. an equivalence relation.

Final Answer

\( R \) is NOT symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). The smallest relation is \( R_1 = \{(2,2),\ (2,1)\} \), giving \( R \cup R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \), which is an equivalence relation on \( \{1,2,3\} \).

Common Mistake

A common mistake is to add extra pairs like \( (1,3) \) or \( (3,1) \), thinking every element must relate to every other. This makes \( R_1 \) larger than necessary. Since \( 3 \) only appears with itself, no pairs linking \( 3 \) to \( 1 \) or \( 2 \) are required, and we must add the minimum only.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the given relation and the set. The relation on \( A = \\{1,2,3\\} \) is \[ R = \\{(1,1),\\ (3,3),\\ (1,2)\\}. \] — Reason: Listing everything explicitly prevents us from missing any pair when checking the three properties.
  2. Step 2: Test symmetry. Look at every pair \( (a,b) \in R \) and check whether \( (b,a) \) also belongs to \( R \). The pair \( (1,2) \in R \), but searching \( R \) shows \( (2,1) \notin R \). — Reason: Symmetry requires the reverse of every pair to be present; finding even one counterexample is enough to declare the property fails.
  3. Step 3: Conclude on symmetry. Because \( (1,2) \in R \) while \( (2,1) \notin R \), the symmetry condition is violated, so \( R \) is NOT a symmetric relation. — Reason: This directly answers the first part of the question before moving on to construct the equivalence relation.
  4. Step 4: Check reflexivity of \( R \). For \( A = \\{1,2,3\\} \) we need \( (1,1),(2,2),(3,3) \) all inside the final relation. Currently \( R \) contains \( (1,1) \) and \( (3,3) \) but is missing \( (2,2) \). — Reason: Identifying the missing reflexive pairs tells us what must be added to achieve reflexivity.
  5. Step 5: Fix symmetry. The only asymmetric pair in \( R \) is \( (1,2) \), so we must add its reverse \( (2,1) \). — Reason: Adding the minimum reverses keeps \( R_1 \) as small as possible.
  6. Step 6: Collect all pairs needed in \( R_1 \). From Step 4 we need \( (2,2) \); from Step 5 we need \( (2,1) \). No other pair from \( A \times A \) is missing. Therefore \[ R_1 = \\{(2,2),\\ (2,1)\\}. \] — Reason: Combining both requirements into a single minimal set gives the smallest possible addition.
  7. Step 7: Form the union and verify transitivity. \[ R \cup R_1 = \\{(1,1),(2,2),(3,3),(1,2),(2,1)\\}. \] Check all transitive chains: \( (2,1) \in R\cup R_1 \) and \( (1,2) \in R\cup R_1 \) gives \( (2,2) \) — already present. \( (1,2) \in R\cup R_1 \) and \( (2,1) \in R\cup R_1 \) gives \( (1,1) \) — already present. No chain is broken. — Reason: Transitivity must be verified after every addition because new pairs can create new chains that may need further pairs.
  8. Step 8: Confirm all three properties hold for \( R \cup R_1 \). Reflexive: \( (1,1),(2,2),(3,3) \) all present. Symmetric: every pair has its reverse present. Transitive: verified in Step 7. Hence \( R \cup R_1 \) is an equivalence relation on \( \\{1,2,3\\} \). — Reason: A final checklist ensures no property was accidentally overlooked.

Final Answer

\( R \) is NOT symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). The smallest relation is \( R_1 = \{(2,2),\ (2,1)\} \), giving \( R \cup R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \), which is an equivalence relation on \( \{1,2,3\} \).

Common Mistake

One common mistake: students add only \( (2,1) \) to fix symmetry but forget to include \( (2,2) \) for reflexivity, leaving the union non-reflexive and therefore not an equivalence relation.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Given: \[ R = \{(1,1),\ (3,3),\ (1,2)\} \] on \( A = \{1,2,3\} \). Since \( (1,2) \in R \) but \( (2,1) \notin R \), \( R \) is NOT symmetric.
  2. Step 2: Missing for reflexivity: \( (2,2) \). Missing for symmetry: \( (2,1) \). So \( R_1 = \{(2,2),\ (2,1)\} \).
  3. Step 3: Transitivity check on \( R \cup R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \): \( (1,2),(2,1) \Rightarrow (1,1) \in R \cup R_1 \) and \( (2,1),(1,2) \Rightarrow (2,2) \in R \cup R_1 \). No new pairs needed.

Answer: \( R \) is NOT symmetric because \( (1,2) \in R \) but \( (2,1) \notin R \). The smallest relation is \( R_1 = \{(2,2),\ (2,1)\} \), giving \( R \cup R_1 = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \), which is an equivalence relation on \( \{1,2,3\} \).

➕ More Examples

More Examples

Example 1

Question: A relation R on A = \{1, 2, 3, 4\} is defined as \[R = \{(1,1),\ (2,2),\ (3,3),\ (2,3)\}.\] (i) Is R symmetric? Justify your answer. (ii) Find the smallest relation \(R_1\) such that \(R \cup R_1\) is an equivalence relation on A = \{1, 2, 3, 4\}.

Solution: Step 1 — Check Reflexivity of R. For R to be reflexive, we need \((a, a) \in R\) for every \(a \in A\). We have \((1,1), (2,2), (3,3) \in R\) but \((4,4) \notin R\). So R is NOT reflexive. Step 2 — Check Symmetry of R. R contains \((2, 3)\). For symmetry we need \((3, 2) \in R\), but \((3,2) \notin R\). Hence R is NOT symmetric. Step 3 — Find the smallest \(R_1\) so that \(R \cup R_1\) is an equivalence relation. We need to repair reflexivity, symmetry, and transitivity one step at a time. Repair reflexivity: Add \((4,4)\) because it is the only missing diagonal pair. Repair symmetry: \((2,3) \in R\), so add \((3,2)\). Check transitivity after the above additions: The pairs involving 2 and 3 are \((2,3)\) and \((3,2)\). Using \((2,3)\) and \((3,2)\) gives \((2,2)\) — already present. Using \((3,2)\) and \((2,3)\) gives \((3,3)\) — already present. No new pairs are required for transitivity. Therefore the smallest relation is \[R_1 = \{(4,4),\ (3,2)\}.\] Verification: \(R \cup R_1 = \{(1,1),(2,2),(3,3),(4,4),(2,3),(3,2)\}\). Reflexive: \((1,1),(2,2),(3,3),(4,4)\) — all present. ✓ Symmetric: \((2,3)\) and \((3,2)\) both present; all diagonal pairs are self-symmetric. ✓ Transitive: The only non-diagonal pairs are \((2,3)\) and \((3,2)\). Composing \((2,3)\) then \((3,2)\) gives \((2,2)\) ✓; composing \((3,2)\) then \((2,3)\) gives \((3,3)\) ✓. No violation. ✓ Hence \(R \cup R_1\) is an equivalence relation.

Answer: R is not symmetric because \((2,3) \in R\) but \((3,2) \notin R\). The smallest relation is \(R_1 = \{(4,4),\ (3,2)\}\).

Example 2

Question: A relation R on A = \{1, 2, 3\} is defined as \[R = \{(1,1),\ (2,2),\ (1,3),\ (3,1)\}.\] (i) Is R symmetric? Justify your answer. (ii) Find the smallest relation \(R_1\) such that \(R \cup R_1\) is an equivalence relation on A.

Solution: Step 1 — Check Reflexivity of R. For R to be reflexive, \((a,a)\) must belong to R for every \(a \in A = \{1,2,3\}\). We see \((1,1)\) and \((2,2)\) are in R, but \((3,3) \notin R\). Hence R is NOT reflexive. Step 2 — Check Symmetry of R. For symmetry, whenever \((a,b) \in R\) we need \((b,a) \in R\). The non-diagonal pairs are \((1,3)\) and \((3,1)\). Since both are present, the symmetry condition is satisfied for these pairs. The diagonal pairs are trivially symmetric. Hence R IS symmetric. Step 3 — Find the smallest \(R_1\) so that \(R \cup R_1\) is an equivalence relation. Repair reflexivity: \((3,3)\) is the only missing diagonal pair. Add \((3,3)\). Check transitivity after adding \((3,3)\): The current set becomes \(\{(1,1),(2,2),(3,3),(1,3),(3,1)\}\). Now check all compositions: Using \((1,3)\) and \((3,1)\): gives \((1,1)\) — already present. ✓ Using \((3,1)\) and \((1,3)\): gives \((3,3)\) — already present. ✓ Using \((1,3)\) and \((3,3)\): gives \((1,3)\) — already present. ✓ Using \((3,3)\) and \((3,1)\): gives \((3,1)\) — already present. ✓ No additional pairs are needed for transitivity. Therefore the smallest relation is \[R_1 = \{(3,3)\}.\] Verification: \(R \cup R_1 = \{(1,1),(2,2),(3,3),(1,3),(3,1)\}\). Reflexive: \((1,1),(2,2),(3,3)\) all present. ✓ Symmetric: \((1,3)\) and \((3,1)\) both present; diagonal pairs are self-symmetric. ✓ Transitive: Verified above — no violation. ✓ Hence \(R \cup R_1\) is an equivalence relation. Note: Under this equivalence relation, 1 and 3 are in the same equivalence class, while 2 is in its own class. The equivalence classes are \(\{1,3\}\) and \(\{2\}\).

Answer: R is symmetric because for every \((a,b) \in R\) we have \((b,a) \in R\). The smallest relation is \(R_1 = \{(3,3)\}\).

🎯 Try a Similar Question

Try a Similar Question

Question: A relation \( R \) on the set \( A = \{1, 2, 3\} \) is defined as \( R = \{(1,1),\ (2,2),\ (2,3)\} \). (i) Is \( R \) a symmetric relation? Justify your answer. (ii) Find the smallest relation \( R_1 \) such that \( R \cup R_1 \) is an equivalence relation on \( A \).

Solution

  1. Step 1: Check Symmetry of R: A relation is symmetric if for every \( (a, b) \in R \), we also have \( (b, a) \in R \). Examine the pairs in \( R = \{(1,1),\ (2,2),\ (2,3)\} \). The pair \( (2, 3) \in R \), but \( (3, 2) \notin R \). Therefore, \( R \) is NOT symmetric.
  2. Step 2: Check Reflexivity of R: For reflexivity, we need \( (a, a) \in R \) for all \( a \in A = \{1, 2, 3\} \). We have \( (1,1) \in R \) and \( (2,2) \in R \), but \( (3,3) \notin R \). So \( R \) is also not reflexive.
  3. Step 3: Identify Pairs Needed for Reflexivity: To make the relation reflexive, we must add \( (3, 3) \) since \( (1,1) \) and \( (2,2) \) are already present. So \( R_1 \) must contain \( (3, 3) \).
  4. Step 4: Identify Pairs Needed for Symmetry: Since \( (2, 3) \in R \) but \( (3, 2) \notin R \), we must add \( (3, 2) \) to restore symmetry. So \( R_1 \) must also contain \( (3, 2) \).
  5. Step 5: Check Transitivity of R ∪ R₁: After adding \( (3,3) \) and \( (3,2) \), the combined relation is \( R \cup R_1 = \{(1,1),\ (2,2),\ (3,3),\ (2,3),\ (3,2)\} \). Check all pairs for transitivity: \( (2,3) \in R \cup R_1 \) and \( (3,2) \in R \cup R_1 \) gives \( (2,2) \in R \cup R_1 \). Also \( (3,2) \in R \cup R_1 \) and \( (2,3) \in R \cup R_1 \) gives \( (3,3) \in R \cup R_1 \). No other transitivity conditions are violated, so the relation is transitive.
  6. Step 6: State the Final Answer: The smallest relation is \( R_1 = \{(3,3),\ (3,2)\} \). The combined relation \( R \cup R_1 = \{(1,1),\ (2,2),\ (3,3),\ (2,3),\ (3,2)\} \) is reflexive, symmetric, and transitive, hence it is an equivalence relation on \( A = \{1,2,3\} \).

Answer: \( R \) is NOT symmetric because \( (2,3) \in R \) but \( (3,2) \notin R \). The smallest relation is \( R_1 = \{(3,3),\ (3,2)\} \), giving \( R \cup R_1 = \{(1,1),\ (2,2),\ (3,3),\ (2,3),\ (3,2)\} \), which is an equivalence relation on \( \{1,2,3\} \).

Everything you get with Solver7

More questions in Relations and Functions