0% found this document useful (0 votes)
67 views11 pages

hw3 Solutions

This document contains 7 math problems regarding equivalence relations and well-defined operations on sets. Problem 1 asks to check if relations are reflexive, symmetric, or transitive for sets with various relations. Problem 2 examines an equivalence relation on real numbers where numbers are related if their squares are equal. Problems 3-5 contain similar analyses of other relations and sets. Problems 6-7 determine if certain operations are well-defined on sets of rational numbers and integers modulo n.

Uploaded by

Alok Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
67 views11 pages

hw3 Solutions

This document contains 7 math problems regarding equivalence relations and well-defined operations on sets. Problem 1 asks to check if relations are reflexive, symmetric, or transitive for sets with various relations. Problem 2 examines an equivalence relation on real numbers where numbers are related if their squares are equal. Problems 3-5 contain similar analyses of other relations and sets. Problems 6-7 determine if certain operations are well-defined on sets of rational numbers and integers modulo n.

Uploaded by

Alok Yadav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Math 3450 - Homework # 3

Equivalence Relations and Well-Defined Operations


1. A set S and a relation ∼ on S is given. For each example, check if ∼
is (i) reflexive, (ii) symmetric, and/or (iii) transitive. If ∼ satisfies the
property that you are checking, then prove it. If ∼ does not satisfy the
property that you are checking, then give an example to show it.

(a) S = R where a ∼ b if and only if a ≤ b.


Solution:
(i) Yes, ∼ is reflexive. Proof: Let a ∈ R. Then a ≤ a. So a ∼ a.
(ii) No, ∼ is not symmetric. Counterexample: 3 ≤ 4, but 4 6≤ 3.
That is, 3 ∼ 4 but 4 6∼ 3.
(iii) Yes, ∼ is transitive. Proof: Let a, b, c ∈ R and suppose that
a ∼ b and b ∼ c. Then a ≤ b and b ≤ c. So a ≤ c. Thus a ∼ c.
(b) S = R where a ∼ b if and only if |a| = |b|.
Solution:
(i) Yes, ∼ is reflexive. Proof: Let a ∈ R. Then |a| = |a|. So a ∼ a.
(ii) Yes, ∼ is symmetric. Proof: Let a, b ∈ R and suppose that
a ∼ b. Then |a| = |b|. So |b| = |a|. Thus b ∼ a.
(iii) Yes, ∼ is transitive. Proof: Let a, b, c ∈ R and suppose that
a ∼ b and b ∼ c. Then |a| = |b| and |b| = |c|. So |a| = |c|. Thus
a ∼ c.
(c) S = Z where a ∼ b if and only if a|b.
Solution:
(i) Yes, ∼ is reflexive. Proof: Let a ∈ Z. Then a(1) = a. Hence
a|a. So a ∼ a.
(ii) No, ∼ is not symmetric. Counterexample: 3|6, but 6 - 3.
(iii) Yes, ∼ is transitive. Proof: Let a, b, c ∈ Z. Suppose that
a ∼ b and b ∼ c. Then a|b and b|c. Thus there exists k, m ∈ Z
such that ak = b and bm = c. Then c = bm = (ak)m = a(km).
So a|c. Thus a ∼ c.
(d) S is the set of subsets of N where A ∼ B if and only if A ⊆ B.
Some examples of elements of S are {1, 10, 199}, {2, 7, 10}, and
{2, 10, 3, 7}. Note that {2, 7, 10} ∼ {2, 10, 3, 7}
Solution:
(i) Yes, ∼ is reflexive. Proof: A ⊆ A for all A ∈ S.
(ii) No, ∼ is not symmetric. Counterexample: {3} ⊆ {3, 42}, but
{3, 42} * {3}.
(iii) Yes, ∼ is transitive. Proof: Let A, B, C ∈ S with A ∼ B and
B ∼ C. Then A ⊆ B and B ⊆ C. We want to show that A ⊆ C.
Let x ∈ A. Since A ⊆ B, we have that x ∈ B. Since B ⊆ C we
have that x ∈ C. So A ⊆ C and thus A ∼ C.
2. Consider the set S = R where x ∼ y if and only if x2 = y 2 .
(a) Find all the numbers
√ that are related to x = 1. Repeat this
exercise for x = 2 and x = 0.
Solution:
1 ∼ 1 since 12 = 12 . We also have 1 ∼ (−1) since 12 = (−1)2 .
There are no other elements related to 1.
√ √ √ 2 √ 2 √ √
√2 ∼ 2 since
√ ( 2) = ( 2) . We also have 2 ∼ (− 2) since

