PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: Very high
[parent] proof of Bolzano-Weierstrass Theorem (Proof)

To prove the Bolzano-Weierstrass theorem, we will first need two lemmas.

Lemma 1.

All bounded monotone sequences converge.

proof.

Let $ (s_n)$ be a bounded, nondecreasing sequence. Let $ S$ denote the set $ \{s_n : n \in \mathbb{N}\}$. Then let $ b=\sup S$ (the supremum of $ S$.)

Choose some $ \epsilon > 0$. Then there is a corresponding $ N$ such that $ s_N>b-\epsilon$. Since $ (s_n)$ is nondecreasing, for all $ n>N$, $ s_n > b-\epsilon$. But $ (s_n)$ is bounded, so we have $ b-\epsilon < s_n \le b$. But this implies $ \vert s_n-b\vert<\epsilon$, so $ \lim s_n= b$. $ \square$

(The proof for nonincreasing sequences is analogous.)

Lemma 2.

Every sequence has a monotonic subsequence.

proof.

First a definition: call the $ n$th term of a sequence dominant if it is greater than every term following it.

For the proof, note that a sequence $ (s_n)$ may have finitely many or infinitely many dominant terms.

First we suppose that $ (s_n)$ has infinitely many dominant terms. Form a subsequence $ (s_{n_k})$ solely of dominant terms of $ (s_n)$. Then $ s_{n_{k+1}} < s_{n_k}$ $ k$ by definition of “dominant”, hence $ (s_{n_k})$ is a decreasing (monotone) subsequence of ($ s_n$).

For the second case, assume that our sequence $ (s_n)$ has only finitely many dominant terms. Select $ n_1$ such that $ n_1$ is beyond the last dominant term. But since $ n_1$ is not dominant, there must be some $ m>n_1$ such that $ s_m > s_{n_1}$. Select this $ m$ and call it $ n_2$. However, $ n_2$ is still not dominant, so there must be an $ n_3>n_2$ with $ s_{n_3} > s_{n_2}$, and so on, inductively. The resulting sequence

$\displaystyle s_1,s_2,s_3,\ldots $

is monotonic (nondecreasing). $ \square$

proof of Bolzano-Weierstrass.

The proof of the Bolzano-Weierstrass theorem is now simple: let $ (s_n)$ be a bounded sequence. By Lemma 2 it has a monotonic subsequence. By Lemma 1, the subsequence converges. $ \square$



"proof of Bolzano-Weierstrass Theorem" is owned by akrowne.
(view preamble)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: simple, decreasing, dominant, term, subsequence, monotonic, nonincreasing, implies, supremum, proof, converge, sequences, monotone, bounded, Bolzano-Weierstrass theorem

This is version 2 of proof of Bolzano-Weierstrass Theorem, born on 2002-02-18, modified 2002-02-19.
Object id is 2129, canonical name is ProofOfBolzanoWeierstrassTheorem.
Accessed 16446 times total.

Classification:
AMS MSC40A05 (Sequences, series, summability :: Convergence and divergence of infinite limiting processes :: Convergence and divergence of series and sequences)
 26A06 (Real functions :: Functions of one variable :: One-variable calculus)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)