Eigenvalues of the graph unitary of in
ProvedHryniewiczCriterion.graphUnitary2_polar_rootslinear-algebrasymplectic-geometry
Let be a real symmetric positive definite matrix with , let , and let (every element of has this polar form). Put . Then the eigenvalues of the graph unitary (Souriau map of the graph , the diagonal) are
counted with multiplicity. In particular the rotation part of is the mean of the two eigen-angles, and the half-gap depends only on .
Preamble
import Definitions.Def_HryniewiczCriterion_GraphAngle open HryniewiczCriterion open scoped ContDiff
Formal statement
theorem HryniewiczCriterion.graphUnitary2_polar_roots (x : ℝ) {P : Matrix (Fin 2) (Fin 2) ℝ} (hP : P.PosDef)
(hdet : P.det = 1) :
(graphUnitary2 (rotationMatrix x * P)).charpoly.roots =
{Complex.exp ((x + Real.arccos (2 / (P 0 0 + P 1 1))) * Complex.I),
Complex.exp ((x - Real.arccos (2 / (P 0 0 + P 1 1))) * Complex.I)} := by sorrySource
Hofer–Wysocki–Zehnder, The dynamics on three-dimensional strictly convex energy surfaces, Ann. of Math. 148 (1998), https://doi.org/10.2307/120994, the eigenvalue computation behind (3.45)–(3.46), p. 222; Souriau map as in Robbin–Salamon, The Maslov index for paths, Topology 32 (1993). Explicit formula; not a verbatim numbered assertion.