Mathematics, in pictures.

Some mathematical ideas are hard because they are genuinely hard. Others are hard only because nobody drew them properly. This is a collection of essays about the second kind — one idea at a time, illustrated to the point where the argument becomes visible.

Pascal's triangle mod 2, 32 rows. Only the odd entries are drawn; the pattern that appears is the Sierpiński triangle.
Fig. 1 Pascal’s triangle with the odd numbers shaded and the even ones left blank. Nothing here was designed to make a pattern; the pattern is a consequence of the arithmetic. See Pascal’s triangle, two colours.

Recently added

44 essays, 29 September 2026 — everything that has been added, in order

Two different graphs with the same adjacency matrix eigenvalues. a star with four arms: adjacency matrix eigenvalues 2, 0³, −2; a square and a lone point: adjacency matrix eigenvalues 2, 0³, −2. The characteristic polynomials are identical. Algebra

Two graphs the eigenvalues cannot tell apart

A graph's matrix has eigenvalues, and they count a surprising amount of the drawing: its edges, its triangles, every closed walk of every length. They do not count everything. A star with four arms and a square beside a lone point have the same eigenvalues exactly, although one of them is in two pieces — and on six points ten of the 156 graphs have a twin of this kind.

6 figures
A loop that is a hole, and the same loop filled in. a hollow triangle: 3 points, 3 edges, 0 triangles; holes in each dimension 1, 1, 0; a filled triangle: 3 points, 3 edges, 1 triangles; holes in each dimension 1, 0, 0. Algebra

A hole is a cycle that bounds nothing

A hollow triangle and a filled one have the same three edges and the same loop round them. In one the loop is the edge of something and in the other it is not, and that difference — a cycle that is not a boundary — is what a hole is. Counting holes is rank and nullity applied twice, and the Euler characteristic is what is left when the two applications cancel.

7 figures
Secants closing on the slope of the folium x³ + y³ = 3xy. The curve x³ + y³ = 3xy with secants from (1.001, 0.348) of slopes 1.274, 0.953, 0.830, 0.777, approaching the tangent slope 0.744 given by the equation's partial derivatives. Analysis

A slope for a curve that is no function

The folium x³ + y³ = 3xy loops back over itself, so no formula y = f(x) describes it, and yet at almost every point it has a perfectly good tangent. Differentiating the equation as it stands gives the slope, −(∂F/∂x) ÷ (∂F/∂y), and the only points where that fails are the ones where the curve turns vertical or crosses itself — which are exactly the points where it stops being a graph.

6 figures
The slope of x² sin(1/x): discontinuous at nought, and never jumping. The derivative of x^2 sin(1/x) on [−0.12, 0.12], with the value at nought marked and the level 0.5 crossed 77 times. Analysis

A slope can swing but never jump

A function can have a slope at every point without that slope changing continuously: x² sin(1/x) has slope nought at the origin and a slope that swings between −1 and 1 however close to the origin it is taken. What a slope cannot do is jump. Darboux proved in 1875 that a derivative takes every value between any two of its values, so a step is never a derivative — and the only way a slope can be discontinuous is by oscillating.

6 figures
The core of a group worth the square of its size: the outline of its six arrival orders. Splits of 9 among three players; core corners (1, 5, 3), (5, 1, 3), (1, 3, 5), (5, 3, 1), (3, 1, 5), (3, 5, 1); arrival-order splits (1, 3, 5), (1, 5, 3), (3, 1, 5), (5, 1, 3), (3, 5, 1), (5, 3, 1); average 3, 3, 3. Applied

The corners are the orders of arrival

Line the players up, let each join in turn, and pay each what it adds on arrival: every order gives a split. When a newcomer always adds at least as much to a bigger group, those splits are exactly the corners of the core — so the core is never empty, it is the outline of the orders, and the average over all of them lies inside it. For a group worth the square of its size the outline is a hexagon whose corners are the six orderings of 1, 3 and 5.

6 figures
The cheapest tree for a remote user between two near ones, and each user paying for its own link. A source and 3 users with link costs source–A 2, source–B 9, source–C 2, A–B 1, B–C 1, A–C 2; the cheapest tree costs 4 and Bird's rule charges 2, 1, 1. Applied

Each user pays for its own last link

