Question

Let Q be the set {(a, b) ∶ a ∈ Z and b ∈ N}. Let...

Let Q be the set {(a, b) ∶ a ∈ Z and b ∈ N}.

Let (a, b), (c, d) ∈ Q. Show that (a, b) ∼ (c, d) if and only if ad − bc = 0 defines an equivalence relation on Q.

Homework Answers

Answer #1

​​​​​​a relation is an equivalence relation if it is

1)reflexive:a relation is reflexive if (a,b) related to (a,b) on Q

2)symmetric:a relationis symmetric if (a,b) related to (c,d) then (c,d) related to (a,b)

3) transitive:a relation is transitive if (a,b) related to (c,d) and (c,d) related to (e,f) then (a,b) related to (e,f).

Here (a,b),(c,d),(e,f) are elements on Q.

Know the answer?
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
Similar Questions
Let Q be the set {(a, b) ∶ a ∈ Z and b ∈ N}. Define...
Let Q be the set {(a, b) ∶ a ∈ Z and b ∈ N}. Define addition on Q by (a, b) + (c, d) = (ad + bc, bd) and define multiplication by (a, b) ⋅ (c, d) = (ac, bd).
Consider the following set S = {(a,b)|a,b ∈ Z,b 6= 0} where Z denotes the integers....
Consider the following set S = {(a,b)|a,b ∈ Z,b 6= 0} where Z denotes the integers. Show that the relation (a,b)R(c,d) ↔ ad = bc on S is an equivalence relation. Give the equivalence class [(1,2)]. What can an equivalence class be associated with?
Recall from class that we defined the set of integers by defining the equivalence relation ∼...
Recall from class that we defined the set of integers by defining the equivalence relation ∼ on N × N by (a, b) ∼ (c, d) =⇒ a + d = c + b, and then took the integers to be equivalence classes for this relation, i.e. Z = [(a, b)]∼ | (a, b) ∈ N × N . We then proceeded to define 0Z = [(0, 0)]∼, 1Z = [(1, 0)]∼, − [(a, b)]∼ = [(b, a)]∼, [(a, b)]∼...
1. Let a ∈ Z and b ∈ N. Then there exist q ∈ Z and...
1. Let a ∈ Z and b ∈ N. Then there exist q ∈ Z and r ∈ Z with 0 ≤ r < b so that a = bq + r. 2. Let a ∈ Z and b ∈ N. If there exist q, q′ ∈ Z and r, r′ ∈ Z with 0 ≤ r, r′ < b so that a = bq + r = bq′ + r ′ , then q ′ = q and r...
Define a relation on N x N by (a, b)R(c, d) iff ad=bc a. Show that...
Define a relation on N x N by (a, b)R(c, d) iff ad=bc a. Show that R is an equivalence relation. b. Find the equivalence class E(1, 2)
Let S be the set of all functions from Z to Z, and consider the relation...
Let S be the set of all functions from Z to Z, and consider the relation on S: R = {(f,g) : f(0) + g(0) = 0}. Determine whether R is (a) reflexive; (b) symmetric; (c) transitive; (d) an equivalence relation.
Let S = {A, B, C, D, E, F, G, H, I, J} be the set...
Let S = {A, B, C, D, E, F, G, H, I, J} be the set consisting of the following elements: A = N, B = 2N , C = 2P(N) , D = [0, 1), E = ∅, F = Z × Z, G = {x ∈ N|x 2 + x < 2}, H = { 2 n 3 k |n, k ∈ N}, I = R \ Q, J = R. Consider the relation ∼ on S given...
13. Let R be a relation on Z × Z be defined as (a, b) R...
13. Let R be a relation on Z × Z be defined as (a, b) R (c, d) if and only if a + d = b + c. a. Prove that R is an equivalence relation on Z × Z. b. Determine [(2, 3)].
Let F = {A ⊆ Z : |A| < ∞} be the set of all finite...
Let F = {A ⊆ Z : |A| < ∞} be the set of all finite sets of integers. Let R be the relation on F defined by A R B if and only if |A| = |B|. (a) Prove or disprove: R is reflexive. (b) Prove or disprove: R is irreflexive. (c) Prove or disprove: R is symmetric. (d) Prove or disprove: R is antisymmetric. (e) Prove or disprove: R is transitive. (f) Is R an equivalence relation? Is...
Using Discrete Math Let ρ be the relation on the set of natural numbers N given...
Using Discrete Math Let ρ be the relation on the set of natural numbers N given by: for all x, y ∈ N, xρy if and only if x + y is even. Show that ρ is an equivalence relation and determine the equivalence classes.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT