SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q23

Let \( A =\{1, 2, 3\}.\) Then show that the number of relations containing \((1,2)\) and \((2,3)\) which are reflexive and transitive but not symmetric is three.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine three friends numbered 1, 2, and 3. We want to make a list of pairs showing who is connected to whom. Two connections are already given: 1 connects to 2, and 2 connects to 3. Every person must also connect to themselves. Because 1 connects to 2 and 2 connects to 3, fairness forces 1 to also connect to 3. After all these forced connections, only a tiny number of extra optional connections keep the list fair without making it perfectly two-way. It turns out exactly 3 such lists are possible.

Answer: There are exactly three such relations: \( R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \), \( R_1 = R_0 \cup \{(2,1)\} \), and \( R_2 = R_0 \cup \{(3,2)\} \). Each is reflexive and transitive but not symmetric, so the required number of relations is \( 3 \).

📖 Counting Reflexive, Transitive but Not Symmetric Relations

Detailed Explanation

A relation \( R \) on a set \( A \) is a subset of \( A \times A \). We are given \( A = \{1, 2, 3\} \) and we must build relations that always contain \( (1,2) \) and \( (2,3) \). We need them to be reflexive and transitive but NOT symmetric. Recall the definitions. Reflexive: every element must relate to itself, so \( (1,1), (2,2), (3,3) \) must all be in \( R \). Transitive: if \( (a,b) \in R \) and \( (b,c) \in R \), then \( (a,c) \in R \). Symmetric: if \( (a,b) \in R \) then \( (b,a) \in R \); we want the relation to fail this at least once. The strategy is to first put in all the pairs we are forced to include, then check which extra pairs transitivity demands, and finally count how many valid relations exist without becoming symmetric.

Formula Used

Reflexive: \( (a,a) \in R \) for all \( a \in A \). Transitive: \( (a,b) \in R \text{ and } (b,c) \in R \Rightarrow (a,c) \in R \). Symmetric: \( (a,b) \in R \Rightarrow (b,a) \in R \).

Solution

  1. Step 1: List the pairs that MUST be present. For reflexivity we need \( (1,1), (2,2), (3,3) \). We are also told \( (1,2) \) and \( (2,3) \) must be in \( R \). So every valid relation contains at least these five pairs: \( \{(1,1),(2,2),(3,3),(1,2),(2,3)\} \).
  2. Step 2: Apply transitivity to the forced pairs. Since \( (1,2) \in R \) and \( (2,3) \in R \), transitivity forces \( (1,3) \in R \). So \( (1,3) \) must also be added. The compulsory set now becomes \( R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \).
  3. Step 3: Check whether \( R_0 \) itself is valid. It is reflexive (all three self-pairs present) and transitive (verify: \( (1,2),(2,3)\Rightarrow(1,3) \) is present; no other new chains appear). It is not symmetric because \( (1,2) \in R_0 \) but \( (2,1) \notin R_0 \). So \( R_0 \) is one valid relation.
  4. Step 4: Now try adding extra pairs from the remaining candidates \( (2,1),(3,1),(3,2) \) without making the relation symmetric and while keeping transitivity. Consider adding \( (2,1) \). Then transitivity gives: \( (2,1) \) and \( (1,2) \Rightarrow (2,2) \) (already in); \( (2,1) \) and \( (1,3) \Rightarrow (2,3) \) (already in). But we now have both \( (1,2) \) and \( (2,1) \). To avoid full symmetry we must not also be forced to add \( (3,2) \) etc. Adding only \( (2,1) \) gives \( R_1 = R_0 \cup \{(2,1)\} \). Check symmetry: \( (2,3) \in R_1 \) but \( (3,2) \notin R_1 \), so it is still NOT symmetric, and transitivity holds. So \( R_1 \) is a second valid relation.
  5. Step 5: Similarly consider adding \( (3,2) \). Then transitivity gives: \( (3,2) \) and \( (2,3) \Rightarrow (3,3) \) (present); \( (3,2) \) and \( (2,1) \) is not applicable since \( (2,1) \) is not in this relation; \( (1,3) \) and \( (3,2) \Rightarrow (1,2) \) (present). So \( R_2 = R_0 \cup \{(3,2)\} \) is transitive and reflexive. Symmetry fails because \( (1,2) \in R_2 \) but \( (2,1) \notin R_2 \). So \( R_2 \) is a third valid relation.
  6. Step 6: Check that no further relation is possible. If we add both \( (2,1) \) and \( (3,2) \), then transitivity forces \( (3,2) \) and \( (2,1) \Rightarrow (3,1) \), and then \( (2,1),(1,3)\Rightarrow(2,3) \), and combining all pairs we are forced to include \( (2,1),(3,2),(3,1) \) plus their reverses eventually give the whole \( A \times A \), which IS symmetric. Adding \( (3,1) \) alone with the others similarly collapses into symmetry. Hence no additional non-symmetric transitive reflexive relation exists beyond the three found.

