Let ${R_1}$ be a relation 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

If $R = \{(6, 6), (9, 9), (6, 12), (12, 12), (12, 6)\}$ is a relation on set $A = \{3, 6, 9, 12\}$,then relation $R$ is

Let $A = \{2, 3, 4\}$ and $B = \{8, 9, 12\}$. Then the number of elements in the relation $R = \{((a_1, b_1), (a_2, b_2)) \in (A \times B) \times (A \times B) : a_1 \text{ divides } b_2 \text{ and } a_2 \text{ divides } b_1\}$ 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.

The void relation on a set $A$ is

Let $R$ be the real line. Let the relations $S$ and $T$ on $R$ be defined by $S = \{(x, y) : y = x + 1, 0 < x < 2\}$ and $T = \{(x, y) : (x - y) \text{ is an integer}\}$. Then:

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