Bounded Sequence

Boundedness controls the size or location of terms, whereas convergence concerns whether terms approach one limiting value. Thus, a sequence can remain inside a fixed finite range while continuing to vary and fail to settle. This distinction prevents boundedness from being treated as a substitute for convergence and explains why additional structure, such as monotonicity, is needed for stronger conclusions.

A monotone sequence moves consistently in one direction, so a bound prevents its terms from continuing indefinitely in that direction. The monotone convergence theorem uses this combination to establish convergence: an increasing sequence needs an upper bound, while a decreasing sequence needs a lower bound. The bound supplies control, and monotonicity supplies the order needed to reach a limit.

The Bolzano–Weierstrass theorem turns boundedness into a subsequential limit result. Rather than requiring the entire sequence to converge, it identifies a subsequence that converges when the sequence remains controlled. This matters when the full sequence oscillates or otherwise fails to settle, because a convergent subsequence still reveals limiting behavior useful in analysis and compactness arguments.

For real sequences, boundedness can be described through simultaneous upper and lower bounds on the terms. For complex sequences, ordering is unavailable, so the relevant control is expressed through the modulus |a_n| and a single finite constant M. This distinction lets the same inequality framework handle both settings while respecting their different number systems.

Start by seeking one finite constant M that works for every index, then verify |a_n| ≤ M through an argument valid for all n. In the real case, equivalently establish both an upper and a lower bound. If no common finite control applies to every index, the sequence does not satisfy the required boundedness condition.

In an iterative method, boundedness provides preliminary control over the values generated across infinitely many steps. It can help determine whether the iteration remains within a manageable range and whether limit or subsequence theorems may apply. However, boundedness alone does not show that the iterates converge, so additional reasoning, such as monotonicity, is required.

Boundedness provides a finite-range constraint that supports broader arguments about limits, compactness, and approximation. It allows mathematicians to study infinite collections without permitting terms to escape arbitrarily far. In these settings, boundedness is usually one ingredient rather than a complete conclusion, since further properties are needed to establish convergence or other precise behavior.