Final Answer

There are exactly three such relations: \( R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \), \( R_1 = R_0 \cup \{(2,1)\} \), and \( R_2 = R_0 \cup \{(3,2)\} \). Each is reflexive and transitive but not symmetric, so the required number of relations is \( 3 \).

Common Mistake

A common mistake is forgetting that transitivity forces \( (1,3) \) into the relation once \( (1,2) \) and \( (2,3) \) are present, or failing to verify transitivity after adding an extra pair. Students also often miscount by adding pairs that quietly make the relation symmetric (e.g. adding both \( (2,1) \) and \( (3,2) \)), which violates the 'not symmetric' condition.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Collect the compulsory pairs from reflexivity: For a relation on \( A = \{1, 2, 3\} \) to be reflexive, it must contain \( (1,1) \), \( (2,2) \), and \( (3,3) \). The problem also tells us \( (1,2) \) and \( (2,3) \) must be present. So every candidate relation contains at least these five pairs: \[ \{(1,1),\,(2,2),\,(3,3),\,(1,2),\,(2,3)\} \] Reason: Reflexivity and the given conditions pin down a fixed starting set before we do anything else.
  2. Step 2: Apply transitivity to find any forced additional pairs: Since \( (1,2) \in R \) and \( (2,3) \in R \), transitivity forces \( (1,3) \in R \). No other new forced pairs arise from the current set (check: \( (1,3) \) combined with existing pairs does not produce a pair outside \( A \times A \) that is missing). The minimal compulsory base is therefore \[ R_0 = \{(1,1),\,(2,2),\,(3,3),\,(1,2),\,(2,3),\,(1,3)\} \] Reason: Every transitive relation must close under chaining; we cannot add \( (1,2) \) and \( (2,3) \) without also including \( (1,3) \).
  3. Step 3: List the remaining candidate pairs that could optionally be added: The full set \( A \times A \) has 9 pairs. Removing the 6 already in \( R_0 \), the three pairs not yet included are \( (2,1) \), \( (3,1) \), and \( (3,2) \). Each of these may or may not appear in a valid relation, giving us candidates to check one by one. Reason: We need to know which optional pairs keep reflexivity and transitivity intact while avoiding symmetry.
  4. Step 4: Check what adding (3,1) forces via transitivity: If \( (3,1) \in R \), then because \( (1,2) \in R \) transitivity demands \( (3,2) \in R \), and because \( (1,3) \in R \) and \( (3,1) \in R \), transitivity demands \( (1,1) \in R \) (already there). Also \( (3,2) \in R \) and \( (2,3) \in R \) force \( (3,3) \in R \) (already there), but \( (2,3) \in R \) and \( (3,1) \in R \) force \( (2,1) \in R \). So adding \( (3,1) \) pulls in both \( (3,2) \) and \( (2,1) \), making \( R \) the full \( A \times A \), which is symmetric. This violates the non-symmetry requirement, so no valid relation can contain \( (3,1) \). Reason: Transitivity creates a chain reaction that forces symmetry, so this option is eliminated.
  5. Step 5: Check what adding (2,1) alone forces: Add only \( (2,1) \) to \( R_0 \). Check transitivity: \( (2,1) \in R \) and \( (1,2) \in R \) give \( (2,2) \in R \) (already present); \( (2,1) \in R \) and \( (1,3) \in R \) give \( (2,3) \in R \) (already present). No new pair is forced. Call this relation \[ R_1 = R_0 \cup \{(2,1)\} \] Is it symmetric? \( (1,2) \in R_1 \) but \( (2,1) \in R_1 \); \( (2,3) \in R_1 \) but \( (3,2) \notin R_1 \). Not fully symmetric. Valid! Reason: \( R_1 \) is reflexive, transitive, and not symmetric, so it qualifies.
  6. Step 6: Check what adding (3,2) alone forces: Add only \( (3,2) \) to \( R_0 \). Check transitivity: \( (3,2) \in R \) and \( (2,3) \in R \) give \( (3,3) \in R \) (already present); \( (3,2) \in R \) and \( (2,1) \notin R \), so no new pair appears there. No additional pair is forced. Call this relation \[ R_2 = R_0 \cup \{(3,2)\} \] Is it symmetric? \( (2,3) \in R_2 \) but \( (3,2) \in R_2 \); however \( (1,2) \in R_2 \) but \( (2,1) \notin R_2 \). Not fully symmetric. Valid! Reason: \( R_2 \) is reflexive, transitive, and not symmetric, so it qualifies.
  7. Step 7: Verify R0 itself and compile the final count: The base relation \( R_0 \) alone: reflexive (all diagonal pairs present), transitive (verified in Step 2), and symmetric? \( (1,2) \in R_0 \) but \( (2,1) \notin R_0 \), so not symmetric. Valid! Adding both \( (2,1) \) and \( (3,2) \) together to \( R_0 \): transitivity then forces \( (3,1) \) (since \( (3,2) \in R \) and \( (2,1) \in R \)), which by Step 4 leads to full \( A \times A \), which is symmetric — invalid. The valid relations are exactly \( R_0 \), \( R_1 \), and \( R_2 \), giving a total count of \( 3 \). Reason: Systematically checking every subset of optional pairs ensures we neither miss a valid relation nor count an invalid one.

