Infinity
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Infinitely many guessers, finitely many wrong
An infinite line of people each wears a black or white hat, sees every hat in front and none of their own, and must guess their own colour. With a finite line, each guesser is right half the time whatever they agree in advance. With an infinite line and the axiom of choice, they can agree a strategy under which all but finitely many are right — and nobody can carry it out.
Enough partners in every finite group
Hall's theorem says a matching exists unless some group has too few partners between them. On an infinite graph that is false: one vertex that can be paired with anybody, and every other with exactly one, passes the test on every finite group and has no matching at all. The failure needs a vertex with infinitely many choices. Forbid that, and the theorem comes back, by an argument about trees rather than about matchings.
Named alongside it
The objects these essays reach for when they reach for this one.
Axiom of choiceBipartite graphChoice functionCompactnessEquivalence classExhaustive searchIndependenceMatchingNon-measurable setParityPigeonhole principleProbability