A peak of a sequence of real numbers is an index whose value is at least every later value. This is a condition on the entire tail, stronger than comparing only adjacent terms. Equality is allowed: every index of a constant sequence is a peak of a sequence.
Infinitely many peaks of a sequence, listed in increasing order of index, give a nonincreasing monotone subsequence. If only finitely many exist, every index beyond the last has a larger later term; repeatedly choosing one gives a strictly increasing monotone subsequence. This proves the monotone subsequence theorem.
A peak of a sequence of supplies a lower bound for all subsequent terms of . If both and have a peak of a sequence, the two selected values bound a common tail. Adding bounds for the finite initial segment proves that is a bounded sequence.
Suppose are peaks of a sequence and are peaks of a sequence . Then converges precisely when these two subsequences have a common finite limit of a sequence .
Necessity follows because every subsequence inherits the limit of a sequence of a convergent sequence. For sufficiency, choose one selected value from each subsequence within of . Every term after both selected indices lies between the two selected values:
This is exactly .
Suppose both and have only finitely many peaks of a sequence. Beyond some index , every term has a strictly larger later term and a strictly smaller later term. Starting from , construct one strictly increasing and one strictly decreasing monotone subsequence.
If the original sequence had limit of a sequence , both selected subsequences would tend to . The increasing one has a second term strictly above , so ; the decreasing one similarly forces . This contradiction proves nonconvergence. For example, has no peaks of a sequence in either sign and diverges.

Articles by others on the same topic (0)

There are currently no matching articles.