Show that the relation $R$ in the set $\{1, 2, 3\}$ given by $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)\}$ is reflexive but neither symmetric nor transitive.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
(N/A) relation $R$ on a set $A$ is reflexive if $(a, a) \in R$ for all $a \in A$. Here,$A = \{1, 2, 3\}$. Since $(1, 1), (2, 2), (3, 3) \in R$,the relation $R$ is reflexive.
$A$ relation $R$ is symmetric if $(a, b) \in R$ implies $(b, a) \in R$. Here,$(1, 2) \in R$,but $(2, 1) \notin R$. Therefore,$R$ is not symmetric.
$A$ relation $R$ is transitive if $(a, b) \in R$ and $(b, c) \in R$ implies $(a, c) \in R$. Here,$(1, 2) \in R$ and $(2, 3) \in R$,but $(1, 3) \notin R$. Therefore,$R$ is not transitive.

Explore More

Similar Questions

Consider set $A = \{1, 2, 3\}$. The number of symmetric relations that can be defined on $A$ containing the ordered pairs $(1, 2)$ and $(2, 1)$ is:

Let $H$ be the set of all houses in a village where each house is faced in one of the directions,East,West,North,South. Let $R = \{ (x,y) | (x,y) \in H \times H \text{ and } x, y \text{ are faced in same direction} \}$. Then the relation $R$ is

Give an example of a relation which is transitive but neither reflexive nor symmetric.

Let $A$ be the set of all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ and $R$ be a relation on $A$ such that $R =\{( f , g ): f(0)= g (1) \text{ and } f(1)= g (0)\}$. Then $R$ is:

Let $A = \{1, 2, 3, 4, 5, 6, 7\}$. Then the relation $R = \{(x, y) \in A \times A : x + y = 7\}$ is

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