Concept

Nonconstructive

Said of a proof that establishes something exists while giving no way to find it. Such a proof is worth having and worth flagging, since it leaves the question of finding the object entirely open.

Named by 12 essays across 5 fields — each of them below, with the objects they name alongside it.

13 into 12. 13 items spread as evenly as 12 boxes allow. Even at their most even, some box holds 2, because 13 is more than 12 × 1.

More things than boxes

If there are more objects than containers, some container holds two. That is the entire principle, it is impossible to disagree with, and it settles questions that look nothing like it.

discrete · Pigeonhole
A map of the interval must fix a point. a continuous map of the interval, drawn with the diagonal. Every continuous map of the interval into itself meets the diagonal somewhere; this one does so at x = 0.6944.

Something always stays put

Stir a cup of coffee however violently and let it settle. Some molecule is exactly where it started. Crumple a map and drop it on the region it depicts, and one point lies over the place it names.

topology · Fixed points
Six people, and the trio that cannot be avoided. The fifteen pairs among six people, coloured at random. Whatever the colouring, three people are all mutual acquaintances or all mutual strangers — here 1, 2, 5.

Six people at a party

Among any six people, three are mutual acquaintances or three are mutual strangers. Five is not enough, and the arrangement that saves five is a pentagon. Beyond that the numbers become unknowable.

discrete · Ramsey theory
The field that cannot be combed. A tangent field on the sphere, flowing along the meridians. Every arrow is tangent to the surface, and at the two poles there is no direction for an arrow to take — the field is zero there, and no rearrangement removes both zeros.

Nothing on a sphere can be combed flat

Point an arrow along the surface at every place on a sphere, continuously, and somewhere an arrow has to vanish. On a doughnut it can be done. The difference between the two is a number that was already known from counting corners.

topology · Fixed points
8 multiples of φ in 7 boxes. The fractional parts of the first multiples of a number, dropped into equal boxes along the unit interval.

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.

number · Pigeonhole
The image of four circles, turning 0 to 3 times. The polynomial applied to circles of four radii, each image drawn as a closed loop with the origin marked, and the number of times the loop goes round it.

A loop that cannot miss the middle

Feed a circle into a polynomial and a closed loop comes out. A small circle gives a loop that does not enclose the origin; a large one gives a loop that goes round it as many times as the degree. Something has to happen in between, and that something is a root.

algebra · Polynomial roots
One line, and both shapes halved. Two shapes and the single straight cut that divides each of them into two equal areas. The direction was found by sweeping every angle and watching the imbalance change sign.

One line that halves them both

Two shapes lying anywhere on a page, of any sizes and any shapes at all. There is always a single straight line that cuts both of them into two equal halves at once — and finding it needs no cleverness, only the observation that a quantity which reverses sign has to pass through zero.

topology · Borsuk ulam
The expected number of monochromatic sets, and where it drops below one. The logarithm of the expected number of single-coloured 4, 5, 6-point sets in a random two-colouring, plotted against the number of points, with the crossing of one marked for each.

The colouring nobody has ever seen

Count the monochromatic sets a random colouring is expected to contain. If the average is below one, some colouring has none — and the argument is finished, having produced nothing anyone can look at.

discrete · Ramsey theory
sin(2πkx) for k up to 10, and the largest gap between every pair. Members of the sequence sin 2πkx drawn on one pair of axes, beside a table of the largest vertical gap between every two members, none of which is less than one.

The subsequence that has to exist

Every bounded list of numbers has a part that settles down. A bounded list of functions need not: the waves sin 2πkx never come within 1.76 of one another. One extra condition — that no member may change faster than a bound they all share — restores the guarantee, and it is the reason a differential equation with a continuous rule has a solution at all.

analysis · Uniform convergence
Two opposite points on a globe with the same temperature and the same pressure. A world map in longitude and latitude with one curve where each point's temperature matches its opposite point's and another where the pressures match, crossing at a pair of opposite points that are marked.

Two opposite points that agree twice

At any moment there are two points on opposite sides of the Earth with the same temperature and the same pressure. On a seeded globe they sit at 11.9°N 44.6°E and 11.9°S 135.4°W. The reason is the circle argument that halved two shapes, run one dimension up: the differences between opposite readings, walked round the equator, wind round zero an odd number of times — and an odd number cannot be zero.

topology · Borsuk ulam
A necklace of 4 orange, 4 blue, 2 green beads, shared fairly with 3 cuts. A row of coloured beads cut at marked places into pieces, each piece labelled with the thief who receives it, so that both thieves get half of every colour.

As many cuts as colours

Two thieves steal a necklace and want half of every colour of bead each. However the beads are strung, they never need more cuts than there are colours — three cuts for three colours, four for four — and sometimes they need every one. The guarantee is the Borsuk–Ulam theorem again, with a point on a sphere read as a way of cutting the necklace, and every necklace of several small kinds has been checked against it.

topology · Borsuk ulam
A rule that meets the diagonal, and the same rule with a hole in it. Two panels, each the graph of a rule assigning a set of values to every point of the unit interval, drawn against the diagonal: the first meets the diagonal at a filled-in jump, the second has the jump left open and misses it.

A map that offers a choice

Brouwer's theorem needs a function, and the object it was most wanted for is not one — a best reply is a whole set whenever a chooser is indifferent. Allow a point to be sent to a set and the fixed point survives, provided the sets are convex, and the convexity is the entire hypothesis.

topology · Fixed points

Named alongside it

The objects these essays reach for when they reach for this one.

Existence proofContinuityBrouwerCounting argumentFixed pointPigeonhole principleWinding numberAntipodal pairDegreeIntermediate value theoremComplete graphDirichlet

All concepts