Question

In: Advanced Math

Determine whether the given relation is an equivalence relation on the set. Describe the partition arising...

Determine whether the given relation is an equivalence relation on the set. Describe the partition arising from each equivalence relation. (c) (x1,y1)R(x2,y2) in R×R if x1∗y2 = x2∗y1.

Solutions

Expert Solution

Use comments section for queries

Reflexive:

Since hence

Thus is reflexive.

Symmetric:

Assume that

then

Now

Thus R is symmetric.

Transitive:

Assume that

-----------------------(1)

Again assume that

------------------------(2)

Now multiplying (1) by and (2) by we have

Thus is transitive.

Combining we find that is an equivalence relation.

Equivalence Relation:

Notice that

Our set of equivalence classes will be those sets of ordered pairs of real numbers who when divided equal one another. For example, if we consider the equivalence class   ,then Included in this would also be and so on.

Similarly if we consider equivalence class , then   Included in this would also be and so on.


Related Solutions

Prove that the equivalence classes of an equivalence relation form a partition of the domain of...
Prove that the equivalence classes of an equivalence relation form a partition of the domain of the relation. Namely, suppose ? be an equivalence relation on a set ? and define the equivalence class of an element ?∈? to be [?]?:={?∈?|???}. That is [?]?=?(?). Divide your proof into the following three peices: Prove that every partition block is nonempty and every element ? is in some block. Prove that if [?]?∩[?]?≠∅, then ???. Conclude that the sets [?]? for ?∈?...
Determine whether or not the following is an equivalence relation on N. If it is not,...
Determine whether or not the following is an equivalence relation on N. If it is not, determine which property fails. If it is, prove it. (a) x ∼ y if and only if x|y (x evenly divides y). (b) x ∼ y if and only if the least prime dividing x is the same as the least prime dividing y. In this case, instead if using N, use the set A = {2,3,4,5,...}. (c) x∼yifandonlyif|x−y|<5. (d) x∼yifandonlyifx=4. 2. Prove that...
An equivalence relation partitions the plane R2 into the set of lines with slope 2. Describe...
An equivalence relation partitions the plane R2 into the set of lines with slope 2. Describe the relation on R .
Let X be a finite set. Describe the equivalence relation having the greatest number of distinct...
Let X be a finite set. Describe the equivalence relation having the greatest number of distinct equivalence classes, and the one with the smallest number of equivalence classes.
The equivalence relation on Z given by (?, ?) ∈ ? iff ? ≡ ? mod...
The equivalence relation on Z given by (?, ?) ∈ ? iff ? ≡ ? mod ? is an equivalence relation for an integer ? ≥ 2. a) What are the equivalence classes for R given a fixed integer ? ≥ 2? b) We denote the set of equivalence classes you found in (a) by Z_5. Even though elements of Z_5 are sets, it turns out that we can define addition and multiplication in the expected ways: [?] + [?]...
(1) In each part, decide whether or not the described relation is an equivalence relation. Explain...
(1) In each part, decide whether or not the described relation is an equivalence relation. Explain your answers. (a) A is the set of all residents of the United States. The relation ∼ on A given by: x ∼ y if x, y are in the same state at noon on November 3rd. (b) U is the set of all undergraduates at the University of Oregon. The relation ∼ on U given by: x ∼ y if x, y are...
Determine whether the relation R on the set of all people is reflexive, symmetric, antisymmetric, and/or...
Determine whether the relation R on the set of all people is reflexive, symmetric, antisymmetric, and/or transitive, where (a, b) ∈ R if and only if a) a is taller than b. b) a and b were born on the same day.
select the relation that is an equivalence relation. THe domain set is (1,2,3,4). a. (1,4)(4,1),(2,2)(3,3) b....
select the relation that is an equivalence relation. THe domain set is (1,2,3,4). a. (1,4)(4,1),(2,2)(3,3) b. (1,4) (4,1)(1,3)(3,1)(2,2) c. (1,4)(4,1)(1,1)(2,2)(3,3)(4,4) d. (1,4)(4,1)(1,3)(3,1)(1,1)(2,2)(3,3)(4.4)
Problem 10. a. Construct of partition of N with exactly 4 elements and describe the equivalence...
Problem 10. a. Construct of partition of N with exactly 4 elements and describe the equivalence relation defined by your partition. Remember the elements of a partition are sets. b. Construct of partition of N with infinitely many elements and describe the equivalence relation defined by your partition. c. Construct a partion of the plane with exactly 4 elements and describe the equivalence relation defined by your partition. d. Construct a partion of the plane with infinitely many elements and...
Prove that \strongly connected" is an equivalence relation on the vertex set of a directed graph
Prove that \strongly connected" is an equivalence relation on the vertex set of a directed graph
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT