SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q3

Let L be the set of all lines in a plane and R be the relation in L defined as \(R=\{(L_1,L_2):L_1\) is perpendicular to \(L_2\}.\) Show that R is symmetric but neither reflexive nor transitive.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine two roads crossing each other perfectly sideways — that is what perpendicular means. A road cannot cross itself sideways, so no line is perpendicular to itself. But if road A crosses road B sideways, then road B also crosses road A sideways — so the rule works both ways. However, if road A crosses road B sideways and road B crosses road C sideways, roads A and C actually end up running parallel — they never cross at all. So the relation \( R \) is symmetric, but it is neither reflexive nor transitive.

Answer: The relation \( R \) is symmetric, but it is neither reflexive nor transitive.

📖 Perpendicularity Relation: Symmetric but Not Reflexive or Transitive

Detailed Explanation

A relation \( R \) on a set is examined for three key properties. It is reflexive if every element is related to itself, i.e. \( (a, a) \in R \) for all \( a \). It is symmetric if \( (a, b) \in R \) implies \( (b, a) \in R \). It is transitive if \( (a, b) \in R \) and \( (b, c) \in R \) together imply \( (a, c) \in R \). Here the set is \( L \), the set of all lines in a plane, and \( R = \{(L_1, L_2) : L_1 \text{ is perpendicular to } L_2\} \). We must check each property using the geometric meaning of perpendicular lines (two lines meeting at an angle of \( 90^\circ \)).

Formula Used

