MathLabs
TheoremProved

Monotone convergence theorem

Statement

If (an)(a_n) is increasing and bounded above, then it converges, and a1≤a2≤⋯≤M ⇒ lim⁡n→∞an=sup⁡nana_1\le a_2\le\cdots\le M\ \Rightarrow\ \lim_{n\to\infty}a_n=\sup_n a_n (symmetrically for decreasing sequences bounded below).

Why is it true?

Intuitively, a sequence that only ever climbs but can never pass a ceiling has nowhere else to go except settle right below that ceiling.

Proof sketch

Let (an)(a_n) be increasing and bounded above. By the completeness axiom of R\mathbb{R}, the set {an:n∈N∗}\{a_n : n\in\mathbb{N}^*\} has a least upper bound L=sup⁡nanL=\sup_n a_n.

Fix ε>0\varepsilon>0. Since LL is the least upper bound, L−εL-\varepsilon is not an upper bound, so there exists an index NN with aN>L−εa_N>L-\varepsilon.

Because (an)(a_n) is increasing, for every n>Nn>N we have an≥aN>L−εa_n\ge a_N>L-\varepsilon. Also an≤La_n\le L for every nn, since LL is an upper bound of the whole sequence.

Combining both bounds, L−ε<an≤L<L+εL-\varepsilon<a_n\le L<L+\varepsilon for all n>Nn>N, i.e. ∣an−L∣<ε|a_n-L|<\varepsilon. Since ε>0\varepsilon>0 was arbitrary, lim⁡n→∞an=L\lim_{n\to\infty} a_n = L holds by the ε–N definition. ■\blacksquare

Topics that use this theorem

Step-by-step proofs

No step-by-step proof yet for this theorem.

References

  1. James Stewart (2015). Calculus: Early Transcendentals
  2. Judith V. Grabiner (1983). Who Gave You the Epsilon? Cauchy and the Origins of Rigorous Calculus