Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No short subcritical periodic orbits near the saddle-centers

Proved
BirkhoffGlobalSection.saddle_center_no_short_subcritical_orbits

by caleb · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamical-systemssymplectic-geometry

Let U⊂R4U \subset \mathbb{R}^4U⊂R4 be any open neighborhood of both s±=(±12,0,0,0)s_\pm = (\pm \tfrac12, 0, 0, 0)s±​=(±21​,0,0,0), and prescribe L>0L > 0L>0. There are an open neighborhood V⊂UV \subset UV⊂U of both saddle-centers and constants ε,η>0\varepsilon, \eta > 0ε,η>0 such that, for

0<μ<1,∣μ−12∣<ε,c<2+η,−c<h1(μ),0 < \mu < 1, \qquad |\mu - \tfrac12| < \varepsilon, \qquad c < 2 + \eta, \qquad -c < h_1(\mu),0<μ<1,∣μ−21​∣<ε,c<2+η,−c<h1​(μ),

every closed solution xxx of period TTT of the Levi--Civita Hamiltonian on the selected left component meeting VVV has period exceeding LLL:

x(R)∩V≠∅⟹L<T.x(\mathbb{R}) \cap V \ne \varnothing \quad\Longrightarrow\quad L < T.x(R)∩V=∅⟹L<T.

Here μ\muμ is the mass ratio, c=−hc = -hc=−h is the energy parameter, −c<h1(μ)-c < h_1(\mu)−c<h1​(μ) says the energy lies below the first critical value, and the period TTT need not be minimal.

This is the period-bound half of the arbitrarily-long-residence statement: short closed orbits cannot accumulate on the saddle-centers because there are no local periodic (Lyapunov) orbits on the subcritical side, so after shrinking the neighborhood every visiting closed orbit is long. The complementary long-residence segment is a separate obligation.

Formalization Note This is the U1U_1U1​ period-bound paragraph of the proof of Theorem 1.8 (the part using the absence of local subcritical Lyapunov orbits), specialized to the subcritical side and expressed in Levi--Civita coordinates. No residence segment is asserted here.

Preamble
import Definitions.Def_BirkhoffGlobalSection_DynamicalConvexity
Formal statement
namespace BirkhoffGlobalSection

/-- No short subcritical periodic orbits near the two saddle-centers: after
shrinking a neighborhood and the parameter strip, every subcritical periodic
orbit meeting the smaller neighborhood has period exceeding any prescribed
bound. The strict bound uses the absence of local subcritical Lyapunov
orbits. This isolates the `U₁` period-bound paragraph of Liu--Salomao,
Section 7, from the residence-segment argument. -/
theorem saddle_center_no_short_subcritical_orbits
    (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) →
            L < T := by sorry

end BirkhoffGlobalSection
Source
Liu--Salomao, Finite energy foliations and global dynamics in the restricted three-body problem, https://arxiv.org/html/2506.17867v2#S7. Proof of Theorem 1.8, paragraphs choosing U1U_1U1​ and asserting T>b−aT > b-aT>b−a via the absence of local subcritical Lyapunov orbits; Section 6.1 saddle-center description; Section 10 subcritical application. Neighborhood-refinement formulation in Levi--Civita coordinates.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me