Michelle Bradshaw September 4, 2013 MAT 4315 Assignment 1 Chapter 0 exercises 6, 7, 10, 17, 18, 21, 22, 32,

33, 40, 44, 45 Exercise 6: If A B , prove that (C \ B ) (C \ A). Either prove the converse is true or give a counterexample. Proof. Assume (C \ B ) (C \ A). A counterexample would be letting C : {1, 2, 3}, A : {4}, B : {5}. Then {1, 2, 3} {1, 2, 3} which is true. However, A B is not true since {4} is not a subset of {5}. Thus the converse is not true. Exercise 7: Under what conditions does A \ (A \ B ) = B ? Proof. For A \ B , let x A x / B . Then, A \ (A \ B ) implies that x A (x / A x B ), by DeMorgans Law. Then (x A x / A) (x A x B ). This implies (x A x B ). So, A B = B if A B or if A is the empty set. Exercise 10: Describe each of the following sets as the empty set, as R, or in interval notation, as appropriate: (a) (b) (c) (d)
n=1 n=1 n=1 n=1 1 1 ,n n

n, n
1 n ,1 + 1 n ,2 + 1 n 1 n

Solutions for Exercise 10: (a) {0} (b) R (c) [0, 1] (d) (1, 3) Exercise 17: Give an example of f : A B, g : B C such that g f is 1 1 but g is not 1 1. Solution: If g = x2 and f = g is not 1 1. x, then g f = ( x)2 = x. Thus g f is 1 1 but

Exercise 18: If f : A B is 1 1 and imf = B , prove that (f 1 f )(a) = a for all a A and (f f 1 )(b) = B for each b B .
1

Proof. Let f : A B be 1 1 and imf = B . Since f is 1 1 , then f 1 is also 1 1. Given f : A B and imf = B , we know f 1 : B A and imf 1 = A by theorem 0.6. Then a A and b B such that f (a) = b and f 1 (b) = a. So (f 1 f )(a) = f 1 (f (a)) = f 1 (b) = a. Thus (f 1 f )(a) = a. Similarly, (f f 1 )(b) = f (f 1 (b)) = f (a) = b. Thus (f f 1 )(b) = b. Therefore, (f 1 f )(a) = a for all a A and (f f 1 )(b) = B for each b B . Exercise 21: Prove that n3 + 5n is divisible by 6 for each n J . Proof. Assume n3 + 5n is divisible by 6 for each n J . If n = 1, then (1)3 + 5(1) = 1 + 5 = 6, which is divisible by 6 so this is true for n = 1. Suppose n = k . Then k 3 +5k = 6m for some m J . Then (k +1)3 +5(k +1) = k 3 +3k 2 +3k +1+5k +5 = k 3 + 5k + 3k 2 + 3k + 6. Since we know k 3 + 5k = 6m by the induction hypothesis, we +1) +1) ) = 6(m + 1 + k(k2 ). can rewrite it as 6m + 6 + 3k (k + 1). Thus 6(m + 1) + 6( k(k2 k(k+1) k(k+1) Since either k or k + 1 is odd, is an integer. So m + 1 + 2 is an integer 2 so (k + 1)3 + 5(k + 1) is divisible by 6. Thus true for k + 1 so true for all n J . Exercise 22: Prove that n2 < 2n for n J , n 5. Proof. Assume n2 < 2n for n J , n 5. Let n = 5. Then 52 < 25 = 25 < 32. Thus the statement is true for n = 5. Assume k 2 < 2k for some k 5. The (k + 1)2 = k 2 + 2k + 1 < 2k + 2k + 1, by the induction hypothesis. So k 2 + 2k + 1 < 2k + 2k since 2k + 1 < 2k for k 5. Thus k 2 + 2k + 1 < 2k+1 . Therefore the statement is true for k + 1. Hence, n2 < 2n is true for all n J , n 5. Exercise 32: Let Pn be the set of all polynomials of degree n with integer coecients. Prove that Pn is countable. Proof. Let Pn = an xn + an1 xn1 + + a1 x + a0 . Let P0 = an + an1 + an2 because n, n 1, n 2, . . . J , P0 J . By theorem 0.14, P0 is countable. Assume the statement is true for some n, such that Pn is countable. Let A and B be sets such that A = {axn+1 : a J } and B = {Pn }. Since a J and xn+1 is xed, B that is 1 1. Thus, since A and B are countable so is A B , by theorem 0.16. Therefore Pn+1 is countable. So Pn is countable for all n J . Exercise 33: Use exercise 32 to show that the set of all polynomials with integer coecients is a countable set. Proof. Let Pn = an xn + an1 xn1 + + a1 x + a0 . Then let f be a function such that domf = Pn and imf = J J Jn+1 . So f (Pn ) = f (an xn + an1 xn1 + + a1 x + a0 ) = (an , an1 , . . . , a1 , a0 ). By exercise 32 we know Pn is countable and by theorem 0.16 we know the cross product of Pn and J J Jn+1 is also countable. Let P be the set of all polynomials with integer coecients. Then P = n=1 P (n). By theorem 0.17, P is countable.

Exercise 40: If x 0 and y 0, prove that

xy

x+y 2 .

y Proof. By contradiction. Let x 0 and y 0. Assume xy > x+ 2 . Then 2 2 2 y 2 x +2xy +y ( xy ) > ( x+ . So 4xy > x2 + 2xy + y 2 = 2xy > x2 + y 2 = 2 ) = xy > 4 2 2 2 x 2xy + y < 0. Thus (x y ) < 0. Now, assume x y = z . Either x > y and z > 0 or z < y and z < 0. Regardless, z 2 > 0. So (x y )2 cannot be less than 0. y This is a contradiction. Thus xy x+ 2 is true. Exercise 44: If x = supS , show that, for each x < a x. > 0, there is a a S such that

Proof. Let x = supS and > 0. Then x < x. Because x < x, x is not supS . Then, a S such that a > x . Since x = supS , a x. Thus, x < a x. Exercise 45: If y = inf S , show that, for each ya<y+ . > 0, there is a S such that

Proof. Let y = inf S and > 0. Then y < y + . Because y < y + , y is not inf S . Then a S such that a > y + . Since y = inf S , a y . Thus, y a < .