What could 1+21+41+81+⋯ mean? Nobody can add infinitely many numbers. In §76 Hardy gives the expression a meaning without any new machinery: an infinite series is a disguised sequence, the sequence of its partial sums, and its “sum” is that sequence’s limit. Everything proved about limits so far applies at once. The series that do not converge are just as instructive, and the most famous of them, 1+21+31+⋯, shows that terms which tend to 0 are not enough.
The idea
Start with any sequence of terms u1,u2,u3,… and form the running totals
Each sn is an ordinary finite sum. The question “what is u1+u2+u3+⋯?” becomes “does the sequence sn tend to a limit?”, which is exactly the question of the earlier lessons. Two different sequences are involved, and keeping them apart is half the battle: the termsun and the partial sumssn.
ExploreTerms against partial sums
Try this.Switch the plot between partial sums and terms for ∑1/n (blue) and ∑1/n2 (ochre). Then show 1000 terms.
∑n=1∞n1compared with∑n=1∞n21
nsₙ
sₙ for n1
sₙ for n21
the sum s
Plot
After 100 terms s100=5.187377518. The series diverges. The comparison series converges to 1.6449341.
What to notice
Both sequences of terms tend to 0 and look almost the same. The partial sums behave quite differently: those of ∑1/n2 level off below 1.65, while those of ∑1/n keep creeping upwards, by about 2.3 each time the number of terms is multiplied by ten. A picture cannot prove that they never level off; the argument below does.
The creeping upward of the harmonic sums is too slow to be convincing in a plot. Hardy’s argument makes it certain, by cutting the series into blocks that double in length.
ExploreWhy 1+21+31+⋯ diverges
Try this.Increase the number of blocks K for ∑1/n. Read the bound 1+K/2 in the read-out. Then switch to ∑1/n2 and do the same.
1+21+(31+41)+(51+⋯+81)+⋯
block kblock sum
sum of the terms in block k (alternate blocks shaded differently)
every block sum is at least ½
Series
Block k≥1 holds the 2k−1 terms with 2k−1<n≤2k. Blocks 0 to 6 hold the first 26=64 terms, and their sum is s64=4.74389. Each term of block k is at least 1/2k, so each block sums to at least ½ and s2K≥1+K/2=4. Adding blocks adds at least ½ every time: the sums pass every bound, although the terms tend to 0.
What to notice
For 1/n every block, however far out, sums to at least 21: the blocks get longer exactly as fast as their terms get smaller. So the partial sums pass every bound. For 1/n2 the terms shrink like the square of their position, block k sums to less than 1/2k−1, a bound that halves from block to block, and the total stays below 3.
Precise statements
DefinitionConvergent series, sumHardy: §76
Let u1,u2,… be numbers and sn=u1+u2+⋯+un. If sn→s as n→∞, the series u1+u2+⋯ is convergent, s is its sum, and we write
ν=1∑∞uν=soru1+u2+u3+⋯=s.
In terms of δ: for every δ>0 there is n0(δ) with s−δ<sn<s+δ for all n≥n0(δ).
If sn→+∞ or sn→−∞ the series diverges to +∞ or −∞; if sn oscillates, finitely or infinitely, so does the series.
Conversely every sequence is the sequence of partial sums of some series: take u1=ϕ(1) and un=ϕ(n)−ϕ(n−1) for n≥2. Series and sequences are two ways of describing the same thing.
§77 lists the general theorems. The first six are bookkeeping; each follows from the theorems on sums and multiples of limits applied to sn.
TheoremBookkeeping for seriesHardy: §77 (1)–(6)
Suppose ∑un converges to s and ∑vn converges to t.
(1) Putting finitely many terms a,b,…,k in front gives a convergent series with sum a+b+⋯+k+s.
(2) Deleting the first m terms gives a convergent series um+1+um+2+⋯ with sum s−u1−⋯−um.
(3) If any of the series in (1) or (2) diverges or oscillates, so do the others.
(4) ∑kun converges to ks; and (5) if ∑un diverges or oscillates, so does ∑kun, unless k=0.
(6) ∑(un+vn) converges to s+t.
The next theorems are of a different kind: each says something about the terms or about rearranging the brackets.
TheoremThe terms of a convergent series tend to zeroHardy: §77 (7)
If ∑un converges, then un→0. The converse is false: un=1/n tends to 0, but ∑1/n diverges to +∞.
TheoremBrackets may be insertedHardy: §77 (8)
If ∑un converges to s, then so does any series obtained by grouping consecutive terms in brackets and treating each bracket as one term. The converse is false: (1−1)+(1−1)+⋯=0+0+⋯ converges, but 1−1+1−1+⋯ oscillates.
TheoremSeries of positive termsHardy: §77 (9), (10)
If un≥0 for every n, then ∑un either converges or diverges to +∞: it cannot oscillate. It converges if and only if there is a number K with sn≤K for every n, and then its sum is at most K.
TheoremComparisonHardy: §77 (11)
Let un≥0 and vn≥0, and let un≤Kvn for every n, where K is a constant. If ∑vn converges, so does ∑un, and its sum is at most K times that of ∑vn. If ∑un diverges, so does ∑vn (when K>0).
Proofs
Proofun→0 when ∑un converges
Strategy
A single term is the difference of two consecutive partial sums. If both partial sums are close to s, their difference is close to 0.
un=sn−sn−1 for n≥2
The partial sum sn is sn−1 with un added on.
Both sn and sn−1 tend to s
The first by hypothesis; the second because sn−1 is the same sequence shifted by one place, and shifting changes no limit.
So un→s−s=0
By the theorem on the limit of a difference (§63).
∎
Proof1+21+31+⋯ diverges to +∞
Strategy
The terms are positive, so the partial sums increase; it is enough to show that they are not bounded. Group the terms in blocks whose lengths double, and bound each block below by its length times its smallest term.
Block k consists of the terms 1/n with 2k−1<n≤2k
For k=1,2,3,… this gives 21, then 31+41, then 51+⋯+81, and so on. Block k has 2k−1 terms.
Each block sums to at least 21
Every term of block k is at least 1/2k, its last term. So the block sum is at least 2k−1⋅2−k=21.
s2K≥1+K/2
The first 2K terms are the term 1 followed by blocks 1,…,K.
Conclude
Given any Δ, choose K>2Δ; then s2K>Δ, and since sn increases, sn>Δ for every n≥2K. That is the definition of sn→+∞.
∎
Hardy leaves the bracket theorem to the reader. The point is that bracketing only thins out the sequence of partial sums.
ProofBrackets may be inserted
Strategy
The partial sums of the bracketed series are some of the partial sums of the original one, taken in order. A sequence that tends to s still tends to s when we keep only some of its terms.
Describe the bracketed series
Let the brackets end after the terms un1,un2,…, where n1<n2<⋯. The j-th partial sum of the bracketed series is Sj=snj.
Use the n0 for the original series
Let δ>0, and choose n0 with ∣sn−s∣<δ for n≥n0. Since nj≥j, we have nj≥n0 whenever j≥n0, so ∣Sj−s∣<δ for all j≥n0.
Why the converse fails
The thinned-out sequence can converge when the full one does not: sn=1,0,1,0,… has the convergent subsequence s2,s4,⋯=0,0,….
∎
ProofSeries of positive terms, and comparison
Strategy
With un≥0 the partial sums form an increasing sequence, and §69 says that an increasing sequence either tends to a limit or tends to +∞, the first exactly when it is bounded.
The partial sums increase
sn+1=sn+un+1≥sn. By §69, sn either converges or tends to +∞; it cannot oscillate.
Bounded if and only if convergent
If sn≤K for all n, then sn cannot tend to +∞, so it converges, and its limit is at most K (a limit of numbers ≤K is ≤K). Conversely a convergent sequence is bounded.
Comparison
If un≤Kvn and ∑vn=t, then u1+⋯+un≤K(v1+⋯+vn)≤Kt, because the partial sums of ∑vn increase to t. So the partial sums of ∑un are bounded by Kt, and the previous step applies. If ∑un diverged while ∑vn converged, this would be a contradiction.
∎
Without positive terms, bounded partial sums prove nothing: the partial sums of 1−1+1−⋯ are 1,0,1,0,…, bounded by 1, and the series oscillates.
Worked examples and exercises
Exercise●○○Hardy: Examples XXX, 13
Show that 1+11+1⋅21+1⋅2⋅31+⋯ converges.
Hint
Compare 1/n! with a geometric quantity.
Hint
n!=1⋅2⋅3⋯n≥2n−1 for n≥1.
Solution
The terms are positive. For n≥1, each of the factors 2,3,…,n of n! is at least 2, so n!≥2n−1 and 1/n!≤1/2n−1. The series 1+21+41+⋯ converges (to 2; see the next lesson), so by comparison (§77 (11), with K=1) the series ∑n≥11/n! converges with sum at most 2, and adding the initial term 1 keeps it convergent (§77 (1)). Its sum is at most 3. (It is e=2.71828…; Chapter IX.)
Exercise●●○Hardy: Examples XXX, 15
Let a>0 and b>0. Show that a1+a+b1+a+2b1+⋯ diverges to +∞.
Hint
Compare with the harmonic series, but in the direction that proves divergence: you need a lower bound for each term.
Hint
For n≥1, a+nb≤n(a+b).
Solution
The general term is un=1/(a+nb) for n=0,1,2,…. For n≥1 we have a+nb≤na+nb=n(a+b), so
un≥a+b1⋅n1.
If ∑n≥1un converged, then by comparison (with K=a+b) so would ∑1/n, which diverges. So ∑n≥1un, a series of positive terms, diverges to +∞, and putting back the first term 1/a changes nothing (§77 (3)).
Show that (u0−u1)+(u1−u2)+(u2−u3)+⋯ converges if and only if un tends to a limit, and find its sum. Use this to sum ∑n≥1n(n+1)1.
Hint
Write out the n-th partial sum and watch the cancellation.
Solution
The n-th partial sum is (u0−u1)+⋯+(un−1−un)=u0−un. This tends to a limit if and only if un does, and if un→l the sum is u0−l.
Since n(n+1)1=n1−n+11, take un=1/(n+1) (so u0=1): the series is telescoping with sum 1−0=1.
Exercise●●○Hardy: Examples XXX, 17
Show that if ∑un diverges (to +∞ or −∞), then so does every series obtained from it by grouping terms in brackets. Does the same hold if “diverges” is replaced by “oscillates”?
Hint
As in the proof above, the partial sums of the bracketed series are a subsequence sn1,sn2,… of the original partial sums.
Solution
Let sn→+∞ and let the brackets close after un1,un2,… with n1<n2<⋯, so nj≥j. Given Δ, choose n0 with sn>Δ for n≥n0. For j≥n0, nj≥n0, so the bracketed partial sum Sj=snj>Δ. Hence Sj→+∞. The case −∞ is the same.
For oscillation the statement fails: 1−1+1−⋯ oscillates, and (1−1)+(1−1)+⋯ converges. A subsequence of an oscillating sequence may converge.
Exercise●○○Hardy: Examples XXX, 18
Show that any series formed by selecting some of the terms (in their original order) of a convergent series of positive terms is itself convergent.
Hint
Use the bounded-partial-sums criterion, §77 (10).
Solution
Let ∑un=s with un≥0. Every partial sum of the selected series is a sum of finitely many distinct terms um1+⋯+umj with mj the largest index, so it is at most smj≤s. The selected series has positive terms and partial sums bounded by s, so it converges, with sum at most s. (Positivity is essential: from 1−1+21−21+31−31+⋯, which converges to 0, select the positive terms and get the harmonic series.)
Check yourself
Check yourselfTrue or false?
If un→0, then ∑un converges.
Why
False. This is the converse of §77 (7), and the harmonic series refutes it. Terms tending to 0 are necessary for convergence, not sufficient. The useful form of the true theorem is the contrapositive: if un does not tend to 0, the series cannot converge.
Check yourselfChoose one
For the series 1+21+41+⋯, which sequence has to tend to 2 for us to write 1+21+41+⋯=2?
Why
The sum of a series is by definition the limit of its partial sums. The terms of a convergent series tend to 0, never to the sum (unless the sum happens to be 0 and that is a coincidence). There is no way to “add infinitely many numbers directly”: the limit is the definition.
Check yourselfTrue or false?
Since (1−1)+(1−1)+⋯=0, the series 1−1+1−1+⋯ has sum 0.
Why
False. Its partial sums are 1,0,1,0,…, which oscillate. Inserting brackets keeps only every second partial sum; that subsequence converges although the whole sequence does not. Brackets may be inserted in a convergent series, but not removed in general.
Check yourselfEnter a number
The block argument gives s2K≥1+K/2 for the harmonic series. What is the smallest K for which this bound guarantees s2K≥5?
Why
1+K/2≥5 means K≥8, so K=8: the first 28=256 terms sum to at least 5. (In fact s256≈6.12; the bound is crude, but it is enough to prove divergence. The smallest n with sn>5 is 83.)
Check yourselfChoose one
Which of these statements needs the hypothesis that every un≥0?
Why
Only the second. For positive terms the partial sums increase, and an increasing bounded sequence converges (§69). Without positivity, 1−1+1−⋯ has bounded partial sums but oscillates. The other three hold for all series, with any signs.
Hardy’s language
the consideration of such infinite series introduces no new ideas beyond those with which the early part of this chapter should already have made the reader familiar.
— G. H. Hardy, §76
Summary
Summary
A series ∑un converges to s when its partial sums sn=u1+⋯+un tend to s. Series are sequences in disguise: every limit theorem applies to sn.
If ∑un converges then un→0; the converse is false, as the harmonic series shows by its blocks of sum at least 21.
Brackets may be inserted in a convergent series without changing its sum, but not removed in general.
A series of terms ≥0 cannot oscillate: it converges exactly when its partial sums are bounded. This gives the comparison test.