Question

In: Advanced Math

Show that the relation 'a R b if and only if a−b is an even integer defined on the Z of integers is an equivalence relation.

Expert Solution

(i) Since a−a=0 and 0 is an even integer

(a,a)∈R

∴ R is reflexive.

(ii) If (a−b) is even, then (b−a) is also even. then, if (a−b)∈R,(b,a)∈R

∴ The relation is symmetric.

(iii) If (a,b)∈R,(b,c)∈R, then (a−b) is even, (b−c) is even, then $$(a-b

+b-c)=a-c$$ is even.

∴ If (a,b)∈R,(b,c)∈R implies (a,c)∈R

∴ R is transitive.

Since R is reflexive, symmetric and transitive, it is an equivalence relation.

(i) Since a−a=0 and 0 is an even integer

(a,a)∈R

∴ R is reflexive.

(ii) If (a−b) is even, then (b−a) is also even. then, if (a−b)∈R,(b,a)∈R

∴ The relation is symmetric.

(iii) If (a,b)∈R,(b,c)∈R, then (a−b) is even, (b−c) is even, then $$(a-b

+b-c)=a-c$$ is even.

∴ If (a,b)∈R,(b,c)∈R implies (a,c)∈R

∴ R is transitive.

Since R is reflexive, symmetric and transitive, it is an equivalence relation.

Nipun Maity answered 2 years ago

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?

S = Z (integers), R = {(a,b) : a = b mod 5}. Is this relation...

S = Z (integers), R = {(a,b) : a = b mod 5}. Is this relation an equivalence relation on S? S = Z (integers), R = {(a,b) : a = b mod 3}. Is this relation an equivalence relation on S? If so, what are the equivalence classes?

Consider the equivalence relation on Z defined by the prescription that all positive numbers are equivalent,...

Consider the equivalence relation on Z defined by the prescription that all positive numbers are equivalent, all negative numbers are equivalent, and 0 is only equivalent to itself. Let f ∶ Z → {a, b} be the function that maps all negative numbers to a and all non-negative numbers to b. Does there exist a function F ∶ X/∼→ {a, b} such that f = F ○ π? If so, describe it .

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:...

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.

Consider the relation R defined on the set Z as follows: ∀m, n ∈ Z, (m,...

Consider the relation R defined on the set Z as follows: ∀m, n ∈ Z, (m, n) ∈ R if and only if m + n = 2k for some integer k. For example, (3, 11) is in R because 3 + 11 = 14 = 2(7). (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.

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: [?] + [?]...

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

Consider the following recurrence relation defined only for n = 2^k for integers k such that...

Consider the following recurrence relation defined only for n = 2^k for integers k such that k ≥ 1: T(2) = 7, and for n ≥ 4, T(n) = n + T(n / 2). Three students were working together in a study group and came up with this answer for this recurrence: T(n) = n * log2 (n) − n − log2 (n) + 8. Determine if this solution is correct by trying to prove it is correct by induction.

Question 1. Equivalence Relation 1 Define a relation R on by iff . Prove that R...

Question 1. Equivalence Relation 1 Define a relation R on by iff . Prove that R is an equivalence relation, that is, prove that it is reflexive, symmetric, and transitive. Determine the equivalence classes of this relation. What members are in the class [2]? How many members do the equivalence classes have? Do they all have the same number of members? How many equivalence classes are there? Question 2. Equivalence Relation 2 Consider the relation from last week defined as:...