HOMEWORK 2

SHUANGLIN SHAO

1. P45. 2.1.1 Proof. a). For any > 0, we want to nd N N such that for any n N , 1 |2 2| < . n 1 In order for n < holds, 1 n> . So we take N = [ 1 ] + 1, where, for a R, [a] denotes the integer part of a. d). For any > 0, we need to nd N N such that for any n N , 2n2 + 1 2 | < . 3n2 3 In order for the last inequality to hold, | 1 < , i.e., n > 3n2 So we take N = [
1 3 ]

1 . 3

+ 1.

2. P 45. 2.1.2 Proof. a). limn xn = 1 : for any > 0, there exists N1 N such that for any n N1 , |xn 1| < /2. Then |1 + 2xn 3| = 2|xn 1| < 2 = . 2 So we conclude that limn |(1 + 2xn ) 3| < . c). limn xn = 1 : for any > 0, there exists N1 N such that for any n N1 , |xn 1| < . 4e
1

In particular, for = 1 , there exists N2 N such that for any n N2 , 2 1 1 3 |xn 1| < , i. e. , < xn < . 2 2 2 For the same > 0 above, we need to nd N R such that for any n N , x2 e n (1 e) < . xn i.e., xn 1 ) < . xn In order for the last inequality to hold, it suces that (xn 1) e( |xn 1| + e If n max{N1 , N2 }, |xn 1| + e |xn 1| < + 2e|xn 1| + = . |xn | 4e 2 2 |xn 1| < . |xn |

3. P 45. 2.1.5 Proof. Since limn bn = 0, for any > 0, there exists N N such that for any n N , |bn 0| < . C Hence |xn a| Cbn < C = . C This proves that lim |xn a| = 0.
n

4. P51. 2.2.1
1 Proof. a ). Since |xn | n , the squeezing theorem implies that n 2n n2 + 2/n . 1+/n2

lim xn = 0.

b). xn =

So
n

lim xn = 0.
2

 c). xn =

2/n+1/n . 1+ 2/n

So
n

lim xn = 0.

d). By the Binomial theorem, 2n = (1 + 1)n > So 2 n . n 2 n1 On the other hand,

n 2n

n(n 1) . 2

0. So n = 0. n 2n lim

5. P52. 2.2.5 Proof. If x = 0, limn xn = 0 implies that, for any > 0, there exists N N such that for any n N , |xn | = xn < 2 . Hence So
n

xn < . lim xn = 0.

If x > 0, for > 0, there exists N N such that for any n N , |xn x| We have |xn x| |xn x| | xn x| = < . xn + x x So
n

x .

lim

xn =
3

x.

6. P57. 2.3.1 Proof. We rst prove that xn 0 by mathematical induction. x0 < 0 is known. Secondly, if xn 0, xn+1 = xn + 1 1 1 1 = 0. So for all n, xn 0. We claim that {xn }n1 is increasing. x0 + 1 1 x0 x1 = x0 + 1 1 = = x0 . x0 + 1 + 1 x0 + 2 We assume that xn1 xn , xn+1 xn = xn + 1 1 ( This shows that xn+1 xn . So {xn } is increasing. By the monotone convergence theorem, limn xn exists. Let A be the limit. Taking the limit on the both sides of the equation, A = A + 1 1. Solving this to obtain A + 1 = 0, or1, A = 1 or A = 0. Since x0 > 1, we have A = 0. When x0 = 1, xn = 1, the limit in this case A = 1. When x0 = 0, xn = 0, the limit in this case A = 0. xn xn1 0. xn + xn1 + 2

xn1 + 1 1) =

7. P57. 2.3.2 Proof. Firstly xn 0 for all n. So {xn } is bounded below. We consider the dierence xn xn1 xn+1 xn = 1 xn1 1 xn = . 2 xn xn1 This shows that xn+1 xn has the same sign as the xn xn1 . Inductively, it has the same sign as x2 x1 . x2 x1 = 1 x1 1 x1 0. The last inequality is due to the fact, for a [0, 1], a a. Thus {xn } is decreasing. By the monotone convergence theorem, limn xn exists. Let A be the limit. Then 1 A = 0, 1. We have A = 1, or 0. Since x0 < 1, A = 0.
4

For the second limit, xn+1 1 1 xn 1 1 (1 xn ) 1 1 = = = xn xn xn 1 + 1 xn 2 1 + 1 xn since limn xn = 0.

8. P57. 2.3.8 Proof. a). Use the math induction to prove that ) < xn < yn for all n. b). Since 0 < yn < xn for all n, yn+1 = xn yn > yn .
xn +yn 2

So {yn } is increasing. On the other hand, xn+1 = decreasing. Since for all n, 0 < y1 yn xn x1 .

< xn , thus {xn } is

We know that {xn } is bounded below by y1 , and {xn } is bounded above by x1 . c).
xn +yn 2

From a), xn yn > 0 for all n. This also implies that xn+1 yn+1 < yn = xn yn . Inductively, 2 xn+1 yn+1 < x1 y1 . 2n

d). By b) and c), the sequences have the same limits.

9. P61. 2.4.1 Proof. By the squeezing theorem,

n

lim |xn | = 0.

It implies that limn xn = 0. By Theorem 2.29, {xn } is a Cauchy sequence.

10. P61. 2.4.4 Proof. Let

n

