Math 2.0

Sequences, series, summability Lemma

Every sequence has a monotone subsequence

Builds on SubsequenceMonotone sequence

Statement

Let (an)(a_n) be a real sequence. Then (an)(a_n) has a subsequence that is monotone.

Remarks

The usual proof uses peaks. An index nn is a peak if am≤ana_m \le a_n for all m>nm > n. If there are infinitely many peaks, the terms at the peaks form a decreasing subsequence. If there are finitely many peaks, start after the last one. Each index then has a later index with a larger term, and this gives a strictly increasing subsequence. With the monotone convergence theorem, the lemma gives the Bolzano–Weierstrass theorem.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Sequence definition
  2. Real sequence definition
  3. Subsequence definition
  4. Monotone sequence definition
  5. Every sequence has a monotone subsequence statement

Where this leads

165 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Bolzano–Weierstrass_theorem, Proof
About this page
Tag0MHGJRZMTM
URIm2://0MHGJRZMTM
Kindstatement, lemma
WritingW0 stub
MSC40A05
StatusThis copy of the site has no build data. Run m2 status 0MHGJRZMTM.
UsesSubsequence, Monotone sequence

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by