SOLVER7 Study. Nothing Else.
Exercise 1.1 Q10(i)

Give an example of a relation. Which is Symmetric but neither reflexive nor transitive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have three friends numbered 1, 2, and 3. A relation is like a list of "who likes who." Our list says: 1 likes 2, and 2 likes 1. That is symmetric, like a mutual friendship. But 1 does not like itself, so it is not reflexive. Also, since 1 likes 2 and 2 likes 1, we would need 1 to like 1 for transitivity, but that is missing. So the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric only.

Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).

📖 Relation that is Symmetric but Neither Reflexive nor Transitive

Detailed Explanation

A relation \( R \) on a set \( A \) is a subset of \( A \times A \). We check three properties. Reflexive means every element is related to itself, i.e. \( (a, a) \in R \) for all \( a \in A \). Symmetric means whenever \( (a, b) \in R \), we also have \( (b, a) \in R \). Transitive means whenever \( (a, b) \in R \) and \( (b, c) \in R \), we must have \( (a, c) \in R \). To build the required example, we deliberately make sure symmetry holds, but break reflexivity (by leaving out at least one pair \( (a, a) \)) and break transitivity (by having \( (a, b) \) and \( (b, a) \) present but \( (a, a) \) absent).

Formula Used

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

Solution

  1. Step 1: Choose a small set to work with. Let \( A = \{1, 2, 3\} \). Working on a small finite set makes it easy to check every property directly.
  2. Step 2: Define the relation. Let \( R = \{(1, 2), (2, 1)\} \) on the set \( A \). We include a pair and its reverse so that symmetry will hold automatically.
  3. Step 3: Check symmetry. The only ordered pairs in \( R \) are \( (1, 2) \) and \( (2, 1) \). Since \( (1, 2) \in R \Rightarrow (2, 1) \in R \) and \( (2, 1) \in R \Rightarrow (1, 2) \in R \), every pair has its reverse present. Therefore \( R \) is symmetric.
  4. Step 4: Check reflexivity. For \( R \) to be reflexive we need \( (1, 1) \), \( (2, 2) \) and \( (3, 3) \) all in \( R \). But \( (1, 1) \notin R \), so the reflexive condition fails. Therefore \( R \) is not reflexive.
  5. Step 5: Check transitivity. We have \( (1, 2) \in R \) and \( (2, 1) \in R \). For transitivity this forces \( (1, 1) \in R \). However \( (1, 1) \notin R \), so the transitive condition fails. Therefore \( R \) is not transitive.
  6. Step 6: Conclusion. The relation \( R = \{(1, 2), (2, 1)\} \) on \( A = \{1, 2, 3\} \) is symmetric but neither reflexive nor transitive, which is exactly what was required.

Final Answer

On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).

Common Mistake

