Subsequences and nested intervals
Subsequences and extraction maps
What a subsequence is
A subsequence of is obtained by keeping only some of the terms, without ever going backward. Formally, we take a map
and consider the sequence . The map is called an extraction map.
Example: with , we extract the even-indexed terms ; with , we extract
The basic lemma
If is strictly increasing, then for all .
Proof by induction. We have since takes nonnegative integer values. If , strict monotonicity gives , hence since these are integers.
This tiny lemma is used everywhere: it is what guarantees that the extraction "moves" toward infinity, so that a subsequence really is a sequence of terms further and further along.
What subsequences preserve
| Property of | True for ? |
|---|---|
| converges to | yes, to the same |
| bounded | yes, by the same bounds |
| tends to | yes |
| increasing | yes |
| diverges | not necessarily |
The first row is the most useful, and its contrapositive even more so: if we exhibit two subsequences with different limits, the sequence does not converge.
Canonical example: for , we have and . These two limits differ, so diverges — without ever having had to work with the definition of convergence.
The even-odd criterion
Conversely, if and converge to the same limit , then converges to : every index is even or odd, so the two bounds fit together.
Be careful: the two extractions really must cover all indices. Knowing that and converge to is not enough: index , for example, is reached by neither.
Classic pitfall
Believing that an extraction map must be surjective, that is, must reach every integer. This is false: skips index , and yet is a perfectly legitimate subsequence. The only constraint is strict monotonicity — and it is what must be checked carefully in the construction of the next chapter.

