Math 2.0

Sequences, series, summability Sequences and limits Theorem

Monotone convergence theorem for sequences

Builds on Monotone sequenceBounded sequenceLimit of a sequence

Statement

Let (an)(a_n) be an increasing real sequence, in the sense of a monotone sequence. Assume that (an)(a_n) is bounded above. Then (an)(a_n) converges, and its limit is the supremum sup⁡{an:n∈ℕ}\sup \{a_n : n \in \mathbb{N}\}.

Remarks

The supremum ss exists by the completeness of ℝ\mathbb{R}. For ε>0\varepsilon > 0 there is NN with aN>s−εa_N > s - \varepsilon, and then s−ε<an≤ss - \varepsilon < a_n \le s for all n≥Nn \ge N. The statement fails in ℚ\mathbb{Q}. The decimal approximations 1,1.4,1.41,1.414,…1, 1.4, 1.41, 1.414, \dots of 2\sqrt{2} increase and are bounded, but they have no limit in ℚ\mathbb{Q}. The node decreasing sequence bounded below converges gives the dual statement. An increasing sequence that is not bounded above tends to infinity.

Reading path

To understand this page from the ground up, read these 6 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. Bounded sequence definition
  4. Limit of a sequence definition
  5. Monotone sequence definition
  6. Monotone convergence theorem for sequences statement

Where this leads

247 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Monotone_convergence_theorem, Convergence of a monotone sequence of real numbers
About this page
Tag0FM6N4R0VB
URIm2://0FM6N4R0VB
Kindstatement, theorem
WritingW1 stated
MSC40A05
StatusThis copy of the site has no build data. Run m2 status 0FM6N4R0VB.
UsesMonotone sequence, Bounded sequence, Limit of a sequence
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (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