$A$ relation $R$ defined on a set $A$ is anti-symmetric if $(a, b) \in R$ and $(b, a) \in R$ implies:

  • A
    $a = b$ for all $(a, b) \in R$
  • B
    not for any $(a, b) \in R$
  • C
    not for any $(a, b) \in R$ where $a \neq b$
  • D
    None of these

Explore More

Similar Questions

Let $R$ be a relation on the set $N$ of natural numbers defined by $nRm \iff n$ is a factor of $m$ (i.e.,$n|m$). Then $R$ is

If $R$ is an equivalence relation on a set $A$,then $R^{-1}$ is not :-

If $A = \{1, 2, 3, \dots, m\}$,then the total number of reflexive relations that can be defined from $A \to A$ is:

Let $R = \{ (3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6) \}$ be a relation on the set $A = \{ 3, 6, 9, 12 \}$. The relation is

Let $R$ be a relation from $N$ to $N$ defined by $R = \{(a, b) : a, b \in N \text{ and } a = b^2\}$. Is the following statement true?
$(a, b) \in R, (b, c) \in R$ implies $(a, c) \in R$

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