MATH 321 SECTION 002 HOMEWORK #4 SOLUTIONS

DUE IN CLASS TUESDAY 10/1

1. Do Exercises 3.1.9, 3.1.14, and 3.2.2 from the text.

Exercise 3.1.9. A = B <> (A = B ) <> ((A B ) (B A)) <> ((x)(x A x B ) (x)(x B x A)) <> (x)(x A x B ) (x)(x B x A)) <> (x)(x A x B ) (x)(x B x A)) <> (x)(x A x / B ) (x)(x B x / A)) Exercise 3.1.14. (a) P (A) = {, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}} (b) P (B ) = {, {b}} (c) P () = {} (d) P (P (B )) = , , {b} , , {b} (e) The following are true, and the rest are false: 1 A, {1} A, {1} P (A), A, A, P (A), P (A), {} P (A), {2} A, {2} A, P (P (A)), A P (A), P (A) P (A), {A} P (P (A)) Exercise 3.2.2. (a) (b) (c) (d) (e) (f) A B = {b, f } B C = {a, b, f, h, k, l, m} A C = {a, b, c, f, g, i, k, l, m} BC = (A B ) C = {a, b, f, k, l, m} A (B C ) = {a, b, f }

2. We shall use the following familiar result without proof: For every real number 2 x 0, there is a unique number b 0 such that b = x. The number b is called the square root of x, and we write b = x.
1

DUE IN CLASS TUESDAY 10/1

(a) Prove that for all x, y R with x 0 and y 0, xy = x y. (b) Prove that for all x R, |x| =

x2 .

(c) Use the previous two parts to give a short proof of the fact that |xy | = |x||y |, x, y R. [Hint: To prove that b = a, one needs only to prove that b2 = a and b 0.] Solution. 0 and y 0 be arbitrary non-negative real numbers. Let (a) Let x b = x and c = y . By denition of square root, b2 = x, c2 = y. We wish to show that bc is the square root of xy . Now bc 0 because b, c 0 and (bc)2 = b2 c2 = xy. This shows that bc = xy . Thus, xy = x y for all x, y 0. (b) Let x R be arbitrary. We shall show |x| = x2 . Notice that |x| 0 for all x R. We must show that |x|2 = x2 . Recall the denition |x| = Case 1. Suppose x 0. Then |x| = x and so |x|2 = x2 . Case 2. Suppose x < 0. Then |x| = x and so |x|2 = (x)2 = x2 . In both cases, we have shown that |x|2 = x2 . Thus, |x| = x2 . (c) Let x, y R be arbitrary. Then |xy | = (xy )2 = x2 y 2 = x2 y 2 = |x||y |, where we have used part (b), then part (a), then part (b) again. 3. Is {} = ? Explain your answer. Solution. No, they are not equal sets. The set on the left has one element (namely ) and the set on the right has zero elements. Thus, they cannot be equal. 4. Prove the following parts of Proposition 3.2.3: Let A, B, C be sets, then (a) A A = A. (b) A = A. (c) A B A. (d) A (B C ) = (A B ) (A C ). x, x, x0 . x < 0.

MATH 321 SECTION 002

HOMEWORK #4 SOLUTIONS

Solution. (a) We rst prove that A A A, that is (x)(x A A x A). Let x be arbitrary and suppose x A A. By denition of union, (x A) (x A). It follows that x A. This shows A A A. Now we shall prove that A A A, which says (x)(x A x A A) Let x be arbitrary and suppose x A. Since x A is true, then (x A) (x A) is true as well. By denition of union, x A A. We have shown A A A. Since A A A and A A A, we conclude that A A = A. (b) We rst prove that A A, which is the statement (x)(x A x A). Suppose x A is arbitrary. Then x or x A. Since has no elements, x is false. We deduce that x A is true. As x was arbitrary, we deduce that A A. Now, we will show that A A, that is (x)(x A x A). Let x A be arbitrary. Although the statement x is false, the disjunction (x ) (x A) is true. By denition of union, x A. This proves A A. Thus A = A, by denition of equality of sets. (c) To prove A B A, we must prove (x)(x A B x A). Let x A B be arbitrary. By denition of intersection, x A and x B . In particular, x A is true. Since x was arbitrary, we have proved AB A. (d) We will rst prove A (B C ) (A B ) (A C ), that is (x)(x A (B C ) x (A B ) (A C )). Let x A (B C ) be arbitrary. We must prove x (A B ) (A C ). By denition of intersection, x A and x B C . By denition of union, x B or x C . We consider these two cases separately. Case 1. Suppose x B . Then x A and x B , which implies x A B . It follows that the disjunction (x A B ) (x A C ) is true. By denition of union, x (A B ) (A C ). Case 2. Suppose x C . Similarly to the previous case, we have that x A C . It follows that (x A B ) (x A C ), which shows x (A B ) (A C ). In both cases, we concluded that x (A B ) (A C ), which is what we wanted to show. This proves A (B C ) (A B ) (A C ).

