Math 2.0

Sequences, series, summability Proof

Proof of Dirichlet's test by summation by parts

Builds on Monotone sequencePartial sumCauchy criterion for seriesEpsilon-N definition of the limit of a sequenceTriangle inequality

Proof

We use summation by parts and the Cauchy criterion.

  1. Let (an)n≥1(a_n)_{n \ge 1} be monotone with an→0a_n \to 0. Let (bn)n≥1(b_n)_{n \ge 1} be real with ∣Bn∣≤M\abs{B_n} \le M for all nn, where Bn=∑k=1nbkB_n = \sum_{k=1}^{n} b_k is the nn-th partial sum.
  2. Put B0=0B_0 = 0. Then bk=Bk−Bk−1b_k = B_k - B_{k-1} for all k≥1k \ge 1, and ∣Bk∣≤M\abs{B_k} \le M for all k≥0k \ge 0.
  3. Let n>m≥0n > m \ge 0. Then ∑k=m+1nakbk=∑k=m+1nakBk−∑k=m+1nakBk−1=∑k=m+1nakBk−∑k=mn−1ak+1Bk.\sum_{k=m+1}^{n} a_k b_k = \sum_{k=m+1}^{n} a_k B_k - \sum_{k=m+1}^{n} a_k B_{k-1} = \sum_{k=m+1}^{n} a_k B_k - \sum_{k=m}^{n-1} a_{k+1} B_k.
  4. Collecting the terms with the same BkB_k in step 3 gives the summation by parts formula ∑k=m+1nakbk=anBn−am+1Bm+∑k=m+1n−1(ak−ak+1)Bk.\sum_{k=m+1}^{n} a_k b_k = a_n B_n - a_{m+1} B_m + \sum_{k=m+1}^{n-1} (a_k - a_{k+1}) B_k.
  5. Since (an)(a_n) is monotone, the differences ak−ak+1a_k - a_{k+1} all have the same sign. So ∑k=m+1n−1∣ak−ak+1∣=∣∑k=m+1n−1(ak−ak+1)∣\sum_{k=m+1}^{n-1} \abs{a_k - a_{k+1}} = \abs{\sum_{k=m+1}^{n-1} (a_k - a_{k+1})}.
  6. The last sum telescopes to am+1−ana_{m+1} - a_n. So ∑k=m+1n−1∣ak−ak+1∣=∣am+1−an∣≤∣am+1∣+∣an∣\sum_{k=m+1}^{n-1} \abs{a_k - a_{k+1}} = \abs{a_{m+1} - a_n} \le \abs{a_{m+1}} + \abs{a_n}.
  7. By step 4, the triangle inequality, ∣Bk∣≤M\abs{B_k} \le M and step 6, ∣∑k=m+1nakbk∣≤M∣an∣+M∣am+1∣+M(∣am+1∣+∣an∣)=2M(∣an∣+∣am+1∣).\abs{\sum_{k=m+1}^{n} a_k b_k} \le M \abs{a_n} + M \abs{a_{m+1}} + M \left( \abs{a_{m+1}} + \abs{a_n} \right) = 2M \left( \abs{a_n} + \abs{a_{m+1}} \right).
  8. Let ε>0\varepsilon > 0. Since an→0a_n \to 0, the epsilon-N form of the limit gives N≥1N \ge 1 with ∣ak∣<ε/(4M+1)\abs{a_k} < \varepsilon / (4M + 1) for all k≥Nk \ge N.
  9. For n>m≥Nn > m \ge N, both nn and m+1m + 1 are at least NN. So step 7 gives ∣∑k=m+1nakbk∣≤4Mε/(4M+1)<ε\abs{\sum_{k=m+1}^{n} a_k b_k} \le 4M \varepsilon / (4M + 1) < \varepsilon.
  10. The Cauchy criterion is stated for series indexed from 00. Adding the term 00 at index 00 leaves the partial sums unchanged.
  11. By step 9 and the Cauchy criterion for series, the series ∑n=1∞anbn\sum_{n=1}^{\infty} a_n b_n converges.

Idea

Summation by parts moves the differences from bnb_n to ana_n. The partial sums BnB_n are bounded, and the differences ak−ak+1a_k - a_{k+1} have one sign, so their absolute values telescope. Every block of the series is then bounded by a multiple of a few terms ∣an∣\abs{a_n}, which tend to 00.

Reading path

To understand this page from the ground up, read these 82 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 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 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 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 of the monotone convergence theorem for sequences.

  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. Implication definition
  18. Predicate definition
  19. The reals form a field statement
  20. Real sequence definition
  21. Subsequence definition
  22. Infimum definition
  23. Supremum definition
  24. Ordered pair definition
  25. Addition of natural numbers definition
  26. Universal quantifier definition
  27. The successor function is injective statement
  28. Zero is not a successor statement
  29. The rationals form a field statement
  30. Bounded sequence definition
  31. Cauchy sequence definition
  32. Limit of a sequence definition
  33. Monotone sequence definition
  34. Series definition
  35. Completeness axiom statement
  36. Cartesian product definition
  37. Subset definition
  38. Proof of the commutativity of addition by induction proof
  39. Order on the natural numbers definition
  40. The rationals form an ordered field statement
  41. Convergent sequence definition
  42. Partial sum definition
  43. Binary relation definition
  44. Order on the reals definition
  45. Commutativity of addition statement
  46. Proof of strong induction from ordinary induction proof
  47. Convergent series definition
  48. Antisymmetric relation definition
  49. Reflexive relation definition
  50. Transitive relation definition
  51. Strong induction statement
  52. Preorder definition
  53. Proof of the well-ordering principle from strong induction proof
  54. Partial order definition
  55. Well-ordering principle statement
  56. Total order definition
  57. Proof that every sequence has a monotone subsequence, by peaks proof
  58. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  59. Every sequence has a monotone subsequence statement
  60. The reals form an ordered field statement
  61. Absolute value definition
  62. Proof of the approximation property of the supremum proof
  63. Proof of the triangle inequality for real numbers proof
  64. Proof of the epsilon-N definition of the limit of a sequence proof
  65. Approximation property of the supremum statement
  66. Triangle inequality statement
  67. Epsilon-N definition of the limit of a sequence statement
  68. Proof that convergent sequences are Cauchy proof
  69. Proof that Cauchy sequences are bounded proof
  70. Proof of the monotone convergence theorem for sequences proof
  71. Convergent sequences are Cauchy statement
  72. Cauchy sequences are bounded statement
  73. Monotone convergence theorem for sequences statement
  74. Proof that a decreasing sequence bounded below converges proof
  75. Decreasing sequence bounded below converges statement
  76. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  77. Bolzano–Weierstrass theorem statement
  78. Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem proof
  79. Cauchy criterion for sequences statement
  80. Proof of the Cauchy criterion for series proof
  81. Cauchy criterion for series statement
  82. Proof of Dirichlet's test by summation by parts proof

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Dirichlet%27s_test, Proof
About this page
TagFJDKHV76P4
URIm2://FJDKHV76P4
Kindproof
WritingW0 stub
MSC40A05
ProvesDirichlet's test
UsesMonotone sequence, Partial sum, Cauchy criterion for series, 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.