Home
Class 12
MATHS
Let Z be the set of all integers and ...

Let `Z` be the set of all integers and `R` be the relation on `Z` defined as `R={(a , b); a ,\ b\ in Z ,` and `(a-b)` is divisible by `5.}` . Prove that `R` is an equivalence relation.

Text Solution

Verified by Experts

The given relation is ` R={(a,b):a,b in Z " and "a-b " is divisible by " 5}.`
We shall prove that R is reflexive, symmetric and transitive.
(i) R is reflexive as as for any ` x in Z`, we have `x-x=0` and 0 is divisible by 5
`implies x-x` is divisible by 5
`implies (x,x) in R, AA x in Z`
` :. `R is reflexive.
(ii) R is symmetric As `(x,y) in R, " where " x,y in Z`
`implies x-y ` is divisible by 5 `" " ` [By defnition of R]
`implies x-y=5lambda " for some " lambda in Z`
`implies y-x=5(-lambda)`
`implies y-x` is also divisible by 5
` :. R` is symmetric.
(iii) R is transitive AS `(x,y) in R,` where `x,y in Z`
`implies x-y` is divisible by 5
`implies x-y=5 lambda_(1)` for some `lambda_(1) in Z`
Again, for `(y,z) in R` where, `y,z in Z`
`implies y-z` is divisible by 5
`implies y-z=5lambda_(2)` for some `lambda_(2) in Z`
Now, `(x-y) +(y-z)=5lambda_(1)+5lambda_(2)`
`impliesx-z=5(lambda_(1)+lambda_(2))`
`implies x-z` is divisible by 5 for some `(lambda_(1)+lambda_(2)) in Z`
` :. ` R is transitive.
Since, R is reflexive, symmetric and transitive.
Therefore, it is an equivalence relation.
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    CENGAGE ENGLISH|Exercise CONCEPT APPLICATION EXERCISE 1.3|9 Videos

  • RELATIONS AND FUNCTIONS

    CENGAGE ENGLISH|Exercise CONCEPT APPLICATION EXERCISE 1.4|8 Videos

  • RELATIONS AND FUNCTIONS

    CENGAGE ENGLISH|Exercise CONCEPT APPLICATION EXERCISE 1.1|15 Videos

  • PROPERTIES AND SOLUTIONS OF TRIANGLE

    CENGAGE ENGLISH|Exercise Archives (Numerical Value Type)|3 Videos

  • SCALER TRIPLE PRODUCTS

    CENGAGE ENGLISH|Exercise DPP 2.3|11 Videos

Similar Questions

Explore conceptually related problems

Let Z be the set of all integers and R be the relation on Z defined by R= { (a,b): a, b in Z and (a-b) is divisible by 5} . Prove that R is an equivalence relation

Let m be a given fixed positive integer. Let R={(a.b) : a,b in Z and (a-b) is divisible by m} . Show that R is an equivalence relation on Z .

Let Z be the set of all integers and Z_0 be the set of all non zero integers. Let a relation R on Z X Z_0 be defined as follows: (a , b)R(c , d) ,a d=b c for all (a , b),(c , d) ZXZ_0 Prove that R is an equivalence relation on ZXZ_0dot

Let N be the set of all natural numbers and let R be a relation on NxxN , defined by (a ,\ b)R\ (c ,\ d) a d=b c for all (a ,\ b),\ (c ,\ d) in NxxN . Show that R is an equivalence relation on NxxN

Let S be the set of all real numbers and Let R be a relations on s defined by A R B hArr |a|le b. then ,R is

Let Z be the set of all integers and Z_0 be the set of all non-zero integers. Let a relation R on ZxxZ_0 be defined as follows: (a , b)R(c , d) if and only if a d=b c for all (a , b),(c , d) in ZxxZ_0 Prove that R is an equivalence relation on ZxxZ_0 .

Let Z be the set of all integers and Z_0 be the set of all non-zero integers. Let a relation R on ZxxZ_0 be defined as follows: (a ,\ b)\ R\ (c ,\ d)hArra d=b c for all (a ,\ b),\ (c ,\ d) in ZxxZ_0 Prove that R is an equivalence relation on ZxxZ_0

Let N be the set of all natural numbers and let R be a relation on N×N , defined by (a , b)R(c , d) iff a d=b c for all (a , b),(c , d) in N × Ndot . Show that R is an equivalence relation on N × N .

Let R be the relation on Z defined by R={(a , b): a , b in Z , a-b is an integer }dot Find the domain and range of Rdot

Let R be the relation on Z defined by R = {(a , b): a , b in Z , a b is an integer}.Find the domain and range of R.