What Are Monotonic Sequences?
Monotonic sequences are sequences whose terms move in a single direction and never reverse. A sequence ${a_n}$ is increasing if $a_{n+1} \ge a_n$ for every $n$, and decreasing if $a_{n+1} \le a_n$ for every $n$. If a sequence is one or the other, it is called monotonic; if it changes direction even once, it is not.
The word splits into a strict and a non-strict form, and the difference matters when terms repeat:
Strictly increasing: $a_{n+1} > a_n$ for all $n$ (each term is genuinely larger).
Non-decreasing (weakly increasing): $a_{n+1} \ge a_n$ for all $n$ (terms may stay level).
Strictly decreasing: $a_{n+1} < a_n$ for all $n$.
Non-increasing (weakly decreasing): $a_{n+1} \le a_n$ for all $n$.
A constant sequence such as $3, 3, 3, \dots$ is both non-decreasing and non-increasing, so it counts as monotonic. The idea sits one level up from the broader notion of sequences, and it is the sequence version of the same one-directional behaviour studied for monotonic functions.
Table: The four types of monotonic behaviour and the condition each one places on consecutive terms.
Type | Condition for all $n$ | Example |
|---|---|---|
Strictly increasing | $a_{n+1} > a_n$ | $a_n = n$: $1, 2, 3, 4, \dots$ |
Non-decreasing | $a_{n+1} \ge a_n$ | $1, 1, 2, 2, 3, \dots$ |
Strictly decreasing | $a_{n+1} < a_n$ | $a_n = \frac{1}{n}$: $1, \tfrac{1}{2}, \tfrac{1}{3}, \dots$ |
Non-increasing | $a_{n+1} \le a_n$ | $5, 5, 4, 4, 3, \dots$ |
How Do You Test Whether A Sequence Is Monotonic?
Three tests decide the direction, and you pick whichever makes the algebra cleanest for the formula in front of you.
Table: Three ways to test a sequence for monotonic behaviour, with the sign that signals each direction.
Method | What you compute | Increasing when | Decreasing when |
|---|---|---|---|
Difference | $a_{n+1} - a_n$ | $> 0$ | $< 0$ |
Ratio (positive terms only) | $\dfrac{a_{n+1}}{a_n}$ | $> 1$ | $< 1$ |
Derivative ($a_n = f(n)$) | $f'(x)$ for $x \ge 1$ | $f'(x) > 0$ | $f'(x) < 0$ |
The difference test is the default: form $a_{n+1} - a_n$, simplify, and read its sign. The ratio test is quicker when the terms are built from powers, because the powers cancel; it is only valid when every term is positive, since dividing by a negative flips the inequality. The derivative test treats the discrete formula as a smooth function $f(x)$ and uses the sign of $f'(x)$, the same tool that classifies increasing and decreasing functions. Each method is applied once below.
How Do You Use The Difference Test? Worked Example
Example 1: Show that $a_n = \dfrac{n}{n+1}$ is increasing, then find its limit.
Form the difference between consecutive terms and put it over a common denominator:
$$a_{n+1} - a_n = \frac{n+1}{n+2} - \frac{n}{n+1} = \frac{(n+1)^2 - n(n+2)}{(n+2)(n+1)}$$
Expand the numerator: $(n+1)^2 - n(n+2) = (n^2 + 2n + 1) - (n^2 + 2n) = 1$. So
$$a_{n+1} - a_n = \frac{1}{(n+1)(n+2)} > 0 \quad \text{for every } n \ge 1.$$
The difference is positive, so the sequence is strictly increasing. Every term also satisfies $\frac{n}{n+1} < 1$, so the sequence is bounded above by $1$. Increasing and bounded above, so by the Monotone Convergence Theorem it converges, and the limit is
$$\lim_{n \to \infty} \frac{n}{n+1} = \lim_{n \to \infty} \frac{1}{1 + \tfrac{1}{n}} = 1.$$
Final answer: $a_n = \dfrac{n}{n+1}$ is strictly increasing, bounded above by $1$, and converges to $1$.
How Do You Use The Ratio Test? Worked Example
Example 2: Show that $a_n = \dfrac{n}{3^{,n}}$ is decreasing.
Every term is positive, so the ratio test applies. Divide consecutive terms and let the powers cancel:
$$\frac{a_{n+1}}{a_n} = \frac{n+1}{3^{,n+1}} \cdot \frac{3^{,n}}{n} = \frac{n+1}{3n}$$
For every $n \ge 1$, the largest this ratio ever gets is at $n = 1$, where it equals $\frac{2}{3}$, and it only shrinks after that. So $\frac{a_{n+1}}{a_n} < 1$ for all $n$, which means $a_{n+1} < a_n$: the sequence is strictly decreasing. Since each term is positive, it is bounded below by $0$, so it converges. The limit is
$$\lim_{n \to \infty} \frac{n}{3^{,n}} = 0,$$
because the power $3^{,n}$ grows far faster than the linear top $n$.
Final answer: $a_n = \dfrac{n}{3^{,n}}$ is strictly decreasing, bounded below by $0$, and converges to $0$.
How Do You Use The Derivative Test? Worked Example
Example 3: Show that $a_n = \dfrac{n}{n^2 + 1}$ is decreasing.
Treat the formula as a smooth function $f(x) = \dfrac{x}{x^2 + 1}$ and differentiate with the quotient rule:
$$f'(x) = \frac{(x^2 + 1)(1) - x(2x)}{(x^2 + 1)^2} = \frac{1 - x^2}{(x^2 + 1)^2}$$
The denominator is always positive, so the sign of $f'(x)$ is the sign of $1 - x^2$. For every $x > 1$ that is negative, so $f$ is decreasing on $[1, \infty)$, and therefore the sequence $a_n = f(n)$ is decreasing for $n \ge 1$. It is bounded below by $0$, so it converges, and
$$\lim_{n \to \infty} \frac{n}{n^2 + 1} = 0.$$
Final answer: $a_n = \dfrac{n}{n^2 + 1}$ is decreasing for $n \ge 1$, bounded below by $0$, and converges to $0$.
What Is The Monotone Convergence Theorem?
The Monotone Convergence Theorem is the reason monotonic sequences matter so much. It states two symmetric facts about a sequence that heads one way and is fenced in.
$$\text{If } {a_n} \text{ is increasing and bounded above, then } \lim_{n \to \infty} a_n = \sup{a_n}.$$
$$\text{If } {a_n} \text{ is decreasing and bounded below, then } \lim_{n \to \infty} a_n = \inf{a_n}.$$
Here $\sup{a_n}$ is the least upper bound of the terms and $\inf{a_n}$ is the greatest lower bound. In words: an increasing sequence that cannot pass a ceiling climbs right up to its least upper bound, and a decreasing sequence that cannot fall through a floor drops down to its greatest lower bound.
Both hypotheses are needed. A monotonic sequence with no bound runs off to infinity, and a bounded sequence that is not monotonic can oscillate forever without settling. The theorem turns a hard question, "does this sequence have a limit?", into two easier ones: is it monotonic, and is it bounded?
How Do You Prove A Sequence Converges With The Theorem? Worked Example
Example 4: The recursive sequence $a_1 = 1$ and $a_{n+1} = \sqrt{2 + a_n}$ converges. Find its limit.
The formula gives no direct expression for $a_n$, so the theorem is the natural tool. Establish the two hypotheses in turn.
Bounded above by $2$. Use induction. The first term $a_1 = 1 < 2$. If $a_n < 2$, then
$$a_{n+1} = \sqrt{2 + a_n} < \sqrt{2 + 2} = \sqrt{4} = 2,$$
so every term stays below $2$.
Increasing. Compare a term with the next: $a_{n+1} > a_n$ exactly when $\sqrt{2 + a_n} > a_n$, which for positive $a_n$ is the same as $2 + a_n > a_n^{,2}$, that is $a_n^{,2} - a_n - 2 < 0$, or $(a_n - 2)(a_n + 1) < 0$. That holds whenever $-1 < a_n < 2$, and every term does sit in that range. So the sequence is strictly increasing.
Increasing and bounded above, so the theorem guarantees a limit $L$. Because the terms converge, both sides of $a_{n+1} = \sqrt{2 + a_n}$ approach the same value, giving $L = \sqrt{2 + L}$. Squaring, $L^2 = 2 + L$, so $L^2 - L - 2 = 0$ and $(L - 2)(L + 1) = 0$. Since every term is positive, $L = 2$.
Final answer: the sequence increases up to and converges to $L = 2$.
Why Does A Bounded Monotonic Sequence Have To Converge?
The theorem can feel like a trick until you picture it, and the picture is the whole reason it holds.
A rising sequence under a ceiling runs out of room. Each new term is at least as large as the last, so the sequence keeps pressing upward, but it can never cross its upper bound. The values pile up just beneath the least upper bound and have nowhere else to go, so they close in on it.
The real numbers have no gaps. The "settles somewhere" step relies on a deep property called completeness: every set of real numbers that is bounded above has a least upper bound that is itself a real number. Without that property, the sequence could aim at a gap and miss, the way $1, 1.4, 1.41, 1.414, \dots$ would fail to converge if $\sqrt{2}$ were not there to catch it.
Direction plus a fence removes every escape. Convergence can fail in only two ways: a sequence wanders off to infinity, or it swings back and forth without settling. Boundedness blocks the first, and being monotonic blocks the second, so no route to divergence is left.
Read together, monotonic behaviour and boundedness are exactly the two conditions that a sequence needs to be trapped against a single value, which is what convergence means. The same accumulation idea drives the study of convergence and divergence of series, where partial sums often form a monotonic sequence.
Who Discovered The Monotone Convergence Theorem?
The result feels obvious, yet it could not be proved until mathematicians pinned down what a real number actually is.
Two more names anchor the wider story:
Bernard Bolzano (1781 to 1848, Bohemia) proved early convergence results and gave the first careful treatment of bounded sequences, well before the tools existed to finish the job.
Karl Weierstrass (1815 to 1897, Germany) set the modern epsilon standard for limits, so that statements about a sequence "closing in" on a value became precise inequalities rather than intuition.
Where Are Monotonic Sequences Used In The Real World?
One-directional, fenced-in behaviour shows up wherever a process approaches a steady state.
Numerical methods: iterative square-root and root-finding routines, including many built on Newton's method, generate a monotonic sequence of approximations that closes in on the true answer, and boundedness is what proves the routine will stop improving at a genuine value.
Computing: a version counter, a running maximum, or the shrinking error bound in a machine-learning training loop is a monotonic sequence, and an engineer relies on a bound to know the loop terminates.
Economics and finance: the balance of an account under compound interest with a cap, or the partial sums of a discounted future income stream, form bounded monotonic sequences that settle at a present value.
Probability and analysis: the monotone convergence principle lets you exchange a limit with an expectation for a rising sequence of quantities, a workhorse behind many results on long-run averages.
Across all of these, the same two-part check, one direction plus a bound, is what promises the process arrives somewhere.
What Are The Most Common Mistakes With Monotonic Sequences?
These three errors account for most lost marks on the topic, and each matches a question real students ask on r/calculus, r/learnmath, and course common-error handouts.
Assuming "not increasing" means "decreasing."
Where it slips in:
A student checks a few terms, sees they do not climb, and concludes the sequence must be decreasing.
Don't do this:
Do not treat monotonic as the only option. A sequence can be neither increasing nor decreasing.
The correct way:
Test the sign of $a_{n+1} - a_n$ across all $n$. If it is sometimes positive and sometimes negative, as with $a_n = (-1)^n$ giving $-1, 1, -1, 1, \dots$, the sequence is simply not monotonic.
Thinking bounded alone forces convergence.
Where it slips in:
A student sees that every term stays between two fixed numbers and declares the sequence convergent on the spot.
Don't do this:
Do not drop the monotonic hypothesis. Boundedness by itself is not enough.
The correct way:
Check for a direction too. The sequence $a_n = (-1)^n$ is bounded between $-1$ and $1$ yet never settles, so it diverges. The theorem needs bounded and monotonic together.
Thinking monotonic alone forces convergence.
Where it slips in:
A student proves a sequence is increasing and stops there, assuming a limit must exist.
Don't do this:
Do not forget the bound. An increasing sequence can climb forever.
The correct way:
Confirm a ceiling before claiming a limit. The sequence $a_n = n$ is strictly increasing but has no upper bound, so it runs off to infinity and does not converge.
Practice Problems On Monotonic Sequences
Work each one, then check against the answer. Answers are verified.
Classify $a_n = \dfrac{n+1}{n}$ and give its limit.
(Answer: $a_n = 1 + \tfrac{1}{n}$, and $a_{n+1} - a_n = \tfrac{1}{n+1} - \tfrac{1}{n} < 0$, so it is strictly decreasing, bounded below by $1$, and converges to $1$.)Classify $a_n = \dfrac{2n}{n+3}$ and give its limit.
(Answer: $a_{n+1} - a_n = \tfrac{6}{(n+3)(n+4)} > 0$, so it is strictly increasing, bounded above by $2$, and converges to $2$.)Is $a_n = \dfrac{(-1)^n}{n}$ monotonic?
(Answer: the terms are $-1, \tfrac{1}{2}, -\tfrac{1}{3}, \tfrac{1}{4}, \dots$, alternating in sign, so it is not monotonic, though it is bounded and converges to $0$.)Classify $a_n = \dfrac{n^2}{2^{,n}}$ for large $n$.
(Answer: the ratio $\tfrac{a_{n+1}}{a_n} = \tfrac{(n+1)^2}{2n^2} < 1$ once $n \ge 3$, so it is eventually decreasing, bounded below by $0$, and converges to $0$.)Classify $a_n = 5 - \dfrac{1}{n}$ and give its limit.
(Answer: $a_{n+1} - a_n = \tfrac{1}{n} - \tfrac{1}{n+1} > 0$, so it is strictly increasing, bounded above by $5$, and converges to $5$.)The sequence $a_1 = 0$ and $a_{n+1} = \sqrt{6 + a_n}$ converges. Find its limit.
(Answer: it is increasing and bounded above by $3$; the limit solves $L = \sqrt{6 + L}$, so $L^2 - L - 6 = 0$, giving $L = 3$.)
Where Should You Go Next After Monotonic Sequences?
Monotonic behaviour is one of the first real tools for deciding whether a sequence has a limit, and several natural doors open from here.
Limit of a sequence. The precise definition of the value a monotonic bounded sequence is guaranteed to reach.
Monotonic functions. The same one-directional idea for continuous functions, which powers the derivative test used above.
Infinite series. A series converges exactly when its sequence of partial sums does, and for positive terms those partial sums form a monotonic sequence.
If your child is meeting monotonic sequences for the first time, a live Bhanzu trainer teaches the topic from the "trapped against a ceiling" picture up, so the theorem feels inevitable, in the Bhanzu math program.
Was this article helpful?
Your feedback helps us write better content