Reflexive: \( (a, a) \in R \) for all \( 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: Check reflexivity. For \( R \) to be reflexive, every line must satisfy \( (L_1, L_1) \in R \), meaning each line would have to be perpendicular to itself. But a line cannot be perpendicular to itself, since a line makes an angle of \( 0^\circ \) with itself, not \( 90^\circ \).
  2. Step 2: Conclude about reflexivity. Since \( (L_1, L_1) \notin R \) for any line \( L_1 \), the relation \( R \) is not reflexive.
  3. Step 3: Check symmetry. Suppose \( (L_1, L_2) \in R \), so \( L_1 \) is perpendicular to \( L_2 \). If line \( L_1 \) is perpendicular to line \( L_2 \), then line \( L_2 \) is also perpendicular to line \( L_1 \), because the angle between them is \( 90^\circ \) regardless of the order.
  4. Step 4: Conclude about symmetry. Since \( (L_1, L_2) \in R \Rightarrow (L_2, L_1) \in R \), the relation \( R \) is symmetric.
  5. Step 5: Check transitivity using a counterexample. Suppose \( (L_1, L_2) \in R \) and \( (L_2, L_3) \in R \), so \( L_1 \perp L_2 \) and \( L_2 \perp L_3 \). Consider three lines where \( L_1 \) and \( L_3 \) are both perpendicular to the same line \( L_2 \). In a plane, two lines perpendicular to the same line are parallel to each other, so \( L_1 \) is parallel to \( L_3 \), not perpendicular.
  6. Step 6: Conclude about transitivity. Since \( L_1 \parallel L_3 \), we have \( (L_1, L_3) \notin R \), even though \( (L_1, L_2) \in R \) and \( (L_2, L_3) \in R \). Hence \( R \) is not transitive.

Final Answer

The relation \( R \) is symmetric, but it is neither reflexive nor transitive.

Common Mistake

A common mistake is thinking \( R \) is transitive because 'perpendicular of perpendicular' seems to continue the pattern. In fact, two lines each perpendicular to a common line are parallel to each other, so \( (L_1, L_3) \notin R \), which breaks transitivity.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Identify the set and relation. Let \( L \) be the set of all lines in a plane. The relation is defined as \( R = \\{(L_1, L_2) : L_1 \text{ is perpendicular to } L_2\\} \). — Reason: Clearly stating the domain and the rule of the relation helps us apply each property test accurately.
  2. Step 2: Test for Reflexivity: Reflexivity requires \( (L_1, L_1) \in R \) for every line \( L_1 \), meaning each line must be perpendicular to itself. Geometrically, a line makes an angle of \( 0^\circ \) with itself, not \( 90^\circ \), so \( (L_1, L_1) \notin R \). — Reason: Since the perpendicularity condition fails for every line with itself, reflexivity is violated.
  3. Step 3: Conclude on Reflexivity: Because no line is perpendicular to itself, \( (L_1, L_1) \notin R \) for any \( L_1 \in L \). Therefore, \( R \) is NOT reflexive. — Reason: Even one failure of \( (a, a) \in R \) is enough to disqualify reflexivity; here it fails for every element.
  4. Step 4: Test for Symmetry: Assume \( (L_1, L_2) \in R \), meaning \( L_1 \perp L_2 \). The angle between \( L_1 \) and \( L_2 \) is \( 90^\circ \). Since the angle between two lines is mutual, \( L_2 \) is also perpendicular to \( L_1 \), giving \( (L_2, L_1) \in R \). — Reason: Perpendicularity is a symmetric geometric property; the direction of listing the lines does not change whether they meet at \( 90^\circ \).
  5. Step 5: Conclude on Symmetry: Since \( (L_1, L_2) \in R \Rightarrow (L_2, L_1) \in R \) for all lines \( L_1, L_2 \), the relation \( R \) IS symmetric. — Reason: The implication holds universally for all pairs, confirming the symmetric property.
  6. Step 6: Test for Transitivity: Assume \( (L_1, L_2) \in R \) and \( (L_2, L_3) \in R \), so \( L_1 \perp L_2 \) and \( L_2 \perp L_3 \). Consider a concrete example: let \( L_1 \) be the x-axis, \( L_2 \) be the y-axis, and \( L_3 \) be any line parallel to the x-axis. Then \( L_1 \perp L_2 \) and \( L_2 \perp L_3 \), but \( L_1 \) is parallel to \( L_3 \), so \( L_1 \not\perp L_3 \), meaning \( (L_1, L_3) \notin R \). — Reason: A single counterexample is sufficient to disprove transitivity.
  7. Step 7: Conclude on Transitivity: Since the implication \( (L_1, L_2) \in R \) and \( (L_2, L_3) \in R \Rightarrow (L_1, L_3) \in R \) does NOT hold in general, the relation \( R \) is NOT transitive. — Reason: When two lines are each perpendicular to a common line, they turn out to be parallel to each other, not perpendicular, breaking transitivity.

Final Answer

The relation \( R \) is symmetric, but it is neither reflexive nor transitive.

Common Mistake

One common mistake: Students sometimes assume that if \( L_1 \perp L_2 \) and \( L_2 \perp L_3 \), then \( L_1 \perp L_3 \) as well. In reality, \( L_1 \) and \( L_3 \) are parallel (not perpendicular), so transitivity fails.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Reflexivity: A line cannot be perpendicular to itself, so \( (L_1, L_1) \notin R \) for any \( L_1 \in L \). Hence R is not reflexive.
  2. Symmetry: If \( L_1 \perp L_2 \), then \( L_2 \perp L_1 \). So \( (L_1, L_2) \in R \Rightarrow (L_2, L_1) \in R \). Hence R is symmetric.
  3. Transitivity: Take \( L_1 \perp L_2 \) and \( L_2 \perp L_3 \). Then \( L_1 \parallel L_3 \), so \( (L_1, L_3) \notin R \). Hence R is not transitive.

Answer: The relation \( R \) is symmetric, but it is neither reflexive nor transitive.

➕ More Examples

More Examples

Example 1

Question: Let S be the set of all lines in a plane and let R be the relation on S defined by: R = {(l1, l2) : l1 is parallel to l2}. Show that R is reflexive and transitive but NOT symmetric.

Solution: We check R for the three properties. Reflexivity: Take any line \( l \in S \). Every line is parallel to itself (by convention in this context). So \( (l, l) \in R \) for all \( l \in S \). Hence R is reflexive. Symmetry: If \( l_1 \) is parallel to \( l_2 \), then \( l_2 \) is parallel to \( l_1 \). So \( (l_1, l_2) \in R \Rightarrow (l_2, l_1) \in R \). Hence R is symmetric. Transitivity: Suppose \( (l_1, l_2) \in R \) and \( (l_2, l_3) \in R \). Then \( l_1 \parallel l_2 \) and \( l_2 \parallel l_3 \). Two lines parallel to the same line are parallel to each other, so \( l_1 \parallel l_3 \), i.e., \( (l_1, l_3) \in R \). Hence R is transitive. Conclusion: R is reflexive, symmetric, and transitive — it is an equivalence relation. Note: The question asks to show it is NOT symmetric, but the mathematical truth is that parallelism IS symmetric. Let us re-read: the question says 'Show that R is reflexive and transitive but NOT symmetric.' This is actually incorrect for standard parallelism. Let us instead use the relation R = {(l1, l2) : l1 is parallel to l2 and l1 ≠ l2} (strict parallelism, excluding a line being parallel to itself). With strict parallelism (a line is NOT parallel to itself): Reflexivity: For any line \( l \), \( (l, l) \notin R \) since we require \( l_1 \ne l_2 \). So R is NOT reflexive. Symmetry: If \( l_1 \) is strictly parallel to \( l_2 \) (with \( l_1 \ne l_2 \)), then \( l_2 \) is strictly parallel to \( l_1 \) (with \( l_2 \ne l_1 \)). So \( (l_1, l_2) \in R \Rightarrow (l_2, l_1) \in R \). Hence R is symmetric. Transitivity: If \( l_1 \parallel l_2 \) and \( l_2 \parallel l_3 \) (all distinct), then \( l_1 \parallel l_3 \) and \( l_1 \ne l_3 \), so \( (l_1, l_3) \in R \). Hence R is transitive. Final Answer: R (with strict parallelism) is symmetric and transitive but NOT reflexive.

Answer: R (strict parallelism) is symmetric and transitive but NOT reflexive.

Example 2

Question: Let A be the set of all integers \( \mathbb{Z} \) and define a relation R on A by R = {(a, b) : a + b is an odd integer}. Show that R is symmetric but neither reflexive nor transitive.

Solution: We verify all three properties. Reflexivity: For any \( a \in \mathbb{Z} \), we need \( (a, a) \in R \), i.e., \( a + a = 2a \) must be odd. But \( 2a \) is always even for any integer \( a \). So \( (a, a) \notin R \) for any \( a \). Hence R is NOT reflexive. Symmetry: Suppose \( (a, b) \in R \). Then \( a + b \) is odd. Since addition is commutative, \( b + a = a + b \) is also odd. So \( (b, a) \in R \). Hence R is symmetric. Transitivity: We look for a counterexample. Let \( a = 1, b = 2, c = 3 \). Check \( (a, b) \): \( 1 + 2 = 3 \), which is odd, so \( (1, 2) \in R \). Check \( (b, c) \): \( 2 + 3 = 5 \), which is odd, so \( (2, 3) \in R \). Check \( (a, c) \): \( 1 + 3 = 4 \), which is even, so \( (1, 3) \notin R \). Since \( (1,2) \in R \) and \( (2,3) \in R \) but \( (1,3) \notin R \), R is NOT transitive. This makes sense in general: for \( a + b \) to be odd, one of \( a, b \) must be even and the other odd. If \( a \) is odd and \( b \) is even, then for \( b + c \) to be odd, \( c \) must be odd. But then \( a + c \) is odd + odd = even, which is NOT odd. So transitivity always fails when both \( a \) and \( c \) are odd. Conclusion: R is symmetric but neither reflexive nor transitive.

Answer: R is symmetric but neither reflexive nor transitive.

🎯 Try a Similar Question

Try a Similar Question

Question: Let \( L \) be the set of all lines in a plane and let \( R \) be a relation on \( L \) defined as \( R = \{(L_1, L_2) : L_1 \text{ is parallel to } L_2\} \). Determine whether \( R \) is reflexive, symmetric, and transitive. Justify your answer.

Solution

  1. Step 1: Check Reflexivity: A relation \( R \) on a set is reflexive if every element is related to itself, i.e., \( (L, L) \in R \) for every \( L \in L \). For \( (L, L) \in R \), the line \( L \) must be parallel to itself. By convention, a line is considered parallel to itself (since it has the same direction/slope as itself). Therefore \( (L, L) \in R \) for every line \( L \), and \( R \) is reflexive.
  2. Step 2: Check Symmetry: A relation \( R \) is symmetric if \( (L_1, L_2) \in R \Rightarrow (L_2, L_1) \in R \). Suppose \( (L_1, L_2) \in R \), meaning \( L_1 \) is parallel to \( L_2 \). Since parallelism is a symmetric geometric relationship, \( L_2 \) is also parallel to \( L_1 \), so \( (L_2, L_1) \in R \). Therefore \( R \) is symmetric.
  3. Step 3: Check Transitivity: A relation \( R \) is transitive if \( (L_1, L_2) \in R \) and \( (L_2, L_3) \in R \) imply \( (L_1, L_3) \in R \). Suppose \( L_1 \) is parallel to \( L_2 \) and \( L_2 \) is parallel to \( L_3 \). By the transitivity of parallelism in Euclidean geometry, \( L_1 \) must also be parallel to \( L_3 \), so \( (L_1, L_3) \in R \). Therefore \( R \) is transitive.
  4. Step 4: Conclusion: Since \( R \) satisfies all three properties — reflexivity, symmetry, and transitivity — the relation \( R \) is an equivalence relation on \( L \).

Answer: The relation \( R \) is reflexive, symmetric, and transitive. Hence \( R \) is an equivalence relation on the set of all lines in a plane.

Everything you get with Solver7

More questions in Relations and Functions