( 2)2 = (− 2)2 . There are no other elements related to 2.
0 ∼ 0 since 02 = 02 . There are no other elements related to 0.
(b) Prove that ∼ is an equivalence relation on S.
Solution:
Proof. Reflexive: We know that x2 = x2 for all real numbers x.
Therefore x ∼ x for all real numbers x. So ∼ is reflexive.
Symmetric: Let x, y ∈ R. Suppose that x ∼ y.
Since x ∼ y we have that x2 = y 2 .
So y 2 = x2 .
Therefore y ∼ x.
Transitive Let x, y, z ∈ R. Suppose that x ∼ y and y ∼ z.
Since x ∼ y we have that x2 = y 2 .
Since y ∼ z we have that y 2 = z 2 .
So x2 = y 2 = z 2 .
Therefore x ∼ z.
(c) Draw a number line. Draw √a picture of the equivalence class of 1.
Repeat this for x = 0, x = 6, x = −3.
Solution: Please draw a picture.
(d) Describe the elements of S/ ∼.
Solution:
If x 6= 0, then the equivalence class of x is x = {−x, x}. The
equivalence class of 0 is 0 = {0}.

3. Consider the set S = Z where x ∼ y if and only if 2|(x + y).

(a) List six numbers that are related to x = 2.


Solution:
2 ∼ (−4) since 2|(2 + (−4)).
2 ∼ (−2) since 2|(2 + (−2)).
2 ∼ (0) since 2|(2 + (0)).
2 ∼ (2) since 2|(2 + (2)).
2 ∼ (4) since 2|(2 + (4)).
2 ∼ (6) since 2|(2 + (6)).
(b) Prove that ∼ is an equivalence relation on S.

Proof. Reflexive: Let x ∈ Z.


Since 2|2x we have that 2|(x + x).
So x ∼ x.
Symmetric: Let x, y ∈ Z and suppose that x ∼ y.
Thus 2|(x + y).
So 2|(y + x).
So y ∼ x.
Transitive: Let x, y, z ∈ Z and suppose that x ∼ y and y ∼ z.
Therefore 2|(x + y) and 2|(y + z).
So there exist k, ` ∈ Z such that 2k = x + y and 2` = y + z.
Add these equations to get 2k + 2` = x + 2y + z.
Subtract 2y from both sides to get 2(k + ` − y) = x + z.
Note that k + ` − y ∈ Z, because k, `, y ∈ Z and Z is closed under
addition and subtraction.
So 2|(x + z).
So x ∼ z.
(c) Draw a picture of the set of integers. Next, circle the numbers
that are in the equivalence class of −3.
Solution: Draw a picture and circle these numbers:
. . . , −7, −5, −3, −1, 1, 3, 5, 7, . . .
(d) Describe the elements of S/ ∼. Draw a picture of several equiva-
lence classes.
Solution: Draw a picture of the following:

0 = {. . . , −6, −4, −2, 0, 2, 4, 6, . . .} = −2 = 2 = 4 = −4 = · · ·


1 = {. . . , −7, −5, −3, −1, 1, 3, 5, 7, . . .} = −1 = 3 = −3 = −5 = · · ·

So S/ ∼ is equal to {0, 1}. That is, one equivalence class is the


set of all odd numbers; the other equivalence class is the set of all
even numbers.
2
4. Show that the operation a ⊕ b = a2 + b is a well-defined operation for
Zn . Here a2 means a · a. For example, in Z4 we have that

2 ⊕ 3 = 2 · 2 + 3 · 3 = 4 + 9 = 1.

Proof. 1) Let a, b ∈ Zn where a, b ∈ Z.


Then
2
a ⊕ b = a2 + b = a2 + b 2 = a2 + b 2 .

Since a, b ∈ Z we have that a2 + b2 ∈ Z.


