Question

1. (14 points) (a) For each of the following relations R on the given domains A,...

1. (14 points) (a) For each of the following relations R on the given domains A, categorize them as not an equivalence relation, an equivalence relation with finitely many distinct equivalence classes, or an equivalence relation with infinitely many distinct equivalence classes. Justify each decision with a brief proof. (i) A = {1, 2, 3} , R = {(1, 1),(2, 2),(3, 3)} (ii) A = R, R = {(x, y) | x 2 = y 2} (iii) A = Z, R = {(x, y) | x ≡ y (mod 4)} (iv) A = P(Z +), R = {(x, y) | x ⊆ y}

0 0
Add a comment Improve this question Transcribed image text
Answer #1

r) So) ryて 3 2 2 RederomPage d.Date:/ p(2,ナ) Thi 2 l in Nad Related to Le 1 2

Add a comment
Know the answer?
Add Answer to:
1. (14 points) (a) For each of the following relations R on the given domains A,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 2. (5pt) Consider the following binary relations. In each case prove the relation in question is...

    2. (5pt) Consider the following binary relations. In each case prove the relation in question is an equivalence relation and describe, in geometric terms, what the equivalence classes are. (a) Si is a binary relation on R2 x R2 defined by z+ly-+ 1 r,y). (,y) e S Recall that R =R x R. (b) Sa is a binary relation on R defined by 1-ye2 r,y) e S

  • probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R =...

    probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R = R(,y) on S is a statement about pairs (x,y) of elements of S. For r,y ES, I is related to y notation: Ry) if R(x,y) is true. A relation Ris: Reflexive if for any I ES, R. Symmetric if for any ry ES, Ry implies y Rr. Transitive if for any r.y.ES, Ry and yRimply R. An equivalence relation is a reflexive, symmetric and...

  • (1) Suppose R and S are reflexive relations on a set A. Prove or disprove each...

    (1) Suppose R and S are reflexive relations on a set A. Prove or disprove each of these statements. (a) RUS is reflexive. (b) Rn S is reflexive. (c) R\S is reflexive. (2) Define the equivalence relation on the set Z where a ~b if and only if a? = 62. (a) List the element(s) of 7. (b) List the element(s) of -1. (c) Describe the set of all equivalence classes.

  • 2. Consider the set A = {1, 2, 3, ... , 12} and the relations Em...

    2. Consider the set A = {1, 2, 3, ... , 12} and the relations Em on A where x =m y means m divides x – y. (These are equivalence relations on A for the same reason as the similarly-defined relations on all of Z.) For each x E A, find the equivalence classes [x]=ş and [x]=4. Which =3 -equivalence classes are the same? Which 34 -equivalence classes are the same?

  • Please how to solve this problem! thank you & (-76 Points) DETAILS EPPDISCMATHS 8.3.006. MY NOTES...

    Please how to solve this problem! thank you & (-76 Points) DETAILS EPPDISCMATHS 8.3.006. MY NOTES ASK YOUR TEACHER Let A = (-2,-1, 0, 1, 2, 3, 4, 5, 6, 7) and define a relation Ron A as follows: For all x,y EA, XRY 3)(x - y). It is a fact that is an equivalence relation on A. Use set-roster notation to write the equivalence classes of R. [0] = [1] - [2] - (3) - How many distinct equivalence...

  • 1) Let R be the relation defined on N N as follows: (m, n)R(p, q) if...

    1) Let R be the relation defined on N N as follows: (m, n)R(p, q) if and only if m - pis divisible by 3 and n - q is divisible by 5. For example, (2, 19)R(8,4). 1. Identify two elements of N X N which are related under R to (6, 45). II. Is R reflexive? Justify your answer. III. Is R symmetric? Justify your answer. IV. Is R transitive? Justify your answer. V.Is R an equivalence relation? Justify...

  • (2 pts each) Find a different equivalent form of the statements. Justify your answers using Laws...

    (2 pts each) Find a different equivalent form of the statements. Justify your answers using Laws of equivalence or otherwise. (a) Not all men are Scientists. (b) If you are a computer science major you will need discrete mathematics. (10 pts) Let R be an equivalence relation on a non empty set X. So R C X X X. R is reflexive: Vx E X, (x,x) E R, R is symmetric: Vx, y E X, (x,y) E R = (y,x)...

  • Problem 3. Which of the following relations are equivalence relations on the given set S (1)...

    Problem 3. Which of the following relations are equivalence relations on the given set S (1) S-R and ab5 2a +3b. (2) S-Z and abab 0 (4) S-N and a~b ab is a square. (5) S = R × R and (a, b) ~ (x, y)-a2 + b-z? + y2.

  • Please do both questions. wrong answers will be given thumbs down. Question 7. Prove using the...

    Please do both questions. wrong answers will be given thumbs down. Question 7. Prove using the Division Lemma that Yn E Z, n3 n is divisible by 3 (any proof not using the Division Lemma will receive no credit). Question 8. Define a relation ~ on R \ {0} by saying x ~ y İfzy > 0. (a) Prove that is an equivalence relation (b) Determine all distinct equivalence classes of~ prove that your answer is correct.

  • 2. Let S 11,2,3,4,5, 6, 7,8,91 and let T 12,4,6,8. Let R be the relation on P (S) detined by for ...

    2. Let S 11,2,3,4,5, 6, 7,8,91 and let T 12,4,6,8. Let R be the relation on P (S) detined by for all X, Y E P (s), (X, Y) E R if and only if IX-T] = IY-T]. (a) Prove that R is an equivalence relation. (b) How many equivalence classes are there? Explain. (c) How mauy elements of [ø], the equivalence class of ø, are there? Explain (d) How many elements of [f1,2,3, 4)], the equivalence class of (1,2,3,...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT