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

Give an example of a relation. Which is Reflexive and transitive but not symmetric.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a queue where taller people stand behind shorter ones. Every person is at least as tall as themselves, so the 'at least as tall' rule always includes yourself. If person A is taller than B, B is NOT taller than A, so the rule is not two-way. Yet if A is taller than B and B is taller than C, then A is definitely taller than C too. This 'bigger or equal' idea is the heart of our example relation on the set \( \{1, 2, 3\} \).

Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.

📖 Reflexive & Transitive but Not Symmetric Relation

Detailed Explanation

A relation \( R \) on a set \( A \) is a collection of ordered pairs from \( A \times A \). We check three main properties. A relation is reflexive if every element is related to itself, that is \( (a, a) \in R \) for all \( a \in A \). It is symmetric if whenever \( (a, b) \in R \) then also \( (b, a) \in R \). It is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \). A very natural example that is reflexive and transitive but NOT symmetric is the 'less than or equal to' relation \( \le \) on real numbers, or we can build a simple finite example on a small set. We want a relation where being related in one direction does not force the reverse direction.

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: Choose a set and define the relation. Let \( A = \{1, 2, 3\} \) and define \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\}. \] This is essentially the relation 'is less than or equal to' on the set \( A \).
  2. Step 2: Check reflexivity. We need \( (a,a) \in R \) for every \( a \in A \). Here \( (1,1), (2,2), (3,3) \) are all present in \( R \). So \( R \) is reflexive.
  3. Step 3: Check transitivity. Take pairs and verify the chain. Since \( (1,2) \in R \) and \( (2,3) \in R \), we need \( (1,3) \in R \); indeed \( (1,3) \in R \). All other combinations also close up (for example \( (1,2) \) and \( (2,2) \) give \( (1,2) \)). So \( R \) is transitive.
  4. Step 4: Check symmetry. We look for a pair whose reverse is missing. Here \( (1,2) \in R \) but \( (2,1) \notin R \). Since the reverse pair is absent, \( R \) is NOT symmetric.
  5. Step 5: Conclude. The relation \( R \) satisfies reflexivity and transitivity but fails symmetry, so it is exactly the type of relation required.

Final Answer

On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.

Common Mistake

A common mistake is to declare a relation not symmetric without producing a specific witness pair. You must clearly show one pair \( (a,b) \in R \) whose reverse \( (b,a) \notin R \), such as \( (1,2) \in R \) but \( (2,1) \notin R \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Choose a small finite set and build the relation. Let \( A = \{1, 2, 3\} \) and define \[R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\}.\] — Reason: Using a three-element set keeps verification simple, and including all pairs where the first element is less than or equal to the second mimics the '\( \le \)' ordering, which is a well-known example of a non-symmetric relation.
  2. Step 2: Verify reflexivity. Check that \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). All three are present in the definition of \( R \), so \( R \) is reflexive. — Reason: Reflexivity requires every element of \( A \) to be paired with itself; confirming each diagonal pair covers this completely.
  3. Step 3: Verify transitivity. Examine every pair of tuples \( (a,b) \in R \) and \( (b,c) \in R \) and confirm \( (a,c) \in R \). The only non-trivial chain is: \( (1,2) \in R \) and \( (2,3) \in R \), so we need \( (1,3) \in R \) — which is indeed in \( R \). All other combinations either involve diagonal pairs (which contribute nothing new) or are already verified. Hence \( R \) is transitive. — Reason: Transitivity can fail if even one chain \( a \to b \to c \) exists without the shortcut \( a \to c \); checking every chain confirms there is no such failure.
  4. Step 4: Check whether \( R \) is symmetric. Symmetry would require that for every \( (a,b) \in R \), we also have \( (b,a) \in R \). Consider \( (1,2) \in R \). For symmetry, \( (2,1) \) must also belong to \( R \), but \( (2,1) \notin R \). Therefore \( R \) is NOT symmetric. — Reason: A single counterexample is enough to disprove symmetry, and the pair \( (1,2) \) with the missing reverse \( (2,1) \) serves exactly that purpose.
  5. Step 5: Summarise the properties found. \( R \) is reflexive (all \( (a,a) \) present), transitive (every chain closes), but not symmetric (the pair \( (1,2) \) has no reverse). This makes \( R \) the required example. — Reason: Listing all three verdicts together confirms the relation meets exactly the criteria asked: reflexive and transitive but not symmetric.
  6. Step 6: Note the equivalent infinite example. On \( \mathbb{R} \), the relation \( R = \{(a,b) : a \le b\} \) satisfies \( a \le a \) (reflexive), and if \( a \le b \) and \( b \le c \) then \( a \le c \) (transitive), but \( a \le b \) does not imply \( b \le a \) in general — for instance, \( 2 \le 3 \) yet \( 3 \not\le 2 \) (not symmetric). — Reason: Recognising the finite example as a concrete restriction of the familiar '\( \le \)' relation on \( \mathbb{R} \) deepens understanding and shows the idea scales to infinite sets.

Final Answer

On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.

Common Mistake

One common mistake: students sometimes confuse transitivity with symmetry and add the reverse pairs \( (2,1) \), \( (3,2) \), \( (3,1) \) to 'complete' the relation, which would make it symmetric and destroy the intended example — transitivity only demands that chains \( a \to b \to c \) imply \( a \to c \), not that every one-step link has a reverse.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Define the relation: Let \( A = \\{1, 2, 3\\} \) and \[ R = \\{(1,1),(2,2),(3,3),(1,2),(2,3),(1,3)\\}. \]
  2. Step 2: Verify reflexivity and transitivity: Reflexive: \( (1,1),(2,2),(3,3) \in R \). Transitive: \( (1,2) \in R \) and \( (2,3) \in R \) imply \( (1,3) \in R \). All such chains close.
  3. Step 3: Confirm not symmetric: \( (1,2) \in R \) but \( (2,1) \notin R \), so \( R \) is not symmetric.