DUE IN CLASS TUESDAY 10/1

Next, we will prove (A B ) (A C ) A (B C ), which is (x)(x (A B ) (A C ) x A (B C )). Let x (A B ) (A C ) be arbitrary. We must show x A (B C ). We know that x A B or x A C . We consider these two cases separately. Case 1. Suppose x A B . Then x A and x B . Since x B is true, the statement (x B ) (x C ) is true as well. This shows x B C . So we have shown that x A and x B C . By denition of intersection, x A (B C ). Case 2. Suppose x A C . Then x A and x C . Similarly to the last case, we know (x B ) (x C ) is true, which shows x B C . Thus, x A and x B C , which shows x A (B C ). In both cases, we concluded x A (B C ). As x was arbitrary, this shows (A B ) (A C ) A (B C ). Thus we have proved A (B C ) = (A B ) (A C ).

5. (a) Let A, B, C, D be any sets. Prove that if A C and B D, then A B C D. (b) Prove or disprove the following statement: For any sets A, B, C , if A B = A C , then B = C . Solution. (a) The statement to be proved is (A)(B )(C )(D)((A C ) (B D)) (A B C D)). Let A, B, C, D be arbitrary sets and assume A C and B D. We must show A B C D, that is (x)(x A B x C D). Assume x A B is arbitrary. We shall show x C D. By denition of union, x A or x B . Thus, there are two cases to consider. Case 1. Suppose x A. Then x C because A C . Since (x C ) (x D) is true, we conclude x C D. Case 2. Suppose x B . Then x D because B D. Since (x C ) (x D) is true, we conclude x C D. In both cases, we have shown x C D. As x was arbitrary, we have proved A B C D. Since A, B, C, D were arbitrary sets, we have proved the statement (A)(B )(C )(D)((A C ) (B D)) (A B C D)).

MATH 321 SECTION 002

HOMEWORK #4 SOLUTIONS

(b) We prove the negation (A)(B )(C )((A B = A C ) (B = C )), which is logically equivalent to (A)(B )(C )((A B = A C ) (B = C )). We claim the following is a counterexample: A = {1}, B = {1}, C = . Indeed, A B = {1} and A C = {1}. Thus, A B = A C , but B = C . 6. (a) Prove that for all sets A and B , A B if and only if P (A) P (B ). (b) For all sets A and B , prove that P (A) P (B ) P (A B ). (c) Find a counterexample which shows that we may have P (A) P (B ) = P (A B ). Solution. (a) The statement to be proved is the biconditional statement (A)(B )((A B ) (P (A) P (B ))). Let A and B be arbitrary sets. We rst prove the statement (A B ) (P (A) P (B )). Proceeding directly, suppose A B . Our goal is to prove P (A) P (B ), that is (C )((C P (A)) (C P (B ))). So let C be arbitrary such that C P (A). By denition of power set, C A. Since C A and A B , we conclude C B by Proposition 3.1.4. Thus, C P (B ). As C was arbitrary, we have shown P (A) P (B ). We conclude (A B ) (P (A) P (B )). Next, we shall prove the converse (P (A) P (B )) (A B ). Proceeding directly again, assume (P (A) P (B )). Since A P (A), we get that A P (B ). By denition of power set, A B . So we have shown (P (A) P (B )) (A B ). We have proved the biconditional statement (A B ) (P (A) P (B )). Since A and B were arbitrary, the statement holds for all sets A and B . (b) For arbitrary sets A and B , we shall prove P (A) P (B ) P (A B ), (C )((C P (A) P (B )) (C P (A B ))). Let C C P (A) P (B ) be arbitrary. Then C P (A) or C P (B ). We consider these two cases separately. Case 1. Suppose C P (A).

DUE IN CLASS TUESDAY 10/1

Then C A. By Proposition 3.2.3 (iv), we have A A B . By Proposition 3.1.4, we conclude that C A B , so that C P (A B ). Case 2. Suppose C P (B ). Then C B . By Proposition 3.2.3 (iv), we have B A B . By Proposition 3.1.4, we conclude that C A B , so that C P (A B ). In both cases, we have shown that C P (A B ). As C was arbitrary, we conclude P (A) P (B ) P (A B ). (c) Consider the sets A = {1} and B = {2}. Then P (A) = , {1} , and so P (A) P (B ) = , {1}, {2} . On the other hand, A B = {1, 2} and P (A B ) = , {1}, {2}, {1, 2} . Since {1, 2} P (A B ) and {1, 2} / P (A) P (B ), we see that P (A) P (B ) = P (A B ). P (B ) = , {2} ,