Slow escape segment near the subcritical saddle-centers
ProvedBirkhoffGlobalSection.saddle_center_slow_escape_segmentLet be any open neighborhood of both , and prescribe . There are an open neighborhood of both saddle-centers and constants such that, for
every closed solution of the Levi--Civita Hamiltonian on the selected left component meeting contains a full length- time interval inside :
Here is the mass ratio, is the energy parameter, says the energy lies below the first critical value, and the period of need not be minimal.
This is the slow-escape half of the arbitrarily-long-residence statement: trajectories entering the shrunken neighborhood take an arbitrarily long prescribed time to leave the original one, because the vector field is arbitrarily slow near the saddle-centers. The complementary period bound (no short closed orbits) is a separate obligation.
Formalization Note This is the residence-segment paragraph of the proof of Theorem 1.8, specialized to the subcritical side and expressed in Levi--Civita coordinates. No lower bound on the period is asserted here.
import Definitions.Def_BirkhoffGlobalSection_DynamicalConvexity
namespace BirkhoffGlobalSection
/-- Slow escape near the two saddle-centers: after shrinking a neighborhood
and the parameter strip, every subcritical periodic orbit meeting the smaller
neighborhood contains a prescribed-length time interval inside the original
one. This isolates the `U₂` residence-segment paragraph of Liu--Salomao,
Section 7, from the period-bound argument. -/
theorem saddle_center_slow_escape_segment
(U : Set Phase) (hU : IsOpen U)
(hplus : (![1 / 2, 0, 0, 0] : Phase) ∈ U)
(hminus : (![-(1 / 2), 0, 0, 0] : Phase) ∈ U)
(L : ℝ) (hL : 0 < L) :
∃ V : Set Phase, IsOpen V ∧ V ⊆ U ∧
(![1 / 2, 0, 0, 0] : Phase) ∈ V ∧ (![-(1 / 2), 0, 0, 0] : Phase) ∈ V ∧
∃ ε η : ℝ, 0 < ε ∧ 0 < η ∧
∀ μ c : ℝ, 0 < μ → μ < 1 →
|μ - 1 / 2| < ε → c < 2 + η → belowFirstCriticalValue μ c →
∀ (x : ℝ → Phase) (T : ℝ),
IsPeriodicHamiltonianSolutionIn (leviCivitaHamiltonian μ c)
(leftEnergyComponent μ c) x T →
(∃ t : ℝ, x t ∈ V) →
∃ a : ℝ, ∀ t ∈ Set.Icc a (a + L), x t ∈ U := by sorry
end BirkhoffGlobalSection