A common mistake is to include the pairs \( (1, 2), (2, 1) \) and then think the relation is transitive because it 'looks fine'. Students forget that \( (1, 2) \) and \( (2, 1) \) together demand \( (1, 1) \); if \( (1, 1) \) is missing, transitivity actually fails, which is precisely what we want here.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Choose a small, concrete base set. Let \( A = \\{1, 2, 3\\} \). — Reason: Working with a small finite set allows us to list every element and every ordered pair explicitly, making property checks straightforward and leaving nothing to guesswork.
  2. Step 2: Define the relation \( R = \\{(1, 2),\\, (2, 1)\\} \) on \( A \). — Reason: We deliberately include a pair and its reverse so that symmetry is built in from the start, while keeping the relation small enough to check all properties by hand.
  3. Step 3: Check symmetry. The pairs in \( R \) are \( (1, 2) \) and \( (2, 1) \). Since \( (1, 2) \in R \) and its reverse \( (2, 1) \in R \), and since \( (2, 1) \in R \) and its reverse \( (1, 2) \in R \), every pair in \( R \) has its reverse also present. Therefore \( R \) is symmetric. — Reason: Symmetry requires that flipping any pair in \( R \) still gives a pair that belongs to \( R \); we verify this for each ordered pair individually.
  4. Step 4: Check reflexivity. For \( R \) to be reflexive, every element of \( A \) must be related to itself, meaning \( (1, 1) \in R \), \( (2, 2) \in R \), and \( (3, 3) \in R \) are all required. None of these three pairs appears in \( R = \\{(1, 2),\\, (2, 1)\\} \), so \( R \) is not reflexive. — Reason: Even a single missing self-pair is enough to break reflexivity; here all three are absent.
  5. Step 5: Check transitivity. Transitivity fails if we can find \( (a, b) \in R \) and \( (b, c) \in R \) but \( (a, c) \notin R \). Take \( a = 1 \), \( b = 2 \), \( c = 1 \): we have \( (1, 2) \in R \) and \( (2, 1) \in R \), so transitivity would require \( (1, 1) \in R \). But \( (1, 1) \notin R \), so \( R \) is not transitive. — Reason: One concrete counterexample is all that is needed to conclude a property fails.
  6. Step 6: Summarise all three checks: \( R \) is symmetric, not reflexive, and not transitive. — Reason: Collecting the results of each individual check gives the complete classification of the relation, which directly answers the question.

Final Answer

On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).

Common Mistake

