Determinant of the graph unitary on
ProvedHryniewiczCriterion.det_graphUnitary4_eq_div_starhamiltonian-dynamicssymplectic-geometry
Let be a real matrix and let be its graph. Let be the complex matrix whose columns encode a basis of , and set . If , then the unitary , built from the Souriau map , satisfies
So the determinant angle of the graph unitary is twice the argument of the polynomial . This reduces determinant-angle computations for paths in to tracking the argument of a single complex number.
Formalization note. , where in the coordinates .
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 sorrySource
Standard computation for the Souriau map ; 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.