Recently added

What's new

Essays arrive in groups rather than one at a time. The most recent group is below in full, and every earlier one after it, newest first.

Essays arrive in groups rather than one at a time, and a group usually opens up a subject the collection had not covered before. Between one group and the next nothing changes, so a reader who has seen the most recent group has seen everything.

9 September 2026

33 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

The parabola that proves |a·b| ≤ |a||b|. The squared length of a − t b plotted against t. It is a parabola opening upward whose least value is 7.118; that this is never negative is exactly the Cauchy–Schwarz inequality. Algebra

The square that cannot be negative

Cauchy–Schwarz is the load-bearing inequality of the whole subject and is nearly always asserted. It is one line away from a fact nobody would argue with, and the line is a parabola with no room to cross the axis.

8 figures
One subtraction clears a direction. Gram–Schmidt on two planar vectors, in 3 panels: the pair as given, the shadow of the second on the first, and the perpendicular pair that is left when the shadow is removed. Algebra

One subtraction clears a direction

A basis is a set of directions to measure along, and most bases are awkward because the directions get in each other's way. Removing one shadow at a time turns any basis into one where every coordinate is a shadow and nothing interferes.

9 figures
The nearest point of the plane the columns span. A target vector in space, the plane spanned by two columns, the point of that plane nearest the target, and the residual joining them, which meets the plane at a right angle. Algebra

The nearest point of a flat thing

More equations than unknowns almost never have a solution. Asking instead for the point of a plane nearest to where the answer should have been turns an unanswerable question into a shadow, and the shadow is what a line of best fit is.

8 figures
What the degree-5 sum costs, and what the bound claims. The error of the degree-5 Taylor polynomial of sin x against x, on a logarithmic scale, with Lagrange's bound drawn above it. The bound exceeds the error by a factor of 1.8 at the right-hand end. Analysis

An error with an unknown in it

Taylor's theorem does not say a partial sum is close to anything. It says the error is one more derivative evaluated somewhere nobody can name, and everything the theorem is worth comes from what happens when that somewhere is replaced by the worst case.

8 figures
1/(1 + x²), expanded about 1.2. 1/(1 + x²) with Taylor sums of degree 2, 6, 14 about x = 1.2 rather than about zero. The interval they converge on reaches 1.562 either side of the centre. Analysis

The centre is a choice

A Taylor series is nearly always written about zero, and nothing about the construction prefers zero. Moving the centre moves the interval the series works on, and moving it repeatedly walks the function into places its first series could never reach.

7 figures
11 points, equally spaced. 1/(1 + x²) and the polynomial of degree 10 through 11 of its points, spaced evenly across the interval. The worst error is 2.48e-1, at x = -2.350. Analysis

The points that ruin the fit

A polynomial through eleven points of a gentle curve should be a good approximation to it, and adding more points should make it better. On evenly spaced points it makes it worse, without limit, and the reason is not the polynomial but where the points were put.

7 figures
A signal both can see, and neither wants to disobey. A two-by-two game with a distribution over its four cells, drawn as the weight on each. Obeying the recommendation is a best reply for both choosers, and the pair collects 21/2 between them. Applied

A signal both can see

Two choosers who randomise privately can reach a set of outcomes that is smaller, and worse, than the set they reach when a device draws one cell and whispers each of them their half of it. Nothing is enforced and nobody is bound, and the arrangement is stable anyway.

6 figures
A landscape nobody is looking at, and every move goes downhill on it. The 8 states of a congestion game with 3 participants and two resources, ordered by Rosenthal's potential, with every improving unilateral move drawn as an arrow. Every arrow points downward. Applied

The landscape nobody is looking at

Letting participants move one at a time to whatever is currently better can cycle forever, and on a network of congestible roads it cannot. The reason is a single number attached to each state that falls by exactly what the mover saves.

