The Bolzano–Weierstrass theorem stands as a foundational result in real analysis, establishing a deep connection between boundedness and convergence within Euclidean spaces. This theorem asserts that every bounded sequence in R n contains a convergent subsequence, a property that underpins much of mathematical analysis. Understanding its proof provides insight into the compactness of closed and bounded sets, a concept that extends far beyond the classroom.
Core Statement and Intuition
At its heart, the theorem deals with the behavior of infinite lists of numbers confined to a finite region. Imagine plotting points along a line segment; no matter how haphazardly you place an infinite number of them within that segment, the theorem guarantees that at least one point will act as a magnet, attracting infinitely many terms of the sequence arbitrarily closely. This "accumulation point" is the essence of the subsequence convergence the theorem promises. The result is not merely an abstract curiosity but a vital tool for ensuring the existence of limits where direct computation is impossible.
Logical Structure of the Argument
The most common proof strategy for the Bolzano–Weierstrass theorem relies on the method of bisection, a constructive approach that physically narrows down the region containing the desired subsequence. The logic proceeds by repeatedly dividing the interval containing the sequence into two equal halves. At each step, at least one of these halves must contain infinitely many terms of the sequence. By selecting the half with this property and continuing the process, one generates a nested sequence of intervals whose lengths shrink to zero. The intersection of these intervals contains exactly one point, which becomes the limit of the constructed subsequence.
The Bisection Process Explained
To visualize this, consider a bounded sequence confined to a closed interval [a, b] . The first step divides the interval into [a, (a+b)/2] and [(a+b)/2, b] . Since the original interval contained infinitely many terms, at least one subinterval must also contain infinitely many terms. We select that subinterval and label it I₁ . This procedure is repeated ad infinitum, creating a sequence of intervals I₁ ⊇ I₂ ⊇ I₃ ⊇ ... . The length of Iₙ is (b-a)/2ⁿ , which approaches zero as n increases, forcing the intervals to "pinpoint" a specific real number.
Constructing the Convergent Subsequence
The final step transforms the nested intervals into the subsequence itself. By the construction rule, we choose a term xₖ from the original sequence that lies within the k -th interval Iₖ , ensuring the index keeps increasing. Because the length of Iₖ tends to zero, the distance between xₖ and the unique point in the intersection of all intervals tends to zero as well. Consequently, the selected subsequence converges to that point, fulfilling the theorem's requirement. This elegant interaction between selection and convergence highlights the power of recursive definitions in analysis.
Generalization to Higher Dimensions
The beauty of the Bolzano–Weierstrass theorem lies in its scalability. While the bisection argument is intuitive in one dimension, the theorem applies seamlessly to vectors in R n . The proof follows the same logic by treating each coordinate independently or by applying the bisection method to bounding boxes in multidimensional space. This generalization is crucial for applications in multivariable calculus and functional analysis, where data rarely resides on a single line. The core principle remains: boundedness in finite-dimensional spaces is synonymous with sequential compactness.
