What Does It Mean for a Sequence to Be Bounded?
Introduction
In mathematics, the concept of boundedness provides a way to describe how “tame” or “contained” a sequence is within a given space. This idea is fundamental in analysis, topology, and many applied fields, because bounded sequences often behave more predictably than unbounded ones. When we ask what does it mean for a sequence to be bounded, we are looking for a precise condition that tells us whether the terms of the sequence never stray too far from some fixed range. In this article we will explore the definition, illustrate it with concrete examples, discuss its importance, and answer common questions that arise when studying sequences.
Easier said than done, but still worth knowing.
Definition of a Bounded Sequence
A sequence ((a_n)_{n\in\mathbb{N}}) of real numbers (or elements of a metric space) is called bounded if there exists a real number (M > 0) such that
[ |a_n| \le M \quad \text{for every } n \in \mathbb{N}. ]
In words, all terms of the sequence lie within the interval ([-M, M]). The smallest such (M) is called the bound of the sequence, and any value larger than the smallest bound also qualifies as a bound.
If no finite (M) can satisfy the inequality, the sequence is said to be unbounded Easy to understand, harder to ignore..
Key points:
- The definition uses absolute value, so it works for both positive and negative terms.
- The existence of a single uniform bound for the entire sequence distinguishes boundedness from local boundedness (e.g., a function may be bounded on each compact subinterval but not on the whole domain).
Visual Intuition
Imagine a number line and a sequence of points representing the terms (a_1, a_2, a_3, \dots). That's why if you can draw a closed interval ([-M, M]) that contains every point, the sequence is bounded. If the points keep moving farther out without ever staying inside any fixed interval, the sequence is unbounded Most people skip this — try not to. Surprisingly effective..
Illustrative example:
- The sequence (a_n = \frac{1}{n}) is bounded because (|a_n| \le 1) for all (n).
- The sequence (b_n = n) is unbounded because (|b_n| = n) grows without limit; no finite (M) can contain all terms.
Examples and Non‑Examples
Bounded Sequences
- Constant sequence: (c_n = 5) for all (n). Here (M = 5) works.
- Alternating sequence: (d_n = (-1)^n). Since (|d_n| = 1) for every (n), the sequence is bounded with (M = 1).
- Convergent sequence: (e_n = \frac{(-1)^n}{n}). As (n) increases, the absolute value decreases, so (|e_n| \le 1) for all (n); the sequence is bounded.
Unbounded Sequences
- Diverging to infinity: (f_n = n). Clearly (|f_n| = n) exceeds any fixed bound.
- Oscillating with growing amplitude: (g_n = (-1)^n n). The magnitude grows linearly, so no finite bound exists.
- Reciprocal of zero: The sequence (h_n = n) (again) or (k_n = \frac{1}{1/n}) (which simplifies to (n)) is unbounded.
Relationship with Convergence
Boundedness is a necessary but not sufficient condition for a sequence to converge.
- If a sequence converges to a limit (L), then it must be bounded. Indeed, for any (\varepsilon > 0) there exists (N) such that (|a_n - L| < \varepsilon) for all (n \ge N). Choosing (\varepsilon = 1) and using the triangle inequality, we obtain a bound for all terms.
Conversely, a bounded sequence may fail to converge. The classic example is (a_n = (-1)^n), which stays within ([-1, 1]) but does not approach a single limit because it keeps flipping signs.
Thus, boundedness can be viewed as a pre‑condition that prevents the sequence from “escaping to infinity,” allowing other analytical tools (like the Bolzano‑Weierstrass theorem) to be applied Simple, but easy to overlook..
The Bolzano‑Weierstrass Theorem
One of the most important results that relies on boundedness is the Bolzano‑Weierstrass theorem, which states:
Every bounded sequence in (\mathbb{R}) has a convergent subsequence The details matter here..
This theorem highlights why boundedness matters: it guarantees the existence of a subsequence that does settle down to a limit, even if the whole sequence does not. The proof uses the concept of nested intervals and the fact that a bounded set cannot be “too scattered.”
Properties of Bounded Sequences
-
Sum and Product:
- If ((a_n)) and ((b_n)) are bounded, then ((a_n + b_n)) and ((a_n b_n)) are also bounded.
- Proof sketch: let (|a_n| \le M_1) and (|b_n| \le M_2). Then (|a_n + b_n| \le |a_n| + |b_n| \le M_1 + M_2), so the sum is bounded by (M_1 + M_2).
-
Finite Subsets:
- Any finite subsequence of a bounded sequence is automatically bounded, because the same global bound works for all its terms.
-
Operations that May Break Boundedness:
- Dividing a bounded sequence by a term that approaches zero can produce an unbounded sequence. Here's one way to look at it: (a_n = \frac{1}{n}) is bounded, but (\frac{1}{a_n} = n) is unbounded.
-
Relation to Cauchy Sequences:
- Every Cauchy sequence in (\mathbb{R}) is bounded. This follows from the definition: after some index (N), all terms lie within a small interval around the eventual limit, and the earlier terms can be bounded by taking the maximum of a finite set.
How to Prove a Sequence Is Bounded
To show that a sequence ((a_n)) is bounded, follow these steps:
-
Identify a candidate bound.
Look at the expression for (a_n) and try to find a simple expression that dominates its absolute value Worth knowing.. -
Establish an inequality.
Use known inequalities (e.g., triangle inequality, AM‑GM, Cauchy‑Schwarz) to relate (|a_n|) to a constant. -
Verify for all indices.
Ensure the inequality holds for every (n \in \mathbb{N}). If the sequence is defined piecewise, treat each piece separately and take the maximum of the bounds. -
Conclude.
State explicitly that there exists an (M) such that (|a_n| \le M) for all (n).
Example proof:
Show that the sequence (a_n = \
Example proof – a rational‑trigonometric sequence
Consider the sequence
[ a_n ;=; \frac{2n^{2}+\sin n}{,n^{2}+1,}, \qquad n\in\mathbb N . ]
We will verify directly that ((a_n)) is bounded, following the four‑step recipe introduced earlier That alone is useful..
1. Identify a candidate bound
Because (|\sin n|\le 1) for every integer (n), the numerator satisfies
[ 2n^{2}+\sin n ;\le; 2n^{2}+1 . ]
The denominator is always positive and grows like (n^{2}). Hence a natural candidate for an absolute bound is
[ M ;=; \frac{2n^{2}+1}{n^{2}} ;=; 2+\frac{1}{n^{2}} . ]
Since (2+\frac{1}{n^{2}}\le 3) for all (n\ge 1), we may take the simple constant (M=3) as a global bound Practical, not theoretical..
2. Establish an inequality
For every (n),
[ \begin{aligned} |a_n| &= \left|\frac{2n^{2}+\sin n}{n^{2}+1}\right| \le \frac{2n^{2}+|\sin n|}{n^{2}+1} \le \frac{2n^{2}+1}{n^{2}+1} \ &\le \frac{2n^{2}+1}{n^{2}} = 2+\frac{1}{n^{2}} \le 3 . \end{aligned} ]
The chain of inequalities uses only the elementary facts (|\sin n|\le 1) and (n^{2}+1>n^{2}) Took long enough..
3. Verify for all indices
The derivation above holds for every natural number (n); there is no piecewise case to treat separately. Because of this, the inequality (|a_n|\le 3) is valid for the entire sequence Nothing fancy..
4. Conclude
We have exhibited a constant (M=3) such that
[ |a_n| \le M \qquad \text{for all } n\in\mathbb N . ]
Hence the sequence ((a_n)) is bounded. In fact, a sharper bound can be obtained by noting that the limit of (a_n) as (n\to\infty) is (2); the terms never exceed (2+\frac{1}{n^{2}}), which is already captured by the simple (M=3) Still holds up..
Concluding remarks
Boundedness is more than a technical nicety—it is the cornerstone that lets analysts invoke powerful theorems such as Bolzano‑Weierstrass and the completeness of (\mathbb{R}). A bounded sequence may not converge, but it always contains a convergent subsequence, guaranteeing that “something” settles down even when the whole sequence does not It's one of those things that adds up. Turns out it matters..
On top of that, boundedness interacts cleanly with algebraic operations: sums, products, and finite subsequences of bounded sequences remain bounded
The interplay between boundedness and algebraic operations not only simplifies proofs but also provides a framework for constructing new bounded sequences from known ones. Take this: if ((a_n)) and ((b_n)) are both bounded by constants (M_1) and (M_2), then their sum ((a_n + b_n)) is bounded by (M_1 + M_2), and their product ((a_n b_n)) is bounded by (M_1 M_2). Similarly, scalar multiples of a bounded sequence remain bounded: if (|a_n| \le M), then for any real number (c), (|c a_n| \le |c| M). These properties allow analysts to combine bounded sequences in meaningful ways without losing control over their growth Easy to understand, harder to ignore..
Crucially, boundedness is a necessary—but not sufficient—condition for convergence. A convergent sequence must be bounded, yet the converse does not hold, as illustrated