7 figures
Two equilibria, and two tests that disagree. The row chooser's expected payoff from each option against the column chooser's behaviour, for a joint effort worth more than a safe one. The lines cross at 0.750, which is the mixed equilibrium and the boundary between the two basins. Applied

Two equilibria and no way to choose

A game can have two states nobody wants to leave, one paying more than the other, and the definition of an equilibrium has nothing to say about which happens. The two standard tie-breakers disagree, and the one that wins is usually the worse.

8 figures
A dissection that never comes apart. The three pieces of the triangle-to-rectangle dissection drawn at 4 moments of the swing. Each top piece turns about a pin at the end of the slice it stands on, and the pieces stay joined throughout. Computation

A dissection that never comes apart

The plane theorem lets the pieces be picked up and put down anywhere. Require instead that they stay joined at their corners and swing, and the theorem survives — which was open for a century and is a much stronger statement about the same cuts.

6 figures
The quantity a cut cannot change and a turn can. 4 polygons, each with the spikes of its translation invariant drawn round a dial: the length of the edges facing each direction, less the length of those facing the opposite way. It vanishes everywhere for 3 of them. Computation

Slid, but never turned

Every construction on this ladder turns its pieces. Forbid the turn — allow the pieces to be slid and nothing else — and equal area stops being enough, for a reason that is a single number attached to each direction and that a cut cannot change.

6 figures
What the chain costs on a 6-gon: 39 pieces. A regular 6-gon fanned into 4 triangles, each with the three cuts that turn it into a rectangle, beside the running count of the pieces the whole chain produces — 39 of them. Computation

Finitely many, and nobody says how many

The theorem promises a dissection exists and the proof produces one. Running the proof on a hexagon produces thirty-nine pieces, ingenuity produces five, and there is no method for proving that five cannot be four.

5 figures
A run down a diagonal, and the entry it adds to. 9 rows of Pascal's triangle with 5 entries shaded and the entry they add to marked. The claim is checked by adding the shaded entries: 1 + 3 + 6 + 10 + 15 = 35. Discrete

The run that lands one place along

Add up a run of entries down one of Pascal's diagonals and the total is another entry of the triangle — one row further down and one place along. The same triangle holds four more sums of that kind, and each is a different question answered by the same additive rule.

7 figures
35 routes across a 4 by 3 grid. A grid with each cell holding the number of monotone routes reaching it. The far corner holds 35, which is the binomial coefficient of 7 choose 3. Discrete

Every entry counts the routes to it

Turn Pascal's triangle forty-five degrees and it becomes a grid of street corners, with each entry counting the ways of walking there. Identities between the entries then become statements about routes, and the statements are proved by cutting the routes in one place.

5 figures
3 carries in base 2, and 2 divides it 3 times. The addition of 5 and 7 written in base 2, column by column, with the carries marked. There are 3, and 2 divides the binomial coefficient 792 exactly 3 times. Discrete

The carries decide the divisibility

How many times a prime divides a binomial coefficient is not a fact about the coefficient at all. It is a count of the carries that happen when two numbers are added in that prime's base, which is a question about column addition and has nothing to do with choosing anything.

5 figures
Infinite below 0.6309, nought above it. The total of the s-th powers of the diameters in the natural cover of the middle-thirds Cantor set, plotted against s for 4 depths. Every curve passes through one at s = 0.6309 and they separate either side of it. Dynamics

Infinite on one side and nought on the other

Box counting returns a growth rate. Hausdorff's definition returns a measure — a quantity that is infinite for every exponent below the dimension and zero for every exponent above it, and the dimension is the one place where it is neither.

5 figures
A carpet whose two dimensions differ by 0.076. A self-affine carpet built by keeping 5 cells of a 4 by 2 grid and repeating 4 times. Its box dimension is 1.6610 and its Hausdorff dimension 1.5850. Dynamics

A carpet with two dimensions

For every set on this ladder so far the two definitions of dimension agree, and the agreement is a theorem about sets built from copies of themselves scaled equally. Stretch one direction more than the other and the two numbers come apart, by an amount that can be computed exactly.

