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

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:

Give an example of a relation on a set $A = \{5, 6, 7\}$ which is symmetric but neither reflexive nor transitive.

Let $X$ be a non-void set. If $\rho_1$ and $\rho_2$ are transitive relations on $X$, then which of the following is true?

Let $A = \{-3, -2, -1, 0, 1, 2, 3\}$ and $R$ be a relation on $A$ defined by $x R y$ if and only if $2x - y \in \{0, 1\}$. Let $l$ be the number of elements in $R$. Let $m$ and $n$ be the minimum number of elements required to be added in $R$ to make it reflexive and symmetric relations,respectively. Then $l + m + n$ is equal to :-

Let $R = \{(1, 3), (2, 2), (3, 2)\}$ and $S = \{(2, 1), (3, 2), (2, 3)\}$ be two relations on the set $A = \{1, 2, 3\}$. Find $R \circ S^{-1}$.

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