Prove BallPackingNecessity (openai/math family 343: Sharp symplectic ball-packing criteria in higher…
Prove BallPackingNecessity (openai/math family 343: Sharp symplectic ball-packing criteria in higher…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 343 of the release, Sharp symplectic ball-packing criteria in higher dimensions…
The task
Context: this statement belongs to family 343 of the release, *Sharp symplectic ball-packing criteria in higher dimensions* (Differential geometry). The family as a whole: Resolves the Siegel–Yao conjecture for arbitrary capacities in every dimension $2n\ge6$. Finitely many closed symplectic balls of capacities…
Part of raising-heart/openai-math.