Math 2.0

statement theorem

Rearrangements of an absolutely convergent series have the same sum

Statement

Let ∑an\sum a_n be a real series that converges absolutely, with sum AA. Let σ ⁣:N→N\sigma \colon \mathbb{N} \to \mathbb{N} be a bijection. Then the rearrangement ∑aσ(n)\sum a_{\sigma(n)} converges absolutely, and its sum is AA.

Remarks

Given ε>0\varepsilon > 0, choose NN with ∑n>N∣an∣<ε\sum_{n > N} |a_n| < \varepsilon. For large mm, the first mm terms of the rearrangement include a0,…,aNa_0, \dots, a_N. So the two partial sums differ by less than ε\varepsilon. By the Riemann rearrangement theorem, the converse also holds for real series. Mathlib states a general form for sums over a type, as Equiv.tsum_eq.

Explanations

L1 human

When the series converges absolutely, the far terms have a small total size, whatever their order. So a new order changes the partial sums only by a small amount.

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 10 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. Limit of a sequence definition
  4. Series definition
  5. Convergent sequence definition
  6. Partial sum definition
  7. Rearrangement of a series definition
  8. Convergent series definition
  9. Absolute convergence definition
  10. Rearrangements of an absolutely convergent series have the same sum statement

Sources

  1. Web https://en.wikipedia.org/wiki/Absolute_convergence, Rearrangements and unconditional convergence