Home
Class 12
MATHS
Show that the relation R on R defined as...

Show that the relation R on R defined as `R= {(a,b): a <= b } ` is reflexive and transitive but not symmetric.

Text Solution

Verified by Experts

`R = {(a,b): a le b}`
If the relation is reflexive,
then `(a,a) in R`
Here, `a le a`
`:. f(a,a)` is true.
So, relation is reflexive.

...
Promotional Banner

Similar Questions

Explore conceptually related problems

Show that the relation R in R defined as R={(a ,b): alt=b} , is reflexive and transitive but not symmetric.

Show that the relation R is R defined as R = {(a,b) : a le b} is reflexive and transitive but not symmetric.

Show that the relation R in R defined as R = {(a,b) { a leb}, is reflexive and transitive but not symmetric.

Show that the relation R in R defined as R= {(a,b):aleb} is reflexive and transitive but not symmetric.

Show that the relation R in R defined as R={(a,b):ageb} is transitive.

Show that the relation R in R defined as R={(a,b):ageb} is transitive.

Show that the relation R in R defined as R={(a,b):a<=b} is reflexive and transitive but not symmetric.

Show that the relation R in R defined R = {(a, b) : a le b} is reflexive and transitive but not symmetric.

Show that the relation R in R, defined by R={(a,b),aleb} , is reflexive and transsitive but not symmetric.

Show that the relation R defined by R = {(a, b): (a - b) is divisible by 3., a, b in N} is an equivalence relation.