In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation,it is sufficient,if $R$

  • A
    Is reflexive
  • B
    Is symmetric
  • C
    Is transitive
  • D
    Possesses all the above three properties

Explore More

Similar Questions

The relation $R = \{(a, a), (b, b), (c, c), (a, b), (b, a)\}$ is defined on the set $A = \{a, b, c\}$. Then $R$ is . . . . . . .

If $R$ and $R^1$ are equivalence relations on a set $A$, then which of the following is also an equivalence relation?

Give an example of a relation which is reflexive and transitive but not symmetric.

Let the relation $R_1$ be defined by $R_1 = \{ (a, b) | a \ge b, a, b \in R \}$. Then $R_1$ is:

Let $R$ be a relation on $\mathbb{R}$,given by $R = \{(a, b) : 3a - 3b + \sqrt{7} \text{ is an irrational number} \}$. Then $R$ 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