5 figures
A dimension of 1.2576, from two stretching rates. The running averages of the Hénon map's two Lyapunov exponents, settling at 0.4177 and -1.6217. Kaplan and Yorke's formula turns them into a dimension of 1.2576 without counting a single box. Dynamics

A dimension from the stretching rates

An attractor has no construction rule, so its dimension has to be counted — that was the rung below's argument for defining dimension by counting at all. Kaplan and Yorke's formula computes it instead, from two numbers that describe the map and never look at the set.

5 figures
Every ray aimed at one focus is turned towards the other. A hyperbola with its two foci and 13 rays aimed at the far one. Each strikes the near branch from outside and is turned towards the near focus — which is the property a Cassegrain telescope's secondary mirror uses. Geometry

Aimed at one focus, turned towards the other

An ellipse sends every ray leaving one focus through the other. A hyperbola does something that sounds like the same sentence and is not — it takes a ray aimed at the far focus and turns it towards the near one, which is what the second mirror of a telescope is for.

6 figures
Two families of conics, crossing at right angles. 4 ellipses and 3 hyperbolas with the same pair of foci. Every ellipse meets every hyperbola at a right angle, checked at all 12 crossings. Geometry

Two families that cross at right angles

Fix two points and draw every ellipse with those foci, then every hyperbola with the same two. Each curve of the first family meets each of the second at a right angle, so between them they are a coordinate system — and the reason is one sentence about angle bisectors.

5 figures
One sign decides which curve it is. 3 conics drawn from the general quadratic, each labelled with its discriminant B² − 4AC and the curve that sign names, checked against how many times the curve meets a large circle. Geometry

One sign decides which curve

The general quadratic in two variables has six coefficients and draws a conic. Which of the four it draws is settled by a single combination of three of them, and the other three cannot change the answer however they are chosen.

5 figures
7 steps and 3 withdrawn assumptions. A natural-deduction derivation of (p → q) → (¬q → ¬p). Each horizontal bar is one inference, named on its right; the bracketed formulas are assumptions, and each is withdrawn at the step that names it. Logic

The assumption a proof pays back

A tableau assumes the opposite once and takes it apart. Natural deduction assumes things freely, uses them, and then withdraws them — and the withdrawal is what turns a derivation of a consequence into a proof of an implication.

5 figures
A lemma, and the proof that never mentions one. Two derivations of ((p → q) ∧ (q → r)) → (p → r) compared: the cut-free one uses 8 nodes and only subformulas of the goal, and the one through a lemma uses 21 and mentions a formula the goal does not contain. Logic

A lemma, and the proof that never mentions one

Proving something by first proving a lemma is what makes mathematics readable, and it is exactly what makes a proof system impossible to search — because the lemma can be any formula at all. Gentzen proved the step can always be removed, and the removal is not free.

5 figures
Closed after 3 uses of the universal. The Herbrand expansion of a first-order question at 5 stages, with the number of remaining models at each. It reaches nought after 3 instantiations. Logic

The instance that has to be guessed

Every rule of a propositional tableau replaces a formula by shorter ones, which is why it stops. The rule for a universal claim does not replace it — it keeps it and adds an instance — and one word changing turns a decision procedure into a search that may run forever.

5 figures
The tree as words in two matrices. 6 nodes of the Stern–Brocot tree, each as the word of turns reaching it, the matrix that word multiplies out to, its two columns as fractions, and the mediant of those columns. Number

Two matrices that generate the tree

A node of the Stern–Brocot tree is not really a fraction — it is the pair of fractions it lies between. Written as the columns of a matrix, the two turns of the tree become two multiplications, and the determinant that kept everything in lowest terms becomes a property of a product.

5 figures
Every positive rational, in one sequence. The first 32 terms of Stern's diatomic sequence as bars, with the ratios of consecutive terms beneath. Every ratio is in lowest terms, no two agree, and each term counts the hyperbinary representations of its index. Number

