Sixteen points in the unit square have a close pair
ProvedCirclePackingConstants.sixteen_unit_square_close_paircombinatoricsdiscrete-geometrypacking
Any sixteen points in the unit square contain two distinct points at squared distance at most .
This is the pigeonhole core of the four-by-four grid upper bound: with the separation scale is , and this lemma supplies exactly the close pair at that scale. It separates the finite combinatorics from the packing normalization (inner square, scaling, ssup argument), which is routine once this is available.
Formalization Note The bound is stated evaluated ( rather than ); the reduction rewrites it via norm_num.
Preamble
import Definitions.Def_CirclePackingConstants
Formal statement
namespace CirclePackingConstants theorem sixteen_unit_square_close_pair : forall p : Fin 16 -> 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)/9 := by sorry end CirclePackingConstants
Source
Circle packing in a square, four-by-four grid upper bound (Section 7): plotted against the proved three-by-three analogue. Companion to the six- and eight-point close-pair lemmas.