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

  • A
    An equivalence relation on $R$
  • B
    Reflexive,transitive,but not symmetric
  • C
    Symmetric,transitive,but not reflexive
  • D
    Neither transitive nor reflexive,but symmetric

Explore More

Similar Questions

Let the relation $\rho$ be defined on $\mathbb{R}$ by $a \rho b$ if and only if $a-b$ is zero or irrational. Then:

Let $L$ be the set of all straight lines in the Euclidean plane. Two lines $l_1$ and $l_2$ are related by the relation $R$ if and only if $l_1$ is parallel to $l_2$. Then the relation $R$ is:

Let $L$ denote the set of all straight lines in a plane. Let a relation $R$ be defined by $\alpha R\beta \Leftrightarrow \alpha \perp \beta$,where $\alpha, \beta \in L$. Then $R$ is

Let $f: X \rightarrow Y$ be a function. Define a relation $R$ in $X$ given by $R = \{(a, b) : f(a) = f(b)\}$. Examine if $R$ is an equivalence relation.

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:

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