Monotone Convergence Theorem

Monotone Convergence Theorem

If a Sequence is monotone and bounded, then it converges.

Proof
Let (an) be monotone and bounded. To show (an) converges, we need a candidate limit. Let's assume the sequence is increasing (the decreasing case is handled similarly), and consider the set of points {an|n∈N}. By assumption, this set is bounded, so then:

s=sup({an|n∈N})

exists. It seems reasonable to claim that (an)→s so let's show it via the definition of convergence of a sequence.

Pasted image 20241022165505.png

Let ε>0. Since s is a least upper bound for the set in question, then s−ε is not an upper bound. Hence, there is a point in the sequence aN such that s−ε<aN. Now since (an) is increasing then any n≥N has it that aN≤an. Hence:

s−ε<an≤an≤s⏟s is an upper bound<s+ε

Consequently then |an−s|<ε by using the ends and the middle of the inequality.
☐

An alternate proof:

The idea is that if we have the set A be the ai's, then it must have a supremum, which must be the limit's value itself.

Proof
Let (an) be bounded and assume it is increasing (from the monotonic part). Let A={an|n∈N} where A≠∅ and A is bounded. Let a=sup(A). We'll show that a=liman.

Let ε>0. Since a is a suprema, then by the Suprema Lemma then ∃a′∈A where:

a−ε<a′

But a′∈A, so then ∃N∈N where a′=aN. Then:

a−ε<aN

Now assume n≥N. Since (an) is increasing. Then:

an≥aN>a−ε

By flipping the signs:

an≤a<a+ε

That implies:

−ε<an−a<ε⇒|an−a|<ε

The decreasing version is proved in a very similar way.
☐

Example

Show that (an)=xn is convergent for all x∈(0,1). Show it converges to 0.

Proof
Notice that xn is decreasing since x⋅xn≤xn. Similarly, xn is bounded since it's in (0,1). As such, the MST suggests that ∃L where limxn=L.

But notice also that the ALT suggests that bn→xL where bn=xan. Notice that then bn→L so then xL=L⇒L=0.
☐