Math 2.0

statement corollary

Decreasing sequence bounded below converges

Statement

Let (an)(a_n) be a decreasing real sequence: an≥an+1a_n \ge a_{n+1} for all n∈Nn \in \mathbb{N}. Assume that (an)(a_n) is bounded below. Then (an)(a_n) converges, and its limit is the infimum inf⁡{an:n∈N}\inf \{a_n : n \in \mathbb{N}\}.

Remarks

The proof applies the monotone convergence theorem to the increasing sequence (−an)(-a_n). For example, 1/n1/n decreases and is bounded below by 00. Its limit is its infimum 00. Together, the two statements say that a monotone sequence converges if and only if it is bounded.

Explanations

L1 human

A decreasing sequence that cannot pass a floor must settle down. It settles at the highest floor, which is the infimum of its terms.

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 7 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. Bounded sequence definition
  4. Limit of a sequence definition
  5. Monotone sequence definition
  6. Monotone convergence theorem for sequences statement
  7. Decreasing sequence bounded below converges statement

Sources

  1. Web https://en.wikipedia.org/wiki/Monotone_convergence_theorem, Convergence of a monotone sequence of real numbers