One common mistake: students often assume that a symmetric relation must also be reflexive, forgetting that symmetry only governs pairs of distinct elements and says nothing about self-pairs like \( (1, 1) \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Let \( A = \\{1, 2, 3\\} \) and define \( R = \\{(1, 2), (2, 1)\\} \).
  2. Step 2: Symmetry: \( (1,2) \in R \Rightarrow (2,1) \in R \) and \( (2,1) \in R \Rightarrow (1,2) \in R \). Hence \( R \) is symmetric.
  3. Step 3: Reflexivity: \( (1,1) \notin R \). Hence \( R \) is not reflexive.
  4. Step 4: Transitivity: \( (1,2) \in R \) and \( (2,1) \in R \), but \( (1,1) \notin R \). Hence \( R \) is not transitive.

Answer: On the set \( A = \{1, 2, 3\} \), the relation \( R = \{(1, 2), (2, 1)\} \) is symmetric (since both a pair and its reverse are present), not reflexive (since \( (1, 1) \notin R \)), and not transitive (since \( (1, 2) \in R \) and \( (2, 1) \in R \) but \( (1, 1) \notin R \)).

➕ More Examples

More Examples

Example 1

Question: Let A = {1, 2, 3, 4}. Define a relation R on A as R = {(1, 2), (2, 1), (3, 4), (4, 3)}. Show that R is Symmetric but neither Reflexive nor Transitive.

Solution: We check each property for the relation R = {(1, 2), (2, 1), (3, 4), (4, 3)} defined on A = {1, 2, 3, 4}. Step 1 — Reflexivity Check: For R to be reflexive, every element must be related to itself, i.e., (a, a) must be in R for all a in A. Checking: (1, 1), (2, 2), (3, 3), and (4, 4) are all absent from R. Since none of the pairs (a, a) belong to R, the relation R is NOT Reflexive. Step 2 — Symmetry Check: For each pair (a, b) in R, we must verify (b, a) is also in R. We check: (1, 2) is in R and (2, 1) is in R. ✓ (2, 1) is in R and (1, 2) is in R. ✓ (3, 4) is in R and (4, 3) is in R. ✓ (4, 3) is in R and (3, 4) is in R. ✓ Since for every (a, b) in R we have (b, a) also in R, the relation R is Symmetric. Step 3 — Transitivity Check: For R to be transitive, whenever (a, b) and (b, c) are in R, then (a, c) must also be in R. Consider (1, 2) and (2, 1) which are both in R. This requires (1, 1) to be in R. But (1, 1) is NOT in R. So R is NOT Transitive.

Answer: R = {(1, 2), (2, 1), (3, 4), (4, 3)} is Symmetric but neither Reflexive nor Transitive.

Example 2

Question: Let A be the set of all students in a class. Define a relation R on A as: (a, b) belongs to R if and only if a and b are best friends with each other (and being a best friend is mutual but a person is not considered their own best friend, and having a common best friend does not make two people best friends directly). Give a concrete finite example to illustrate that such a relation can be Symmetric but neither Reflexive nor Transitive.

Solution: Let A = {P, Q, R} represent three students, and define the relation R on A as: R = {(P, Q), (Q, P)} This captures the idea that P and Q are best friends with each other, but Q and R are not, and no one is their own best friend. Step 1 — Reflexivity Check: For reflexivity, (P, P), (Q, Q), and (R, R) must all be in R. None of them are present in R = {(P, Q), (Q, P)}. So R is NOT Reflexive. Step 2 — Symmetry Check: For every pair in R, the reverse must also be in R. (P, Q) is in R and (Q, P) is in R. ✓ (Q, P) is in R and (P, Q) is in R. ✓ There are no other pairs to check. So R is Symmetric. Step 3 — Transitivity Check: For transitivity, (a, b) in R and (b, c) in R must imply (a, c) is in R. Consider (P, Q) and (Q, P) which are both in R. This would require (P, P) to be in R. But (P, P) is NOT in R. So R is NOT Transitive. Thus the relation R = {(P, Q), (Q, P)} on A = {P, Q, R} is Symmetric but neither Reflexive nor Transitive.

Answer: R = {(P, Q), (Q, P)} on A = {P, Q, R} is Symmetric but neither Reflexive nor Transitive.

🎯 Try a Similar Question

Try a Similar Question

Question: Let A = {4, 5, 6}. Define a relation R on A by R = {(4, 5), (5, 4), (5, 6), (6, 5)}. Check whether R is (i) reflexive, (ii) symmetric, and (iii) transitive. Hence classify R.

Solution

  1. Step 1: Check Reflexivity: A relation R is reflexive if (a, a) is in R for every element a in A. Here A = {4, 5, 6}, so we need (4, 4), (5, 5), and (6, 6) all to be in R. Looking at R = {(4, 5), (5, 4), (5, 6), (6, 5)}, none of these pairs are present. Since \( (4, 4) \notin R \), the relation is NOT reflexive.
  2. Step 2: Check Symmetry: A relation R is symmetric if whenever \( (a, b) \in R \), then \( (b, a) \in R \). Check each ordered pair in R: \( (4, 5) \in R \) and \( (5, 4) \in R \) — condition satisfied. \( (5, 4) \in R \) and \( (4, 5) \in R \) — condition satisfied. \( (5, 6) \in R \) and \( (6, 5) \in R \) — condition satisfied. \( (6, 5) \in R \) and \( (5, 6) \in R \) — condition satisfied. Since every pair has its reverse in R, the relation IS symmetric.
  3. Step 3: Check Transitivity: A relation R is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). Consider \( (4, 5) \in R \) and \( (5, 6) \in R \). Transitivity requires \( (4, 6) \in R \). But \( (4, 6) \notin R \). Therefore, the relation is NOT transitive.
  4. Step 4: Conclusion: The relation R = {(4, 5), (5, 4), (5, 6), (6, 5)} on A = {4, 5, 6} is symmetric but neither reflexive nor transitive. It is an example of a relation that is symmetric only.

Answer: On the set \( A = \{4, 5, 6\} \), the relation \( R = \{(4, 5), (5, 4), (5, 6), (6, 5)\} \) is symmetric (since the reverse of every pair is also in R), not reflexive (since \( (4, 4) \notin R \)), and not transitive (since \( (4, 5) \in R \) and \( (5, 6) \in R \) but \( (4, 6) \notin R \)).

Everything you get with Solver7

More questions in Relations and Functions