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

Let $A = \{2, 4, 6, 8\}$. $A$ relation $R$ on $A$ is defined by $R = \{(2, 4), (4, 2), (4, 6), (6, 4)\}$. Then $R$ is:

Let $R$ and $S$ be two equivalence relations on a set $A$. Then

Let the set of all relations $R$ on the set $\{a, b, c, d, e, f\}$ be denoted by $S$,such that $R$ is reflexive and symmetric,and $R$ contains exactly $10$ elements. Then the number of elements in $S$ is $...$ .

The empty relation on a set $A$ is

Let $N$ denote the set of all natural numbers. Define two binary relations on $N$ as $R_1 = \{(x,y) \in N \times N : 2x + y = 10\}$ and $R_2 = \{(x,y) \in N \times N : x + 2y = 10\}$. 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