Question #27183

What is Bolzano-Weierstrass Theorem? Give the proof.

Expert's answer

Bolzano-Weierstrass theorem

In real analysis, the Bolzano-Weierstrass theorem is a fundamental result about convergence in a finite-dimensional Euclidean space RnR^n. The theorem states that each bounded sequence in RnR^n has a convergent subsequence. An equivalent formulation is that a subset of RnR^n is sequentially compact if and only if it is closed and bounded.

Proof

First we prove the theorem in the case of n=1n = 1, in which case the ordering on RR can be put to good use. Indeed we have the following result.

Rising Sun Lemma: Every sequence {xn}\{x_n\} in RR has a monotone subsequence.

Proof: Let us call a positive integer "n" a peak of the sequence if m>nm > n implies xn>xmx_{n} > x_{m}, i.e., if xnx_{n} is greater than every subsequent term in the sequence. Suppose first that the sequence has infinitely many peaks. Then the subsequence of peaks is strictly decreasing, and we are done. So suppose now that there are only finitely many peaks, and let "N" be the last peak. By definition, this means that there is n1>Nn_1 > N with xn1<xnx_{n_1} < x_n. Since n1>Nn_1 > N, n1n_1 is not a peak, which, as above, implies the existence of an n2>n1n_2 > n_1 with xn2<xn1x_{n_2} < x_{n_1}. Repeating this process leads to an infinite subsequence xn1<xn2x_{n_1} < x_{n_2}.

Now suppose we have a bounded sequence in RR; by the Rising Sun Lemma there exists a monotone subsequence, necessarily bounded. But it is immediate from the completeness of the real numbers that any bounded nondecreasing (respectively, nonincreasing) sequence converges to its least upper bound (respectively, greatest lower bound).

Finally, the general case can be easily reduced to the case of n=1n = 1 as follows: given a bounded subsequence in RnR^n, the sequence of first coordinates is a bounded real sequence, so, has a convergent subsequence. We can then extract a subsubsequence on which the second coordinates converge, and so on, until in the end we have passed from the original sequence to a subsequence "n" times -- which is still a subsequence of the original sequence -- on which each coordinate sequence converges, so, the subsequence itself is convergent.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS