Sequences, series, summability Absolute and conditional convergence, rearrangements, products of series Theorem
Riemann rearrangement theorem
Statement
Let be a real series that converges conditionally. Let be a real number. Then there is a rearrangement that converges to . There is also a rearrangement that diverges to , and one that diverges to .
Remarks
The positive terms and the negative terms each give a divergent series, and . Take positive terms until the partial sum exceeds , then negative terms until it falls below , and repeat. So a real series converges absolutely if and only if all its rearrangements converge to the same sum. For the alternating harmonic series, take two positive terms, then one negative term, and repeat. The sum becomes .
History
Augustin-Louis Cauchy is usually credited with the first remark that a new order can change a sum. He studied the alternating harmonic series in 1833. The theorem is named after Bernhard Riemann.
Reading path
To understand this page from the ground up, read these 11 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Sequence definition
- Real sequence definition
- Limit of a sequence definition
- Series definition
- Convergent sequence definition
- Partial sum definition
- Rearrangement of a series definition
- Convergent series definition
- Absolute convergence definition
- Conditional convergence definition
- Riemann rearrangement theorem statement
Further reading
- Web https://en.wikipedia.org/wiki/Riemann_series_theorem, Statement of the theorem
About this page
| Tag | 0E7VBYGFF7 |
|---|---|
| URI | m2://0E7VBYGFF7 |
| Aliases | riemann-series-theorem |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 40A05 |
| Status | This copy of the site has no build data. Run m2 status 0E7VBYGFF7. |
| Uses | Conditional convergence, Rearrangement of a series |
| 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
No page links to this page yet.