Reflection principle
Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.
The path folded at its first touch
Counting the walks that touch a line looks like a question about a walk's whole history. Fold each one where it first touches, and it becomes a question about where walks end up — which is a binomial coefficient, and is already known.
Half the time is the rarest answer
In a fair game of many rounds, the fraction of the time one side is ahead is not usually near a half. It is usually near nought or one, and an even split is the single least likely outcome there is.
Counting the paths that go wrong
The number of good paths across a grid has no obvious formula. The number of bad ones does, because every bad path can be reflected into a path to a different corner, and that reflection is a perfect matching between two sets nobody chose to relate.
Named alongside it
The objects these essays reach for when they reach for this one.
Random walkBallot problemBijectionBinomial coefficientFirst returnArcsine lawCatalan numbersCentral limitCounting-two waysDistributionFairnessLattice paths