Let R be a relation on the set N≥0 given byR = {(a, b) : (b − a) is divisible by 6}Show that this is an equivalence relation
Question
Let R be a relation on the set given by Show that this is an equivalence relation.
Solution
To show that a relation is an equivalence relation, we need to prove that it is reflexive, symmetric, and transitive.
-
Reflexive: A relation R is reflexive if for every a in N≥0, (a, a) is in R. In this case, (b - a) would be (a - a) which equals 0. Since 0 is divisible by 6, the relation is reflexive.
-
Symmetric: A relation R is symmetric if for every (a, b) in R, (b, a) is also in R. In this case, if (b - a) is divisible by 6, then -(a - b) is also divisible by 6. Therefore, the relation is symmetric.
-
Transitive: A relation R is transitive if for every (a, b) in R and (b, c) in R, (a, c) is also in R. In this case, if (b - a) and (c - b) are both divisible by 6, then their sum (c - a) = (b - a) + (c - b) is also divisible by 6. Therefore, the relation is transitive.
Therefore, the relation R is an equivalence relation.
Similar Questions
Determine whether the Relation R in the set A=1,2,3,4,5,6 as R={(x,y):yisdivisiblebyx} is reflexive, symmetric and transitiveHard
f A={1,4,5} and the relation R defined on the set A as aRb if a+b < 6 checkwhether the relation R is an equivalence relation
Let R be the relation on the set Z defined by xRy iff x − y is an integer. Prove that R is anequivalence relation on Z.
Let A = {4,5,6} , B = {a,y,c,w}and R = {(4,c), (4,y), (5,a),(5,c), (5,w)} is a relation from A to B.Then we can write :
If A = {2, 3, 5} and B = {4, 6, 9}, then if R is defined as R = {(a,b) ∈ bAxB/a}, the set R =
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.