Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Determinant of the graph unitary W(Γg) W(Δ)−1W(\Gamma_g)\,W(\Delta)^{-1}W(Γg​)W(Δ)−1 on R4\mathbb{R}^4R4

Proved
HryniewiczCriterion.det_graphUnitary4_eq_div_star

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

hamiltonian-dynamicssymplectic-geometry

Let ggg be a real 4×44\times44×4 matrix and let Γg={(z,gz)}⊂R4⊕R4\Gamma_g=\{(z,gz)\}\subset\mathbb{R}^4\oplus\mathbb{R}^4Γg​={(z,gz)}⊂R4⊕R4 be its graph. Let Ag=graphBasis4 gA_g=\texttt{graphBasis4}\ gAg​=graphBasis4 g be the complex 4×44\times44×4 matrix whose columns encode a basis of Γg\Gamma_gΓg​, and set δ(g)=det⁡Ag\delta(g)=\det A_gδ(g)=detAg​. If δ(g)≠0\delta(g)\neq0δ(g)=0, then the unitary W(Γg) W(Δ)−1W(\Gamma_g)\,W(\Delta)^{-1}W(Γg​)W(Δ)−1, built from the Souriau map W(L)=UUTW(L)=UU^TW(L)=UUT, satisfies

det⁡(W(Γg) W(Δ)−1)=δ(g)δ(g)‾.\det\bigl(W(\Gamma_g)\,W(\Delta)^{-1}\bigr)=\frac{\delta(g)}{\overline{\delta(g)}} .det(W(Γg​)W(Δ)−1)=δ(g)​δ(g)​.

So the determinant angle of the graph unitary is twice the argument of the polynomial δ(g)\delta(g)δ(g). This reduces determinant-angle computations for paths in Sp(4)Sp(4)Sp(4) to tracking the argument of a single complex number.

Formalization note. δ(g)=4det⁡CA\delta(g)=4\det_{\mathbb{C}}Aδ(g)=4detC​A, where gz=Az+Czˉgz=Az+C\bar zgz=Az+Czˉ in the coordinates zk=qk+ipkz_k=q_k+ip_kzk​=qk​+ipk​.

Preamble
import Definitions.Def_HryniewiczCriterion_GraphAngle

open HryniewiczCriterion
open scoped ContDiff
Formal statement
theorem HryniewiczCriterion.det_graphUnitary4_eq_div_star (g : Matrix (Fin 4) (Fin 4) ℝ)
    (hg : (graphBasis4 g).det ≠ 0) :
    (graphUnitary4 g).det = (graphBasis4 g).det / star (graphBasis4 g).det := by sorry
Source
Standard computation for the Souriau map W(L)=UUTW(L)=UU^TW(L)=UUT; used for the determinant-angle argument in the index estimate of Hofer–Wysocki–Zehnder, The dynamics on three-dimensional strictly convex energy surfaces, Ann. of Math. 148 (1998), https://doi.org/10.2307/120994, Theorem 3.4, pp. 219–222.

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