Question

In: Advanced Math

Let R be the relation on Z+× Z+ such that (a, b) R (c, d) if...

Let R be the relation on Z+× Z+ such that (a, b) R (c, d) if and only if ad=bc. (a) Show that R is an equivalence relation. (b) What is the equivalence class of (1,2)? List out at least five elements of the equivalence class. (c) Give an interpretation of the equivalence classes for R. [Here, an interpretation is a description of the equivalence classes that is more meaningful than a mere repetition of the definition of R. Hint: Look at the ratio a/b corresponding to (a, b).

Solutions

Expert Solution

Given that,

R is the relation on​​​​​ Z+ * Z+ . (a,b) R(c,d)<=> ad=bc

(a)To prove:

R is equivalence relation

proof:

For equivalence relation we have to prove reflexive, symmentric and transistive.

Reflexive:

Consider (a,b)R . (a,b) R(a,b) is reflexive because ab=ab.

Symmentric:

Consider (a,b) and (c,d) R . Given that ad=bc and obviously bc=ad. Therefore, R is symmentric i.e., (a,b) R(c,d) =(c,d) R (a,b) .

Transistive:

Consider (a,b) ,(c,d) and (e,f) R.

(a,b)R(e,f) is af=be=>a/b=e/f ----(1)

(e,f)R(c,d) is ed=fc => e/f=c/d -------(2)

From (1) and (2)

a/b=c/d

ad=bc =>(a,b)R(c,d)

Therefore ,R is transistive.

R is an equivalence relation.

(b)  The equivalence class of (1,2)in R is { (2,4),(3,6),(4,8),(5,10),(6,13)}

Because 1/2 = 2/4 = 3/6 = 4/8 = 5/10 = 6/12

(c) Equivalence class is the quotient set created from the relation divided by ~ .

R/~= Z+* Z+ /~

a/b~c/d is the equivalence class of R

It is also written as

R is the equivalence class of element (a,b)

{x R|x~ (a,b)}

​​


Related Solutions

Let R be the relation on Q defined by a/b R c/d iff ad=bc. Show that...
Let R be the relation on Q defined by a/b R c/d iff ad=bc. Show that R is an equivalence relation. Describe the elements of the equivalence class of 2/3.
Define a relation ~ on Z x Z such that (a,b) ~ (c,d) precisely when a...
Define a relation ~ on Z x Z such that (a,b) ~ (c,d) precisely when a + b = c + d. Let R = {[(a,b)] : (a,b) in Z x Z} (i.e. R is the set of all equivalence classes of Z x Z under the equivalence relation ~). For each of the following operations, determine whether or not the operation is well defined. Prove your answer. [(x,y)] * [(w, z)] = [(x + w, y + z)] [(x,y)]...
Suppose A = {(a, b)| a, b ∈ Z} = Z × Z. Let R be...
Suppose A = {(a, b)| a, b ∈ Z} = Z × Z. Let R be the relation define on A where (a, b)R(c, d) means that 2 a + d = b + 2 c. a. Prove that R is an equivalence relation. b. Find the equivalence classes [(−1, 1)] and [(−4, −2)].
For the relation R(A,B,C,D,E) with the following Functional Dependencies: A → B, A → C, BC...
For the relation R(A,B,C,D,E) with the following Functional Dependencies: A → B, A → C, BC → D, AC → E, CE → A, list all non-trivial FDs following from the above.    Generate all possible keys for R. Check whether R is in 3NF. If it is in 3NF, explain the criteria you used. If it is not in 3NF, convert it into 3NF, showing the new relations and their FDs.
Let A and B be sets, and let R be a relation from A to B....
Let A and B be sets, and let R be a relation from A to B. Prove that Rng(R^-1) = Dom(R)
6. Let R be a relation on Z x Z such that for all ordered pairs...
6. Let R be a relation on Z x Z such that for all ordered pairs (a, b),(c, d) ∈ Z x Z, (a, b) R (c, d) ⇔ a ≤ c and b|d . Prove that R is a partial order relation.
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
2. Define a relation R on pairs of real numbers as follows: (a, b)R(c, d) iff...
2. Define a relation R on pairs of real numbers as follows: (a, b)R(c, d) iff either a < c or both a = c and b ≤ d. Is R a partial order? Why or why not? If R is a partial order, draw a diagram of some of its elements. 3. Define a relation R on integers as follows: mRn iff m + n is even. Is R a partial order? Why or why not? If R is...
Let ∼ be the relation on P(Z) defined by A ∼ B if and only if...
Let ∼ be the relation on P(Z) defined by A ∼ B if and only if there is a bijection f : A → B. (a) Prove or disprove: ∼ is reflexive. (b) Prove or disprove: ∼ is irreflexive. (c) Prove or disprove: ∼ is symmetric. (d) Prove or disprove: ∼ is antisymmetric. (e) Prove or disprove: ∼ is transitive. (f) Is ∼ an equivalence relation? A partial order?
Consider the relation R= {A, B, C, D, E, F, G, H} and the set of...
Consider the relation R= {A, B, C, D, E, F, G, H} and the set of functional dependencies: FD= {{B}—> {A}, {G}—> {D, H}, {C, H}—> {E}, {B, D}—> {F}, {D}—>{C}, {C}—> {G}} 1) Draw FD using the diagrammatic notation. 2) What are all candidate keys for R? 3) If delete {C}—>{G} and change {C, H}—> {E} to {C, H}—> {E, G}, what are all candidate keys for R
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT