Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compactly supported symplectomorphisms of R4\mathbb{R}^4R4 are Hamiltonian

Open
SymplecticBallPacking.compact_symplectomorphism_hamiltonian

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

analysisdifferential-geometrysymplectic-geometry

Every compactly supported symplectomorphism of R4\mathbb R^4R4 is Hamiltonian. Let f:C2→C2f:\mathbb C^2\to\mathbb C^2f:C2→C2 be a global symplectomorphism (smooth, a topological embedding, derivative preserving ω\omegaω everywhere, bijective) with compact support, i.e. f(x)=xf(x)=xf(x)=x outside some compact set. Then there exist a smooth Hamiltonian H:C2×R→RH:\mathbb C^2\times\mathbb R\to\mathbb RH:C2×R→R with compact support and a Hamiltonian flow Φ\PhiΦ on [0,1][0,1][0,1] whose time-111 map is fff:

Φ1=f.\Phi_1=f.Φ1​=f.

This is the flux correspondence in the compactly supported setting: Hc1(R4;R)=0H^1_c(\mathbb R^4;\mathbb R)=0Hc1​(R4;R)=0 forces the flux of any compactly supported symplectic isotopy to vanish, so it is homotopic to a Hamiltonian isotopy; and Sympc(R4)\mathrm{Symp}_c(\mathbb R^4)Sympc​(R4) is contractible (Gromov), so every compactly supported symplectomorphism lies in the identity component. It is the step that turns a symplectic packing into the Hamiltonian flow required by the goal.

Formalization Note. HasCompactSupport is taken on C2×R\mathbb C^2\times\mathbb RC2×R (compact support in space and time); for the existential claim this is equivalent to spatial compact support uniform in t∈[0,1]t\in[0,1]t∈[0,1], since HHH may be cut off in time.

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

theorem compact_symplectomorphism_hamiltonian (f : Phase 2 → Phase 2)
    (hf : IsSymplectomorphism f)
    (hcomp : ∃ K : Set (Phase 2), IsCompact K ∧ ∀ x ∉ K, f x = x) :
    ∃ (H : Phase 2 → ℝ → ℝ) (Φ : ℝ → Phase 2 → Phase 2),
      ContDiff ℝ ∞ (Function.uncurry H) ∧
      HasCompactSupport (Function.uncurry H) ∧
      IsHamiltonianFlow H Φ ∧ Φ 1 = f := by sorry

end SymplecticBallPacking
Source
McDuff–Salamon, Introduction to Symplectic Topology, 3rd ed., §10.2 (flux homomorphism; Ham = kernel of Flux); M. Gromov, Symp_c(ℝ⁴) contractible, see D. McDuff, A survey of the topological properties of symplectomorphism groups, Prop 1.1(i), https://arxiv.org/abs/math/0404340; M. M. R. Moreira, The flux homomorphism, Theorem 4, https://math.mit.edu/~miguel73/flux_hom.pdf.
Read-back

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

For every map f:C2→C2f:\mathbb C^2\to\mathbb C^2f:C2→C2 that is a global symplectomorphism — fff is C∞C^\inftyC∞ on all of C2\mathbb C^2C2, a topological embedding, its total Fréchet derivative preserves the standard symplectic form ω(u,v)=∑j(Re uj Im vj−Im uj Re vj)\omega(u,v)=\sum_j(\mathrm{Re}\,u_j\,\mathrm{Im}\,v_j-\mathrm{Im}\,u_j\,\mathrm{Re}\,v_j)ω(u,v)=∑j​(Reuj​Imvj​−Imuj​Revj​) at every point, and fff is bijective — and that has compact support (there is a compact K⊂C2K\subset\mathbb C^2K⊂C2 with f(x)=xf(x)=xf(x)=x for all x∉Kx\notin Kx∈/K), there exist H:C2→R→RH:\mathbb C^2\to\mathbb R\to\mathbb RH:C2→R→R and Φ:R→C2→C2\Phi:\mathbb R\to\mathbb C^2\to\mathbb C^2Φ:R→C2→C2 such that: (z,t)↦H(z,t)(z,t)\mapsto H(z,t)(z,t)↦H(z,t) is C∞C^\inftyC∞ on C2×R\mathbb C^2\times\mathbb RC2×R; the uncurried HHH has compact support (its support, the closure of the set where it is nonzero, is compact in C2×R\mathbb C^2\times\mathbb RC2×R); Φ\PhiΦ is a Hamiltonian flow of HHH on [0,1][0,1][0,1]; and Φ1=f\Phi_1=fΦ1​=f exactly (as functions).

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