Documentation

LeanPool.ArnoldKAM.Arnold1963.Geometry.HamiltonianLocalization

Nondegeneracy of the Hamiltonian Hessian supplies local frequency data. HamiltonianPatch is an output format whose existence is proved before the perturbation is chosen.

noncomputable def KamProject.Arnold1963.hessianDet {n : ℕ} (H₀ : ComplexSpace n → ℂ) (p : ComplexSpace n) :

The determinant of the derivative of the action-frequency map.

Equations
Instances For
    theorem KamProject.Arnold1963.frequency_derivative_apply {n : ℕ} {H₀ : ComplexSpace n → ℂ} {p : ComplexSpace n} (ha : AnalyticAt ℂ H₀ p) (v : ComplexSpace n) (j : Fin n) :
    (fderiv ℂ (actionFrequency H₀) p) v j = ((fderiv ℂ (fderiv ℂ H₀) p) v) (Pi.single j 1)
    theorem KamProject.Arnold1963.hessianDet_eq_matrix {n : ℕ} {H₀ : ComplexSpace n → ℂ} {p : ComplexSpace n} (ha : AnalyticAt ℂ H₀ p) :
    hessianDet H₀ p = Matrix.det fun (i j : Fin n) => ((fderiv ℂ (fderiv ℂ H₀) p) (Pi.single j 1)) (Pi.single i 1)
    structure KamProject.Arnold1963.HamiltonianPatch (n : ℕ) (H₀ : ComplexSpace n → ℂ) (ambient : Set (ComplexSpace n)) :

    A compact Hamiltonian patch with an analytic frequency chart and uniform derivative bounds.

    Instances For

      The frequency polydisc associated with the Hamiltonian patch.

      Equations
      Instances For
        noncomputable def KamProject.Arnold1963.HamiltonianPatch.typeConstant {n : ℕ} {H₀ : ComplexSpace n → ℂ} {ambient : Set (ComplexSpace n)} (c : HamiltonianPatch n H₀ ambient) :

        The geometric type constant for the patch's frequency polydisc.

        Equations
        Instances For
          theorem KamProject.Arnold1963.HamiltonianPatch.typeD {n : ℕ} {H₀ : ComplexSpace n → ℂ} {ambient : Set (ComplexSpace n)} (c : HamiltonianPatch n H₀ ambient) (hn : 0 < n) :
          theorem KamProject.Arnold1963.HamiltonianPatch.exists_at {n : ℕ} {H₀ : ComplexSpace n → ℂ} {ambient : Set (ComplexSpace n)} {x : RealSpace n} {V : Set (ComplexSpace n)} (hV : V ∈ nhds (complexify x)) (hVG : V ⊆ ambient) (ha : AnalyticOnNhd ℂ H₀ ambient) (hc : ∀ p ∈ ambient, H₀ (conjVec p) = star (H₀ p)) (hnd : hessianDet H₀ (complexify x) ≠ 0) :
          ∃ (c : HamiltonianPatch n H₀ ambient), c.domain ⊆ V ∧ complexify x ∈ interior c.domain
          theorem KamProject.Arnold1963.HamiltonianPatch.exists_finite_cover {n : ℕ} {H₀ : ComplexSpace n → ℂ} {ambient : Set (ComplexSpace n)} {K : Set (RealSpace n)} (hK : IsCompact K) (hKG : ∀ x ∈ K, complexify x ∈ interior ambient) (ha : AnalyticOnNhd ℂ H₀ ambient) (hc : ∀ p ∈ ambient, H₀ (conjVec p) = star (H₀ p)) (hnd : ∀ x ∈ K, hessianDet H₀ (complexify x) ≠ 0) :
          ∃ (s : Finset (HamiltonianPatch n H₀ ambient)), K ⊆ ⋃ c ∈ s, realSlice (interior c.domain)