Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The graph unitary of a positive symplectic path is a positive unitary path

Proved
HryniewiczCriterion.graphUnitary4_positive_path

by Mazecto · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

hamiltonian-dynamicssymplectic-geometry

Let Y^:R→R4×4\hat Y:\mathbb{R}\to\mathbb{R}^{4\times4}Y^:R→R4×4 solve Y^′=J S(t) Y^\hat Y'=J\,S(t)\,\hat YY^′=JS(t)Y^ with Y^(0)=I\hat Y(0)=IY^(0)=I, where every S(t)S(t)S(t) is symmetric positive definite and JJJ is the standard complex structure in the coordinates (q1,p1,q2,p2)(q_1,p_1,q_2,p_2)(q1​,p1​,q2​,p2​). Let V(t)=W(ΓY^(t)) W(Δ)−1V(t)=W(\Gamma_{\hat Y(t)})\,W(\Delta)^{-1}V(t)=W(ΓY^(t)​)W(Δ)−1 be the graph unitary (graphUnitary4). Then V(0)=IV(0)=IV(0)=I, every V(t)V(t)V(t) is unitary, and VVV is a positive path:

V′(t)=i Q(t) V(t)with Q(t) Hermitian positive definite.V'(t)=i\,Q(t)\,V(t)\qquad\text{with } Q(t) \text{ Hermitian positive definite.}V′(t)=iQ(t)V(t)with Q(t) Hermitian positive definite.

Proof idea: Y^(t)\hat Y(t)Y^(t) is symplectic, so ΓY^(t)\Gamma_{\hat Y(t)}ΓY^(t)​ is Lagrangian in (R4⊕R4,−ω0⊕ω0)(\mathbb{R}^4\oplus\mathbb{R}^4,-\omega_0\oplus\omega_0)(R4⊕R4,−ω0​⊕ω0​) and V(t)V(t)V(t) is unitary. For a unitary frame UUU of a Lagrangian path, U∗U′=R+iPU^*U'=R+iPU∗U′=R+iP with RRR real antisymmetric and PPP the crossing form, so (UUT)′=2i (UPU∗) UUT(UU^{\mathsf T})'=2i\,(UPU^*)\,UU^{\mathsf T}(UUT)′=2i(UPU∗)UUT. On the graph the crossing form is (z,Y^z)↦ω0(Y^z,JSY^z)=⟨SY^z,Y^z⟩>0(z,\hat Yz)\mapsto\omega_0(\hat Yz,JS\hat Yz)=\langle S\hat Yz,\hat Yz\rangle>0(z,Y^z)↦ω0​(Y^z,JSY^z)=⟨SY^z,Y^z⟩>0.

Preamble
import Definitions.Def_HryniewiczCriterion_GraphAngle

open HryniewiczCriterion
open scoped ContDiff ComplexOrder
Formal statement
theorem HryniewiczCriterion.graphUnitary4_positive_path (Ŷ S : ℝ → Matrix (Fin 4) (Fin 4) ℝ)
    (hSpos : ∀ t, (S t).PosDef) (h0 : Ŷ 0 = 1)
    (hd : ∀ t : ℝ, ∀ i j : Fin 4, HasDerivAt (fun s => Ŷ s i j) ((symplJ4 * S t * Ŷ t) i j) t) :
    graphUnitary4 (Ŷ 0) = 1 ∧ (∀ t, star (graphUnitary4 (Ŷ t)) * graphUnitary4 (Ŷ t) = 1) ∧
      ∃ Q : ℝ → Matrix (Fin 4) (Fin 4) ℂ, ∀ t, (Q t).PosDef ∧
        ∀ i j : Fin 4, HasDerivAt (fun s => graphUnitary4 (Ŷ s) i j)
          ((Complex.I • (Q t * graphUnitary4 (Ŷ t))) i j) t := by sorry
Source
Positivity of the crossing form of the graph of a positive symplectic path; Robbin–Salamon, The Maslov index for paths, Topology 32 (1993), https://doi.org/10.1016/0040-9383(93)90052-W, Section 1, and the Souriau map W(L)=UUTW(L)=UU^{\mathsf T}W(L)=UUT (Arnold). Used in Hofer–Wysocki–Zehnder, The dynamics on three-dimensional strictly convex energy surfaces, Ann. of Math. 148 (1998), https://doi.org/10.2307/120994, proof of Theorem 3.4, (3.43), p. 221.

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