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} \text{ is perpendicular to } L_{2}\}$. Show that $R$ is symmetric but neither reflexive nor transitive.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) $R$ is not reflexive,as a line $L_{1}$ cannot be perpendicular to itself,i.e.,$(L_{1}, L_{1}) \notin R$.
$R$ is symmetric as $(L_{1}, L_{2}) \in R$
$\Rightarrow L_{1} \text{ is perpendicular to } L_{2}$
$\Rightarrow L_{2} \text{ is perpendicular to } L_{1}$
$\Rightarrow (L_{2}, L_{1}) \in R$
$R$ is not transitive. Indeed,if $L_{1}$ is perpendicular to $L_{2}$ and $L_{2}$ is perpendicular to $L_{3}$,then $L_{1}$ can never be perpendicular to $L_{3}$. In fact,$L_{1}$ is parallel to $L_{3}$,i.e.,$(L_{1}, L_{2}) \in R, (L_{2}, L_{3}) \in R$ but $(L_{1}, L_{3}) \notin R$.

Explore More

Similar Questions

Let $A = \{-3, -2, -1, 0, 1, 2, 3\}$ and $R$ be a relation on $A$ defined by $x R y$ if and only if $2x - y \in \{0, 1\}$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in $R$ to make it reflexive and symmetric relations,respectively. Then $l + m + n$ is equal to :-

Let $R$ be a relation on the set of real numbers defined by $nm \ge 0$. Then $R$ is:

Let $A = \{1, 2, 3, \ldots, 100\}$. Let $R$ be a relation on $A$ defined by $(x, y) \in R$ if and only if $2x = 3y$. Let $R_1$ be a symmetric relation on $A$ such that $R \subset R_1$ and the number of elements in $R_1$ is $n$. Then,the minimum value of $n$ is:

Show that the relation $R$ defined in the set $A$ of all triangles as $R = \{(T_{1}, T_{2}) : T_{1} \text{ is similar to } T_{2}\}$,is an equivalence relation. Consider three right-angled triangles $T_{1}$ with sides $3, 4, 5$,$T_{2}$ with sides $5, 12, 13$,and $T_{3}$ with sides $6, 8, 10$. Which triangles among $T_{1}, T_{2}$,and $T_{3}$ are related?

Difficult
View Solution

Show that the relation $R$ in the set $A=\{1,2,3,4,5\}$ given by $R =\{(a, b):|a-b| \text{ is even}\}$ is an equivalence relation. Show that all the elements of $\{1,3,5\}$ are related to each other and all the elements of $\{2,4\}$ are related to each other,but no element of $\{1,3,5\}$ is related to any element of $\{2,4\}$.

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo