Every bounded sequence of real numbers contains a subsequence with a finite limit of a sequence. If for every positive integer , there are integers and a real number such that
The increasing indices matter: a subsequence retains the original order and selects terms arbitrarily far along the original sequence. The theorem guarantees the existence of at least one such selection; it does not claim that the entire sequence converges or that the subsequential limit is unique.[ref]
For example, the bounded sequence has two distinct subsequential limits:
The even terms form a convergent sequence, and so do the odd terms. The full sequence cannot have a limit of a sequence because its two subsequences have different limits. Its limit superior is and its limit inferior is .
Figure 1. . Terms of are colored by even or odd index. The dashed lines mark and . Each color approaches its own limit, while the entire sequence keeps moving between the two groups. The values are exact model calculations, not observations. Details.
This is useful when a construction produces many candidate points but does not immediately produce a convergent sequence. For a continuous function on a nonempty closed bounded feasible region in a finite-dimensional Euclidean space, take a sequence whose objective values approach the infimum. A convergent subsequence supplies a candidate point; a closed subset retains that point, and continuity passes the objective values to the limit of a sequence. This is the mechanism behind attainment in the extreme value theorem. The diagonal subsequence argument extends the real-sequence theorem to finite-dimensional Euclidean space.
Begin with a closed interval containing the entire bounded sequence. Split the interval at its midpoint. At least one of the two closed halves contains infinitely many indexed terms; choose such a half and repeat. This gives nested intervals with lengths . The nested interval theorem, using completeness of the real numbers, supplies their unique common point .
Choose with . Infinitely many indexed terms in guarantee that the next index can be chosen. Both and belong to , so
This is a short existence proof, not necessarily a finite algorithm for an arbitrary input sequence: deciding which half contains infinitely many future terms may require mathematical knowledge about that sequence.
Figure 1.
Nested intervals isolate a subsequential limit while the selected indices keep increasing
. For , the illustrated halves contain infinitely many even-indexed terms and narrow around . Each row marks one selected term inside its interval; the table gives the original index. The right plot shows the selected error below the interval-length bound. The exact selections follow the displayed model, rather than deciding an arbitrary infinite sequence by sampling. Details.
The rational numbers lie in and obey . They form a convergent sequence in the real numbers, with limit of a sequence . Every subsequence has that same real limit. Because is an irrational number, no subsequence converges to a point in the rational numbers with their usual metric. Boundedness alone therefore does not give the corresponding theorem in every metric space; completeness of the real numbers is doing real work here. The floor function simply truncates the decimal expansion in this example.
In the l2 sequence space, let have value one in coordinate and zero elsewhere. This orthonormal sequence is bounded: . For distinct indices , its terms obey . No subsequence can therefore be a Cauchy sequence, so none converges in the norm. Thus even a complete metric space can have a bounded sequence with no convergent subsequence. Finite dimension is essential to the usual Euclidean space extension, and in a general metric space the relevant replacement is compactness or total boundedness together with completeness.
Every real sequence has a subsequence converging to an extended real number. A bounded sequence has a real convergent subsequence by the Bolzano-Weierstrass theorem. If it is unbounded above, every tail is unbounded above, so choose increasing indices with . These terms tend to positive infinity. If it is unbounded below, use .
A diagonal subsequence argument successively extracts nested subsequences that converge in the first, first two, and then first coordinates. Taking the th term from the th nested subsequence produces one subsequence that converges in every fixed coordinate.
If a bounded real sequence has the property that every convergent subsequence converges to the same number , then the full sequence converges to . Otherwise, a subsequence stays at least some fixed distance from ; Bolzano--Weierstrass gives it a convergent subsubsequence, contradicting the assumed uniqueness.

Ancestors (6)

  1. Sequence and series
  2. Real analysis
  3. Analysis
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.