Math 2.0

statement lemma

Every sequence has a monotone subsequence

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.

Explanations

L1 human

Think of the terms as heights of hills seen from left to right. Either infinitely many hills have no higher hill to their right, or from some point on you can always find a higher hill further right.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • 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

What depends on this

101 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Bolzano–Weierstrass_theorem, Proof