Several users must be connected to a source, and the cheapest network that does it is a tree. Dividing its cost so that no group of users would rather build its own looks like a hard search, and it has a one-line answer: each user pays for the link that joins it to the tree on its way to the source. No group is ever overcharged — while the average over orders of arrival, the rule that settles so much else, can charge a pair more than its own connection costs.

6 figures

Start anywhere

Eight of 781 essays — the whole collection is a click away, or search it.

The Pythagorean theorem by dissection. Two squares of the same size. Each holds four copies of one right triangle. The space left over is a single tilted square on the left and two upright squares on the right. Geometry

Two squares, four triangles, and no algebra

The Pythagorean theorem is usually met as a formula to be memorised. It is much better met as a rearrangement that can be checked by eye.

7 figures
Odd numbers as square shells. Nested L-shaped shells of 1, 3, 5 … 11 cells stack into a 6 by 6 square. Geometry

Every square is a stack of odd numbers

Add up the odd numbers in order and the running totals are 1, 4, 9, 16, 25. This is not a coincidence, and the reason fits in a single picture.

7 figures
Euclid's algorithm on a 34 by 13 rectangle. The rectangle is tiled by peeling off the largest square that fits, again and again, until nothing is left. Geometry

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.

7 figures
The five Platonic solids. Tetrahedron, cube, octahedron, dodecahedron and icosahedron, drawn at a common scale. Geometry

Why the list of perfect solids stops at five

There are infinitely many regular polygons and exactly five regular solids. The reason is not deep, but it is very sharp, and it can be checked on a single row of corners.

8 figures
Four conic sections from one cone. Circle, ellipse, parabola and hyperbola, produced by tilting a single cutting plane further and further. Geometry

One cone, four curves

The circle, the ellipse, the parabola and the hyperbola look like four separate objects with four separate equations. They are one object, cut at four angles.

6 figures
A circle unrolled into a sine wave. On the left a radius turns through an angle; on the right the height of its tip is plotted against the angle, tracing a sine curve. Analysis

A sine wave is a circle seen from the side

Sine is introduced as a ratio in a right triangle, which is true and explains nothing about why its graph is a wave. There is a better picture.

7 figures
8 rectangles under a curve. A left-endpoint Riemann sum with 8 rectangles approximating the area under a curve. Analysis

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.

7 figures
Partial sums of the square wave. Approximations using 1, 3, 7, 21 terms; the corners sharpen but a fixed overshoot remains. Analysis

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.

7 figures

The eleven fields

the spine — every essay sits in exactly one

Longest series

one idea, several arguments — all 134 of them

Threads running through

themes, not categories

Proof without words

Arguments that are complete once they have been looked at properly. Not illustrations of proofs — the proofs themselves.

96 essays

Pi turns up uninvited

A constant defined by circles, appearing in places with no circle anywhere in sight, and what that tends to mean.

25 essays

Doing infinitely many things

Sums that never end, subdivisions that never stop, and the care required to make either of them mean something.

79 essays

The same thing twice

Two constructions that look unrelated and turn out to be the same object wearing different clothes.

336 essays

Throwing things away

Progress made by deleting detail: the map that becomes a graph, the shape that becomes a number.

60 essays

Order out of noise

Random processes that reliably produce the same shape, and the reason that is less mysterious than it looks.

91 essays

One point away

Constructions that work perfectly except at a single exceptional place, and what is done about it.

42 essays

Things that cannot be done

Results that close a door rather than open one — and the peculiar difficulty of drawing a picture of something that does not exist.

194 essays

Counting the same thing twice

One collection, counted by two different methods, and an identity that falls out because both answers have to agree. The proof is the pair of counts.

222 essays

Sensitive to everything

Systems where a difference too small to draw becomes the whole difference, and the reason that is a property of the rule rather than of the measurement.

29 essays

Small rules, large behaviour

Rules short enough to write on one line, producing behaviour nobody can summarise — and the finding that the size of a rule predicts nothing about the difficulty of the questions it raises.

45 essays

What a system cannot say

Rules asked a question about themselves, and an answer that is provably not available from inside — which is a different kind of limit from not knowing yet.

64 essays

Decided by exhaustion

Questions with finitely many cases, settled by going through all of them — and what changes when a claim about every argument becomes a count.

212 essays

Small cases lie

Patterns that hold for every example anyone would check by hand, and then stop. The cases within reach are not a sample of the cases.

147 essays

All 781 essays · by series · by named object · by figure · what the figures prove · what is new