Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gromov's two-ball obstruction in dimension four

Open
SymplecticBallPacking.two_ball_obstruction_dim4

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

analysisdifferential-geometrysymplectic-geometry

Gromov's two-ball obstruction, in real dimension four. If two closed balls of positive capacities aaa and bbb admit a symplectic packing into the unit-capacity ball B4(1)B^4(1)B4(1), then

a+b≤1.a+b\le 1.a+b≤1.

In Euclidean radii (a=πλ12a=\pi\lambda_1^2a=πλ12​, b=πλ22b=\pi\lambda_2^2b=πλ22​, target radius 1/π\sqrt{1/\pi}1/π​) this is λ12+λ22≤R2\lambda_1^2+\lambda_2^2\le R^2λ12​+λ22​≤R2. It is the first packing obstruction that is genuinely symplectic rather than volumetric: two equal balls can fill at most half the volume of a four-ball. This complements the platform's already-proved higher-dimensional version (normalized_two_ball_obstruction, n≥3n\ge 3n≥3) by supplying the dimension-four case.

Formalization Note. Capacities are used (HasPacking); the non-strict inequality ≤\le≤ matches the platform's normalized statement for the open-target packing convention.

Preamble
import Mathlib
import Definitions.Def_BallPacking
import Definitions.Def_SymplecticBallPacking
open scoped ContDiff
Formal statement
namespace SymplecticBallPacking
open OAI.HigherDimensionalBallPacking
open Set

theorem two_ball_obstruction_dim4 (a b : ℝ) (ha : 0 < a) (hb : 0 < b)
    (hp : HasPacking 2 2 1 ![a, b]) : a + b ≤ 1 := by sorry

end SymplecticBallPacking
Source
M. Gromov, Pseudoholomorphic curves in symplectic manifolds, Invent. Math. 82 (1985), https://doi.org/10.1007/BF01388806; P. Biran, From Symplectic Packing to Algebraic Geometry and Back (ECM survey), Theorem 2.1 (λ₁²+λ₂²<R²); McDuff–Polterovich, Invent. Math. 115 (1994). Capacity-normalized form a+b≤1 parallels OAI.HigherDimensionalBallPacking.normalized_two_ball_obstruction (n≥3).
Read-back

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

For all real numbers a,ba,ba,b with 0<a0<a0<a and 0<b0<b0<b, if there is a symplectic packing of two balls of capacities aaa and bbb into the open unit-capacity ball in C2\mathbb C^2C2 — concretely, there exist open sets U0,U1⊂C2U_0,U_1\subset\mathbb C^2U0​,U1​⊂C2 and maps f0,f1:C2→C2f_0,f_1:\mathbb C^2\to\mathbb C^2f0​,f1​:C2→C2 such that each closed capacity ball {z:π∑j∣zj∣2≤ri}\{z:\pi\sum_j|z_j|^2\le r_i\}{z:π∑j​∣zj​∣2≤ri​} (with r0=a,r1=br_0=a,r_1=br0​=a,r1​=b) lies in UiU_iUi​, each fif_ifi​ is C∞C^\inftyC∞ on UiU_iUi​, a topological embedding there, and preserves the standard symplectic form via its derivative at every point of UiU_iUi​, each fif_ifi​ maps its closed ball into the open ball {z:π∑j∣zj∣2<1}\{z:\pi\sum_j|z_j|^2<1\}{z:π∑j​∣zj​∣2<1}, and the two images are disjoint — then a+b≤1a+b\le 1a+b≤1.

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