Math 2.0

Sequences, series, summability Proof

Proof that rearrangements of an absolutely convergent series have the same sum

Builds on Absolute convergenceRearrangement of a seriesA series of nonnegative terms converges iff its partial sums are boundedTriangle inequalityLimit of a sequenceAbsolutely convergent series converge

Proof

Let T=∑n=0∞∣an∣T = \sum_{n=0}^{\infty} \abs{a_n}, and let tK=∑k=0K∣ak∣t_K = \sum_{k=0}^{K} \abs{a_k} and sK=∑k=0Kaks_K = \sum_{k=0}^{K} a_k. The series ∑an\sum a_n converges, with sum AA, since absolutely convergent series converge. Let BN=∑n=0Naσ(n)B_N = \sum_{n=0}^{N} a_{\sigma(n)} be the partial sums of the rearrangement.

  1. By the criterion for nonnegative series, tK≤Tt_K \le T for every KK.
  2. Let NN be a natural number and let K=max⁡{σ(0),…,σ(N)}K = \max \set{\sigma(0), \dots, \sigma(N)}. Since σ\sigma is injective, the indices σ(0),…,σ(N)\sigma(0), \dots, \sigma(N) are distinct elements of {0,…,K}\set{0, \dots, K}.
  3. So ∑n=0N∣aσ(n)∣≤tK≤T\sum_{n=0}^{N} \abs{a_{\sigma(n)}} \le t_K \le T, because the terms are nonnegative.
  4. The partial sums of ∑∣aσ(n)∣\sum \abs{a_{\sigma(n)}} are bounded above by TT. By the same criterion, the rearrangement converges absolutely.
  5. Let ε>0\varepsilon > 0. Since tM→Tt_M \to T and sM→As_M \to A, there is MM with T−tM<εT - t_M < \varepsilon and ∣sM−A∣<ε\abs{s_M - A} < \varepsilon, by the definition of the limit.
  6. Since σ\sigma is surjective, each of 0,1,…,M0, 1, \dots, M equals σ(n)\sigma(n) for some nn. Let N0N_0 be the largest of these M+1M + 1 values of nn.
  7. Let N≥N0N \ge N_0. Then {0,…,M}⊆σ({0,…,N})\set{0, \dots, M} \subseteq \sigma(\set{0, \dots, N}). Let D=σ({0,…,N})∖{0,…,M}D = \sigma(\set{0, \dots, N}) \setminus \set{0, \dots, M}, a finite set of indices larger than MM.
  8. Since σ\sigma is injective, BN=∑k∈σ({0,…,N})ak=sM+∑k∈DakB_N = \sum_{k \in \sigma(\set{0, \dots, N})} a_k = s_M + \sum_{k \in D} a_k.
  9. Let KK be an integer at least MM and every element of DD. By the triangle inequality and step 1, ∣∑k∈Dak∣≤∑k=M+1K∣ak∣=tK−tM≤T−tM<ε\abs{\sum_{k \in D} a_k} \le \sum_{k=M+1}^{K} \abs{a_k} = t_K - t_M \le T - t_M < \varepsilon.
  10. By steps 5, 8 and 9, ∣BN−A∣≤∣sM−A∣+∣∑k∈Dak∣<2ε\abs{B_N - A} \le \abs{s_M - A} + \abs{\sum_{k \in D} a_k} < 2\varepsilon for all N≥N0N \ge N_0.
  11. So BN→AB_N \to A. The rearrangement converges absolutely, and its sum is AA.

Idea

Fix a long initial block a0,…,aMa_0, \dots, a_M whose sum is close to AA and whose tail of absolute values is small. A long enough partial sum of the rearrangement contains this whole block, plus some terms from the tail. Those extra terms have small total size, so they cannot move the sum much.

Reading path