Final Answer

There are exactly three such relations: \( R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \), \( R_1 = R_0 \cup \{(2,1)\} \), and \( R_2 = R_0 \cup \{(3,2)\} \). Each is reflexive and transitive but not symmetric, so the required number of relations is \( 3 \).

Common Mistake

One common mistake: students forget that adding an optional pair like \( (3,1) \) can trigger a chain of transitive closures that forces the relation to become fully symmetric — always re-check all transitivity consequences before accepting an optional pair.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Build the compulsory core: Reflexivity forces \( (1,1),(2,2),(3,3) \in R \); given pairs are \( (1,2),(2,3) \in R \); transitivity of \( (1,2) \) and \( (2,3) \) forces \( (1,3) \in R \). So \( R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \) is in every valid relation.
  2. Step 2: Identify optional pairs: Remaining pairs from \( A \times A \) not yet in \( R_0 \): \( (2,1),(3,1),(3,2) \). Adding \( (3,1) \) alone forces \( (2,1) \) (via \( (2,3),(3,1) \)) and \( (3,2) \) (via \( (3,1),(1,2) \)), making \( R \) symmetric — invalid. Adding both \( (2,1) \) and \( (3,2) \) together makes \( R \) symmetric — invalid.
  3. Step 3: Count valid non-symmetric extensions: Adding \( (2,1) \) alone: check transitivity — no new pairs forced; \( (1,2)\in R \) but \( (2,1)\in R \) does not make all pairs symmetric since \( (2,3)\in R \) but \( (3,2)\notin R \). Valid. Adding \( (3,2) \) alone: \( (3,2) \) and \( (2,3) \) give \( (3,3) \) (already in); \( (1,2) \) and \( (2,3) \) and \( (3,2) \) give no new forced pairs; not symmetric since \( (2,3)\in R \) but \( (3,2)\in R \) while \( (2,1)\notin R \). Valid. So valid relations: \( R_0 \), \( R_0 \cup \{(2,1)\} \), \( R_0 \cup \{(3,2)\} \).

