Skip to content
Tutorials Center
My learning

Topics

Lesson 12 of 37 · Sequences and Limits

The Monotone Convergence Theorem

Prove that bounded monotone sequences converge, then use it to define the number e and analyze recursive sequences like the square root iteration.

Usually to prove a sequence converges you must guess the limit first. The Monotone Convergence Theorem (MCT) is different: it proves a limit exists without knowing its value, using only that the sequence moves in one direction and stays bounded. It is a direct gift of the completeness axiom, and it is how we construct the number e and justify many recursive algorithms.

Monotone sequences

A sequence (a_n) is increasing if a_n ≤ a_{n+1} for all n, decreasing if a_n ≥ a_{n+1}, and monotone if it is one or the other. (Use "strictly" if the inequalities are strict.)

Theorem (Monotone Convergence Theorem). A monotone sequence converges if and only if it is bounded. Specifically:

  • an increasing sequence bounded above converges to sup{a_n};
  • a decreasing sequence bounded below converges to inf{a_n}.

Proof (increasing case). Let S = {a_n : n ∈ ℕ}. It is nonempty and bounded above, so by completeness L = sup S exists. Let ε > 0. Since L − ε is not an upper bound, there is N with a_N > L − ε. For n ≥ N, monotonicity gives a_n ≥ a_N > L − ε, and a_n ≤ L always. So |a_n − L| < ε for n ≥ N. ∎

The "only if" direction is the fact that convergent sequences are bounded.

Python Watch an increasing bounded sequence settle

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

To prove the claim for this sequence: by induction a_n < 2 (if a_n < 2 then a_{n+1} = √(2 + a_n) < √4 = 2), and a_{n+1} ≥ a_n because a_{n+1}² − a_n² = 2 + a_n − a_n² = (2 − a_n)(1 + a_n) > 0. So it converges by MCT to some L. Taking limits in a_{n+1}² = 2 + a_n gives L² = 2 + L, so L = 2 (the other root −1 is impossible as all terms are positive).

Do not take limits of a recursion before proving convergence. If you assume a limit exists, you can "prove" nonsense, e.g. a_{n+1} = 2a_n with a_1 = 1 would give L = 2L, L = 0, but the sequence diverges.

Defining the number e

Let a_n = (1 + 1/n)ⁿ. Using the binomial theorem and the AM-GM inequality one can show that (a_n) is increasing and bounded above by 3. A cleaner way to see boundedness: expanding,

a_n = Σ_{k=0}^{n} C(n,k)/nᵏ ≤ Σ_{k=0}^{n} 1/k! ≤ 1 + 1 + 1/2 + 1/4 + 1/8 + ... < 3,

because C(n,k)/nᵏ ≤ 1/k! and k! ≥ 2^{k−1}. By MCT a_n converges; its limit is e ≈ 2.71828.

Python Approximating e two ways

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Decreasing and unbounded examples

The sequence a_n = 1/n is decreasing and bounded below by 0, so MCT says it converges to inf{1/n} = 0. Another example: b_n = 1 + 1/2 + 1/3 + ... + 1/n is increasing but not bounded above (the harmonic series diverges, see Infinite Series), so MCT does not apply and b_n → ∞.

An increasing sequence that is not bounded above diverges to +∞: given M, some a_N > M and then a_n > M for all n ≥ N. So a monotone sequence either converges or tends to ±∞.

Python Newton's method as a monotone sequence

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. What does the Monotone Convergence Theorem say?

    Monotone plus bounded gives convergence; completeness supplies the limit.
  2. 2. An increasing sequence bounded above by 7 converges to

    The limit is the supremum of the set of terms, which may be below the bound 7.
  3. 3. Why must we prove convergence before solving L = f(L) in a recursion?

    The equation L = 2L gives L = 0 even though 1, 2, 4, 8, ... diverges.
  4. 4. Is the sequence 1, 1 + 1/2, 1 + 1/2 + 1/3, ... bounded above?

    Its terms grow without bound (slowly), so MCT does not apply.

Summary

  • Increasing + bounded above (or decreasing + bounded below) implies convergence, to the sup (or inf).
  • The theorem proves existence without knowing the limit; it is equivalent in strength to completeness.
  • Recursive sequences: prove monotonic and bounded (often by induction), then solve for the limit.
  • e is the limit of the increasing, bounded sequence (1 + 1/n)ⁿ.
  • Unbounded monotone sequences tend to ±∞.

Next: Subsequences and the Bolzano-Weierstrass Theorem