Math 2.0

Sequences, series, summability Proof

Proof of Abel's theorem by summation by parts

Builds on Convergent seriesPower seriesOne-sided limitPartial sumConvergent sequences are boundedGeometric seriesThe sequence r^n tends to zero for |r| < 1Comparison testAbsolutely convergent series convergeLimit of a sum of sequencesLimit of a product of sequencesEpsilon-N definition of the limit of a sequenceTriangle inequality

Proof

We rewrite GG with the partial sums by summation by parts.

  1. Let sn=∑k=0naks_n = \sum_{k=0}^{n} a_k be the partial sums, and let s=lim⁡sns = \lim s_n, which exists by hypothesis. Put s−1=0s_{-1} = 0, so that an=sn−sn−1a_n = s_n - s_{n-1} for all n≥0n \ge 0.
  2. The sequence (sn)(s_n) converges, so it is bounded: there is KK with ∣sn∣≤K\abs{s_n} \le K for all nn. Then ∣an∣≤2K\abs{a_n} \le 2K by the triangle inequality.
  3. Fix xx with 0≤x<10 \le x < 1. Then ∣anxn∣≤2Kxn\abs{a_n x^n} \le 2K x^n and ∣snxn∣≤Kxn\abs{s_n x^n} \le K x^n. The geometric series ∑xn\sum x^n converges.
  4. By the comparison test, ∑anxn\sum a_n x^n and ∑snxn\sum s_n x^n converge absolutely. So both converge.
  5. For each NN, ∑n=0Nanxn=∑n=0Nsnxn−∑n=1Nsn−1xn=(1−x)∑n=0Nsnxn+sNxN+1.\sum_{n=0}^{N} a_n x^n = \sum_{n=0}^{N} s_n x^n - \sum_{n=1}^{N} s_{n-1} x^n = (1 - x) \sum_{n=0}^{N} s_n x^n + s_N x^{N+1}.
  6. We have ∣sNxN+1∣≤KxN+1\abs{s_N x^{N+1}} \le K x^{N+1}, and xN+1→0x^{N+1} \to 0. So sNxN+1→0s_N x^{N+1} \to 0.
  7. Let N→∞N \to \infty in step 5. The sum rule and the product rule for limits give G(x)=(1−x)∑n=0∞snxnG(x) = (1 - x) \sum_{n=0}^{\infty} s_n x^n.
  8. The geometric series gives (1−x)∑n=0∞xn=1(1 - x) \sum_{n=0}^{\infty} x^n = 1. So s=(1−x)∑n=0∞sxns = (1 - x) \sum_{n=0}^{\infty} s x^n.
  9. Subtract step 8 from step 7, using the limit rules on partial sums: G(x)−s=(1−x)∑n=0∞(sn−s)xnG(x) - s = (1 - x) \sum_{n=0}^{\infty} (s_n - s) x^n.
  10. Let ε>0\varepsilon > 0. By the epsilon-N form, there is NN with ∣sn−s∣<ε/2\abs{s_n - s} < \varepsilon / 2 for all n≥Nn \ge N. Let C=∑n=0N−1∣sn−s∣C = \sum_{n=0}^{N-1} \abs{s_n - s}.
  11. Split the series of step 9 into the terms with n<Nn < N and the tail with n≥Nn \ge N. Since xn≤1x^n \le 1, the first part has absolute value at most CC.
  12. The tail has terms of absolute value at most (ε/2)xn(\varepsilon/2) x^n. By the bound for absolutely convergent series and the comparison test, its absolute value is at most (ε/2)∑n≥Nxn(\varepsilon/2) \sum_{n \ge N} x^n.
  13. The geometric series gives (1−x)∑n≥Nxn=xN≤1(1 - x) \sum_{n \ge N} x^n = x^N \le 1. With steps 9, 11 and 12, ∣G(x)−s∣≤(1−x)C+ε/2\abs{G(x) - s} \le (1 - x) C + \varepsilon/2.
  14. Let δ=min⁡(1,ε/(2C+1))\delta = \min(1, \varepsilon / (2C + 1)). If 1−δ<x<11 - \delta < x < 1, then 0≤x<10 \le x < 1, and (1−x)C≤δC≤Cε/(2C+1)<ε/2(1 - x) C \le \delta C \le C \varepsilon / (2C + 1) < \varepsilon / 2.
  15. So ∣G(x)−s∣<ε\abs{G(x) - s} < \varepsilon for all xx with 1−δ<x<11 - \delta < x < 1. By the definition of the left limit, G(x)→s=∑n=0∞anG(x) \to s = \sum_{n=0}^{\infty} a_n as x→1x \to 1 from the left.

Idea

Summation by parts writes G(x)−sG(x) - s as (1−x)∑(sn−s)xn(1 - x) \sum (s_n - s) x^n. The factor 1−x1 - x kills the finitely many early terms as x→1x \to 1. The later terms have small coefficients sn−ss_n - s, and (1−x)∑xn≤1(1 - x) \sum x^n \le 1 keeps their total small.

Reading path

