Monotonic Sequence Theorem: The Simple Guide to Bounded Convergence
The monotonic sequence theorem is one of those ideas in real analysis that feels almost obvious once you see it, yet it quietly powers a surprising amount of calculus, series, and recursion theory. At its core, the theorem says that a sequence which moves in only one direction and stays within some finite boundary must settle down to a limit.
That simple promise gives you a practical test for convergence without computing the limit directly. If you can prove a sequence is increasing or decreasing and also bounded, the monotonic sequence theorem hands you convergence. The rest of the work is often just identifying the bound, interpreting the result, or solving for the limit after existence is guaranteed.
Understanding Monotonic Sequences
Before applying the theorem, you need a clear picture of monotonicity. A sequence is monotonic when its terms never reverse direction. An increasing sequence satisfies a_n ≤ a_{n+1} for every index n, while a decreasing sequence satisfies a_n ≥ a_{n+1}. Some textbooks reserve "strictly increasing" for a_n < a_{n+1} and "nondecreasing" for the weaker inequality, but the convergence theorem works with either version.
Boundedness supplies the other half of the story. A sequence is bounded above if some real number M satisfies a_n ≤ M for all n. It is bounded below if some real number m satisfies a_n ≥ m for all n. When both conditions hold, the sequence is simply bounded. The monotonic sequence theorem connects this spatial idea of being trapped in a finite interval with the analytic idea of having a limit.
Definitions and Notation
Formally, a sequence {a_n} is nondecreasing if a_1 ≤ a_2 ≤ a_3 ≤ ... and nonincreasing if a_1 ≥ a_2 ≥ a_3 ≥ .... These inequalities must hold for every pair of consecutive terms, not just the first few. A sequence that is either nondecreasing or nonincreasing is called monotone. The index set is usually the natural numbers, but the same ideas apply to sequences starting at n = 0 or any later integer.
The notation can hide a small but important distinction. If a_n < a_{n+1} for all n, the sequence is strictly increasing. If a_n ≤ a_{n+1}, it is nondecreasing. Both forms are monotone, and both are covered by the monotonic sequence theorem. Constant sequences are monotone too, since they satisfy both nondecreasing and nonincreasing inequalities, and they trivially converge to their constant value.
Boundedness and Monotonicity in Practice
To see how these ideas work together, consider a_n = 1 - 1/n for n ≥ 1. The terms are 0, 1/2, 2/3, 3/4, and so on. The sequence is increasing because each new term adds a smaller negative amount. It is bounded above by 1, since 1 - 1/n < 1 for every positive n. The monotonic sequence theorem then guarantees convergence, and the limit is clearly 1.
Now look at b_n = 1/n. The terms are 1, 1/2, 1/3, 1/4, ... and the sequence is decreasing. It is bounded below by 0, so it converges, this time to 0. In both examples, you can find the limit by inspection, but the theorem matters most when the limit is not obvious. It lets you prove that a limit exists before spending time solving for it.
The Monotonic Sequence Theorem Explained
The monotonic sequence theorem, often called the monotone convergence theorem, states that every bounded monotonic sequence of real numbers converges. More precisely, if a sequence is nondecreasing and bounded above, it converges to its least upper bound. If it is nonincreasing and bounded below, it converges to its greatest lower bound. This version is sometimes stated separately for increasing and decreasing sequences because the two cases are mirror images of each other.
The theorem is not just a convenient shortcut. It is a direct consequence of the completeness property of the real numbers. The real line has no gaps, so a sequence that keeps pushing upward but never crosses a ceiling must accumulate somewhere. That "somewhere" is the supremum, or least upper bound, of the set of terms. Without completeness, the conclusion can fail in surprising ways.
Formal Statement and Proof Sketch
Let {a_n} be nondecreasing and bounded above. Let S = {a_n : n ∈ ℕ}. Since S is nonempty and bounded above, the completeness axiom gives S a least upper bound L = sup S. We claim that a_n → L. To prove this, take any ε > 0. Because L is the least upper bound, L - ε is not an upper bound for S, so some term a_N satisfies a_N > L - ε. Since the sequence is nondecreasing, every term with n ≥ N satisfies a_n ≥ a_N > L - ε. Also, L is an upper bound, so a_n ≤ L for all n. Therefore, for all n ≥ N, |a_n - L| < ε, which proves convergence to L.
The decreasing case follows by applying the same argument to -a_n or by using the greatest lower bound. If {a_n} is nonincreasing and bounded below, then its infimum is the limit. The proof hinges on the fact that the supremum or infimum exists in the real numbers. Once that existence is established, the monotonicity forces the entire tail of the sequence into an arbitrarily small neighborhood of the limit.
Why Completeness Matters
The completeness of the real numbers is the engine behind the monotonic sequence theorem. In the rational numbers alone, a nondecreasing sequence bounded above can fail to converge because its limit might be irrational. For example, consider decimal approximations to √2: 1, 1.4, 1.41, 1.414, 1.4142, ... . This sequence is nondecreasing and bounded above by 2, but it has no rational limit. Inside the real numbers, it converges to √2, which fills the gap.
This distinction explains why the monotonic sequence theorem is a cornerstone of real analysis rather than just a fact about ordered sets. It depends on the least upper bound property, which is equivalent to completeness. When you use the theorem later to prove convergence of series, recursive sequences, or fixed-point iterations, you are often relying, directly or indirectly, on the completeness of the real line.
Applications and Examples
The monotonic sequence theorem is most useful when a sequence is defined recursively or when its limit is difficult to compute directly. The standard strategy is to prove two things: the sequence is monotone, and it is bounded. Once those facts are established, convergence follows. Only then do you set the limit equal to L and solve the resulting equation. This two-step pattern appears throughout analysis and numerical methods.
Applications range from simple recursive square roots to convergence tests for infinite series. In each case, the theorem converts a qualitative question—does this process settle down?—into two more concrete questions—is it moving in one direction, and is it trapped in a finite range? That conversion is what makes the monotonic sequence theorem so practical.
Solving Recursive Sequences
A classic example is the sequence defined by a_1 = 1 and a_{n+1} = √(2 + a_n). The first few terms are 1, √3 ≈ 1.732, √(3.732) ≈ 1.932, and so on. To prove convergence, you first show by induction that the sequence is increasing. Then you show it is bounded above by 2. The monotonic sequence theorem guarantees that a limit L exists. Then, you take the limit of both sides of the recursion to get L = √(2 + L), which simplifies to L² = 2 + L, or L² - L - 2 = 0. The solutions are L = 2 and L = -1. Since the terms are positive, the limit must be 2.
This method is powerful because it separates existence from computation. Without the monotonic sequence theorem, you might suspect the sequence converges but have no rigorous justification. With the theorem, once monotonicity and boundedness are proven, you can confidently manipulate the recursion. The same approach works for many fixed-point iterations, such as a_{n+1} = cos(a_n) or a_{n+1} = (a_n + 2/a_n)/2, where the limit is a fixed point of a continuous function.
Series and Improper Integrals
Infinite series with nonnegative terms are naturally tied to monotone sequences. If a_n ≥ 0, then the partial sums S_N = a_1 + a_2 + ... + a_N form a nondecreasing sequence. The series converges exactly when the sequence of partial sums is bounded above. This is the monotonic sequence theorem in disguise, and it is the basis for many convergence tests. For example, the harmonic series has partial sums that increase without bound, so it diverges. A geometric series with ratio r between 0 and 1 has partial sums bounded above by 1/(1 - r), so it converges.
Improper integrals of nonnegative functions follow a similar pattern through their accumulation functions. If F(x) = ∫_a^x f(t) dt and f(t) ≥ 0, then F is nondecreasing. The integral converges precisely when F is bounded above. The same bounded-monotone logic appears in probability, numerical analysis, and optimization, wherever a process accumulates improvements without overshooting a known limit.
Common Pitfalls and Related Results
The monotonic sequence theorem has a simple statement, but it is easy to misuse. The theorem requires both monotonicity and boundedness. Monotonicity alone does not guarantee convergence, because a sequence can increase forever. Boundedness alone does not guarantee convergence either, because a bounded sequence can oscillate. The theorem is a package deal: one direction plus one boundary equals convergence.
Another common issue is assuming that every convergent sequence is monotone. That is false. The sequence (-1)^n / n converges to 0, but it is not monotone because its sign alternates. The theorem gives a sufficient condition, not a necessary one. Recognizing this distinction helps you choose the right tool: sometimes you can prove convergence by other means, such as the squeeze theorem, Cauchy criterion, or Bolzano-Weierstrass theorem.
Misconceptions to Avoid
A frequent mistake is to confuse boundedness with convergence. The sequence a_n = (-1)^n is bounded between -1 and 1, but it does not converge because it keeps jumping between two values. Boundedness only says the terms stay in a finite interval; it does not say they settle down. Monotonicity is what prevents the jumping. When both properties are present, the sequence cannot oscillate and cannot escape, so it must converge.
Another subtle point is that monotonicity can be eventual. If a sequence is increasing only for n ≥ N, the monotonic sequence theorem still applies to the tail. Convergence depends on the tail, not the first finitely many terms. You also need to be careful with strict versus non-strict inequalities. A strictly increasing bounded sequence converges, but so does a nondecreasing one with repeated values. The theorem is flexible enough to handle both.
Related Convergence Theorems
The Bolzano-Weierstrass theorem states that every bounded sequence of real numbers has a convergent subsequence. This is a broader result than the monotonic sequence theorem, but it gives less information. For a monotone bounded sequence, the entire sequence converges, not just a subsequence. In fact, the monotonic sequence theorem is often used to prove Bolzano-Weierstrass, because every sequence has a monotone subsequence, and a bounded monotone subsequence converges.
Other related tools include the Cauchy criterion, nested interval theorem, and fixed-point theorems. The Cauchy criterion characterizes convergence without identifying the limit, while the monotonic sequence theorem guarantees a limit through order and bounds. Together, these results form a network of ideas that make real analysis both rigorous and usable. Knowing how they connect helps you move between definitions, proofs, and applications without losing the bigger picture.
The next time you encounter a recursive formula or a partial-sum problem, try checking monotonicity and boundedness before doing heavier algebra. You may find that the monotonic sequence theorem turns a difficult convergence question into a clean, two-step argument, leaving you free to focus on the limit itself.