Optimality:
ProvedCirclePackingConstants.r_n_sixteen_upperdiscrete-geometrypacking
No packing of equal circles in the unit square admits a radius exceeding :
r_{16}\;\le\;rac{1}{8}.This is the optimality half of the exact value, and it is where the mathematical difficulty lies. Unlike the lower bound, it cannot be settled by exhibiting a configuration: it asserts that every one of the infinitely many admissible configurations of centres in the unit square obeys the bound, so the grid is best possible.
Together with the companion lower bound it pins the optimal radius to exactly , from which the covered-area constant follows by arithmetic as .
Preamble
import Definitions.Def_CirclePackingConstants noncomputable section namespace CirclePackingConstants
Formal statement
theorem r_n_sixteen_upper : r_n 16 ≤ (1:ℝ)/8 := by sorry
Source
Erich Friedman, Packing unit squares in squares: a survey and new results / the classical table of optimal packings of equal circles in a unit square. For the optimal configuration is the square grid, giving . The two inequalities are established by different arguments: the lower bound by exhibiting the grid, the upper bound by the corresponding optimality proof.