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 ( x n ) , a particular term x m is a peak term if no later term in the sequence exceeds it; i.e., if x m x n for all n m .

(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)
( 1 , 2 , ) has zero peak terms, ( 1 , 0 , 1 2 , 2 3 , 3 4 , ) has a single peak term, ( 2 , 1 , 1 2 , 2 3 , ) has two peak terms (a similar argument works for k peak terms) and ( 1 , 1 2 , 1 3 , ) has infinitely many peak terms. The sequence ( 1 , 1 2 , 1 3 , 1 4 , ) 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 k . Consider the terms after the last peak term. Since after this point there are no more peak terms, then for every term x n there must be at least one term x m x n where m > n > k . Therefore we can define the monotone subsequence x as x 1 = x k + 1 , x n as the first term after x n 1 such that x n > x n 1 . By MCT this subsequence converges, hence proving BW in this case as well.

User profile picture
2022-01-27 00:00
Comments