More, Fewer, or the Same

Pairing works where counting cannot. The piles may be huge, or you may not know the number words that high — match one to one anyway. Leftovers sit on the bigger side; a perfect match with none left means equal. The verdict arrives without a single number.

Here is the secret underneath: counting is itself a pairing. When you count a pile — one, two, three — you are matching each thing with one number word. Comparing by matching is the older trick; counting borrowed it.

Say it precisely. Two groups match one to one when every member of each group gets exactly one partner in the other — nobody skipped, nobody used twice. If a perfect matching exists, the groups have equal count. If every attempt strands leftovers on the same side, that side has strictly more. Notice what this buys you: a way to establish 'same number' without ever learning which number.

Mathematicians call two sets equinumerous exactly when a one-to-one correspondence exists between them — and this is the definition of 'same number of', not a consequence of it. The idea is old enough to carry a philosopher's name, Hume's principle: the number of As equals the number of Bs precisely when the As and the Bs correspond one to one. Matching sits beneath number itself; the count is a label we attach afterward.

Put one cup on one saucer. Again. Again. If a cup is left with no saucer, there are more cups. If nothing is left over on either side, the groups are the same.

You never said a single number. The pairing answered the question all by itself.

The correspondence is a bijection; an injection that may leave some targets unpartnered witnesses 'at most as many'. Define |A| = |B| iff a bijection A → B exists, and |A| ≤ |B| iff an injection exists. Cantor's move was to play the saucer trick where counting is hopeless: n ↦ 2n is a bijection from the naturals onto the even numbers, so the evens are not fewer than the naturals — an infinite set can match a proper part of itself.

The Cantor–Schröder–Bernstein theorem rounds out the toolkit: injections in both directions guarantee a bijection. Leftover-reasoning, made rigorous, orders sizes even where no counting is possible.

Equinumerosity is an equivalence relation, and the cardinals are its invariants. Cantor's diagonal argument shows the matching game has genuine losers: there is no surjection from ℕ onto ℝ, nor from any set A onto its power set — leftovers are unavoidable, so strictly larger infinities exist. Dedekind turned the anomaly into a definition: a set is infinite iff it admits a bijection with a proper subset of itself.

The foundational weight is heavier still: Frege's theorem derives the Peano axioms, in second-order logic, from Hume's principle alone. The cup-and-saucer pairing a five-year-old performs at the table is, verbatim, the primitive from which arithmetic itself can be rebuilt.