Pick theorem
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
The theorem that has no version in space
A lattice polygon's area is decided completely by two counts of dots. The obvious guess is that a lattice solid's volume is decided by the same two counts in three dimensions, and there is a family of tetrahedra with identical counts and every volume that says otherwise.
Sixteen polygons with one dot inside
Fix one of Pick's two counts at one and ask what is left. The answer is a finite list, the list has exactly sixteen entries, each one is its own kind of object with a dual that is another entry, and the whole classification is a search a page can carry out.
The dots a circle catches
Pick's theorem gives a lattice polygon's area exactly, with no error term anywhere. Ask a circle the same question and the exactness is gone: the count is the area plus something, the something has been measured for two centuries, and nobody knows how big it is.
Named alongside it
The objects these essays reach for when they reach for this one.
LatticeExhaustive searchAsymptoticsClassificationConvex hullCounterexampleCounting two waysDimensionDivisor functionDualityEhrhart polynomialEquivalence