Therefore, a ⊕ b = a2 + b2 ∈ Zn .
So Zn is closed under the operation ⊕.
2) Suppose that a1 , a2 , b1 , b2 ∈ Z such that a1 = a2 and b1 = b2 . We
need to show that a1 ⊕ b1 = a2 ⊕ b2 .
From class we had a theorem that says that if x = y and w = z, then
x + w = y + z and x · w = y · z.
Repeatedly using the above theorem we get the following.
We have that a1 · a1 = a2 · a2 by multiplying the equations a1 = a2 and
a1 = a2 .
Similarly, b1 · b1 = b2 · b2 by multiplying the equations b1 = b2 and
b1 = b2 .
Adding the two equations above we get that a1 ·a1 +b1 ·b1 = a2 ·a2 +b2 ·b2 .
Therefore, a1 ⊕ b1 = a2 ⊕ b2 .
Thus ⊕ is a well-defined operation on Zn .

5. Given two integers a and b, let min(a, b) denote the minimum (smaller)
of a and b. Let n be an integer with n ≥ 2. Is the operation a ⊕ b =
min(a, b) a well-defined operation on Zn ?
Solution: This operation is not well-defined. For example, consider
n = 4. In Z4 we have that 0 = 8 and 1 = 5. Thus, for the operation
to be well-defined we would need 0 ⊕ 1 = 8 ⊕ 5. However, 0 ⊕ 1 =
min(0, 1) = 0 and 8 ⊕ 5 = min(8, 5) = 5. But 0 6= 5 in Z4 .
a c ad
6. (a) Show that the operation ⊕ = is not a well-defined operation
b d bc
on Q. (b) Is the operation well-defined on Q − {0}?

a c ad
(a) Show that the operation ⊕ = is not a well-defined operation
b d bc
on Q.
Solution: We have that 52 , 01 ∈ Q however 52 ⊕ 10 = 5·1
2·0
= 50 6∈ Q.
Hence Q is not closed under ⊕ and the operation is not well-
defined.
(b) Is the operation well-defined on Q \ {0}?
Solution: Yes! Here is a proof.

Proof. 1) Let a, b, c, d ∈ Z with a 6= 0, b 6= 0,c 6= 0,d 6= 0 so that


a c
, ∈ Q − {0}.
b d
Since a 6= 0, b 6= 0,c 6= 0,d 6= 0 we have that ad 6= 0 and bc 6= 0.
a c ad
Thus ⊕ = ∈ Q − {0}.
b d bc
Therefore Q − {0} is closed under the operation ⊕.
2) Suppose further that we have e, f, g, h ∈ Z with e 6= 0, f 6=
0,g 6= 0,h 6= 0 so that fe , hg ∈ Q − {0}.
Also assume that ab = fe and dc = hg .
We want to show that ab ⊕ dc = fe ⊕ hg .
a c ad e g eh
We have that b
⊕ d
= bc
and f
⊕ h
= fg
.
Since ab = fe we have that af = be.
Since dc = hg we have that ch = dg.
Multiplying af = be by dg = ch we get af dg = bech.
Rearranging we get (ad)(f g) = (bc)(eh).
Therefore, adbc
= fehg .
So ab ⊕ dc = fe ⊕ hg .
Thus, the operation is well-defined.

7. Is the operation a ⊕ b = ab a well-defined operation on Zn ?


Solution: There are two issues with this operation.
One issue is as follows. As an example, consider n = 4. In Z4 we have
that 1 = 5. Thus, for the operation to be well-defined we must have
that 2 ⊕ 1 = 2 ⊕ 5. However, 2 ⊕ 1 = 21 = 2 and 2 ⊕ 5 = 25 = 32 = 0.
And 2 6= 0 in Z4 .
Another issue is when b is a negative integer. For example, in Z4
suppose we want to calculate 2 ⊕ −1. What does this mean? The
formula says that it is 2−1 . But what is that in Z4 ? In fact there is
no way to make sense of 1/2 in Z4 because there is no multiplicative
inverse for 2 in Z4 . (Why?) Because there is no x ∈ Z4 with x · 2 = 1.
We can check:
0 · 2 = 0 6= 1
1 · 2 = 2 6= 1
2 · 2 = 4 = 0 6= 1
3 · 2 = 6 = 2 6= 1
Thus there is no way to define 2−1 in Z4 .

