Polar-angle criterion for winding above one in
ProvedHryniewiczCriterion.polar_angle_windingInterval_gt_onecontact-geometryhamiltonian-dynamicssymplectic-geometry
Let be smooth with , and let be its continuous polar angle: with symmetric positive definite and . Let be the eigenvalues of the graph unitary in , and their arguments with . If
then every vector turns strictly more than once under : the winding interval lies in .
This is the two-dimensional index computation behind HWZ (3.45)–(3.46), in the lower semicontinuous convention of Hryniewicz (5): it converts a bound on the polar angle of the contact path into the winding bound that characterizes Conley–Zehnder index at least three.
Preamble
import Definitions.Def_HryniewiczCriterion_GraphAngle open HryniewiczCriterion open scoped ContDiff
Formal statement
theorem HryniewiczCriterion.polar_angle_windingInterval_gt_one (φ : ℝ → Matrix (Fin 2) (Fin 2) ℝ)
(hφ : ContDiffOn ℝ ∞ (fun t i j => φ t i j) (Set.Icc 0 1))
(hsymp : ∀ t ∈ Set.Icc (0 : ℝ) 1, (φ t).det = 1) (h0 : φ 0 = 1)
(α : ℝ → ℝ) (hα : IsPolarAngleLift φ α)
(h : 4 * Real.pi + eigenAngleSum (graphUnitary2 (φ 1)) ≤ 2 * α 1) :
∀ d ∈ windingInterval φ, 1 < d := 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, proof of Theorem 3.4, (3.45)–(3.46), p. 222, in the winding-interval form of Hryniewicz, https://arxiv.org/html/1105.2077v5, Section 2.1.1, equations (4)–(5). Reduction lemma; not a verbatim numbered assertion.