Analysis PM2002 Homework week 2

2.1. Let {an }nN be a sequence of real numbers. Dene what means that {an } is NOT a Cauchy sequence (=write down the negation of the denition of the Cauchy sequence). Solution. A sequence {an } is not a Cauchy sequence if and only if there is > 0 such that for every n0 N there are m, n n0 for which |an am | . PS Equivalently, {an } is not a Cauchy sequence if and only if there is > 0 and two subsequences ank and amk of {an } for which |ank amk | for every k . 2.2. Using the denition only, gure out whether the following sequences are or are not Cauchy sequences: 1)n }nN ; (a) { n+( n+3 n(1)n (b) { n+1 }nN ; (c) { n}n N; (d) { n n 1}nN . Solution. (a) Let xn = Clearly for m > n,
n+(1)n n+3

for n N. We will show that {xn } is a Cauchy sequence.

m + (1)m n + (1)n |(n + 3)(m + (1)m ) (m + 3)(n + (1)n )| |x m x n | = = = m+3 n+3 (m + 3)(n + 3) |(3 (1)n )m (3 (1)m )n + 3((1)m (1)n )| . = (m + 3)(n + 3) Using the triangle inequality, we obtain |x m x n | 4m 2n + 6 (m + 3)(n + 3) 4m + 6 2 = . (m + 3)(n + 3) n+3

Now for each > 0, we can choose n0 N such that n02 < (we just have to take n0 > 2 3). +3 2 Then for m > n n0 , |xm xn | < . Hence |xm xn | < whenever m, n n0 . That is, n+3 {xn } is a Cauchy sequence. 1)n (b) Let xn = n( for n N. We will show that {xn } is not a Cauchy sequence. Clearly n+1 m m if m is odd. Thus for any m N, xm = m+1 if m is even and xm = m +1 |xm xm+1 | = m+1 1 1 m + =2 m+1 m+2 m+1 m+2 2 1 1 > 1. 2 3

Now for = 1 and for any n0 N, we can pick m N satisfying m n0 , put n = m + 1 and observe that |xm xn | = |xm xm+1 | > 1 = . That is, {xn } is not a Cauchy sequence. (c) Let xn = n for n N. We will show that {xn } is not a Cauchy sequence. Now for = 1 2 n0 and xm = n0 , xn = 2n0 . and for any n0 N, we take m = n2 0 and n = 4n0 . Then m, n Therefore |xm xn | = n0 1 = . That is, {xn } is not a Cauchy sequence. 1

(d) Let xn = m N, 0 < xn =

n 1. We will show that {xn } is a Cauchy sequence. Clearly for each 1 . n

( n n 1)( n + n 1) 1 n1= = n+ n1 n+ n1 1 . n

Hence for m > n, we have |x m x n | |x n |

Now for each > 0, we can choose n0 N such that 1 < (we just have to take n0 > 12 ). n0 1 1 < . Hence |xm xn | < whenever m, n n0 . Then for m > n n0 , |xm xn | 2 n0 2 n That is, {xn } is a Cauchy sequence. 2.3. Let 1 < q < 1 and {bn }nN be a bounded sequence of real numbers. Demonstrate that the sequence {an }nN dened by the formula
n

an = b1 + qb2 + q b3 + . . . + q converges.

n1

bn =
j =1

q j 1 bj

Solution. Since {bn } is bounded, there is c > 0 such that |bn | Then n m n |an am | =
j =1

c for every n. Let n > m. bj q j 1

bj q j 1
j =1

b j q j 1 =
j =m+1

Since |bj |

c, we can use the triangle inequality to see that

n n nm1

|an am |
j =m+1

|b j |q

j 1 j =m+1

cq

j 1

= cq

m j =0

qj .

Using the formula 1 + q + . . . + q k =

1q k+1 , 1q

which holds whenever q = 1, we obtain 1 q nm 1q cq m . 1q

|an am |

cq m

Since q m 0, {an } is a Cauchy sequence and therefore converges.