8. (Constructing the integers from the natural numbers) Let S = N × N.


Define the relation ∼ on S where (a, b) ∼ (c, d) if and only if a+d = b+c.

(a) Is (3, 6) ∼ (7, 10) ?


Solution: Yes, because 3 + 10 = 6 + 7.
(b) Is (1, 1) ∼ (3, 5) ?
Solution: No, because 1 + 5 6= 1 + 3.
(c) Prove that ∼ is an equivalence relation.

Proof. Reflexive: Let (a, b) ∈ N × N.


Then a + b = b + a.
So (a, b) ∼ (a, b).
Symmetric: Let (a, b), (c, d) ∈ N × N.
Suppose (a, b) ∼ (c, d).
We know that a + d = b + c, because (a, b) ∼ (c, d).
So c + b = d + a.
So (c, d) ∼ (a, b).
Transitive: Let (a, b), (c, d), (e, f ) ∈ N × N.
Suppose that (a, b) ∼ (c, d) and (c, d) ∼ (e, f ).
We know that a+d = b+c and c+f = d+e, because (a, b) ∼ (c, d)
and (c, d) ∼ (e, f ).
Add these two equations to get a + c + d + f = b + c + d + e.
Subtract c + d from both sides to get a + f = b + e.
So (a, b) ∼ (e, f ).

Therefore, ∼ is an equivalence relation, because it is reflexive,


symmetric, and transitive.

(d) List five elements from each of the following equivalence classes:
(1, 1), (1, 2), (5, 12).
Solution: Some possible answers:
(2, 2), (3, 3), (4, 4), (5, 5), (47, 47) ∈ (1, 1).
(2, 3), (3, 4), (4, 5), (5, 6), (47, 48) ∈ (1, 2).
(2, 9), (3, 10), (4, 11), (5, 12), (47, 56) ∈ (5, 12).
(e) Define the operation (a, b) ⊕ (c, d) = (a + c, b + d). Prove that ⊕
is well-defined on the set of equivalence classes.

Proof. 1) Consider two equivalence classes (a, b) and (c, d) where


(a, b), (c, d) ∈ N × N.
Then a + c and b + d are both in N because N is closed under
addition.
Thus, (a, b) ⊕ (c, d) = (a + c, b + d) is a valid equivalence class in
N × N/ ∼.

2) Now suppose that (a, b),(c, d),(e, f ),and (g, h) are equivalence
classes of N × N/ ∼.
Further suppose that (a, b) = (e, f ) and (c, d) = (g, h).
We need to show that (a, b) ⊕ (c, d) = (e, f ) ⊕ (g, h).
We have that a + f = b + e since (a, b) = (e, f ).
We also have that c + h = d + g since (c, d) = (g, h).
Adding these two equations gives a + f + c + h = b + e + d + g.
Rearranging gives (a + c) + (f + h) = (b + d) + (e + g).
Therefore, (a + c, b + d) = (e + g, f + h).
Hence (a, b) ⊕ (c, d) = (e, f ) ⊕ (g, h).

The above arguments show that ⊕ is a well-defined operation on


the equivalence classes of N × N/ ∼.

9. (Constructing the rational numbers from the integers) Let S = Z ×


(Z − {0}). Define the relation ∼ on S where (a, b) ∼ (c, d) if and only
if ad = bc.

(a) Is (1, 5) ∼ (−3, −15) ?


Solution: Yes, because 1(−15) = 5(−3).
(b) Is (−1, 1) ∼ (2, 3) ?
Solution: No, because (−1)(3) 6= 1(2).
(c) Prove that ∼ is an equivalence relation.

Proof. Reflexive: Let (a, b) ∈ Z × (Z − {0}).


