Two absolutely convergent series may be multiplied term by term and collected along diagonals, as polynomials are; for conditionally convergent series this can fail.
To multiply two polynomials, multiply every term of one by every term of the other and collect equal powers. Power series are “infinite polynomials”, and we would like to multiply them the same way: that is how Hardy proves the binomial theorem for negative exponents and how, in Chapter IX, the exponential series is shown to satisfy exey=ex+y. §177 justified this for series of positive terms. §202 extends it to all absolutely convergent series, and an example shows that the word “absolutely” cannot be dropped.
The idea
Write all the products umvn in a square array, with m numbering the columns and n the rows (as in Hardy’s diagram). The product (∑um)(∑vn) is, in some sense, the sum of the whole array, but an infinite array has no built-in order. Two orders are natural.
By squares. The products with m,n≤k fill a square, and their total is (u0+⋯+uk)(v0+⋯+vk)=sktk. This always tends to st, the product of the two sums.
By diagonals. The products with m+n=k are exactly the terms that contribute to zk when the series are power series. Their total is
wk=u0vk+u1vk−1+⋯+ukv0,
and ∑wk is the Cauchy product of the two series.
The question is whether the two orders give the same answer. For absolutely convergent series the array behaves like a series of positive terms, and order is irrelevant.
ExploreAdding up the array in two orders
Try this.For each pair of series, switch between “diagonals” and “squares” and step k from 0 to 7. Then look at the plot: the filled dots are partial sums of the Cauchy product, the hollow dots the products sktk. Finish with the last pair, ∑(−1)n/n+1 squared.
um=2−m,vn=3−n
ksums
w₀ + … + wₖ (diagonals: the Cauchy product)
sₖ tₖ (squares: product of partial sums)
st, the product of the sums
Group the products by
The diagonal m+n=3 sums to w3=0.30093, and w0+⋯+w3=2.662. After 40 diagonals the Cauchy product has reached 3; the product of the sums is 2×23=3≈3. Both series are absolutely convergent, so every way of adding up the array gives st.
What to notice
For the first three pairs (absolutely convergent) both kinds of dots close in on the dashed line st. For the alternating harmonic series squared the Cauchy product still converges, slowly. For ∑(−1)n/n+1 the cells on each diagonal all have the same sign, the diagonal sums wk never shrink, and the filled dots swing up and down for ever, although the hollow dots still converge.
Precise statements
TheoremMultiplication of absolutely convergent seriesHardy: §202
If ∑un and ∑vn are absolutely convergent, with sums s and t, then their Cauchy product ∑wn, where wn=u0vn+u1vn−1+⋯+unv0, is absolutely convergent and its sum is st.
CorollaryMultiplying power seriesHardy: Examples LXXXI, 1
If ∣z∣ is less than the radius of convergence of both ∑anzn and ∑bnzn, then
The corollary is the theorem with un=anzn and vn=bnzn, which are absolutely convergent inside both circles of convergence (§200); then wn=cnzn.
Proofs
ProofMultiplication of absolutely convergent series
Strategy
Treat the whole array umvn as one series. It is absolutely convergent, so (§192) its sum does not depend on the order. Taken by squares it gives st; taken by diagonals it gives the Cauchy product.
The array of moduli has a finite total
Let σ=∑∣un∣ and τ=∑∣vn∣. Any finite collection of products ∣umvn∣ lies inside some square m,n≤K, whose total is (∣u0∣+⋯+∣uK∣)(∣v0∣+⋯+∣vK∣)≤στ.
So any arrangement of the array is absolutely convergent
Arrange all the products umvn in any order as a single series. By the previous step its series of moduli has bounded partial sums, so it converges: the series is absolutely convergent, and by §192 all arrangements have the same sum S.
Taken by squares, the sum is st
Arrange the products square by square (first m,n≤0, then the new products with max(m,n)=1, and so on). The partial sums at the end of the k-th square are sktk→st. A subsequence of the partial sums of a convergent series has the same limit, so S=st.
Taken by diagonals, the sum is the Cauchy product
Arrange the products diagonal by diagonal. The partial sums at the end of the diagonals are w0+⋯+wk, a subsequence of the partial sums of a series with sum S. So ∑wk converges to S=st.
Absolutely
∣wk∣≤∣u0∣∣vk∣+⋯+∣uk∣∣v0∣, and the right-hand sides are the diagonal sums of the array of moduli, whose series converges to στ. By comparison ∑∣wk∣ converges.
∎
The proof is Hardy’s for positive series (§177), with Dirichlet’s theorem for absolutely convergent series (§192) in place of the positive one. Its weak point is visible: everything rests on the array having a finite total of moduli. For ∑(−1)n/n+1 the array of moduli 1/(m+1)(n+1) has an infinite total, and the diagonals and the squares then part company, as the last exercise shows.
Worked examples and exercises
ExerciseSquaring the geometric series●○○Hardy: Examples LXXXI, 3–4
Show that (1−z)−2=1+2z+3z2+⋯ and (1−z)−3=1+3z+6z2+⋯ for ∣z∣<1, the coefficient of zn in the second being 21(n+1)(n+2).
Hint
Multiply ∑zn by itself, then multiply the result by ∑zn again.
Solution
∑zn is absolutely convergent for ∣z∣<1 with sum 1/(1−z). Squaring by the corollary, cn=∑k=0n1⋅1=n+1, so (1−z)−2=∑(n+1)zn, again absolutely convergent for ∣z∣<1 (ratio test). Multiplying this by ∑zn: the coefficient of zn is ∑k=0n(k+1)=21(n+1)(n+2), so (1−z)−3=1+3z+6z2+10z3+⋯.
ExerciseDividing by 1−z●○○Hardy: Examples LXXXI, 2
If f(z)=∑anzn for ∣z∣<R, show that for ∣z∣<min(R,1)
1−zf(z)=∑snzn,sn=a0+a1+⋯+an.Solution
For such z both ∑anzn and ∑zn are absolutely convergent. Their Cauchy product has cn=a0⋅1+a1⋅1+⋯+an⋅1=sn, and its sum is f(z)⋅1−z1.
ExerciseNegative integral exponents●●○Hardy: Examples LXXXI, 5
Prove that for ∣z∣<1 and every positive integer m,
You will need ∑k=0n(km+k−1)=(nm+n). Prove it by induction on n, using Pascal’s rule.
Solution
For m=1 this is the geometric series. Suppose it holds for m. By the previous exercise with f(z)=(1−z)−m (radius 1),
(1−z)m+11=n∑snzn,sn=k=0∑n(km+k−1).
The identity sn=(nm+n) holds for n=0 (both are 1), and if it holds for n−1 then sn=(n−1m+n−1)+(nm+n−1)=(nm+n) by Pascal’s rule. Since (n(m+1)+n−1)=(nm+n), this is the formula for m+1.
ExerciseThe addition theorem for the exponential series●●○Hardy: Examples LXXXI, 7
Let f(z)=∑n≥0zn/n!. Show that f(z)f(z′)=f(z+z′) for all complex z,z′.
Hint
Both series are absolutely convergent everywhere. Compute the diagonal sum wn and recognise the binomial theorem.
Solution
The series converges absolutely for every z (§198), so the theorem applies:
So f(z)f(z′)=∑(z+z′)n/n!=f(z+z′). This is the key property of ez, used in Chapter IX; the second pair in the figure (with z=z′=1) is e⋅e=e2.
ExerciseFailure of the multiplication theorem●●●Hardy: Examples LXXXI, 9
Let un=vn=(−1)n/n+1. Both series converge (alternating series test). Show that their Cauchy product does not converge.
Hint
Write wn as (−1)n times a sum of n+1 positive terms.
Hint
By the AM–GM inequality, (r+1)(n+1−r)≤21(n+2).
Solution
urvn−r=(−1)r(−1)n−r/(r+1)(n−r+1)=(−1)n/(r+1)(n+1−r), so
wn=(−1)nr=0∑n(r+1)(n+1−r)1.
The two factors under the root add up to n+2, so their geometric mean is at most 21(n+2), and each of the n+1 terms is at least 2/(n+2). Hence ∣wn∣≥2(n+1)/(n+2)≥1 for all n, the terms do not tend to 0, and ∑wn cannot converge. (In fact ∣wn∣→π, as the figure suggests: the sum is a Riemann sum for ∫01dx/x(1−x)=π.)
Check yourself
Check yourselfEnter a number
What is the coefficient of z3 in (1+z+z2+⋯)2?
Why
c3=a0b3+a1b2+a2b1+a3b0=4: one product for each cell on the diagonal m+n=3. In general cn=n+1.
Check yourselfTrue or false?
If ∑un and ∑vn both converge, then their Cauchy product converges.
Why
False: ∑(−1)n/n+1 multiplied by itself gives terms of modulus at least 1. The theorem needs absolute convergence (Mertens later showed that absolute convergence of one of the two series is enough).
Check yourselfChoose one
For any two convergent series with sums s and t, which of these sequences always tends to st?
Why
sktk is a product of two convergent sequences, so it tends to st with no further conditions. The diagonal partial sums are a different selection of products, and for conditionally convergent series they may fail to converge at all.
Hardy’s language
Summary
Summary
The Cauchy product of ∑un and ∑vn is ∑wk with wk=u0vk+⋯+ukv0: the products along the diagonal m+n=k of the array.
If both series are absolutely convergent, the Cauchy product is absolutely convergent with sum st.
Proof: the array has a finite total of moduli, so its sum does not depend on the order, and the square order gives sktk→st.
Power series may be multiplied like polynomials inside both circles of convergence; for instance (1−z)−m=∑(nm+n−1)zn and ezez′=ez+z′.
Without absolute convergence it can fail: (∑(−1)n/n+1)2 has a divergent Cauchy product.