To understand this page from the ground up, read these 106 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the commutativity of addition by induction, Proof that absolutely convergent series converge, Proof that convergent sequences are Cauchy, Proof of the Cauchy criterion for series, Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the double negation law by a truth table, Proof of strong induction from ordinary induction, Proof that Cauchy sequences are bounded, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that limits preserve non-strict inequalities, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof that a decreasing sequence bounded below converges, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof that a series of nonnegative terms converges iff its partial sums are bounded.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Element definition
  4. Integers object
  5. Mathematical induction concept
  6. Natural numbers object
  7. Ordered field definition
  8. Peano axioms concept
  9. Proposition concept
  10. Rational numbers object
  11. Real numbers object
  12. Sequence definition
  13. Set bounded above definition
  14. Set definition
  15. Ring of integers statement
  16. Successor function definition
  17. Conjunction definition
  18. Disjunction definition
  19. Implication definition
  20. Negation definition
  21. Predicate definition
  22. The reals form a field statement
  23. Real sequence definition
  24. Subsequence definition
  25. Infimum definition
  26. Supremum definition
  27. Ordered pair definition
  28. Addition of natural numbers definition
  29. Biconditional definition
  30. The successor function is injective statement
  31. Truth table concept
  32. Zero is not a successor statement
  33. Modus ponens concept
  34. The rationals form a field statement
  35. Universal quantifier definition
  36. Bounded sequence definition
  37. Cauchy sequence definition
  38. Limit of a sequence definition
  39. Monotone sequence definition
  40. Series definition
  41. Completeness axiom statement
  42. Cartesian product definition
  43. Proof of the commutativity of addition by induction proof
  44. Order on the natural numbers definition
  45. Subset definition
  46. Propositional logic concept
  47. Mathematical proof concept
  48. The rationals form an ordered field statement
  49. Convergent sequence definition
  50. Partial sum definition
  51. Rearrangement of a series definition
  52. Binary relation definition
  53. Commutativity of addition statement
  54. Proof of strong induction from ordinary induction proof
  55. Order on the reals definition
  56. Tautology definition
  57. Convergent series definition
  58. Antisymmetric relation definition
  59. Reflexive relation definition
  60. Transitive relation definition
  61. Strong induction statement
  62. Logical equivalence definition
  63. Sum of a series definition
  64. Absolute convergence definition
  65. Preorder definition
  66. Proof of the well-ordering principle from strong induction proof
  67. Proof of the double negation law by a truth table proof
  68. Partial order definition
  69. Well-ordering principle statement
  70. Double negation law statement
  71. Total order definition
  72. Proof by contradiction concept
  73. Proof that every sequence has a monotone subsequence, by peaks proof
  74. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  75. Every sequence has a monotone subsequence statement
  76. The reals form an ordered field statement
  77. Absolute value definition
  78. Proof of the approximation property of the supremum proof
  79. Proof of the triangle inequality for real numbers proof
  80. Proof of the epsilon-N definition of the limit of a sequence proof
  81. Approximation property of the supremum statement
  82. Triangle inequality statement
  83. Epsilon-N definition of the limit of a sequence statement
  84. Proof that limits preserve non-strict inequalities proof
  85. Proof that convergent sequences are bounded proof
  86. Proof that convergent sequences are Cauchy proof
  87. Proof that Cauchy sequences are bounded proof
  88. Proof of the monotone convergence theorem for sequences proof
  89. Limits preserve non-strict inequalities statement
  90. Convergent sequences are bounded statement
  91. Convergent sequences are Cauchy statement
  92. Cauchy sequences are bounded statement
  93. Monotone convergence theorem for sequences statement
  94. Proof that a series of nonnegative terms converges iff its partial sums are bounded proof
  95. Proof that a decreasing sequence bounded below converges proof
  96. Decreasing sequence bounded below converges statement
  97. A series of nonnegative terms converges iff its partial sums are bounded statement
  98. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  99. Bolzano–Weierstrass theorem statement
  100. Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem proof
  101. Cauchy criterion for sequences statement
  102. Proof of the Cauchy criterion for series proof
  103. Cauchy criterion for series statement
  104. Proof that absolutely convergent series converge proof
  105. Absolutely convergent series converge statement
  106. Proof that rearrangements of an absolutely convergent series have the same sum proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Absolute_convergence, Proof of the theorem
About this page
TagY7PDDFZZC3
URIm2://Y7PDDFZZC3
Kindproof
WritingW0 stub
MSC40A05
ProvesRearrangements of an absolutely convergent series have the same sum
UsesAbsolute convergence, Rearrangement of a series, A series of nonnegative terms converges iff its partial sums are bounded, Triangle inequality, Limit of a sequence, Absolutely convergent series converge
Changed4 November 2026

Markdown · JSON · Edit on GitHub

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

What links here

No page links to this page yet.