Answer: On \( A = \{1, 2, 3\} \), the relation \[ R = \{(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)\} \] is reflexive and transitive but not symmetric. Equivalently, the relation \( R = \{(a,b) : a \le b\} \) on \( \mathbb{R} \) works too.

➕ More Examples

More Examples

Example 1

Question: Let A = {1, 2, 3}. Define a relation R on A by R = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)}. Check whether R is (i) Reflexive, (ii) Symmetric, and (iii) Transitive.

Solution: We check each property one by one. Step 1 — Check Reflexivity: For every element in A, we need (a, a) ∈ R. We have \( (1,1) \in R \), \( (2,2) \in R \), and \( (3,3) \in R \). Since all diagonal pairs are present, R is reflexive. Step 2 — Check Symmetry: We need to check: if \( (a, b) \in R \) then \( (b, a) \in R \). Observe that \( (1, 2) \in R \). For symmetry we need \( (2, 1) \in R \), but \( (2, 1) \notin R \). Hence R is NOT symmetric. Step 3 — Check Transitivity: We check all pairs \( (a,b) \in R \) and \( (b,c) \in R \) to see if \( (a,c) \in R \). Case 1: \( (1,2) \in R \) and \( (2,3) \in R \). We need \( (1,3) \in R \). Indeed \( (1,3) \in R \). ✓ Case 2: \( (1,2) \in R \) and \( (2,2) \in R \). We need \( (1,2) \in R \). Indeed \( (1,2) \in R \). ✓ Case 3: \( (2,3) \in R \) and \( (3,3) \in R \). We need \( (2,3) \in R \). Indeed \( (2,3) \in R \). ✓ All other combinations involve diagonal pairs which trivially satisfy the condition. Hence R is transitive. Conclusion: R is reflexive and transitive, but NOT symmetric.

Answer: R = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)} is reflexive and transitive but not symmetric.

Example 2

Question: On the set of natural numbers \( \mathbb{N} \), define a relation R by: \( R = \{(a, b) : a \le b,\; a, b \in \mathbb{N}\} \). Show that R is reflexive and transitive but not symmetric.

Solution: Step 1 — Check Reflexivity: For any \( a \in \mathbb{N} \), we have \( a \le a \), so \( (a, a) \in R \) for all natural numbers a. Hence R is reflexive. Step 2 — Check Symmetry: Take a specific example: let \( a = 2 \) and \( b = 5 \). Since \( 2 \le 5 \), we have \( (2, 5) \in R \). But \( 5 \le 2 \) is false, so \( (5, 2) \notin R \). Since \( (2, 5) \in R \) but \( (5, 2) \notin R \), R is NOT symmetric. Step 3 — Check Transitivity: Suppose \( (a, b) \in R \) and \( (b, c) \in R \). This means \( a \le b \) and \( b \le c \). By the transitive property of inequalities on \( \mathbb{N} \), we get \( a \le c \), i.e., \( (a, c) \in R \). Hence R is transitive. Conclusion: The relation \( R = \{(a, b) : a \le b\} \) on \( \mathbb{N} \) is reflexive and transitive, but NOT symmetric.

Answer: The relation R defined by \( a \le b \) on \( \mathbb{N} \) is reflexive and transitive but not symmetric.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( B = \{p, q, r\} \). Define a relation \( S \) on \( B \) as \( S = \{(p,p),\,(q,q),\,(r,r),\,(p,q),\,(p,r),\,(q,r)\} \). Verify whether \( S \) is (i) reflexive, (ii) symmetric, and (iii) transitive. Hence state the properties that \( S \) satisfies.

Solution

  1. Step 1: Check Reflexivity: A relation \( S \) on \( B \) is reflexive if for every \( x \in B \), we have \( (x, x) \in S \). Here \( B = \{p, q, r\} \). We check: \( (p,p) \in S \), \( (q,q) \in S \), \( (r,r) \in S \). Since all three diagonal pairs are present, \( S \) is reflexive.
  2. Step 2: Check Symmetry: A relation \( S \) is symmetric if for every \( (a,b) \in S \), we also have \( (b,a) \in S \). Consider the pair \( (p, q) \in S \). For symmetry we need \( (q, p) \in S \). But \( (q, p) \notin S \). Therefore \( S \) is NOT symmetric.
  3. Step 3: Check Transitivity: A relation \( S \) is transitive if whenever \( (a,b) \in S \) and \( (b,c) \in S \), then \( (a,c) \in S \). We check all relevant combinations: Since \( (p,q) \in S \) and \( (q,r) \in S \), we need \( (p,r) \in S \) — and indeed \( (p,r) \in S \). Since \( (p,q) \in S \) and \( (q,q) \in S \), we need \( (p,q) \in S \) — yes. Since \( (p,r) \in S \) and \( (r,r) \in S \), we need \( (p,r) \in S \) — yes. All other combinations involve diagonal pairs and are trivially satisfied. Therefore \( S \) is transitive.
  4. Step 4: Conclusion: The relation \( S = \{(p,p),(q,q),(r,r),(p,q),(p,r),(q,r)\} \) on \( B = \{p,q,r\} \) is reflexive and transitive, but NOT symmetric. This is because \( (p,q) \in S \) yet \( (q,p) \notin S \).

Answer: On \( B = \{p, q, r\} \), the relation \( S = \{(p,p),(q,q),(r,r),(p,q),(p,r),(q,r)\} \) is reflexive and transitive but not symmetric, since \( (p,q) \in S \) but \( (q,p) \notin S \).

Everything you get with Solver7

More questions in Relations and Functions