Michelle Bradshaw MAT 4315 Assignment 3

September 15, 2013

Exercise 25: Suppose {an } n=1 and {bn }n=1 are sequences such that {an }n=1 and {an + bn }n=1 converge. Prove that {bn } converges. n=1

Proof. Let {an } n=1 converge to A and {an + bn }n=1 converges to A + B . Choose > 0. There is a positive integer N1 such that if n N , then |an A| < 2 . Similarly, N2 > 0 and N2 J such that n N2 implies |(an + bn ) (A + B )| < . Let N = max(N1 , N2 ). Then if n N , we have n N1 and n N2 implying |an A| < 2 and |(an + bn ) (A + B )| < . So |(an + an + bn ) (A + A + B ) = |(an A) (an A) + (bn B )|. This is less than 2 . This simplies to |bn B | < 2 . Thus by the denition of converge {bn } n=1 converges to B .

Exercise 27: Suppose {an } n=1 and {bn }n=1 are sequences such that {an }n=1 converges to A = 0 and {an bn }n=1 converges. Prove {bn }n=1 converges.

Proof. Let {an } > 0. Since n=1 converges to A = 0 and {an bn }n=1 converge to AB . Choose {an }n=1 converges it is bounded. Thus there is a positive real number such that |an | for all n. Let = |AB |+M > 0. Then there is a positive integer N1 , such that n N1 implies |an A| < and an N2 , such that n N2 implies |an bn AB | < . Let N = max(N1 , N2 ). For n N , |bn B | = |(an bn an an AB )+(an B AB )|. This is less than or equal to |an ||an bn AB | + B ||an A|. This is equivalent to |an bn AB | + |B ||an A| < M + B = . Thus {bn } n=1 converges to B.

Exercise 6: Use the denition of congruence to prove that each of the following sequences converges: 1 a){5 + n }n=1 3n d){ 2n+1 } n=1 Proof. a) Choose
1 n }n=1

> 0 and let N =

. For n > N , |5 +

1 n

5| =

1 n

<

1 N

1
1

= . Therefore

{5 + converges to 5. 3n 3 3 d) Choose > 0 and let N = 32 . For n > N , | 2n +1 2 | = | 4n+2 . This quantity is less 3 3 3 3 3n 3 than | 4N +2 | = | 4 32 +2 | = | 128 +2 | = | 12 | = . Therefore { 2n+1 } n=1 converges to 2 .
4 4

Exercise 7: Show that {an } n=1 converges to A i {an A}n=1 converges to 0.

Proof. Suppose {an A} n=1 converges to 0. Let > 0. We know N that works for {an A}n=1 because it converges. If n > N , |an A 0| < . So |an A| < . By denition, {an }n=1 converges > 0. We know N that works for {an } to A. Now suppose {an } n=1 converges to A. Let n=1 because it converges. If n > N , |an A| < . So |an A 0| < .By denition, {an A} n=1 converges to 0. 1

2 Exercise 10: Prove that, if {an } n=1 converges to A, then {|an |}n=1 converges to |A|. Is the converse true? Justify your conclusion.

Proof. Let {an } n=1 converge to A. Choose > 0. Then for all , N > 0 such that if n > N , then |an A| < . Suppose {|an |} n=1 converges to |A|. So ||an | |A|| |an A| < for n > N by the reverse triangle inequality. Thus N > 0 and {|an |} n=1 converges to |A|. The converse is false. Counterexample: Let n = 1 and an = (1)n .Then let {am } = {|an |} = {1, 1, 1, . . . } which converges to 1but {an } = 1, 1, 1, 1, . . . which doesnt converge. Then {|am an |} is either {|1 (1)|} = 2 or {|1 1|} = 0. If {|am an |} = 2 then it is greater than and is not Cauchy. Thus the sequence does not converge. Exercise 11: Let {an } n=1 be a sequence such that there exists numbers and N such that, for n N , an = . Prove that {an } n=1 converges to . Proof. Let {an } > 0. n=1 be a sequence such that , N such that, for n N , an = . Choose Since an = , an = 0 if n > N . So |an | < . Thus {an } converges to by the denition n=1 of converge.
+1 }n=1 is Cauchy. Exercise 17: Prove the sequence { 2nn

Proof. Choose > 0. Then 2 > 0. N > 0 such that m, n 0 implies |an A| < 2 and m(2n+1)n(2m+1) +1 +1 2mnn n m n |am A| < 2 . So | 2nn 2m = 2mn+m = m m | = mn mn mn mn + mn . The 1 1 1 1 right side of the inequality simplies to n + m . We know then that n + m < 2( 2 ), which means 1 1 2n+1 n + m < . Thus { n }n=1 is Cauchy. Exercise 19: Give an example of a set with a countably innite set of accumulation points. Solution: +1 { nm : n Z, m J } is an example of a set with countably innite accumulation points. }.
1 Exercise 21: Determine the accumulation points of the set {2n + k : n and k are positive integers

1 : n, k J } and n J is xed. For any Proof. Let S = {2n + k 1 1 n n |2 + k 2 | = k < . Thus 2n is an accumulation point of S .

> 0, K such that if k K then

Exercise 22: Let S be a nonempty set of real numbers that is bounded from above (below) and let x = supS (inf S ). Prove that either x belongs to S or that x is an accumulation point of S .

Proof. Let S be a nonempty set of real numbers. Suppose S is bounded from above with x = supS . Consider when x S . Then either x S or an accumulation point of S and thus the conditions are met. Now consider x / S . Since x = supS , there is a set A such that A contains an interval centered at x such that (x , x + ) A. Each neighborhood of x therefore contains an element of S that is not x. Thus x is an accumulation point of S . Without loss of generality, the same is true when S is bounded from below with x = inf S . Therefore either x belongs to S or that x is an accumulation point of S .