Chapter VIII · The convergence of infinite series and infinite integrals
Multiplying series of positive terms
Why two convergent positive series can be multiplied term by term, collecting the products along diagonals, to give the product of their sums.
Why this matters
To multiply two polynomials we multiply every term of one by every term of the other and collect the terms of equal degree. Power series are “polynomials of infinite degree”, and we will want to multiply them in the same way: for example, to see that from the exponential series in Chapter IX. §177 justifies this for series of positive terms. It is a direct application of Dirichlet’s theorem, and it is the model for the general case in §202.
The idea
Let and be convergent series of positive terms with sums and . The product ought to be “the sum of all the products ”. There are infinitely many of these products, arranged naturally in a square array: column , row . The question is in which order to add them up.
Two orders are natural.
- By squares. First ; then the three products with largest index ; then the five with largest index ; and so on. After groups we have added exactly the products with , whose sum is . This tends to , by the theorem on the limit of a product.
- By diagonals. First ; then ; then ; and so on. The -th group, , is what you get by collecting “terms of degree ” when multiplying power series. This is the order we actually want.
Try this. Step from to with the diagonals, then switch to squares and compare. Back on diagonals, turn on the trap and move again.
- products already added (darker = larger)
- the newest diagonal
What to notice
Adding by squares gives exactly the product of two partial sums. Adding by diagonals gives a triangle, and every triangle sits inside the square of the same and contains the square of about half the size. Both squares’ sums tend to , so the triangles are squeezed to as well. Positivity is what makes “contains” imply “has a larger sum”.
Precise statements
If and are convergent series of positive terms, with sums and , then the series
converges, and its sum is . The same is true with the brackets removed.
The series , with , is called today the Cauchy product of the two series. More generally, since the terms are positive, Dirichlet’s theorem gives: the products , taken in any order whatever, form a convergent series with sum .
Proofs
Hardy’s proof goes through the arrangement by squares and Dirichlet’s theorem.
Find one arrangement of the products whose sum is obviously : the arrangement by squares. Every other arrangement, in particular the one by diagonals, is a rearrangement of it, so Dirichlet’s theorem gives the same sum.
The groups of the square arrangement
The products whose largest index is exactly form an L-shaped group: . Their sum is the difference between the products of partial sums for and for :
The grouped series has sum
So the sum of the first groups telescopes to , where and are partial sums. Since and , we get .
Remove the brackets
Inside each group the terms are positive, so the partial sums of the series with brackets removed increase and are squeezed between consecutive values and . Hence the series of single products, in the square order, converges to (previous lesson, second exercise).
Rearrange
The diagonal order, with brackets removed, uses each product exactly once: it is a rearrangement of the square order. By Dirichlet’s theorem it converges to the same sum . Putting the brackets back (grouping consecutive terms) only picks out a subsequence of the partial sums, which has the same limit.
The widget suggests a second proof that avoids rearrangement altogether.
Squeeze the diagonal partial sums between two products of partial sums, both of which tend to .
Triangles between squares
Let , the sum of over the triangle . If then ; and if then . So the triangle contains the square of side and lies inside the square of side .
Positivity turns inclusion into inequality
All products are , so a larger set of products has a larger sum: .
Squeeze
Both bounds tend to as , so .
Both proofs use positivity in an essential way. For series with terms of both signs the diagonal sums need not converge at all, even when both factors converge (§202).
Worked examples and exercises
Let . Verify that
Hint
Solution
Both series contain every power exactly once: the first in the pattern “two even, one odd” (), the second in the pattern “one even, two odd”. So both are rearrangements of , a convergent series of positive terms with sum , and Dirichlet’s theorem gives the same sum. (When all terms but the first vanish and the claim is trivial.)
Use the theorem to show that for . Deduce .
Hint
Solution
Take , . The -th diagonal is , since there are pairs with . By the theorem . With this is .
Show that if one of , (both of positive terms) diverges, then so does the Cauchy product , unless every term of the other series is zero.
Hint
Solution
Suppose diverges and . The diagonal contains the product , so , because all other products are . The right-hand side tends to as , so the partial sums are unbounded and diverges. If instead every , every and the product converges to .
Let and (positive terms, starting at ) have sums and . Let , the sum over all pairs with product . Show that . Deduce that , where is the number of divisors of .
Hint
Solution
Each is a finite sum (there are only finitely many factorisations ), and every product appears in exactly one of them. Writing out the terms of in turn gives an arrangement of all the products , each once. By Dirichlet’s theorem and the theorem of this lesson, that series converges to ; grouping it into the blocks does not change the sum (positive terms). So .
With and , , and the number of pairs with is . So and .
State and prove the analogous result for three convergent series of positive terms with sums , , , collecting with .
Solution
Claim. gives .
Proof. First form the Cauchy product of and , so ; it converges to by the theorem, and its terms are positive. Now form the Cauchy product of and : its -th term is . By the theorem again it converges to .
Check yourself
If and are convergent series of positive terms, then the products may be added in any order whatever and always give .
True. One order (by squares) gives , and by Dirichlet’s theorem every order of a positive series gives the same sum.
In the Cauchy product of and (both starting at index ), what is ?
collects the products whose indices add to : the -th diagonal of the array, with terms. The third option is the sum of the whole square , which is plus the products below the diagonal.
The Cauchy product of with itself has terms . What is ? (Give a decimal.)
By the theorem it is . This is the case of , which Hardy proves in Ch. IX in exactly this way.
The theorem remains true, with the same proof, for any two convergent series.
False. Both proofs use positivity: Dirichlet’s theorem fails for conditionally convergent series, and “a larger set of products has a larger sum” fails when products can be negative. The Cauchy product of with itself diverges (§202).
Hardy’s language
Summary
- The products of two series form a square array; summing by squares gives .
- The Cauchy product sums the array by diagonals, as in multiplying polynomials.
- For convergent positive series it converges to : either by Dirichlet’s theorem, or because each triangle is trapped between two squares.
- If either factor diverges (and the other is not identically zero) the product diverges. For terms of both signs the theorem needs more care.