Non-degenerate approximations of a star-shaped Hamiltonian that agree with it to first order along two given periodic orbits
OpenHryniewiczCriterion.exists_nondegenerate_approx_fixing_orbitsLet be a strictly star-shaped level and let , be periodic orbits of on . Then there is a sequence of Hamiltonians such that
- every level is strictly star-shaped;
- every is non-degenerate: no periodic orbit of on , prime or multiply covered, has as a Floquet multiplier of its linearized return map on ;
- and at every point of ;
- in .
in means: for every and every compact , uniformly on . A Hamiltonian is non-degenerate when for every periodic orbit on (prime or not) and its linearized flow , the linearized return map on , written in the global frame as the matrix of linearizedXiPath, does not have as an eigenvalue.
By (3), along both orbits, so and stay periodic orbits of every . Only the -jet transverse to the orbits is changed, which is what makes and themselves non-degenerate.
In contact language, corresponds to the form on with in and , on the two orbits. Non-degenerate forms are residual in (Kupka–Smale for Reeb flows), and the residual set can be chosen inside the forms with a prescribed -jet along finitely many closed orbits. This is the perturbation used in the proof of Lemma 3.12 of Hryniewicz (2014).
import Definitions.Def_HryniewiczCriterion_ConleyZehnder import Definitions.Def_HryniewiczCriterion_GlobalSection import Definitions.Def_HryniewiczCriterion_SelfLinking open HryniewiczCriterion
theorem HryniewiczCriterion.exists_nondegenerate_approx_fixing_orbits (H : R4 → ℝ) (hS : IsStrictlyStarShapedLevel H) (P Q : PeriodicOrbit H) :
∃ Hs : ℕ → R4 → ℝ, (∀ k, IsStrictlyStarShapedLevel (Hs k)) ∧
(∀ k (R : PeriodicOrbit (Hs k)) (Y : ℝ → (R4 →L[ℝ] R4)), IsLinearizedFlow (Hs k) R.x Y →
∀ v : Fin 2 → ℝ, (linearizedXiPath (Hs k) R Y 1).mulVec v = v → v = 0) ∧
(∀ k, ∀ y ∈ P.image ∪ Q.image, Hs k y = H y ∧ fderiv ℝ (Hs k) y = fderiv ℝ H y) ∧
(∀ m : ℕ, ∀ K : Set R4, IsCompact K →
TendstoUniformlyOn (fun k => iteratedFDeriv ℝ m (Hs k)) (iteratedFDeriv ℝ m H) Filter.atTop K) := by sorry