Homepage › Solution manuals › Stephen Abbott › Understanding Analysis › Exercise 2.5.8
Exercise 2.5.8
Another way to prove the Bolzano-Weierstrass Theorem is to show that every sequence contains a monotone subsequence. A useful device in this endeavor is the notion of a peak term. Given a sequence , a particular term is a peak term if no later term in the sequence exceeds it; i.e., if for all .
- (a)
- Find examples of sequences with zero, one, and two peak terms. Find an example of a sequence with infinitely many peak terms that is not monotone.
- (b)
- Show that every sequence contains a monotone subsequence and explain how this furnishes a new proof of the Bolzano-Weierstrass Theorem.
Answers
- (a)
- has zero peak terms, has a single peak term, has two peak terms (a similar argument works for peak terms) and has infinitely many peak terms. The sequence has infinitely many peak terms, but is not monotone.
- (b)
-
Note that the (possibly finite) sequence of peak terms is monotonic decreasing. There are two possibilities - either there are infinitely many peak terms, or only finitely many. If there are infinitely many peak terms, simply take the subsequence of peak terms; if the parent sequence is bounded we have found a subsequence which converges (by the Monotone Convergence Theorem), hence proving BW in this case.
If there are finitely many peak terms, let the last peak term be at position . Consider the terms after the last peak term. Since after this point there are no more peak terms, then for every term there must be at least one term where . Therefore we can define the monotone subsequence as , as the first term after such that . By MCT this subsequence converges, hence proving BW in this case as well.