Monotone sequences and Cauchy sequences

 Deciding whether a given sequence {an} converges or diverges is usually very difficult. Sometimes it is possible to decide if a sequence converges without knowing its limit explicitly if certain conditions are met.



Definition (Monotone increasing/decreasing sequences)

Let {an} be a sequence. If

a1a2a3anan+1

holds, that is, 

nN (anan+1),

then {an} is said to be monotone increasing.

If

a1a2a3anan+1

hold, that is,

nN (anan+1),

then {an} is said to be monotone decreasing.

If a sequence is either monotone increasing or monotone decreasing, we may simply say it is monotone.

Example. Let us define the sequence {an} by

a1=2,an+1=12(an+2an), n=1,2,.

It can be shown (exercise!) that this sequence has the following properties:

  1. nN (an2).
  2. {an} is monotone decreasing.
  3. limnan=2.
Here are the first few terms.
a1=2,a2==12(a1+2a1)=32=1.5,a3==12(a2+2a2)=1712=1.41666666,a4=12(a3+2a3)=577408=1.41421568,a5=12(a4+2a4)=665857470832=1.41421356
This sequence is monotone decreasing but it cannot be arbitrarily small because it is also bounded below. Therefore it must converge to some number (namely 2 in this case). That such a real number exists is guaranteed by the continuity of real numbers. □
The observation in the above example can be generalized.

Theorem (Monotone convergence theorem)

Any bounded monotone sequence converges.
Proof. Suppose {an} is a bounded monotone increasing sequence. Then the set S={annN} is bounded above so that its supremum α exists. For any ε>0, αε is not an upper bound of S so there exists NN such that αε<aN. Since {an} is monotone increasing, for all nN, anaN>αε. Since α is the supremum of {an}, we have anα<α+ε. Thus we have αε<an<α+ε or |anα|<ε for all nN. Hence limnan=α.

We can prove similarly for the case of a bounded monotone decreasing sequence. 

Definition (Cauchy sequence)

The sequence {an} is said to be a Cauchy sequence if and only if the following condition is met.

  • For any ε>0, there exists NN such that for any k,lN, |akal|<ε.

Or, in a logical form,

ε>0,NN,k,lN (k,lN|akal|<ε).


Theorem

Any convergent sequence is a Cauchy sequence.

Proof. Suppose limnan=α. For any ε>0, there exists NN such that for all k,lN,
|akα|<ε, |alα|<ε.
Thus,
|akal|=|(akα)+(αal)||akα|+|αal|<ε+ε=2ε.
2ε is an arbitrary positive real number. Therefore, {an} is a Cauchy sequence. ■

The converse is also true, but the proof is beyond the scope of this lecture.

Theorem

Any Cauchy sequence converges. 

Corollary

A sequence converges if and only if it is a Cauchy sequence.

For later convenience, we provide the following theorem without proof.

Theorem (Bolzano-Weierstrass Theorem)

Let {an} be a sequence such that an[c,d] for all nN. Then there exists a subsequence {ank} of {an} that converges to a value in the closed interval [c,d].
Proof. Exercise. (Hint: use the squeeze theorem) ■


Comments

Popular posts from this blog

Birth process

Branching processes: Mean and variance

Informal introduction to formal logic