Every rational in one sequence

The tree lists every positive fraction once and needs a tree to do it. One recursion on the whole numbers lists them in a single row — and each term of it counts something nobody was asking about, which is why the enumeration works.

5 figures
13 record approximations in 26 turns. The distance from π to each fraction the descent passes, against its denominator, on logarithmic axes. 13 of them beat every fraction with a smaller denominator. Number

The fractions that beat every smaller one

Walking down the tree towards a number produces a sequence of fractions closing in on it. Most of them are steps along the way; a few are the best approximations there are — closer than every fraction with a smaller denominator — and which few is decided by where the turns change direction.

5 figures
58.6% at 46 candidates, against 37% without the values. The chance of ending with the best candidate when the values are shown, against the number of candidates, for 10 sizes. It falls towards 0.5802 rather than towards 1/e. Probability

When the numbers are shown

The secretary rule wins a third of the time and cannot do better, because it is told only who is ahead. Show the actual values and say where they came from, and the same problem is won three times in five — by a standard that falls as the end approaches.

5 figures
About the fourth-best, whatever the size of the field. The smallest expected rank achievable by an online rule, against the number of candidates, for 10 sizes. It rises to 3.8516 at 2500 candidates and its limit is 3.8695. Probability

Giving up on the best

The secretary rule treats landing the second-best exactly as badly as landing the worst, which is a strange thing to want. Ask instead for the smallest average rank and the answer is about the fourth-best candidate — whatever the size of the field, and whether it is ten or ten million.

5 figures
An online rule taking nine tenths of what an oracle takes. The share of the oracle's expected maximum secured by the best single threshold, and by the threshold at the median of the maximum, for 8 field sizes of independent uniform values. Probability

Half of what an oracle takes

Compare an online rule not against the best it could have done but against a rule that has seen every value in advance. One fixed threshold secures half of what the oracle collects, whatever the distributions are — and there is an example on which half is all there is.

5 figures
3 symmetries over 3 sheets: a regular covering. A 3-sheeted covering of a wedge of 2 circles, with the permutations of its sheets that commute with every generator. There are 3, against 3 sheets. Topology

The symmetries a cover has of its own

A covering space can be shuffled without disturbing anything below it, and how many ways there are is decided by the subgroup it corresponds to. When there are as many symmetries as sheets the covering is called regular, and that is the same statement as the subgroup being normal.

5 figures
3 sheets, 8 of 26 words coming back. A table of reduced words in two generators with the sheet each sends the base sheet to. The words returning to it are the covering's subgroup, and the 3 sheets are its cosets. Topology

A covering is a permutation

Describing a covering means saying where each loop sends each sheet, which is a permutation for every generator. So a covering of a wedge of circles is nothing but a homomorphism to a symmetric group, and the subgroup it corresponds to is a stabiliser.

5 figures
6 vertices folded to 4, and a graph that decides. The graph built from 3 generator words, folded until no vertex has two edges of one label leaving it. Reading a word from the base vertex decides membership, and 6 words are tested. Topology

Folding a graph until it decides

A subgroup of a free group usually arrives as a list of words, and almost nothing about it is readable from the list. Draw the words as loops, merge every pair of edges with the same label leaving one point, and what is left is a machine that decides membership by reading.

5 figures

Before that

Everything published earlier, newest first. Titles only — the cards are on the full listing.

8 September 2026

21 essays on algebra, analysis, applied, computation, discrete, dynamics, geometry, logic, number, probability and topology

5 September 2026

50 essays on geometry, discrete, topology, dynamics, computation, applied, probability, analysis, logic, number and algebra

23 August 2026

15 essays on geometry, discrete, topology, dynamics, probability, logic, computation, applied and algebra

22 August 2026

15 essays on number, geometry, probability, discrete, analysis and topology

Every essay, by subject · by subject · by ladder · search