Chapter IV · §§50–89

Limits of functions of a positive integral variable

The heart of the course: what it means for a sequence to tend to a limit, to diverge or to oscillate; the algebra of limits; monotone sequences; infinite series; upper and lower limits; Cauchy's principle of convergence; and the order notations O, o and ~.

What you will be able to do

  • state the definition of a limit precisely and use it to prove that particular sequences converge
  • classify the behaviour of a sequence: convergent, divergent to plus or minus infinity, or oscillating
  • use the theorem on bounded monotone sequences and Cauchy's principle
  • handle simple infinite series, especially the geometric series
  • find the bounds and the upper and lower limits of a sequence, work with complex sequences such as zⁿ, and compare rates of growth with O, o and ~

Start with “Functions of a positive integral variable” →

Why this chapter is the turning point

Chapters I–III set up the numbers. Chapter IV is where analysis begins: it gives the first precise meaning to “tends to”, and every later chapter (continuity, derivatives, integrals, series, the exponential function) is built from the tools made here. It is also where most readers of Hardy first slow down. The definitions are short, but they contain two quantifiers in a fixed order (“for every δ\delta there is an n0n_0”), and getting comfortable with them takes practice. That practice is what the interactive figures in these lessons are for.

Hardy calls a sequence “a function of the positive integral variable nn” and writes it ϕ(n)\phi(n). We keep his notation in the formulas, so that you can read the book alongside, and translate it into modern language as we go (see the notation guide).

The chapter in six stages

  1. Setting the scene (§§50–52). What a function of nn is (a sequence, whose graph is a row of dots), why a function of nn extends to functions of xx in infinitely many ways (interpolation), and what “finite” and “infinite” mean. These three short lessons are light reading; the last one is needed for everything after it.
  2. Large nn and the definition of a limit (§§53–62). A property holds “for large nn” when it fails only finitely often, which is not the same as holding infinitely often. From this come the definitions of ϕ(n)→l\phi(n) \to l and ϕ(n)→±∞\phi(n) \to \pm\infty, and the classification of everything else as oscillation, finite or infinite. This is the core of the chapter: start with “For large values of n” and The definition of a limit.
  3. Working with limits (§§63–75). The algebra of limits (sums, products, quotients, rational functions of nn); monotone sequences and why a bounded increasing sequence must converge, even when its limit cannot be guessed; Weierstrass’s theorem by bisection; and the key examples xnx^n, (1+1/n)n→e(1 + 1/n)^n \to e, the inequalities for powers, and n(xn−1)n(\sqrt[n]{x} - 1), a first glimpse of the logarithm.
  4. Infinite series (§§76–79). A series as the sequence of its partial sums; the geometric series; functions of xx defined as limits, such as lim⁡xn/(1+xn)\lim x^n/(1 + x^n), which can jump even though every ϕn\phi_n is smooth.
  5. The finer theory (§§80–84). Upper and lower bounds of sets and sequences; the upper and lower limits lim sup⁡\limsup and lim inf⁡\liminf, which exist for every bounded sequence; and Cauchy’s general principle of convergence, which decides convergence from the terms alone.
  6. Complex sequences and orders of magnitude (§§85–89). Limits of complex sequences, the powers znz^n and the complex geometric series; and the symbols OO, oo and ∼\sim for comparing how fast sequences grow.

The chapter ends with a set of problems chosen from Hardy’s Miscellaneous Examples.

How to work through it

  • Stage 2 is the core. Do not move on until you can write the definition of a limit from memory, prove 1/n→01/n \to 0 directly from it, and show that (−1)n(-1)^n “does not tend to anything”.
  • Every proof in stage 3 is the same kind of argument as the proofs in stage 2. When one seems hard, ask: given δ\delta, how would I choose n0n_0? The two new ideas there are splitting the tolerance (12δ\tfrac12\delta for each of two terms) and the monotone theorem, which proves that a limit exists without naming it.
  • Stage 5 is printed partly in Hardy’s small type, but lim sup⁡\limsup, lim inf⁡\liminf and Cauchy’s principle are used constantly from Chapter VIII onwards, so do not skip them.
  • The Miscellaneous Examples at the end of the chapter are hard. Attempt a few after each stage rather than all at the end.

Lessons

