Twenty-five points in the unit square have a close pair
OpenCirclePackingConstants.twentyfive_unit_square_close_paircombinatoricsdiscrete-geometrypacking
Any twenty-five points in the unit square contain two distinct points at squared distance at most .
This is the pigeonhole core of the five-by-five grid upper bound: with the separation scale is . Like its sixteen-point sibling it separates finite combinatorics from the routine packing normalization.
Formalization Note The bound is stated evaluated ( rather than $(1/4)^2`).
Preamble
import Definitions.Def_CirclePackingConstants
Formal statement
namespace CirclePackingConstants theorem twentyfive_unit_square_close_pair : forall p : Fin 25 -> Point, (forall i, 0 ≤ (p i).1 ∧ (p i).1 ≤ 1 ∧ 0 ≤ (p i).2 ∧ (p i).2 ≤ 1) -> exists i j, i ≠ j ∧ sqDist (p i) (p j) ≤ (1 : Rat)/16 := by sorry end CirclePackingConstants
Source
Circle packing in a square, five-by-five grid upper bound (Section 7): plotted against the proved three-by-three analogue. Companion to the six- and eight-point close-pair lemmas.