To prove ϕ(n)→l from the definition you must first know l. Often you do not. What is 1−21+31−41+⋯? What is ∑(sink)/k? The monotone-sequence theorem of §69 avoids the problem, but only for monotone sequences. §83 and §84 give a test that works for every sequence: it converges if and only if its terms eventually stay close to each other. This general principle of convergence, usually called Cauchy’s criterion, is the standard tool for proving that series converge in Chapter VIII, and it is the property that makes the real numbers “complete”.
The idea
If a sequence tends to l, its tail is crowded into a thin strip around l, so any two late terms are close to each other. Cauchy’s criterion says the converse holds as well: if any two late terms are close to each other, there is a number they all crowd around. The test looks only at differencesϕ(n2)−ϕ(n1), so no candidate limit is needed.
For a tail starting at n0, “every two terms differ by less than δ” means the same as “the largest and smallest terms of the tail differ by less than δ”: the tail fits into a strip of width less than δ, wherever that strip happens to be.
ExploreSqueeze the tail without knowing the limit
Try this.For the partial sums of 1−21+31−⋯, set δ=0.1 and move n0 until the strip turns green. Make δ smaller and repeat (use “Smallest n0”, and show more terms when needed). Then try the harmonic sums and (−1)n(1+1/n). Only at the end, reveal the limit.
sn=1−21+31−⋯+n(−1)n+1
nφ(n)
the tail’s spread, from n₀ = 5
its highest and lowest terms
terms (hollow: before n₀)
For 5≤n≤200 the terms lie between 0.616667 and 0.783333: spread 0.1667 ≥ δ=0.1. For instance ∣ϕ(6)−ϕ(5)∣=0.1667, which is not below δ. The smallest n0 that works here is 9.
What to notice
For the convergent sequences, every δ has an n0: the strip can be made as thin as you like by starting late enough, and the limit, when revealed, sits inside every strip. For the harmonic sums the spread of a tail never drops below about 1.38 (it grows with the number of terms checked), and for (−1)n(1+1/n) it never drops below 2. You decided convergence without ever being told the limit.
Precise statements
TheoremThe general principle of convergenceHardy: Theorem 1, §§83–84
A sequence ϕ(n) tends to a limit if and only if, for every δ>0, there is an n0(δ) such that
∣ϕ(n2)−ϕ(n1)∣<δfor all n2>n1≥n0(δ).
Hardy first proves this for bounded sequences (§83), then removes the word “bounded” (§84) by showing that the condition forces boundedness. Applied to the partial sums sn of a series, with sn2−sn1=un1+1+⋯+un2, it becomes a criterion for series.
CorollaryCauchy’s criterion for seriesHardy: Theorem 2, §84
The series u1+u2+⋯ converges if and only if, for every δ>0, there is an n0 such that
∣un1+1+un1+2+⋯+un2∣<δfor all n2>n1≥n0.
In words: a series converges exactly when every block of terms far enough out has a small sum, however long the block. Taking blocks of one term (n2=n1+1) recovers “un→0”, and the harmonic series fails the test with long blocks: n+11+⋯+2n1≥21.
Proofs
ProofThe condition is necessary
Strategy
If both terms are within 21δ of the limit, they are within δ of each other.
Use the definition with 21δ
If ϕ(n)→l, there is n0 with ∣ϕ(n)−l∣<21δ for all n≥n0.
Triangle inequality
For n2>n1≥n0: ∣ϕ(n2)−ϕ(n1)∣≤∣ϕ(n2)−l∣+∣l−ϕ(n1)∣<21δ+21δ=δ.
∎
The other direction is the substantial one. It needs a number to converge to, and that number has to come from somewhere: from the completeness of the real numbers, here in the form of the upper and lower limits.
ProofThe condition forces boundedness
Strategy
Fix one late term. Every later term is within 1 of it, and only finitely many terms come before it.
Take δ=1
The condition gives n0 with ∣ϕ(n2)−ϕ(n1)∣<1 for n2>n1≥n0.
Fix n1=n0
Then ϕ(n0)−1<ϕ(n)<ϕ(n0)+1 for every n>n0.
Add the finitely many early terms
The terms ϕ(1),…,ϕ(n0) have a largest and a smallest value. Together with the previous step, all terms lie between min(ϕ(1),…,ϕ(n0))−1 and max(ϕ(1),…,ϕ(n0))+1.
∎
ProofThe condition is sufficient
Strategy
The sequence is bounded, so it has an upper limit Λ and a lower limit λ, and it converges if and only if λ=Λ (§82). If λ<Λ, infinitely many terms are near Λ and infinitely many near λ, so arbitrarily late pairs of terms differ by nearly Λ−λ: the condition fails.
Suppose λ<Λ and choose a small δ
Take δ=41(Λ−λ)>0.
Late terms near both ends
By properties (3) and (4) of §82, infinitely many n have ϕ(n)>Λ−δ, and infinitely many have ϕ(n)<λ+δ. So beyond any n0 there are n1 and n2 (in either order) of each kind.
Their difference is large
For such a pair, ∣ϕ(n2)−ϕ(n1)∣>(Λ−δ)−(λ+δ)=Λ−λ−2δ=2δ>δ.
Contradiction, so λ=Λ
For this δ no n0 can work, contradicting the hypothesis. Hence λ=Λ, and by §82 (5) the sequence tends to their common value.
∎
The criterion for series is the theorem applied to ϕ(n)=sn.
Worked examples and exercises
ExerciseThe harmonic series fails Cauchy’s test●○○Hardy: §84
Use Cauchy’s criterion to prove again that ∑1/n does not converge.
Hint
Take n1=n and n2=2n.
Solution
The block n+11+⋯+2n1 has n terms, each at least 2n1, so its sum is at least 21. Take δ=21. Whatever n0 is proposed, n1=n0 and n2=2n0 give sn2−sn1≥21. So the condition fails, and the series does not converge (its terms are positive, so it diverges to +∞).
Show that 1−21+31−41+⋯ converges, using Cauchy’s criterion and without finding its sum.
Hint
A block ±(m1−m+11+m+21−⋯) of alternating decreasing terms lies between 0 and its first term. Group it in pairs to see this.
Solution
Let n2>n1 and m=n1+1. Up to sign, the block is B=m1−m+11+m+21−⋯±n21. Grouping in pairs from the start, (m1−m+11)+(m+21−m+31)+⋯, every bracket is positive (and a single last term is positive), so B>0. Grouping from the second term, m1−(m+11−m+21)−⋯, every bracket is positive and subtracted (a single last term −n21 is negative), so B≤m1. Hence ∣sn2−sn1∣≤n1+11.
Given δ>0, take n0>1/δ. Then for n2>n1≥n0, ∣sn2−sn1∣≤1/(n1+1)<δ. By Cauchy’s criterion the series converges. (Its sum is log2, proved in Chapter IX.)
ExerciseA tail bound for ∑1/k2●●○Hardy: §84
Using k21<k−11−k1 for k≥2, show that 0<sn2−sn1<1/n1 for the partial sums of ∑1/k2, and deduce convergence from Cauchy’s criterion.
Hint
Given δ, any n0>1/δ makes this less than δ for n2>n1≥n0. (Comparison with ∑1/(k(k−1)) would also do, but this proof needs nothing about positive series.)
ExerciseSmall steps are not enough●●○Hardy: §84
Give a sequence with ϕ(n+1)−ϕ(n)→0 that does not converge, and explain which part of Cauchy’s condition it fails.
Hint
Try n, or the harmonic partial sums.
Solution
ϕ(n)=n: ϕ(n+1)−ϕ(n)=n+1+n1→0, but n→+∞. Cauchy’s condition controls all pairs n2>n1≥n0, not only neighbours: here ϕ(4n)−ϕ(n)=n is large. Many small steps can add up to a long walk.
Since rn→0, given δ>0 there is n0 with Crn0/(1−r)<δ, and then the same holds for every n1≥n0. By Cauchy’s criterion ϕ(n) converges. This is how iterative methods such as Heron’s square-root rule are often proved to converge, without knowing the answer in advance.
Check yourself
Check yourselfChoose one
Which statement is Cauchy’s condition?
Why
The condition must control every pair of late terms, not just neighbours (options 1 and 2 only look at consecutive terms, and n satisfies the first from some point on without converging). The last option puts n0 before δ, which forces the sequence to be eventually constant.
Check yourselfTrue or false?
If ϕ(n+1)−ϕ(n)→0, then ϕ(n) converges.
Why
False. The partial sums of the harmonic series have steps 1/(n+1)→0 but diverge. The steps must be small in total over arbitrarily long stretches, which is what Cauchy’s condition demands.
Check yourselfEnter a number
For the partial sums of 1−21+31−⋯, the largest value of ∣sn2−sn1∣ over n2>n1 is 1/(n1+1). What is the smallest n0 that works in Cauchy’s condition for δ=0.01?
Why
We need 1/(n1+1)<0.01 for every n1≥n0, that is n1+1>100 for n1=n0: n0≥100. With n0=99 the pair n1=99, n2=100 gives exactly 1001, which is not less than 0.01.
Check yourselfChoose one
Where does the proof of sufficiency use a property of the real numbers that the rational numbers lack?
Why
Λ and λ are bounds of sets of numbers, and their existence comes from Dedekind’s theorem. In the rationals the decimal approximations 1,1.4,1.41,… of 2 satisfy Cauchy’s condition but have no rational limit. That is why “complete” is the modern name for exactly this property.
Hardy’s language
The theoretical importance of the ‘general principle of convergence’ can hardly be overestimated.
— G. H. Hardy, §84
Summary
Summary
Cauchy’s criterion: ϕ(n) converges if and only if for every δ>0 there is n0 with ∣ϕ(n2)−ϕ(n1)∣<δ for all n2>n1≥n0.
It needs no candidate limit: the tail must fit into some strip of width δ, wherever that strip is.
Necessity is the triangle inequality. Sufficiency uses boundedness and the upper and lower limits: if λ<Λ, late terms near each end are far apart.
For series: ∑un converges iff every far-out block un1+1+⋯+un2 has small sum. Small single steps are not enough.