Borsuk ulam theorem
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
Four equal quarters with two lines
Any flat shape, however lopsided, can be cut into four pieces of equal area by two perpendicular straight lines. The proof turns the pair of lines like the hands of a clock: the area in one quadrant, minus a quarter, reverses its sign every quarter-turn, so somewhere it is zero. The same kind of argument cuts a solid into eight equal pieces with three planes. It stops working in five dimensions, where some masses cannot be cut into thirty-two equal pieces by five hyperplanes — and in four, nobody knows.
Seven points split three ways
Any seven points in the plane can be divided into three groups whose convex hulls share a point, and six points in general position never can. The theorem is Helge Tverberg's; its topological version, in which straight lines may bend, is true when the number of groups is a power of a prime and false otherwise — and the proof that decides which is the same antipodal argument that halves a sandwich.
How many pieces to shrink a shape
Cut a disc in two and one half still holds a full diameter; cut it in three and every piece is narrower. In 1933 Karol Borsuk asked whether every bounded shape in d dimensions can be made narrower with d + 1 pieces, and the antipodal theorem he proved in the same paper says no number smaller will do for a ball. The guess held in the plane and in space, and failed in 1993: sixty years later, a set of sign patterns turned into points showed that some shapes need exponentially many pieces — the first in 1,325 dimensions, and now known in 64.
Named alongside it
The objects these essays reach for when they reach for this one.
Antipodal pairChromatic numberConvex hullCounterexampleExhaustive searchFair divisionGeneral positionGraph colouringHam sandwich theoremIntermediate value theoremLower boundMass partition