Question

In: Advanced Math

Let S = {-3, -2, -1, 0, 1, 2, 3}. Define a relation R on S...

Let S = {-3, -2, -1, 0, 1, 2, 3}. Define a relation R on S by: xRy if and only if x = y + 4n for some integer n.

a) Prove that R is an equivalence relation.

b) Find all the distinct equivalence classes of R.

Solutions

Expert Solution


Related Solutions

Let S = {1,2,3,4} and let A = SxS Define a relation R on A by...
Let S = {1,2,3,4} and let A = SxS Define a relation R on A by (a,b)R(c,d) iff ad = bc Write out each equivalence class (by "write out" I mean tell me explicitly which elements of A are in each equivalence class) Hint: |A| = 16 and there are 11 equivalence classes, so there are several equivalence classes that consist of a single element of A.
Let A = R x R, and let a relation S be defined as: “(x​1,​ y​1)​...
Let A = R x R, and let a relation S be defined as: “(x​1,​ y​1)​ S (x​2,​ y​2)​ ⬄ points (x​1,​ y​1)​ and (x​2,​ y​2)​are 5 units apart.” Determine whether S is reflexive, symmetric, or transitive. If the answer is “yes,” give a justification (full proof is not needed); if the answer is “no” you ​must​ give a counterexample.
1. Let R be the relation on A = {1, 2, 3, 4, 5} given by...
1. Let R be the relation on A = {1, 2, 3, 4, 5} given by R = {(1, 1),(1, 3),(2, 2),(2, 4),(2, 5),(3, 1),(3, 3),(4, 2),(4, 4),(4, 5),(5, 2),(5, 4),(5, 5)}. (a) Draw the digraph which represents R. (b) Give the 0 -1 matrix of R with respect to the natural ordering. (c) Which of the five properties (reflexive, irreflexive, symmetric, antisymmetric, transitive) does R have? Give a brief reason why or why not each property holds. 2. Let...
Let S = {2 k : k ∈ Z}. Let R be a relation defined on...
Let S = {2 k : k ∈ Z}. Let R be a relation defined on Q− {0} by x R y if x y ∈ S. Prove that R is an equivalence relation. Determine the equivalence class
Let L = {0 r | r = s 2 , s a positive integer}. Give...
Let L = {0 r | r = s 2 , s a positive integer}. Give the simplest proof you can that L is not regular using the pumping lemma.
1)Let S be the set of all students at a college. Define a relation on the...
1)Let S be the set of all students at a college. Define a relation on the set S by the rule that two people are related if they live less than 2 miles apart. Is this relation an equivalence relation on S? Justify your answer. 2) Define another relation on the set S from problem 5 by defining two people as related if they have the same classification (freshman, sophomore, junior, senior or graduate student). Is this an equivalence relation...
1)Let S be the set of all students at a college. Define a relation on the...
1)Let S be the set of all students at a college. Define a relation on the set S by the rule that two people are related if they live less than 2 miles apart. Is this relation an equivalence relation on S? Justify your answer. 2) Define another relation on the set S from problem 5 by defining two people as related if they have the same classification (freshman, sophomore, junior, senior or graduate student). Is this an equivalence relation...
Define a relation S from R to R by saying that  if and only if (a) List...
Define a relation S from R to R by saying that  if and only if (a) List five different elements of S. (b) Prove that S is not a function.
Question 1. Equivalence Relation 1 Define a relation R on by iff . Prove that R...
Question 1. Equivalence Relation 1 Define a relation R on by iff . Prove that R is an equivalence relation, that is, prove that it is reflexive, symmetric, and transitive. Determine the equivalence classes of this relation. What members are in the class [2]? How many members do the equivalence classes have? Do they all have the same number of members? How many equivalence classes are there? Question 2. Equivalence Relation 2 Consider the relation from last week defined as:...
L = {a r b s | r, s ≥ 0 and s = r 2}....
L = {a r b s | r, s ≥ 0 and s = r 2}. Show that L is not regular using the pumping lemma
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT