Cancellation
Named by 4 essays across 3 fields — each of them below, with the objects they name alongside it.
The arithmetic that loses subtraction
Adding one to an infinite collection changes nothing, and neither does doubling it, or squaring it. What that costs is the two operations that were doing the work — an equation between infinite sizes cannot be cancelled, and how many are left stops being a question.
A determinant that counts trees
Write down a graph's Laplacian, strike out one row and its column, take the determinant. The answer is the number of spanning trees — and the minus signs in the determinant are what cancel every subset of edges that is not one.
The same sum without its minus signs
Delete the signs from the determinant's sum over permutations and what is left counts things directly rather than by cancellation. It is a better count and a far worse object — because the cancellation was what made the determinant computable.
The terms that cancel almost everything
Multiply out the product of 1 − q, 1 − q², 1 − q³ and so on, and nearly every coefficient is zero. What survives is a single plus or minus one at 1, 2, 5, 7, 12, 15 — and the reason is a way of pairing partitions off so that each pair cancels.
Named alongside it
The objects these essays reach for when they reach for this one.
BijectionCounting argumentCounting two waysDeterminantInvolutionMatrixAbsorptionAlgebraic identityBoundsCardinal arithmeticCountabilityGenerating function