Answer: There are exactly three such relations: \( R_0 = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \), \( R_1 = R_0 \cup \{(2,1)\} \), and \( R_2 = R_0 \cup \{(3,2)\} \). Each is reflexive and transitive but not symmetric, so the required number of relations is \( 3 \).

➕ More Examples

More Examples

Example 1

Question: Let \( A = \{1, 2, 3\} \). Find the number of relations on \( A \) that contain the pairs \( (1,3) \) and \( (3,2) \), and are reflexive and transitive but NOT symmetric.

Solution: We work on the set \( A = \{1, 2, 3\} \). Step 1 — Mandatory pairs from reflexivity: Every reflexive relation must contain \( (1,1),\, (2,2),\, (3,3) \). Step 2 — Mandatory pairs from the given pairs: We are told \( (1,3) \in R \) and \( (3,2) \in R \). By transitivity, since \( (1,3) \in R \) and \( (3,2) \in R \), we must also have \( (1,2) \in R \). So the minimum mandatory set is: \[ R_{\min} = \{(1,1),(2,2),(3,3),(1,3),(3,2),(1,2)\} \] Step 3 — Optional pairs to consider: The remaining pairs not yet forced in or out are \( (2,1),(2,3),(3,1) \) and their effect on transitivity. We now list all possible extensions that keep transitivity: Case 1: No optional pair added. \[ R_1 = \{(1,1),(2,2),(3,3),(1,2),(1,3),(3,2)\} \] Check transitivity: All chains close. Check symmetry: \( (1,3) \in R_1 \) but \( (3,1) \notin R_1 \), so NOT symmetric. Valid. Case 2: Add \( (2,1) \). With \( (2,1) \in R \) and \( (1,3) \in R \), transitivity forces \( (2,3) \). With \( (2,3) \in R \) and \( (3,2) \in R \), transitivity forces \( (2,2) \) (already present) and \( (3,3) \) (already present). With \( (3,2) \in R \) and \( (2,1) \in R \), transitivity forces \( (3,1) \). With \( (3,1) \in R \) and \( (1,3) \in R \), forces \( (3,3) \) (already present). With \( (1,2) \in R \) and \( (2,1) \in R \), forces \( (1,1) \) (present). With \( (2,1) \in R \) and \( (1,2) \in R \), forces \( (2,2) \) (present). So: \[ R_2 = \{(1,1),(2,2),(3,3),(1,2),(1,3),(2,1),(2,3),(3,1),(3,2)\} \] This is the universal relation — it IS symmetric. Discard. Case 3: Add \( (2,3) \) only (without \( (2,1) \)). With \( (2,3) \in R \) and \( (3,2) \in R \), forces \( (2,2) \) (present) and \( (3,3) \) (present). No new pairs forced. Relation: \[ R_3 = \{(1,1),(2,2),(3,3),(1,2),(1,3),(2,3),(3,2)\} \] Check symmetry: \( (1,2) \in R_3 \) but \( (2,1) \notin R_3 \). NOT symmetric. Valid. Case 4: Add \( (3,1) \) only (without \( (2,1) \)). With \( (3,1) \in R \) and \( (1,3) \in R \), forces \( (3,3) \) (present). With \( (3,1) \in R \) and \( (1,2) \in R \), forces \( (3,2) \) (present). With \( (1,3) \in R \) and \( (3,1) \in R \), forces \( (1,1) \) (present). No new pairs. Relation: \[ R_4 = \{(1,1),(2,2),(3,3),(1,2),(1,3),(3,1),(3,2)\} \] Check symmetry: \( (1,2) \in R_4 \) but \( (2,1) \notin R_4 \). NOT symmetric. Valid. Case 5: Add both \( (2,3) \) and \( (3,1) \) (but not \( (2,1) \)). With \( (2,3) \) and \( (3,1) \), transitivity forces \( (2,1) \). This reduces to Case 2 (the full relation), which is symmetric. Discard. Case 6: Add both \( (2,1) \) and \( (3,1) \) — already shown in Case 2 to produce the full relation. Discard. Step 4 — Count valid relations: \( R_1,\, R_3,\, R_4 \) — exactly THREE relations.

