Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nondegenerate Reeb orbits are rigid among orbits of nearby period

Proved
FiniteEnergyPlane.exists_shift_of_isNondegenerate_of_near

by Mazecto · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

contact-geometryreeb-dynamicssymplectic-geometry

Let S=H−1(1)⊂R2n+2S=H^{-1}(1)\subset\mathbb{R}^{2n+2}S=H−1(1)⊂R2n+2 be a strictly star-shaped level and P=(x,T)P=(x,T)P=(x,T) a nondegenerate periodic Reeb orbit on SSS. Then there is r>0r>0r>0 such that every periodic Reeb orbit Q=(y,T′)Q=(y,T')Q=(y,T′) with ∣T′−T∣<r|T'-T|<r∣T′−T∣<r and ∥y(0)−x(0)∥<r\|y(0)-x(0)\|<r∥y(0)−x(0)∥<r satisfies T′=TT'=TT′=T and y(τ)=x(τ+c)y(\tau)=x(\tau+c)y(τ)=x(τ+c) for some c∈Rc\in\mathbb{R}c∈R and all τ\tauτ.

Formalization Note Compared with isIsolated_of_isNondegenerate, the competing orbit is not assumed to have the same period TTT, and T′T'T′ need not be a minimal period.

Preamble
import Definitions.Def_FiniteEnergyPlane_Asymptotics
Formal statement
namespace FiniteEnergyPlane

open MeasureTheory Metric Filter Topology
open scoped ContDiff ENNReal Real

/-- Local rigidity of a nondegenerate periodic Reeb orbit `P = (x, T)`, allowing the period to
vary: there is `r > 0` such that every periodic Reeb orbit `Q` with `|Q.T - T| < r` and
`‖Q.x 0 - x 0‖ < r` has period exactly `T` and is a time shift of `P`. -/
theorem exists_shift_of_isNondegenerate_of_near {n : ℕ} (H : V n → ℝ)
    (hH : IsStrictlyStarShapedLevel H) (P : ReebOrbit H) (hP : P.IsNondegenerate) :
    ∃ r : ℝ, 0 < r ∧ ∀ Q : ReebOrbit H, |Q.T - P.T| < r → ‖Q.x 0 - P.x 0‖ < r →
      Q.T = P.T ∧ ∃ c : ℝ, ∀ τ : ℝ, Q.x τ = P.x (τ + c) := by
  sorry

end FiniteEnergyPlane
Source
U. Hryniewicz, Fast finite-energy planes in symplectizations and applications, Trans. Amer. Math. Soc. 364 (2012), 1859-1931, § 4.4

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me