Series

Geometric series — the series

8 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. A square cut into 7 pieces and a remainder. A square divided by cutting off a fixed fraction of what is left, over and over, so that the pieces are the terms of a geometric series and the uncut corner is the tail.

    The sum that fits in one square

    Half, then a quarter, then an eighth, forever. Adding infinitely many things sounds like it should give infinity, and the picture that says otherwise is a square with a corner left uncut.

    part 1 · analysis
  2. n / 2ⁿ held under a geometric series. A bar for each term of the series n / 2ⁿ with a decaying geometric curve above them, the curve lying above every bar from term 2 onwards.

    The series everything else is measured against

    A geometric series is not one series among many. It is the yardstick: a total exists if its terms eventually fit under one, so a single comparison settles infinitely many questions — and the test built from it says nothing at all in exactly the place where the interesting cases are.

    part 2 · analysis
  3. Runs of doubling length in 1/n^2, and the geometric series that bounds them. A bar for the total of each run of terms of 1/n to the 2, with an outlined bar above it for the bound obtained by replacing every term in the run with its largest, the bounds forming a geometric series.

    The repair at the boundary

    Where the geometric yardstick says nothing, compare a series with itself at doubled spacing. That one move turns every 1/n^p back into a geometric series, reads the threshold off at p = 1, and then produces an infinite hierarchy of boundaries with no slowest divergent series anywhere in it.

    part 3 · analysis
  4. Powers of a matrix that shrink in the end. Three curves of the norm of the n-th power of a two-by-two matrix against n on a logarithmic axis: one decays steadily, two rise to peaks of about 18 and 7 before decaying.

    A geometric series whose ratio is a matrix

    1 + r + r² + … adds to 1/(1 − r) when r is smaller than one. Put a matrix in place of r and the same formula holds, with the inverse matrix in place of the fraction — but what must be smaller than one is not the matrix's size. It is its largest eigenvalue. A matrix whose eigenvalues are 0.9 and 0.8 can stretch vectors ten times over before its powers begin to shrink, and the series still converges, after a detour the eigenvalues say nothing about.

    part 4 · analysis
  5. 1 + 2 + 4 + … in two notions of size. Two sets of points against the number of terms up to 20 on an axis whose gridlines are powers of 2: the partial sums' ordinary size rising, their 2-adic distance from −1 falling.

    A series that converges to minus one

    1 + 2 + 4 + 8 + … runs off to infinity, and yet the formula for a geometric series says it should equal 1/(1 − 2) = −1. Measure size by how many factors of 2 a number has, instead of how large it is, and powers of 2 become small: the series converges, and to exactly −1. The same change of ruler explains why every repeating decimal is a fraction, and why repeating binary digits running off to the left are fractions too.

    part 5 · analysis
  6. The sum of all factorials in base 5: digits that stop changing. Partial sums of n! for N = 0 to 21, last 14 base-5 digits; the 5-adic limit ends …13010230042224.

    A sum of factorials that converges at every prime

    1 + 1 + 2 + 6 + 24 + 120 + … grows faster than any geometric series and has no sum in the real numbers. Measure size by divisibility instead and the same series converges at every prime at once, to a different number each time. Whether any of those numbers ends in zero is a question Đuro Kurepa asked in 1971, and a search through every prime below 100,000 says no while a coin-toss model says it should have said yes about twice.

    part 6 · analysis
  7. Forty terms, two digits or thirteen. Errors after 40 terms: series -6.249e-3, Aitken -1.053e-6, Euler -1.250e-13; Wynn after 17 terms 1.250e-13.

    Turning a slow series geometric

    Leibniz's series 1 − 1/3 + 1/5 − 1/7 + … adds up to π/4, and it takes five billion terms to give ten decimal places. Euler found a rule that rewrites it, using exactly the same terms, as a series whose terms halve at every step — and forty of those give thirteen places. Aitken's and Shanks's later rules do better still. None of them works on every slow series, and the reason is that each one is a guess about the shape of the error.

    part 7 · analysis
  8. Three series for Catalan's constant and how fast they arrive. Log10 errors after 1 to 60 terms: plain series -4.46, Euler transform -18.53, Ramanujan series -39.46.

    The sum after Leibniz's, made geometric

    Leibniz's series adds the reciprocals of the odd numbers with alternating signs and gives π/4. Square the odd numbers and the same pattern gives Catalan's constant, 0.915965…, about which almost nothing is known — not even whether it is a fraction. A formula of Ramanujan's turns its slow series into one whose terms shrink by a factor of four, which makes a thousand decimals cheap, and the decimals and continued fraction then say exactly how much digits can settle and where they stop.

    part 8 · analysis

All series