Answer: There are exactly 3 relations on \( A = \{1,2,3\} \) containing \( (1,3) \) and \( (3,2) \) that are reflexive and transitive but not symmetric.

Example 2

Question: Let \( B = \{a, b, c\} \). How many relations on \( B \) contain the pairs \( (a,b) \) and \( (b,c) \) and are reflexive and transitive but NOT symmetric? List all such relations explicitly.

Solution: Step 1 — Mandatory reflexive pairs: \( (a,a),\,(b,b),\,(c,c) \). Step 2 — Mandatory pairs from the given and transitivity: Given \( (a,b) \in R \) and \( (b,c) \in R \), transitivity forces \( (a,c) \in R \). Minimum set: \[ R_{\min} = \{(a,a),(b,b),(c,c),(a,b),(b,c),(a,c)\} \] Step 3 — Optional pairs: The remaining pairs not yet assigned are \( (b,a),(c,b),(c,a) \). We examine all subsets of these three optional pairs for transitivity closure: Case 1: Add none. \[ R_1 = \{(a,a),(b,b),(c,c),(a,b),(b,c),(a,c)\} \] Transitivity: All compositions are already covered. Symmetry check: \( (a,b) \in R_1 \) but \( (b,a) \notin R_1 \). NOT symmetric. Valid. Case 2: Add \( (b,a) \) only. With \( (b,a) \) and \( (a,b) \): forces \( (b,b) \) (present). With \( (b,a) \) and \( (a,c) \): forces \( (b,c) \) (present). With \( (c,c) \) and \( (b,a) \): no new. No further forcing. Relation: \[ R_2 = \{(a,a),(b,b),(c,c),(a,b),(b,c),(a,c),(b,a)\} \] Symmetry check: \( (b,c) \in R_2 \) but \( (c,b) \notin R_2 \). NOT symmetric. Valid. Case 3: Add \( (c,b) \) only. With \( (c,b) \) and \( (b,c) \): forces \( (c,c) \) (present). With \( (c,b) \) and \( (b,a) \): \( (b,a) \) is not present, so no forcing here. With \( (a,b) \) and... no new chain yet. No further forced pairs. \[ R_3 = \{(a,a),(b,b),(c,c),(a,b),(b,c),(a,c),(c,b)\} \] Symmetry: \( (a,b) \in R_3 \) but \( (b,a) \notin R_3 \). NOT symmetric. Valid. Case 4: Add \( (c,a) \) only. With \( (c,a) \) and \( (a,b) \): forces \( (c,b) \). Now \( (c,b) \) forces Case 3 conditions. With \( (c,b) \) and \( (b,c) \): forces \( (c,c) \) (present). With \( (c,a) \) and \( (a,c) \): forces \( (c,c) \) (present). So adding \( (c,a) \) forces \( (c,b) \) as well. \[ R_4 = \{(a,a),(b,b),(c,c),(a,b),(b,c),(a,c),(c,a),(c,b)\} \] Symmetry: \( (a,b) \in R_4 \) but \( (b,a) \notin R_4 \). NOT symmetric. Valid. Case 5: Add \( (b,a) \) and \( (c,b) \). With \( (c,b) \) and \( (b,a) \): forces \( (c,a) \). With \( (c,a) \) and \( (a,b) \): forces \( (c,b) \) (present). With \( (b,a) \) and \( (a,c) \): forces \( (b,c) \) (present). With \( (c,a) \) and \( (a,c) \): forces \( (c,c) \) (present). \[ R_5 = \{(a,a),(b,b),(c,c),(a,b),(b,c),(a,c),(b,a),(c,b),(c,a)\} \] This is the full relation on \( B \) — it IS symmetric. Discard. Case 6: Add \( (b,a) \) and \( (c,a) \). Adding \( (c,a) \) forces \( (c,b) \) (from Case 4). So this becomes Case 5 — the full relation. Discard. Case 7: Add \( (c,b) \) and \( (c,a) \) — same as Case 4 since adding \( (c,a) \) already forces \( (c,b) \). Reduces to \( R_4 \). Already counted. Case 8: Add all three \( (b,a),(c,b),(c,a) \) — full relation. Discard. Step 4 — Count valid relations: \( R_1,\, R_2,\, R_3,\, R_4 \) are the four valid reflexive-transitive-but-not-symmetric relations. Wait — let us recount carefully to ensure we have not missed any subset: Subsets of \( \{(b,a),(c,b),(c,a)\} \): \( \emptyset \to R_1 \) (valid), \( \{(b,a)\} \to R_2 \) (valid), \( \{(c,b)\} \to R_3 \) (valid), \( \{(c,a)\} \to R_4 \) (valid, forces \( (c,b) \)), \( \{(b,a),(c,b)\} \to \) forces \( (c,a) \), gives full relation (symmetric, discard), \( \{(b,a),(c,a)\} \to \) forces \( (c,b) \), gives full relation (discard), \( \{(c,b),(c,a)\} \to R_4 \) (already counted), \( \{(b,a),(c,b),(c,a)\} \to \) full relation (discard). So the distinct valid relations are \( R_1, R_2, R_3, R_4 \) — exactly FOUR relations.

