$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 $A = \{1, 2, 3, 4, 6\}$. Let $R$ be the relation on $A$ defined by $R = \{(a, b) : a, b \in A, b \text{ is exactly divisible by } a\}$. Find the domain of $R$.

On the set $R$ of real numbers,the relation $\rho$ is defined by $x \rho y$ if $x > |y|$. Which of the following statements is true regarding the properties of $\rho$?

The relation $R$ is defined on the set $N$ by $R = \{(x, y) | x, y \in N, 2x + y = 41\}$. Then $R$ is:

On the power set $P(A)$ of a set $A$,the relation "is a subset of" $(\subseteq)$ is:

In the set of all $3 \times 3$ real matrices,a relation is defined as follows: $A$ matrix $A$ is related to a matrix $B$ if and only if there exists a non-singular $3 \times 3$ matrix $P$ such that $B = P^{-1} A P$. This relation 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