24 pages · about 835 minutes of reading, plus time with the book.

  1. §50 Functions of a positive integral variable ✓ done A sequence is a function whose field of definition is the positive integers, and its graph is a row of dots.
  2. §51 Interpolation ✓ done Finding a formula in x that agrees with a given function of n is always possible and never unique; what is wanted is a natural one.
  3. §52 Finite and infinite classes ✓ done An infinite class is simply one that is not finite; for sets of positive integers this means having no largest member.
  4. §§53–57 “For large values of n” ✓ done What it means for a property to hold for all sufficiently large n, how this differs from holding for infinitely many n, and how it gives meaning to “n tends to infinity”.
  5. §§58–61 The definition of a limit ✓ done What it means, exactly, for ϕ(n)\phi(n) to tend to ll or to +∞+\infty, and the small print that the definition hides.
  6. §62 Oscillating sequences ✓ done A sequence that neither tends to a limit nor to plus or minus infinity oscillates, finitely if it is bounded and infinitely if not.
  7. §§63–68 Limits of sums, products and quotients ✓ done If φ(n) → a and ψ(n) → b then φ + ψ → a + b, φψ → ab and φ/ψ → a/b (when b ≠ 0); with these rules the limit of any rational function of n can be read off.
  8. §§69–70 Monotone sequences ✓ done An increasing sequence either tends to a limit or to plus infinity, and it tends to a limit exactly when it is bounded above; this proves convergence without knowing the limit.
  9. §71 Weierstrass’s theorem by bisection ✓ done A second proof that every bounded infinite set has a point of accumulation, in which the nested intervals of repeated bisection give two monotone sequences with a common limit.
  10. §72 The limit of xnx^n ✓ done How xⁿ behaves for every real x, proved with monotone sequences, and the ratio arguments that grow out of it.
  11. §73 The limit of (1+1/n)n(1 + 1/n)^n ✓ done The sequence (1 + 1/n)ⁿ increases and stays below 3, so it has a limit; that limit is the number e.
  12. §74 Some inequalities for powers ✓ done Hardy's algebraical lemmas, which all say that (αʳ − 1)/r increases with r, and their consequence that a chord of t ↦ tʳ lies between the tangents at its ends.
  13. §75 The limit of n(xn−1)n(\sqrt[n]{x} - 1) ✓ done For every x > 0 the sequence n(x^(1/n) − 1) converges; its limit f(x) satisfies f(xy) = f(x) + f(y), and will turn out to be log x.
  14. §§76–77 Infinite series ✓ done An infinite series is nothing but the sequence of its partial sums; the general theorems that follow, and why terms tending to zero is not enough.
  15. §78 The geometric series ✓ done The one series whose partial sums we can write down exactly, its complete classification, and what it says about recurring decimals.
  16. §79 Functions defined by limits ✓ done When the terms depend on a second variable xx, the limit is a function of xx, and smooth functions can have a broken limit.
  17. §80 The bounds of a bounded set ✓ done Every set of real numbers that is bounded above has a least upper bound, and Dedekind’s theorem is what guarantees it.
  18. §81 The bounds of a sequence ✓ done The upper and lower bounds of a bounded sequence, their working form with δ\delta, and why an increasing bounded sequence tends to its upper bound.
  19. §82 Upper and lower limits ✓ done Hardy’s “limits of indetermination” lim⁡‾ ϕ(n)\overline{\lim}\,\phi(n) and lim⁡‾ ϕ(n)\underline{\lim}\,\phi(n), which every bounded sequence has, and which coincide exactly when it converges.
  20. §§83–84 The general principle of convergence ✓ done Cauchy’s criterion decides whether a sequence converges by comparing its terms with each other, without knowing the limit in advance.
  21. §§85–86 Limits of complex sequences and series ✓ done A complex sequence converges when its real and imaginary parts do, or equivalently when its distance from the limit tends to zero; all the real theorems carry over.
  22. §§87–88 Powers of zz and the complex geometric series ✓ done The powers znz^n spiral into 00 exactly when ∣z∣<1|z| < 1, the geometric series 1+z+z2+⋯1 + z + z^2 + \cdots converges exactly then, and its real and imaginary parts sum two trigonometric series.
  23. §89 The symbols OO, oo and ∼\sim ✓ done A compact language for comparing how fast two sequences grow or shrink, its rules, and its one-way equals sign.
  24. Problems Chapter IV problems ✓ done Eleven of Hardy’s Miscellaneous Examples on Chapter IV, with graded hints and full solutions.