Source
Adapted from my own handwritten and hand-typed notes from Year 1 to Year 3 of my EEE degree
The monotone convergence theorem says:
It proves that a limit exists without giving its value. It is often used for recursive sequences and in proofs about series.
Definitions
- Bounded: there are numbers with for every
- Non-decreasing: (strictly increasing if )
- Non-increasing: (strictly decreasing if )
- Monotonic: either non-decreasing or non-increasing, possibly only from some onward
Bounded alone is not enough: is bounded between and but diverges.
Ways to check monotonic
| Test | Non-decreasing | Non-increasing |
|---|---|---|
| Difference | ||
| Ratio (needs ) | ||
| Fitting function | for | for |
For recursive sequences, boundedness and monotonicity are usually shown by induction.
Method
- Show is monotonic (difference, ratio or derivative)
- Show it is bounded. A decreasing sequence is bounded above by its first term, so you only need a lower bound (an increasing one needs only an upper bound)
- Conclude it converges by the theorem
Worked example
Let .
Working:
- Fit . Then for , so is decreasing
- Since it is decreasing and positive: , so it is bounded
- By the theorem, converges (in fact to )
A simple one: because the denominator grows, so is decreasing.
The same idea (increasing and bounded partial sums) is why a positive series converges as soon as its partial sums are bounded, see Infinite Series and Partial Sums.