Closing the normalization induction from one step #
This file reduces the all-orders classical normalization principle to a single reusable closure theorem. Once every jointly analytic first integral can be normalized once—preserving joint analyticity and the first-integral equation—classical choice and primitive recursion construct all orders automatically.
The one-step statement needed from the Poincaré-set obstruction and analytic Hadamard division.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Celestial-mechanics half of one normalization step: the mass-zero coefficient of every analytic first integral is a globally analytic function of the Kepler Hamiltonian.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Analytic half of one normalization step: division by the mass coordinate preserves joint analyticity after the zeroth coefficient has been cancelled on the actual mass-zero domain.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Pointwise form of analytic Hadamard division on the only nontrivial slice. Ordinary division already handles every point with nonzero mass, so this is equivalent to the global joint-analytic division principle above.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Parameterized analytic division is reduced exactly to the removable mass-zero slice.
The functional-dependence and analytic-division halves together give the reusable one-step closure theorem; preservation of the first-integral equation is already formal.
A jointly analytic first integral, bundled so a normalization step can be iterated.
- family : ℝ → PhaseSpace → ℝ
The parameterized phase-space function at the current normalization stage.
- analytic : IsJointlyAnalytic δ self.family
- firstIntegral : IsFirstIntegralFamily δ self.family
Instances For
The energy function selected for one normalization state.
Equations
- LeanPool.PoincareThreeBody.selectedEnergy hstep hδ current = Classical.choose ⋯
Instances For
Apply one selected normalization step to a bundled state.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The recursively selected sequence of analytic first integrals.
Equations
- One or more equations did not get rendered due to their size.
- LeanPool.PoincareThreeBody.normalizationStateSequence hstep hδ initial 0 = initial
Instances For
The energy function selected at each recursive stage.
Equations
- LeanPool.PoincareThreeBody.normalizationEnergySequence hstep hδ initial n = LeanPool.PoincareThreeBody.selectedEnergy ⋯ hδ (LeanPool.PoincareThreeBody.normalizationStateSequence ⋯ hδ initial n)
Instances For
The recursively bundled family agrees with the explicit iteration used by the all-orders endpoint.
A one-step normalization closure theorem supplies the complete all-orders principle.
Thus the exact challenge theorem follows from the one-step closure theorem.
Final decomposition of the exact theorem into its two remaining reusable inputs.