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
CBSE Class 12 Maths · Relations and Functions
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.
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 \)).
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 \).
The relation \( R \) is symmetric, but it is neither reflexive nor transitive.
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.
The relation \( R \) is symmetric, but it is neither reflexive nor transitive.
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.
Answer: The relation \( R \) is symmetric, but it is neither reflexive nor transitive.
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.
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.
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.
Answer: The relation \( R \) is reflexive, symmetric, and transitive. Hence \( R \) is an equivalence relation on the set of all lines in a plane.