Construction
Named by 13 essays across 4 fields — each of them below, with the objects they name alongside it.
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.
Three trisectors and a triangle nobody expected
Cut every angle of a triangle into three. The trisectors nearest each side meet in three points, and those three points are always the corners of an equilateral triangle — for every triangle there is, with no exceptions and no reason anybody finds obvious.
The rope that squares a corner
The theorem turns two sides into a third. Run it backwards and it turns three lengths into a right angle — which is a different statement, needs its own proof, and is the only one of the two that has ever been used to build anything.
The map that trades circles for lines
Send every point to the one on the same ray whose distance multiplies with it to a fixed number, and circles become lines, lines become circles, angles survive untouched, and a ring of tangent circles falls out of a ring of equal ones.
The straightedge buys nothing
Every point a compass and a straightedge can construct together can be constructed by the compass alone. The straightedge draws lines nobody needs; the compass does the work, and the proof that it does is an inversion performed with arcs.
Approached too fast to be algebraic
An algebraic number of degree d cannot be approached by fractions faster than the denominator's dth power. So a number that is approached faster than that is the root of no polynomial at all — and one can be built by choosing where its decimal digits go.
A field's worth of squares
Two orthogonal squares of order five are easy to stumble on. Four of them, every pair orthogonal, is not a stumble — it is one line of arithmetic over a field, and the field supplies as many as the order allows.
A page that knows where it is
A four-by-four array of bits, cyclic in both directions, in which every two-by-two block appears exactly once. Print it repeatedly across a sheet and any four marks on that sheet are an address.
Eight circles touching three
Draw three circles. How many circles touch all three? The answer is eight, the count is a fact about signs rather than about geometry, and the classical way to find them is to move the problem somewhere it becomes easy.
One circle, and a straightedge
A straightedge alone cannot bisect a segment, so it cannot draw a parallel, so it can construct almost nothing. Draw one circle anywhere and mark its centre and everything a compass could ever have done becomes available — the circle is never needed again.
The compass that will not open
Fix the compass at one opening and never change it. That looks like a serious loss — a circle of a given radius through a given point is the compass's whole job — and it turns out to cost nothing at all, for reasons that are arithmetic rather than geometric.
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.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
CircleConstructible numberCounting argumentInversionMidpointOperation setStraightedgeAreaBijectionCompassConformal mapCongruence