Michelle Bradshaw MAT 4315 Assignment 4 Exercise 2: Dene f : (2, 0) R by f (x) = it. Proof. Choose > 0.

Let =
2. 2x2 +3x2 . x+2

September 23, 2013 Prove that f has a limit at 2, and nd

Suppose 0 < |x + 2| < =

2.

+3x2 Then | 2x x + 5| = +2

x1) + 5| = |2x 1 + 5| = |2x + 4| = 2|x + 2| < 2 = . Thus f (x) has a limit of 5 at | (x+2)(2 x+2 x = 2.

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 32: Find the limit of the sequences with general term as given: 2 +4n a) n n2 5
n f) (1)n n+7

Solution: a) 1 f) 0 Exercise 35: Suppose x is an accumulation point of {an : n J }. Show that there is a subsequence of {an } n=1 that converges to x. Proof. Let x be an accumulation point of {an : n J }. Choose > 0. Since x is an accumulation point, every neighborhood about x contains innitely many elements of ak {an } such that |ak 1 x| < . Suppose = 1. Then ak1 such that |ak1 x| < 1. Now suppose < m 2 . Then there are 1 innitely many ak such that |ak x| < m2 . We can nd an ak1 for which k2 < k1 . Similarly, with 1 1 1 = (m+1) = (m+1) 2 there is a ak3 with k3 < k2 < k1 and |ak3 x| < (m+1)2 . This is true for all 2. Thus the subsequence of {an } converges to x . n=1
Exercise 36: Let {an } n=1 be a bounded sequence of real numbers. Prove that {an }n=1 has a convergent subsequence. 1

2 Proof. Let {an } n=1 be a bounded sequence of real numbers. Since {an }n=1 is bounded it has at least one accumulation point according to the Bolzano-Weierstrass Theorem. By exercise 35 we know that a subsequence of {an } n=1 converges to an accumulation point. Thus {an }n=1 has a convergent subsequence.

Exercise 38: Prove that if c > 1, then {c n } n=1 converges to 1. Proof. Let c > 1. and choose > 0. Clearly, for all n > 0, c n > c n+1 . Therefore the sequence is 1 decreasing and is monotone. For all n, c n > 1, so 1 is the greatest lower bound. By theorem 1.16, 1 c n converges to 1.
Exercise 39: Suppose {xn } n=1 converges to x0 and {yn }n=1 converges to x0 . Dene a sequence {zn }n=1 as follows: z2n = xn and z2n1 = yn . Prove that {zn } n=1 converges to x0 . Proof. Let {xn } n=1 converges to x0 and {yn }n=1 converges to x0 . Let {zn }n=1 be z2n = xn and z2n1 = yn . Both z2n and z2n1 converge to x0 . Thus zn has subsequences that converge. By theorem 1.14 {zn } n=1 converges to x0 .
1 1

Exercise 45: Show that if x is any real number, there is a sequence of rational numbers converging to x. Let x be any real number. Let a0 a1 a2 . . . be the decimal expansion of x. Then xn = a0 a1 a2 . . . an . So there exists an N for which xn can within 10k distance for any k and n > N . Thus xn Q for all n and xn converges to x. Proof. Exercise 46: Show that if x is any real number there is a sequence of irrational numbers converging to x. Proof. Consider two cases, if x is irrational and x is rational. If x is irrational let xn x. In this R . Then xn Q for all n and therefore case xn clearly converges to x. If x is rational let xn = x + n xn converges to x.