Full symplectic packing by equal balls in dimension four (Biran)
OpenSymplecticBallPacking.full_packing_dim4Biran's full-packing theorem in real dimension four. For every integer and every there is a capacity such that equal balls of capacity symplectically pack into the unit-capacity ball and
Because , the quantity is precisely the fraction of the target volume occupied by the packed balls; the theorem therefore says , i.e. admits a full symplectic packing by equal balls for every . This is the existence input for the goal, which uses the slightly weaker range reported by Epoch AI.
Formalization Note. Capacities are used (HasPacking, open target ball); a Euclidean unit ball has capacity , so the goal's Euclidean-radius formulation follows by rescaling.
import Mathlib import Definitions.Def_BallPacking import Definitions.Def_SymplecticBallPacking open scoped ContDiff
namespace SymplecticBallPacking
open OAI.HigherDimensionalBallPacking
open Set
theorem full_packing_dim4 (k : ℕ) (hk : 9 ≤ k) (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1) :
∃ c : ℝ, 0 < c ∧ HasPacking 2 k 1 (fun _ => c) ∧ (k : ℝ) * c ^ 2 > 1 - ε := by sorry
end SymplecticBallPackingRead-back
What the Lean code literally says, in plain math · qwen3.8-max
For every natural number with and every real with , there exists a real such that , there is a symplectic packing of equal closed balls of capacity into the open unit-capacity ball in (i.e. open sets and maps , , with each closed ball contained in , each on , a topological embedding there, derivative preserving the standard symplectic form at every point of , each mapping its closed ball into , and pairwise disjoint images), and (with coerced to a real). The target capacity is fixed to ; the ball capacity is the existentially chosen quantity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.