# Discrete Math

posted by .

Which of these relations on {0, 1, 2, 3} are equivalence relations? Justify the relation(s) that are not equivalent.

R1: {(0,0), (1,1), (2,2), (3,3)}
R2: {(0,0), (1,1), (1,3), (2,2), (2,3), (3,1), (3,2), (3,3)}
R3: {(0,0), (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), (2,2), (3,3)}

R1: This relations is equivalent
R2: This relation is equivalent
R3: This relation is not equivalent because:
• It is reflexive because the relation does contains (0,0), (1,1), (2,2), and (3,3).
• It is not symmetric because the relation contains (1,2), but not (2,1).
•This relation is transitive.

I think something is not right. . .Any suggestions? Thanks for any helpful replies!

• Discrete Math -

I think I may have found the problem in my thinking:

R2 is not equivalent right? Because it is not transitive.

Justification:
It is reflexive because the relation does contain (0,0), (1,1), (2,2), and (3,3).
It is symmetric because the relation contains (1,3) ⋏ (3,1), and (2,3) ⋏ (3,2)
Though the relation contains (1,3) ⋏ (3,2) it does not have (1,2), which means it is not transitive.

• Discrete Math -

R1: This relations is equivalent (agree)

R2 is not equivalent right? Because it is not transitive. (agree)

R3: This relation is not equivalent because the relation contains (1,2), but not (2,1) (agree)

Excellent!

• Discrete Math -

Thank you for the reassurance.

• Discrete Math :) -

Keep up the good work!

## Similar Questions

1. ### Discrete Math

Consider the following relations on R, the set of real numbers a. R1: x, y ∈ R if and only if x = y. b. R2: x, y ∈ R if and only if x ≥ y. c. R3 : x, y ∈ R if and only if xy < 0. Determine whether or not …
2. ### social studies

Although the Chesapeake and New England colonies differed in many ways, relations with Native Americans followed a similar course in both regions. Why?
3. ### Math

Suppose R is the relation on N where aRb means that a ends in the same digit in which b ends. Determine whether R is an equivalence relation on N. And, Suppose that R and S are equivalence relations on a set A. Prove that the R ¿ …
4. ### Discrete Math

a) Show that the relation R on Z x Z defined by (a , b) R (c, d) if and only if a + d = b + c is an equivalence relation. b) Show that a subset of an anti symmetric relation is also anti symmetric. c) Suppose that R is a symmetric …

. Let A = {1,2,3,4}. Prove the statements (a) and (b). You must describe the relations on A as a subset of AxA and also draw their arrow diagrams. (a) There exists a relation R on A so that R is refexive, symmetric but not transitive. …

Let A = {1,2,3,4}. Prove the statements (a) and (b). You must describe the relations on A as a subset of AxA and also draw their arrow diagrams. (a) There exists a relation R on A so that R is refexive, symmetric but not transitive. …
7. ### human relations

A major obstacle to developing good human relations skills is that A.human relations aren't rewarding. B. Few persons have common interests. C. Common interests wont help to keep a conversation going. D.people fear taking risks.
8. ### Discrete Mathematics. Need Help

Let A be the set of all ordered pairs of positive integers and R be the relation defined on A where (a,b)R(c,d) means that b-a=d-c. a)Show that R is an equivalence relation. b)Find [(3, 5)] and [(7, 1)].
9. ### math

Are all relations equations? Is there any instances where a relation is not a relation
10. ### Math

Give examples of three functions and three relations, using at least three different representations (e.g., symbolic representations, graphical representations, diagrams, tables of values, lists of ordered pairs). Use the definitions …

More Similar Questions