Then ab = ba.
So (a, b) ∼ (a, b).
Symmetric: Let (a, b), (c, d) ∈ Z × (Z − {0}).
Suppose (a, b) ∼ (c, d).
We know that ad = bc, because (a, b) ∼ (c, d).
So cb = da.
Hence (c, d) ∼ (a, b).
Transitive: Let (a, b), (c, d), (e, f ) ∈ Z × (Z − {0}).
Suppose (a, b) ∼ (c, d) and (c, d) ∼ (e, f ).
We know that ad = bc and cf = de, because (a, b) ∼ (c, d) and
(c, d) ∼ (e, f ).
Multiply these two equations to get adcf = bcde.
Divide both sides by c and then by d to get af = be. (Note that
c, d 6= 0 because c, d ∈ Z − {0}, so it’s okay to divide by c and by
d.)
So (a, b) ∼ (e, f ) since af = be.

Therefore, ∼ is an equivalence relation, because it is reflexive,


symmetric, and transitive.

(d) List five elements from each of the following equivalence classes:
(1, 1), (0, 2), (2, 3).
Solution: Some possible answers:
(2, 2), (3, 3), (4, 4), (5, 5), (47, 47) ∈ (1, 1).
(0, 1), (0, 2), (0, −1), (0, −2), (0, −47) ∈ (0, 2).
(2, 3), (4, 6), (6, 9), (−2, −3), (−4, −6) ∈ (2, 3).
(e) Define the operation (a, b) ⊕ (c, d) = (ad + bc, bd). Prove that ⊕
is well-defined on the set of equivalence classes.

Proof. 1) Consider two equivalence classes (a, b) and (c, d) where


(a, b), (c, d) ∈ Z × (Z − {0}).
Then ad + bc ∈ Z because a, b, c, d ∈ Z and the integers are closed
under addition and multiplication.
Also, since b, d ∈ Z−{0} we have that bd 6= 0 and so bd ∈ Z−{0}.
Thus (ad+bc, bd) ∈ Z×(Z−{0}) and (a, b)⊕(c, d) = (ad + bc, bd)
is a valid equivalence class.

2) Now suppose that (a, b),(c, d),(x, y),and (w, z) are equivalence
classes in Z × (Z − {0})/ ∼.
Further suppose that (a, b) = (x, y) and (c, d) = (w, z).
We need to show that (a, b) ⊕ (c, d) = (x, y) ⊕ (w, z).
That is, we need to show that [(ad + bc, bd)] = [(xz + yw, yz)].
The above is equivalent to showing that (ad+bc)yz = bd(xz +yw).
Let’s do this.
Since (a, b) = (x, y) we have that ay = bx.
Since (c, d) = (w, z) we have that cz = dw.
Therefore, using the equations ay = bx and cz = dw we get that

(ad + bc)yz = adyz + bcyz


= (ay)(dz) + (cz)(by)
= (bx)(dz) + (dw)(by)
= bd(xz + yw).

Thus, [(ad + bc, bd)] = [(xz + yw, yz)].


Thus, the operation ⊕ is well-defined on the equivalence classes
of Z × (Z − {0})/ ∼.

(f) Define the operation (a, b) (c, d) = (ac, bd). Prove that is
well-defined on the set of equivalence classes.

Proof. 1) Consider two equivalence classes (a, b) and (c, d) where


(a, b), (c, d) ∈ Z × (Z − {0}).
Then ac ∈ Z because a, c ∈ Z and the integers are closed under
multiplication.
Also, since b, d ∈ Z−{0} we have that bd 6= 0 and so bd ∈ Z−{0}.
Thus (ac, bd) ∈ Z × (Z − {0}) and (a, b) (c, d) = (ac, bd) is a
valid equivalence class.

2) Now suppose that (a, b),(c, d),(x, y),and (w, z) are equivalence
classes in Z × (Z − {0})/ ∼.
Further suppose that (a, b) = (x, y) and (c, d) = (w, z).
We need to show that (a, b) (c, d) = (x, y) (w, z).
That is, we need to show that [(ac, bd)] = [(xw, yz)].
The above is equivalent to showing that (ac)(yz) = (bd)(xw).
Let’s do this.
Since (a, b) = (x, y) we have that ay = bx.
Since (c, d) = (w, z) we have that cz = dw.
Therefore, using the equations ay = bx and cz = dw we get that

(ac)(yz) = (ay)(cz) = (bx)(dw) = (bd)(xw).

Thus, [(ac, bd)] = [(xw, yz)].


Therefore, the operation is well-defined on the equivalence classes
of Z × (Z − {0})/ ∼.

You might also like