Solveeit Logo

Question

Question: Let \(R _ { 1 }\) be a relation defined by \(R _ { 1 } = \{ ( a , b ) \mid a \geq b , a , b \in R ...

Let R1R _ { 1 } be a relation defined by R1={(a,b)ab,a,bR}R _ { 1 } = \{ ( a , b ) \mid a \geq b , a , b \in R \}. Then R1R _ { 1 } is

A

An equivalence relation on R

B

Reflexive, transitive but not symmetric

C

Symmetric, Transitive but not reflexive

D

Neither transitive not reflexive but symmetric

Answer

Reflexive, transitive but not symmetric

Explanation

Solution

For any aRa \in R, we have bcb \geq cwhich is turn imply that aca \geq c.