Subsequences and nested intervals

Bisection and the nested intervals theorem

The bisection principle

Cut an interval in two, keep one half, start again: the length is divided by 22 at each step. Starting from [a,b][a, b], the interval obtained after nn cuts has length

bn−an=b−a2n→n→+∞0b_n - a_n = \frac{b - a}{2^n} \xrightarrow[n \to +\infty]{} 0

On [0,1][0, 1], the decrease is spectacular:

012345678910interval lengthnumber of bisections

The marked bar is the first whose length drops below 10−310^{-3}: ten cuts are enough, since 210=1024>10002^{10} = 1024 > 1000.

The nested intervals theorem

Let ([an,bn])n∈N\left([a_n, b_n]\right)_{n \in \mathbb{N}} be a sequence of nested closed intervals, that is, satisfying [an+1,bn+1]⊂[an,bn][a_{n+1}, b_{n+1}] \subset [a_n, b_n] for all nn, and such that bn−an→0b_n - a_n \to 0. Then there exists a unique real number cc belonging to all these intervals, and an→ca_n \to c, bn→cb_n \to c.

Proof. Nesting translates into an≤an+1≤bn+1≤bna_n \leq a_{n+1} \leq b_{n+1} \leq b_n: the sequence (an)(a_n) is increasing, the sequence (bn)(b_n) is decreasing, and an≤bn≤b0a_n \leq b_n \leq b_0 for all nn.

The sequence (an)(a_n) is therefore increasing and bounded above by b0b_0: it converges to a real number cc. Likewise (bn)(b_n) is decreasing and bounded below by a0a_0, so it converges to a real number c′c'. Finally

c′−c=lim⁡n→+∞(bn−an)=0c' - c = \lim_{n \to +\infty} \left(b_n - a_n\right) = 0

hence c=c′c = c'. Passing to the limit in an≤c≤bna_n \leq c \leq b_n — legitimate since (an)(a_n) increases to cc and (bn)(b_n) decreases to cc — shows that cc belongs to each interval. And if dd also belonged to them, we would have ∣d−c∣≤bn−an→0\lvert d - c \rvert \leq b_n - a_n \to 0, so d=cd = c.

In other words, the two sequences (an)(a_n) and (bn)(b_n) are adjacent, and their common limit is the only point of the intersection:

⋂n∈N[an,bn]={c}\bigcap_{n \in \mathbb{N}} \left[a_n, b_n\right] = \{c\}

Both hypotheses are essential

Sequence of intervals Nested Length to 00 Intersection
[0,1+1n]\left[0, 1 + \tfrac{1}{n}\right] yes no [0,1][0, 1], not a point
(0,1n)\left(0, \tfrac{1}{n}\right), not closed yes yes empty
[−1n,1n]\left[\tfrac{-1}{n}, \tfrac{1}{n}\right] yes yes {0}\{0\}

The second row deserves a closer look: these are open intervals, and the intersection is empty. The theorem holds for segments, that is, for closed and bounded intervals — the same compactness requirement as in Heine's theorem.

Classic pitfall

Writing directly "the nested intervals converge to a point" without checking that the length tends to 00. Without this hypothesis, the intersection is still nonempty, but it is an interval, not a singleton. Bisection, on the other hand, provides the b−a2n\dfrac{b-a}{2^n} decrease for free: this is precisely why it is the construction tool for the Bolzano-Weierstrass theorem.