A separated half-cell packing with an empty fifth-cell has at most 24 points
OpenCirclePackingConstants.twentyfive_missing_cell_halfbox_boundDivide each cell of the subdivision of the unit square into its lower and upper halves. The resulting fifty closed rectangles are
where and . Let be any set of these half-cell indices, and choose one point for each . Suppose the chosen points have pairwise squared distances strictly greater than . If there is a full fifth-cell whose two half-cell indices both lie outside , then
This is a proposed geometric subproblem for the twenty-five-point occupancy theorem. It concerns assigned half-cell indices: a point on a rectangle boundary may belong geometrically to another rectangle, and no exclusion from that rectangle is assumed. The values of outside are unrestricted.
The half-cell diagonal has square , so every separated configuration can be encoded using at most one point in each of these fifty rectangles. The statement isolates the remaining global obstruction after that elementary local bound. It does not assert that the obstruction has already been proved or that checking only the fifty original rectangles suffices to certify it; further geometric estimates or subdivision are needed.
import Definitions.Def_CirclePackingConstants noncomputable section namespace CirclePackingConstants
theorem twentyfive_missing_cell_halfbox_bound
(S : Finset ((Fin 5 × Fin 5) × Fin 2))
(q : ((Fin 5 × Fin 5) × Fin 2) → Point)
(hc : ∀ r ∈ S,
((r.1.1.val : ℝ) / 5 ≤ (q r).1 ∧
(q r).1 ≤ ((r.1.1.val : ℝ) + 1) / 5) ∧
((r.1.2.val : ℝ) / 5 + (r.2.val : ℝ) / 10 ≤ (q r).2 ∧
(q r).2 ≤ (r.1.2.val : ℝ) / 5 + ((r.2.val : ℝ) + 1) / 10))
(hd : ∀ r ∈ S, ∀ t ∈ S, r ≠ t → (1 : ℝ) / 16 < sqDist (q r) (q t))
(hempty : ∃ c : Fin 5 × Fin 5, ∀ b : Fin 2, (c, b) ∉ S) :
S.card ≤ 24 := by sorry