JC McNamara Math 446 Assignment #5

Section 8 (a) True, By denition. (b) False, S could be . (c) False, It is said to be transnite. (d) False, S is denumerable if there exists a bijection f : N S . (e) True, by Theorem 8.9 (f) False, the subset could be nite.
8.3 de 8.1

x (d) f (x) = 1 x (e) f (x) = tan(x + 2)

8.4

(a) f (x) = (n m)x + m (b) If we have two arbitrary open intervals (a, b) and (c, d), a bijection between dc them is f (x) = b a (x a) + c which means that they are equinumerous. Therefore, any two open intervals are equinumerous because there exists a bijection between the two intervals.
8.10 Theorem. If
Proof.

Let S be denumerable. Then there exists a bijection f : N S . Hence S = {f (1), f (2), f (3), ...}. Let S = {f (2), f (4), f (6), ...}. It is clear that S S since x S , x S and S = S . Also, g : N S dened as g (n) = f (2n) is also a bijection. Therefore, S , which is a proper subset of S , is denumerable.
8.16

is denumerable, then

is equinumerous with a proper subset of itself.

(a) True, since an empty set is a subset of all sets. (b) True, since an empty set is a subset of S. (c) False, because 2 is not a subset of S rather an element of it. (d) True, since {2} is a subset of S . (e) True, since {2} is a subset of S, therefore it's also a subset of the power set of S.
8.17 Theorem. Let
Proof.

Let A and B be sets. () Assume A B and let x P (A). By the denition of power set, if x P (A), then x A. Since A B, then x B. Thus x P (B ). Therefore P (A) P (B ). () Assume P (A) P (B ) and let y A. If y A, then y P (A). Since y P (A) and P (A) P (B ), then y P (B ). Hence y B. Thus A B. Therefore A B P (A) P (B ).

and

be sets. Then

A B P ( A) P ( B ) .

QED

Section 10
10.4

2 2 n N, 13 + 23 + ... + n3 = 1 4 n (n + 1) 1 2 2 3 1 (1 + 1) =4 Proof. If we let n = 1, clearly 1 = 1 and 4 4 = 1. This establishes 1 2 k (k + 1)2 , where k N is true. the basis for induction. Next, assume 13 + 23 + ... + k3 = 4 We must show that the formula holds for k + 1. To do so, we add (k + 1)3 to both sides
Theorem.

of the hypothesis giving us

13 + 23 + ... + k 3 + (k + 1)3

1 2 k (k + 1)2 + (k + 1)3 4 1 = (k + 1)2 ( k 2 + k + 1) 4 1 2 2 = (k + 1) (k + 4k + 4) 4 1 (k + 1)2 (k + 2)2 = 4 1 (k + 1)2 ((k + 1) + 1)2 . = 4 =

1 2 Therefore by induction, n N, 13 + 23 + ... + n3 = 4 n (n + 1)2 .

10.14

QED

n N, 9n 4n is a multiple of 5. 1 1 k k Proof. If we let n = 1, 9 4 = 9 4 = 5 is a multiple of 5. Assume 9 4 is a multiple k k of 5, for some k N. Thus 9 4 = 5m for some m Z. We must show that 9k+1 4k+1 is also a multiple of 5. To do this, we can rewrite 9k+1 4k+1 as follows
Theorem.

9k+1 4k+1

= = = = =

9k+1 4k+1 + 9k 9k + 4k 4k (9k+1 + 9k ) (4k+1 + 4k ) (9k 4k ) 9k (9 + 1) 4k (4 + 1) 5m 10(9k ) 5(4k ) 5m 5(2(9k ) 4k m).

Since 2(9k ) 4k m is an integer, 5(2(9k ) 4k m) is a multiple of 5. Therefore by induction, n N, 9n 4n is a multiple of 5.

n N, 1 + x > 0 (1 + x)n 1 + nx. 1 Proof. Assume 1 + x > 0. Let n = 1, then (1 + x) = 1 + x 1 + 1x = 1 + x. This establishes the basis for induction. Next, assume (1 + x)k 1 + kx, k N. We must show that the statement holds for k + 1. We have
Theorem. 10.22

QED

(1 + x)k+1 (1 + x)k+1 (1 + x)k+1

(1 + x)(1 + kx) 1 + kx + x + kx2 1 + (k + 1)x since x > 1, kx2 0.

Therefore by induction, n N, 1 + x > 0 (1 + x)n 1 + nx.

QED