Question

Determine the distance equivalence classes for the relation R is defined on ℤ by a R...

Determine the distance equivalence classes for the relation R is defined on ℤ by a R b if |a - 2| = |b - 2|.

I had to prove it was an equivalence relation as well, but that part was not hard. Just want to know if the logic and presentation is sound for the last part:

8.48) A relation R is defined on ℤ by a R b if |a - 2| = |b - 2|. Prove that R is an equivalence relation and determine the distinct equivalence classes.

Proof We show that R is reflexive, symmetric, and transitive.

Reflexivity: Let a ∈ ℤ. a R a since it is the case that |a - 2| = |a - 2| for all a.

Symmetry: Suppose a R b. Then |a - 2| = |b - 2|. |b - 2| = |a - 2| trivially.

Transitivity: Suppose a R b and b R c. |a - 2| = |b - 2| and |b - 2| = |c - 2|. a R c by transitive property of equality.

---

Some equivalence classes are:

...[-3] = {-3, 7}, [-2] = {-2, 6}, [-1] = {-1, 5}, [0] = {0, 4}, [1] = {1, 3}, [2] = {0}, [3] = {1, 3}, [4] = {0, 4}, [5] = {5, -1}, [6] = {6, -2}, [7] = {7, -3}, [8] = {8, -4}, [9] = {9, -7}...

Observe that the distinct equivalence classes are [0], [1], [2], [4], [5], [6], [7], [8], [9], ..., [n]

Define the set of distinct equivalence classes as N = {[n] : n ∈ Z+ - {3}}

Homework Answers

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
2. Let R be a relation on the set of integers ℤ defined by ? =...
2. Let R be a relation on the set of integers ℤ defined by ? = {(?, ?): a2 + ?2 ?? ? ??????? ??????} Is this relation reflexive? Symmetric? transitive?
a) Let R be an equivalence relation defined on some set A. Prove using induction that...
a) Let R be an equivalence relation defined on some set A. Prove using induction that R^n is also an equivalence relation. Note: In order to prove transitivity, you may use the fact that R is transitive if and only if R^n⊆R for ever positive integer ​n b) Prove or disprove that a partial order cannot have a cycle.
Consider the relation R defined on the set R as follows: ∀x, y ∈ R, (x,...
Consider the relation R defined on the set R as follows: ∀x, y ∈ R, (x, y) ∈ R if and only if x + 2 > y. For example, (4, 3) is in R because 4 + 2 = 6, which is greater than 3. (a) Is the relation reflexive? Prove or disprove. (b) Is the relation symmetric? Prove or disprove. (c) Is the relation transitive? Prove or disprove. (d) Is it an equivalence relation? Explain.
For each of the following, prove that the relation is an equivalence relation. Then give the...
For each of the following, prove that the relation is an equivalence relation. Then give the information about the equivalence classes, as specified. a) The relation ∼ on R defined by x ∼ y iff x = y or xy = 2. Explicitly find the equivalence classes [2], [3], [−4/5 ], and [0] b) The relation ∼ on R+ × R+ defined by (x, y) ∼ (u, v) iff x2v = u2y. Explicitly find the equivalence classes [(5, 2)] and...
9e) fix n ∈ ℕ. Prove congruence modulo n is an equivalence relation on ℤ. How...
9e) fix n ∈ ℕ. Prove congruence modulo n is an equivalence relation on ℤ. How many equivalence classes does it have? 9f) fix n ∈ ℕ. Prove that if a ≡ b mod n and c ≡ d mod n then a + c ≡b + d mod n. 9g) fix n ∈ ℕ.Prove that if a ≡ b mod n and c ≡ d mod n then ac ≡bd mod n.
Consider the relation R defined on the real line R, and defined as follows: x ∼...
Consider the relation R defined on the real line R, and defined as follows: x ∼ y if and only if the distance from the point x to the point y is less than 3. Study if this relation is reflexive, symmetric, and transitive. Which points are related to 2?
4. Let A={(1,3),(2,4),(-4,-8),(3,9),(1,5),(3,6)}. The relation R is defined on A as follows: For all (a, b),(c,...
4. Let A={(1,3),(2,4),(-4,-8),(3,9),(1,5),(3,6)}. The relation R is defined on A as follows: For all (a, b),(c, d) ∈ A, (a, b) R (c, d) ⇔ ad = bc . R is an equivalence relation. Find the distinct equivalence classes of R.
Let ​R​ be an equivalence relation defined on some set ​A​. Prove using mathematical induction that...
Let ​R​ be an equivalence relation defined on some set ​A​. Prove using mathematical induction that ​R​^n​ is also an equivalence relation.
Let N* be the set of positive integers. The relation ∼ on N* is defined as...
Let N* be the set of positive integers. The relation ∼ on N* is defined as follows: m ∼ n ⇐⇒ ∃k ∈ N* mn = k2 (a) Prove that ∼ is an equivalence relation. (b) Find the equivalence classes of 2, 4, and 6.
A relation R is defined on Z by aRb if |a−b| ≤ 2. Which of the...
A relation R is defined on Z by aRb if |a−b| ≤ 2. Which of the properties reflexive, symmetric and transitive does the relation R possess? Explain why If R does not possess one of these properties,
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT