Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Hamiltonian flows preserve the symplectic form

Open
SymplecticBallPacking.hamiltonianFlow_symplectic

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

analysisdifferential-geometrysymplectic-geometry

Hamiltonian flows act by symplectomorphisms. Let H:Cn×R→RH:\mathbb C^n\times\mathbb R\to\mathbb RH:Cn×R→R be smooth and let Φ\PhiΦ be its Hamiltonian flow on [0,1][0,1][0,1]. Then for every t∈[0,1]t\in[0,1]t∈[0,1], every base point xxx, and all tangent vectors u,vu,vu,v,

ω(dΦt(x) u,  dΦt(x) v)=ω(u,v),\omega\bigl(d\Phi_t(x)\,u,\;d\Phi_t(x)\,v\bigr)=\omega(u,v),ω(dΦt​(x)u,dΦt​(x)v)=ω(u,v),

where ω\omegaω is the standard symplectic form. This is the foundational fact that every Hamiltonian diffeomorphism is a symplectomorphism, and it connects the goal's Hamiltonian flow to the symplectic packings of the milestones.

Formalization Note. The derivative is the total Fréchet derivative fderiv; the smoothness of Φt\Phi_tΦt​ in xxx is a consequence of the smoothness of HHH and the flow equation, and must be established in the proof.

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

theorem hamiltonianFlow_symplectic {n : ℕ} (H : Phase n → ℝ → ℝ)
    (hH : ContDiff ℝ ∞ (Function.uncurry H))
    (Φ : ℝ → Phase n → Phase n) (hΦ : IsHamiltonianFlow H Φ) :
    ∀ t ∈ Icc (0 : ℝ) 1, ∀ x u v : Phase n,
      standardForm (fderiv ℝ (Φ t) x u) (fderiv ℝ (Φ t) x v) = standardForm u v := by sorry

end SymplecticBallPacking
Source
McDuff–Salamon, Introduction to Symplectic Topology, 3rd ed., Oxford University Press (2017), §3.2 (Hamiltonian vector fields; Hamiltonian flows are symplectomorphisms).
Read-back

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

For every natural number nnn, every smooth H:Cn→R→RH:\mathbb C^n\to\mathbb R\to\mathbb RH:Cn→R→R (i.e. (z,t)↦H(z,t)(z,t)\mapsto H(z,t)(z,t)↦H(z,t) is C∞C^\inftyC∞ on Cn×R\mathbb C^n\times\mathbb RCn×R), and every Φ:R→Cn→Cn\Phi:\mathbb R\to\mathbb C^n\to\mathbb C^nΦ:R→Cn→Cn that is a Hamiltonian flow of HHH on [0,1][0,1][0,1] (meaning Φ0(x)=x\Phi_0(x)=xΦ0​(x)=x for all xxx, and for all t∈[0,1]t\in[0,1]t∈[0,1], xxx the curve s↦Φs(x)s\mapsto\Phi_s(x)s↦Φs​(x) has derivative within [0,1][0,1][0,1] at ttt equal to XH(⋅,t)(Φt(x))X_{H(\cdot,t)}(\Phi_t(x))XH(⋅,t)​(Φt​(x)) with XF(z)j=∂F/∂pj−i ∂F/∂qjX_F(z)_j=\partial F/\partial p_j-i\,\partial F/\partial q_jXF​(z)j​=∂F/∂pj​−i∂F/∂qj​), the following holds: for every t∈[0,1]t\in[0,1]t∈[0,1], every x∈Cnx\in\mathbb C^nx∈Cn, and all u,v∈Cnu,v\in\mathbb C^nu,v∈Cn,

∑j(Re(dΦt(x)u)j Im(dΦt(x)v)j−Im(dΦt(x)u)j Re(dΦt(x)v)j)=∑j(Re uj Im vj−Im uj Re vj),\sum_j\bigl(\mathrm{Re}(d\Phi_t(x)u)_j\,\mathrm{Im}(d\Phi_t(x)v)_j-\mathrm{Im}(d\Phi_t(x)u)_j\,\mathrm{Re}(d\Phi_t(x)v)_j\bigr)=\sum_j\bigl(\mathrm{Re}\,u_j\,\mathrm{Im}\,v_j-\mathrm{Im}\,u_j\,\mathrm{Re}\,v_j\bigr),j∑​(Re(dΦt​(x)u)j​Im(dΦt​(x)v)j​−Im(dΦt​(x)u)j​Re(dΦt​(x)v)j​)=j∑​(Reuj​Imvj​−Imuj​Revj​),

where dΦt(x)d\Phi_t(x)dΦt​(x) is the total Fréchet derivative of Φt\Phi_tΦt​ at xxx (returning 000 if Φt\Phi_tΦt​ is not differentiable at xxx). The claim is for all nnn, including n=0n=0n=0 (where C0\mathbb C^0C0 is a point and both sides are 000).

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