Doing infinitely many things — page 1
The oldest algorithm, drawn as a tiling
Euclid's method for finding a greatest common divisor is usually presented as a loop. It is also a way of tiling a rectangle with squares, and the tiling explains why it works.
Adding up rectangles until they stop being rectangles
The integral is defined as a limit of sums of rectangles. The definition is exact, the picture is honest about what it costs, and the gap between them is the whole subject.
A square wave built entirely out of round ones
Add enough sine waves together and flat tops and vertical cliffs appear from nothing. Almost — there is a 9% overshoot that never goes away, and it is not a bug.
The curve that is its own slope
There is exactly one shape of exponential curve whose steepness at every point equals its height at that point. The number that produces it is 2.71828…, and it was not chosen for elegance.
A circle unrolled into a triangle
Take a disc apart into rings, straighten each one, and stack them. The result is a triangle whose base is the circumference and whose height is the radius — and its area is the disc's.
A sum whose terms vanish and whose total does not
Add a half, a third, a quarter, and keep going. The terms shrink to nothing and the total passes every number there is — but so slowly that no computation will ever watch it happen.
One point's worth of information
A Taylor series claims that everything a function does, everywhere, is encoded in its behaviour at a single point. That claim is extraordinary, it is often true, and the cases where it fails are the interesting ones.
The slope of a single point
A slope needs two points. A derivative is the slope at one. The construction that bridges the gap is a sequence of secants, and the whole difficulty of calculus is in what "the limit of that sequence" is allowed to mean.
The same terms, in a different order, adding to whatever is asked
Flip alternate signs in the harmonic series and it converges. Reorder the terms — add nothing, remove nothing — and it converges to any number chosen in advance. Addition stops being commutative, and the picture shows where it goes.
A walk that always comes home, until it does not
Step left or right at random, forever, and the walk returns to where it started with certainty. On a grid it also returns. In space it does not, and about a third of walks leave and never come back.
There is no last prime
Euclid's argument is often described as producing a new prime from any finite list. It does not, and the number it builds is frequently composite — which makes the proof more interesting rather than less.
A fraction that never closes
Euclid's algorithm throws away everything except the number of squares it peeled at each step. Those counts are a second name for the number it started from — one that terminates exactly when the ratio is a ratio.
How close a fraction can get
Drop eight points into seven boxes and two of them share. That one line, applied to the multiples of an irrational number, proves that every irrational has infinitely many astonishingly good rational approximations — and no construction is needed anywhere.
The square that cannot shrink
The usual proof that the square root of two is irrational is about even and odd numbers. There is a proof about squares instead, in which a supposed solution is folded into a smaller one — and the folding is a drawing.
An infinite tree has an infinite path
A tree that goes on forever, in which every node has only finitely many children, must contain a single branch that goes on forever. The proof is a rule for walking, and the rule is the whole of why finite information can decide an infinite question.
The row that is not on the list
Write down a list of infinite sequences, any list at all, and there is a rule that builds a sequence missing from it. The rule reads one entry from each row, and it is the single most reused argument in this field.
Two injections make a bijection
If each of two collections fits inside the other without collisions, they are the same size. That sounds obvious and is not, because neither injection needs to be onto — and the proof is a rule for deciding which of the two to follow, one chain at a time.
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.
A curve with a corner at every point
Continuity means a curve can be drawn without lifting the pen. Differentiability means it has a tangent. The first was assumed to nearly imply the second until 1872, when Weierstrass exhibited a curve that is continuous everywhere and has a tangent nowhere — and it is a sum of cosines.
Almost none of it left, and still uncountably many
Remove the middle third of an interval, then the middle third of each piece left, and keep going. The lengths removed add to exactly the whole interval, so nothing measurable survives — and what survives can be paired off one for one with every point of the interval that was started with.
When the period grows without bound
A repeating signal has a spectrum of separate lines. Stretch the gap between repeats and the lines crowd together while the curve they sit on stays exactly where it is — and at infinite period the lines are gone and the curve is the whole answer.
The walk that becomes a curve
Shrink the steps of a random walk and it disappears. Shrink them while stretching the time in the right proportion — space by the square root of whatever time is divided by — and something is left behind, which is a curve nobody could draw.
The same loop, unrolled
Spread a circle out into a line spiralling above it, and a loop that closes downstairs becomes a path that does not — so a question about which loops can be shrunk becomes a question about where a path ends, which is easy.
A limit that forgets to be continuous
Every one of the functions x, x², x³, … is as smooth as anything could be, and every column of the picture settles down. What they settle on has a jump in it — and the quantity that sees the difference is the largest gap anywhere, which is a number about the whole graph rather than about any point of it.