Documentation

LeanPool.ArnoldKAM.Arnold1963.Geometry.GeneratingGlobal

Global generating transformations on a fixed source, their analytic inverses, and estimates used by the next iteration step.

The eroded phase source used to invert the generating input map.

Equations
Instances For

    The asymmetric action-angle erosion retained by the generating transformation.

    Equations
    Instances For

      A set-restricted inverse of the generating input map on its phase source.

      Equations
      Instances For

        The generating output map composed with the inverse generating input map.

        Equations
        Instances For

          The reverse generating transformation obtained by inverting the generating output map.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            structure KamProject.Arnold1963.GeneratingData {n : ℕ} (S : ComplexPhaseSpace n → ℂ) (G U : Set (ComplexSpace n)) (r : NNReal) (M : ℝ) :

            Analyticity and smallness data ensuring the generating transformation is well defined.

            Instances For
              theorem KamProject.Arnold1963.GeneratingData.inverse_eq_of_input {n : ℕ} {S : ComplexPhaseSpace n → ℂ} {G U : Set (ComplexSpace n)} {r : NNReal} {M : ℝ} (d : GeneratingData S G U r M) {x y : ComplexPhaseSpace n} (hx : x ∈ generatingSource G U r) (he : generatingInput S x = y) :
              generatingInverse S G U r y = x
              theorem KamProject.Arnold1963.GeneratingData.inverse_spec {n : ℕ} {S : ComplexPhaseSpace n → ℂ} {G U : Set (ComplexSpace n)} {r : NNReal} {M : ℝ} (d : GeneratingData S G U r M) {y : ComplexPhaseSpace n} (hy : y ∈ generatingTarget G U r) :
              generatingInverse S G U r y ∈ erosion (G ×ˢ U) (r + r) ∧ generatingInput S (generatingInverse S G U r y) = y ∧ (generatingInverse S G U r y).1 = y.1 ∧ (generatingInverse S G U r y).2 ∈ Metric.closedBall y.2 ↑r
              theorem KamProject.Arnold1963.GeneratingData.displacement_bound {n : ℕ} {S : ComplexPhaseSpace n → ℂ} {G U : Set (ComplexSpace n)} {r : NNReal} {M : ℝ} (d : GeneratingData S G U r M) :
              NormBoundOn (fun (y : ComplexPhaseSpace n) => generatingTransform S G U r y - y) (generatingTarget G U r) (M / ↑r)
              theorem KamProject.Arnold1963.GeneratingData.equations {n : ℕ} {S : ComplexPhaseSpace n → ℂ} {G U : Set (ComplexSpace n)} {r : NNReal} {M : ℝ} (d : GeneratingData S G U r M) {y : ComplexPhaseSpace n} (hy : y ∈ generatingTarget G U r) :
              (generatingTransform S G U r y).1 = y.1 + qGradient S (y.1, (generatingTransform S G U r y).2) ∧ y.2 = (generatingTransform S G U r y).2 + pGradient S (y.1, (generatingTransform S G U r y).2)