Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Full symplectic packing by equal balls in dimension four (Biran)

Open
SymplecticBallPacking.full_packing_dim4

by LG · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisdifferential-geometrysymplectic-geometry

Biran's full-packing theorem in real dimension four. For every integer k≥9k\ge 9k≥9 and every ϵ∈(0,1)\epsilon\in(0,1)ϵ∈(0,1) there is a capacity c>0c>0c>0 such that kkk equal balls of capacity ccc symplectically pack into the unit-capacity ball B4(1)B^4(1)B4(1) and

k c2>1−ϵ.k\,c^2>1-\epsilon.kc2>1−ϵ.

Because vol B4(C)=C2/2\mathrm{vol}\,B^4(C)=C^2/2volB4(C)=C2/2, the quantity k c2k\,c^2kc2 is precisely the fraction of the target volume occupied by the kkk packed balls; the theorem therefore says vk(B4(1))=1v_k(B^4(1))=1vk​(B4(1))=1, i.e. B4B^4B4 admits a full symplectic packing by kkk equal balls for every k≥9k\ge 9k≥9. This is the existence input for the goal, which uses the slightly weaker range k≥10k\ge 10k≥10 reported by Epoch AI.

Formalization Note. Capacities are used (HasPacking, open target ball); a Euclidean unit ball has capacity π\piπ, so the goal's Euclidean-radius formulation follows by rescaling.

Preamble
import Mathlib
import Definitions.Def_BallPacking
import Definitions.Def_SymplecticBallPacking
open scoped ContDiff
Formal statement
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 SymplecticBallPacking
Source
P. Biran, Symplectic packing in dimension 4, Geom. Funct. Anal. 7 (1997), 420–437, https://doi.org/10.1007/s000390050014; P. Biran, From Symplectic Packing to Algebraic Geometry and Back (ECM survey), Theorem 3.1: 'For every N≥9 we have v_N(B⁴(1))=v_N(CP²)=1.' McDuff–Polterovich, Invent. Math. 115 (1994).
Read-back

What the Lean code literally says, in plain math · qwen3.8-max

For every natural number kkk with 9≤k9\le k9≤k and every real ϵ\epsilonϵ with 0<ϵ<10<\epsilon<10<ϵ<1, there exists a real ccc such that 0<c0<c0<c, there is a symplectic packing of kkk equal closed balls of capacity ccc into the open unit-capacity ball in C2\mathbb C^2C2 (i.e. open sets UiU_iUi​ and maps fi:C2→C2f_i:\mathbb C^2\to\mathbb C^2fi​:C2→C2, i∈Fin ki\in\mathrm{Fin}\,ki∈Fink, with each closed ball {z:π∑j∣zj∣2≤c}\{z:\pi\sum_j|z_j|^2\le c\}{z:π∑j​∣zj​∣2≤c} contained in UiU_iUi​, each fif_ifi​ C∞C^\inftyC∞ on UiU_iUi​, a topological embedding there, derivative preserving the standard symplectic form at every point of UiU_iUi​, each fif_ifi​ mapping its closed ball into {z:π∑j∣zj∣2<1}\{z:\pi\sum_j|z_j|^2<1\}{z:π∑j​∣zj​∣2<1}, and pairwise disjoint images), and k c2>1−ϵk\,c^2>1-\epsilonkc2>1−ϵ (with kkk coerced to a real). The target capacity is fixed to 111; the ball capacity ccc is the existentially chosen quantity.

Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me