Compactness
Named by 3 essays across 3 fields — each of them below, with the objects they name alongside it.
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.
Three in a row on the number line
Colour the numbers one to eight in two colours and it can be arranged that no three equally spaced numbers agree. Add the ninth and it cannot. The structure being forced is arithmetic rather than graphical, and the proof is a different proof.
One chart is never enough
Stereographic projection matches the sphere minus a point with the whole plane, and the missing point is not a blemish to be tidied away. It is a theorem — no single flat picture covers a sphere — and the repair is two pictures with a rule for passing between them.
Named alongside it
The objects these essays reach for when they reach for this one.
Arithmetic progressionAtlasChartCounting argumentExhaustive searchExistence proofFermats little theoremFinite branchingGraph colouringInfinite pathKonig lemmaManifold