Eigen-angle sum of the graph unitary of
ProvedHryniewiczCriterion.eigenAngleSum_graphUnitary4_blockOnehamiltonian-dynamicssymplectic-geometry
For every real matrix ,
with eigenvalues counted with algebraic multiplicity and , . Here and are graphUnitary4 and graphUnitary2.
Proof idea: after permuting rows to and columns to , graphBasis4 (blockOne g) is block diagonal with blocks graphBasis2 1 and graphBasis2 g. So is conjugate to , and the charpoly factors as . If graphBasis2 g is singular, both unitaries are by the convention . Then both sides equal , since .
Preamble
import Definitions.Def_HryniewiczCriterion_GraphAngle open HryniewiczCriterion open scoped ContDiff ComplexOrder
Formal statement
theorem HryniewiczCriterion.eigenAngleSum_graphUnitary4_blockOne (g : Matrix (Fin 2) (Fin 2) ℝ) :
eigenAngleSum (graphUnitary4 (blockOne g)) = 4 * Real.pi + eigenAngleSum (graphUnitary2 g) := by sorrySource
Block structure of the Souriau map on a symplectic direct sum; used for the kernel count (3.42) 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, p. 221.