Answer: There are exactly 4 relations on \( B = \{a,b,c\} \) containing \( (a,b) \) and \( (b,c) \) that are reflexive and transitive but not symmetric.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( A = \{1, 2, 3\} \). Find the number of relations on \( A \) that contain the pairs \( (1, 2) \) and \( (2, 2) \), and are reflexive and transitive but NOT symmetric. List all such relations explicitly.

Solution

  1. Step 1: Identify the mandatory pairs: Any relation on \( A \) we consider must contain the pairs \( (1,2) \) and \( (2,2) \). Since the relation must also be reflexive, it must contain \( (1,1) \), \( (2,2) \), and \( (3,3) \). So the minimum required set of pairs so far is \( \{(1,1),(2,2),(3,3),(1,2)\} \).
  2. Step 2: Check transitivity of the minimum set: Start with \( R_0 = \{(1,1),(2,2),(3,3),(1,2)\} \). Check every pair \( (a,b) \in R_0 \) and \( (b,c) \in R_0 \): the only non-trivial chain is \( (1,2) \) and \( (2,2) \), giving \( (1,2) \) which is already present. So \( R_0 \) is transitive.
  3. Step 3: Check symmetry of R0: \( R_0 \) contains \( (1,2) \) but not \( (2,1) \), so \( R_0 \) is NOT symmetric. Hence \( R_0 \) qualifies as a reflexive, transitive, non-symmetric relation.
  4. Step 4: Consider adding (2,1): Let \( R_1 = R_0 \cup \{(2,1)\} = \{(1,1),(2,2),(3,3),(1,2),(2,1)\} \). Check transitivity: \( (2,1) \in R_1 \) and \( (1,2) \in R_1 \) gives \( (2,2) \) — already present. Also \( (1,2) \in R_1 \) and \( (2,1) \in R_1 \) gives \( (1,1) \) — already present. So \( R_1 \) is transitive. Now check symmetry: \( R_1 \) contains both \( (1,2) \) and \( (2,1) \), but it does NOT contain \( (3,1) \), \( (3,2) \), \( (1,3) \), or \( (2,3) \), so all diagonal and present pairs are symmetric among themselves. In fact \( R_1 \) IS symmetric (every pair \( (a,b) \) in \( R_1 \) has \( (b,a) \) also in \( R_1 \)). So \( R_1 \) does NOT qualify (it is symmetric).
  5. Step 5: Consider adding (1,3): Let \( R_2 = R_0 \cup \{(1,3)\} = \{(1,1),(2,2),(3,3),(1,2),(1,3)\} \). Check transitivity: no new chains are forced since there is no pair \( (3,x) \) other than \( (3,3) \). So \( R_2 \) is transitive. It contains \( (1,2) \) but not \( (2,1) \), and contains \( (1,3) \) but not \( (3,1) \), so \( R_2 \) is NOT symmetric. \( R_2 \) qualifies.
  6. Step 6: Consider adding (3,1): Let \( R_3 = R_0 \cup \{(3,1)\} = \{(1,1),(2,2),(3,3),(1,2),(3,1)\} \). Check transitivity: \( (3,1) \in R_3 \) and \( (1,2) \in R_3 \) forces \( (3,2) \). Add \( (3,2) \): now check again — \( (3,2) \) and \( (2,2) \) gives \( (3,2) \), already present. So the closed relation is \( R_3' = \{(1,1),(2,2),(3,3),(1,2),(3,1),(3,2)\} \). Check symmetry: \( (1,2) \in R_3' \) but \( (2,1) \notin R_3' \), so NOT symmetric. \( R_3' \) qualifies.
  7. Step 7: Consider adding (2,3): Let \( R_4 = R_0 \cup \{(2,3)\} = \{(1,1),(2,2),(3,3),(1,2),(2,3)\} \). Check transitivity: \( (1,2) \in R_4 \) and \( (2,3) \in R_4 \) forces \( (1,3) \). Add \( (1,3) \): no further forced pairs. So the transitively closed set is \( R_4' = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \). Check symmetry: \( (1,2) \in R_4' \) but \( (2,1) \notin R_4' \), so NOT symmetric. \( R_4' \) qualifies.
  8. Step 8: Verify no other independent additions lead to new qualifying relations: Any other pair from \( A \times A \) not yet considered — such as \( (3,2) \) alone, \( (2,1) \) alone, \( (3,1) \) alone — either force additional pairs (already handled above) or produce symmetric relations. Combining the above additions in all subsets either duplicates existing relations or forces symmetry. After exhaustive check, the distinct qualifying relations are: \( R_0 = \{(1,1),(2,2),(3,3),(1,2)\} \), \( R_2 = \{(1,1),(2,2),(3,3),(1,2),(1,3)\} \), \( R_3' = \{(1,1),(2,2),(3,3),(1,2),(3,1),(3,2)\} \), and \( R_4' = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \).
  9. Step 9: Count the qualifying relations: We have found exactly four distinct relations on \( A \) that contain \( (1,2) \) and \( (2,2) \), are reflexive and transitive, but are NOT symmetric. Therefore, the required number of relations is \( 4 \).

Answer: There are exactly four such relations: \( R_0 = \{(1,1),(2,2),(3,3),(1,2)\} \), \( R_2 = \{(1,1),(2,2),(3,3),(1,2),(1,3)\} \), \( R_3' = \{(1,1),(2,2),(3,3),(1,2),(3,1),(3,2)\} \), and \( R_4' = \{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\} \). Each is reflexive and transitive but not symmetric, so the required number of relations is \( 4 \).

Everything you get with Solver7

More questions in Relations and Functions