Sn =
k=1 5

xk .

The condition implies that, for any > 0, there exists N N such that for m n N,
m

|Sm Sn | = |
k=n+1

xk | < .

So this implies that {Sn } is a Cauchy sequence. Hence it converges to a nite number.

11. P61. 2.4.6 Proof. By the condition, we have, for any m n N , |xm xn | |xm xm1 |+|xm1 xm2 |+ +|xn+1 xn | am1 + +an an aN . 1a 1a

So for 1 > > 0, we choose N log[(1 a)]/loga + 1. So {xn } is a Cauchy sequence. Hence {xn } converges.

12. P65. 2.5.2 Proof. Let x = lim supn xn and y = lim inf n (xn ). We rst assume that x (, ). Since inf kn (xk ) = supkn xk , we know the limit on the right hand exists and is nite, which implies the limit on the left hand exists and is nite. So taking limits in n, we obtain lim sup xn = lim inf xn .
n n

If x = , then for any C > 0, there exists M N such that for any n N , sup xk > M.
kn

Thus inf (xk ) > M, inf (xk ) < M.

kn kn

This implies that lim inf (xk ) =

n

establishing the desired identity. The case where x = can be dealt with similarly. For the second identity, let yn = xn and apply the rst identity to yn and then rewrite it in terms of xn .
6

13. P65. 2.5.3 Proof. a). The condition lim supn xn < r implies that limn an < r where an = supkn xk . Hence there exists N N such that, for any n N , an < r. In particular, aN < r. By the denition of aN , for any k N , ak < r. The part b) can be proven similarly. 14. P66. 2.5.4 Proof. a). Let lim supn xn = x and lim supn yn = y. To begin with, we assume that x, y (, ). For any n N,
kn

inf xk + inf k nyk xl + yl

for any l n. So
kn

inf xk + inf k nyk inf (xk + yk ).

kn

Since both sides are increasing in n, taking limits in n, we establish the rst inequality. Next consider x = , y > or x > , y = . In this case, x + y = . Then for any suciently large C > 0, there exists N N, such that for any n N, M < inf xk + inf yk .
kn kn

This implies that

kn

inf (xk + yk ) C > . lim inf (xk + yk ) = .

n

Hence

To establish the second inequality, we only consider the case where x, y (, ). inf (xk + yk ) xl + yl sup xk + yl
kn kn

for all l n. So
kn

inf (xk + yk ) xl + yl sup xk + inf yk .

kn 7 kn

Taking limits in n yields the second inequality. The other two inequalities in part a) can be proven similarly. b). These follow from the part a) and the fact, whenever limn xn = a, lim inf xn = lim sup xn = a.
n n

c). Consider xn = (1)n and yn = (1)n1 . This example shows that the rst, fourth inequality can be strict. Consider xn = (1)n and yn = (1)n . This example shows that the second and third inequality can be strict. 15. P66. 2.5.5 Proof. a). Let lim supn xn = x and lim supn yn = y. We assume that x, y [0, ). Since xl , yl 0, xl yl sup xk sup yk
kn kn

for any l n. Hence sup xk yk sup xk sup yk .

kn kn kn

Taking limits, we have established the rst inequality. If x > 0, y = , or x = , y > 0 the inequality holds automatically. The example is xn = (1)n and yn = (1)n1 . (This example is not right because xn 0 and yn 0; thanks to Zhou Hongjuan for correction.) We consider the following example, {xn } : its even subsequence converges n=1 1 to 2, for instance, x2n = 2 + n , and its odd subsequence converges to 3, say, 1 x2n+1 = 3 + n ; we dene yn = x1 . In this case, n lim sup xn yn = 1,
n

while lim sup xn lim sup yn = 3

n n

1 3 = . 2 2

So the inequality is strict. b). The proof of b). Use part a) and Ex. 2.5.2.

16. P66. 2.5.6 Proof. For any n N , xl yl sup xk yk , for l n.

kn

This implies that, because yl 0,

kn

inf xk yl sup xk yk
kn

which holds for all l n. Thus

kn

inf xk sup yk sup xk yk .

kn kn

Taking n , we have lim inf xn lim sup yn lim sup xn yn .

n n n

Since limn xn = x, x lim sup yn lim sup xn yn .

n n

On the other hand, from part (a) of Ex. 2.5.5, lim sup xn yn lim sup xn lim sup yn = x lim sup yn .
n n n n

Hence lim sup xn yn = x lim sup yn .

n n

This completes the proof. We may also proceed as follows. limn xn = x. If x = 0, 0 lim sup xn yn .
n

By part (a) of Ex. 2.5.5, lim sup xn yn lim sup xn lim sup yn = x lim sup yn = 0.
n n n n

These imply that, lim sup xn yn = 0.

n

If x > 0, the limit limn xn = x implies that, for 0 < < x, N N such that for n N , x < xn < x + . Since yn 0, (x )yn < xn yn < (x + )yn .
9

Thus (x ) sup yn sup xn yn (x + ) sup yn .

nN nN nN

Let n , (x ) lim sup yn lim sup xn yn (x + ) lim sup yn .

n n n

Let 0, lim sup xn yn = x lim sup yn . (Thanks to Hongjuan Zhou for correction.)
n n

Department of Mathematics, KU, Lawrence, KS 66045 E-mail address: slshao@math.ku.edu

10