To understand this page from the ground up, read these 124 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, 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 of the sum of a finite geometric series, 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 of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, 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 of the comparison test, 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. Limit point of a set definition
  6. Mathematical induction concept
  7. Natural numbers object
  8. Ordered field definition
  9. Peano axioms concept
  10. Proposition concept
  11. Rational numbers object
  12. Real numbers object
  13. Sequence definition
  14. Set bounded above definition
  15. Set definition
  16. Ring of integers statement
  17. Limit of a function definition
  18. Successor function definition
  19. Conjunction definition
  20. Disjunction definition
  21. Implication definition
  22. Negation definition
  23. Predicate definition
  24. The reals form a field statement
  25. Real sequence definition
  26. Subsequence definition
  27. Infimum definition
  28. Supremum definition
  29. Ordered pair definition
  30. One-sided limit definition
  31. Addition of natural numbers definition
  32. Biconditional definition
  33. The rationals form a field statement
  34. The successor function is injective statement
  35. Truth table concept
  36. Zero is not a successor statement
  37. Modus ponens concept
  38. Universal quantifier definition
  39. Bounded sequence definition
  40. Cauchy sequence definition
  41. Geometric sequence definition
  42. Limit of a sequence definition
  43. Monotone sequence definition
  44. Series definition
  45. Completeness axiom statement
  46. Cartesian product definition
  47. Proof of the commutativity of addition by induction proof
  48. Order on the natural numbers definition
  49. Subset definition
  50. The rationals form an ordered field statement
  51. Propositional logic concept
  52. Mathematical proof concept
  53. Proof of the sum of a finite geometric series proof
  54. Convergent sequence definition
  55. Partial sum definition
  56. Power series definition
  57. Binary relation definition
  58. Order on the reals definition
  59. Commutativity of addition statement
  60. Proof of strong induction from ordinary induction proof
  61. Tautology definition
  62. Sum of a finite geometric series statement
  63. Convergent series definition
  64. Antisymmetric relation definition
  65. Reflexive relation definition
  66. Transitive relation definition
  67. Strong induction statement
  68. Logical equivalence definition
  69. Sum of a series definition
  70. Absolute convergence definition
  71. Preorder definition
  72. Proof of the well-ordering principle from strong induction proof
  73. Proof of the double negation law by a truth table proof
  74. Partial order definition
  75. Well-ordering principle statement
  76. Double negation law statement
  77. Total order definition
  78. Proof by contradiction concept
  79. Proof that every sequence has a monotone subsequence, by peaks proof
  80. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  81. Every sequence has a monotone subsequence statement
  82. The reals form an ordered field statement
  83. Absolute value definition
  84. Proof of the approximation property of the supremum proof
  85. Proof of the triangle inequality for real numbers proof
  86. Proof that the absolute value is multiplicative proof
  87. Proof of the epsilon-N definition of the limit of a sequence proof
  88. Approximation property of the supremum statement
  89. Triangle inequality statement
  90. Absolute value is multiplicative statement
  91. Epsilon-N definition of the limit of a sequence statement
  92. Proof of the limit of a sum of sequences proof
  93. Proof of the squeeze theorem for sequences proof
  94. Proof that limits preserve non-strict inequalities proof
  95. Proof that convergent sequences are bounded proof
  96. Proof that convergent sequences are Cauchy proof
  97. Proof that Cauchy sequences are bounded proof
  98. Proof of the monotone convergence theorem for sequences proof
  99. Limit of a sum of sequences statement
  100. Limits preserve non-strict inequalities statement
  101. Convergent sequences are bounded statement
  102. Squeeze theorem statement
  103. Convergent sequences are Cauchy statement
  104. Cauchy sequences are bounded statement
  105. Monotone convergence theorem for sequences statement
  106. Proof of the limit of a product of sequences proof
  107. Proof that a series of nonnegative terms converges iff its partial sums are bounded proof
  108. The sequence r^n tends to zero for |r| < 1 example
  109. Proof that a decreasing sequence bounded below converges proof
  110. Decreasing sequence bounded below converges statement
  111. Limit of a product of sequences statement
  112. A series of nonnegative terms converges iff its partial sums are bounded statement
  113. Geometric series example
  114. Proof of the comparison test proof
  115. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  116. Comparison test statement
  117. Bolzano–Weierstrass theorem statement
  118. Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem proof
  119. Cauchy criterion for sequences statement
  120. Proof of the Cauchy criterion for series proof
  121. Cauchy criterion for series statement
  122. Proof that absolutely convergent series converge proof
  123. Absolutely convergent series converge statement
  124. Proof of Abel's theorem by summation by parts proof

Where this leads

7 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Abel%27s_theorem, Outline of proof
About this page
Tag8Z4R1MEPAN
URIm2://8Z4R1MEPAN
Kindproof
WritingW0 stub
MSC40A30
ProvesAbel's theorem
UsesConvergent series, Power series, One-sided limit, Partial sum, Convergent sequences are bounded, Geometric series, The sequence r^n tends to zero for |r| < 1, Comparison test, Absolutely convergent series converge, Limit of a sum of sequences, Limit of a product of sequences, Epsilon-N definition of the limit of a sequence, Triangle inequality
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.