MCQ
The relation $R = \{(1, 1), (2, 2), (3, 3)\}$ on the set $\{1, 2, 3\}$ is:
  • A
    Symmetric only.
  • B
    Reflexive only.
  • An equivalence relation.
  • D
    Transitive only.

Answer

Correct option: C.
An equivalence relation.
$R = \{(a, b): a = b$ and $a, b \in\text{A}\}$
Reflexivity: Let $\text{a}\in\text{A}$
Here,
$a = a$
$\Rightarrow\ (\text{a, a})\in\text{R}$ for all $\text{a}\in\text{A}$
So$, R$ is reflexive on $A.$
Symmetry: Let $\text{a, b}\in\text{A}$ such that $ (\text{a, b})\in\text{R}.$ Then,
$ (\text{a, b})\in\text{R}$
$\Rightarrow\ \text{a}=\text{b}$
$\Rightarrow\ \text{b}=\text{a}$
$\Rightarrow\ (\text{b, a})\in\text{R}$ for all $\text{a}\in\text{A}$
So$, R$ is symmetric on $A.$​​​​​​​
Transitive: Let $\text{a, b, c}\in\text{A}$ such that $ (\text{a, b})\in\text{R}$ and $ (\text{b, c})\in\text{R}.$ Then,
$ (\text{a, b})\in\text{R}\Rightarrow\ \text{a}=\text{b}$
and $ (\text{b, c})\in\text{R}\Rightarrow\ \text{b}=\text{c}$
$\Rightarrow\ \text{a}=\text{c}$
$\Rightarrow\ (\text{a, c})\in\text{R}$ for all $\text{a}\in\text{A}$
So$, R$ is transitive on $A.$
Hence$, R$ is an equivalence relation on $A.$

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free