Summary
This lesson proves the monotone convergence theorem: every monotonic and bounded sequence converges, and its limit is the supremum or the infimum of the set of its terms; unbounded monotonic sequences tend to infinity or to minus infinity. It is the first face of the completeness axiom in this unit: it guarantees that a limit exists without knowing its value in advance. With it, the sequences with which Algebra and Geometry I defined the number as a supremum, and the sums , converge to , with explicit error bounds, and the limit obtained in Calculus I becomes a consistent check. The second half studies recurrences : if is continuous and the sequence converges, its limit is a fixed point of ; if is increasing, the sequence is monotonic, and the theorem decides whether it converges. They are applied to nested roots, to the arithmetic-geometric mean and to the iterates of the Newton-Raphson method, whose convergence turns out to be a case of the theorem.
Learning objectives
- Prove the monotone convergence theorem from the completeness axiom, pointing out what the depends on, and deduce that a monotonic sequence converges if and only if it is bounded.
- Obtain the limits of , of and of the sums from what Algebra and Geometry I proved about the number , with explicit error bounds.
- Prove that the limit of a recurrence with continuous is a fixed point of , and that the recurrence is monotonic if is increasing.
- Study the convergence of specific recurrences according to their initial term, including those given by a decreasing function and those that have no finite limit.
Monotonic sequences
The lesson on sequences and their limit obtained limits by knowing their value in advance: the definition compares each term with the number . But many sequences are defined without their limit being known, such as the approximations of the Newton-Raphson method or the sums with which Algebra and Geometry I approximated the number . For them a criterion is needed that guarantees convergence without naming the limit. Calculus I already used the completeness axiom in this way: Bolzano’s theorem, Weierstrass’s theorem and the monotone convergence of the Newton-Raphson method obtained a number as the supremum or the infimum of a set. This lesson turns that device into a theorem about sequences.
A sequence is increasing if for every , and strictly increasing if for every ; it is decreasing if for every , and strictly decreasing if for every . It is monotonic if it is increasing or decreasing.
If is increasing, then whenever : by induction on , starting from , because and give . Likewise, a decreasing sequence satisfies if . For example, is strictly increasing, is strictly decreasing, a constant sequence is both increasing and decreasing, and is not monotonic. An increasing sequence is bounded below by its first term, and a decreasing one, above; the question is whether it is bounded on the other side.
If is increasing and bounded above, it converges, and its limit is the supremum of the set of its terms. If it is decreasing and bounded below, it converges, and its limit is the infimum of that set.
The completeness axiom provides the candidate, the supremum ; since is not an upper bound, some term exceeds it, and by monotonicity so do all the later ones. The figure follows the increasing sequence , whose supremum is , with the challenge , which the term of index is the first to exceed; at the end, the decreasing sequence , whose infimum is .
Proof
Let be increasing and bounded above. The set of its terms is nonempty and bounded above; by the completeness axiom, from the lesson on number systems, it has a supremum , which is an upper bound of .
Let . Since is the least of the upper bounds, the number , smaller than , is not an upper bound: some term exceeds it. Its index depends on and on the sequence, through .
If , monotonicity gives , and the bound from the first move of the proof, . The term lies between and , at a distance from less than .
If is decreasing and bounded below by , the sequence is increasing and bounded above by ; by what has just been shown, it converges to the supremum of its terms. The number is a lower bound of the , and it is the greatest: if is a lower bound of the , then is an upper bound of the , and . Therefore, is the infimum of the , and by the algebra of limits, tends to .
The proof does not compute the limit: the completeness axiom delivers it as a supremum. That is why the theorem serves for sequences whose limit is unknown, and in this lesson it will always be used in the same way: first one proves that the sequence converges, and then one identifies its limit by another argument. Neither of the two hypotheses is superfluous: is bounded, is not monotonic and diverges; is increasing, is not bounded and does not converge either. The lesson on the limit at infinity proved the corollary on monotonic functions at infinity for a function that is increasing and bounded above on an interval ; its proof goes through one-sided limits on an interval and does not apply to the domain , which contains no intervals, although the idea is the same.
If is increasing and not bounded above, then ; if it is decreasing and not bounded below, then . Consequently, a monotonic sequence converges if and only if it is bounded. Without an upper bound, every number is exceeded by some term, and by monotonicity also by all the later ones.
Proof
Let be real. Since is not an upper bound, there is a natural number with , and for , monotonicity gives . The decreasing case reduces to this one with the sequence , which is increasing and not bounded above.
If a monotonic sequence is bounded, it converges, by the monotone convergence theorem. If it is not, it does not converge, by the theorem that every convergent sequence is bounded, from the lesson on sequences and their limit.
Loading the content…
Completed
Sign in to save your progress