Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.14 — a connected ω_σ(x) containing a regular periodic orbit equals it

Proved
TeschlODE.Planar.omegaLimitSet_eq_periodic_orbit

by mikedeng1 · 1 vote · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamical-systemslimit-setordinary-differential-equationsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1planar-systems

Let M⊆R2M \subseteq \mathbb{R}^2M⊆R2 be open, f∈C1(M,R2)f \in C^1(M, \mathbb{R}^2)f∈C1(M,R2), x∈Mx \in Mx∈M and σ∈{±}\sigma \in \{\pm\}σ∈{±}. Suppose ωσ(x)\omega_\sigma(x)ωσ​(x) is connected and contains a regular periodic orbit γ(y)\gamma(y)γ(y). Then

ωσ(x)=γ(y).\omega_\sigma(x) = \gamma(y).ωσ​(x)=γ(y).

Formalization Note. "Connected" is IsPreconnected (nonemptiness is automatic, since γ(y)⊆ωσ(x)\gamma(y) \subseteq \omega_\sigma(x)γ(y)⊆ωσ​(x)). "Regular periodic orbit γ(y)\gamma(y)γ(y)" is: yyy periodic, f(y)≠0f(y) \neq 0f(y)=0, and γ(y)⊆ωσ(x)\gamma(y) \subseteq \omega_\sigma(x)γ(y)⊆ωσ​(x). No compactness is assumed, as in the book.

Preamble
import Mathlib
import Definitions.Def_TeschlODE_Planar_orbit
import Definitions.Def_TeschlODE_Planar_omegaLimitSet
import Definitions.Def_TeschlODE_Planar_IsPeriodicPoint
Formal statement
namespace TeschlODE.Planar

/-- Teschl, Lemma 7.14 (p. 222): for `M ⊆ ℝ²` open, `f ∈ C¹(M, ℝ²)`, `x ∈ M` and `σ ∈ {±}`, if
`ω_σ(x)` is connected and contains a regular periodic orbit `γ(y)` (`y` periodic, `f y ≠ 0`,
`γ(y) ⊆ ω_σ(x)`), then `ω_σ(x) = γ(y)`. -/
theorem omegaLimitSet_eq_periodic_orbit {M : Set (Fin 2 → ℝ)} (hM : IsOpen M)
    {f : (Fin 2 → ℝ) → Fin 2 → ℝ} (hf : ContDiffOn ℝ 1 f M) (σ : Bool)
    {x : Fin 2 → ℝ} (hx : x ∈ M)
    (hconn : IsPreconnected (omegaLimitSet f M σ x))
    {y : Fin 2 → ℝ} (hy : IsPeriodicPoint f M y) (hyreg : f y ≠ 0)
    (hsub : orbit f M y ⊆ omegaLimitSet f M σ x) :
    omegaLimitSet f M σ x = orbit f M y := by sorry

end TeschlODE.Planar
Source
Teschl, Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012), p. 222, Lemma 7.14
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

The objects used are defined as follows.

  • Integral curves. For f:R2→R2f:\mathbb{R}^2\to\mathbb{R}^2f:R2→R2 and M⊆R2M\subseteq\mathbb{R}^2M⊆R2, an integral curve at xxx is a pair (K,φ)(K,\varphi)(K,φ) where:
    • KKK is an open interval containing 000;
    • φ:R→R2\varphi:\mathbb{R}\to\mathbb{R}^2φ:R→R2 satisfies φ(0)=x\varphi(0)=xφ(0)=x;
    • φ(r)∈M\varphi(r)\in Mφ(r)∈M and φ′(r)=f(φ(r))\varphi'(r)=f(\varphi(r))φ′(r)=f(φ(r)) (with φ\varphiφ differentiable at rrr) for all r∈Kr\in Kr∈K.
  • Lifetime. I(x)I(x)I(x) is the union of the intervals of all integral curves at xxx.
  • Flow. Φ(t,x)\Phi(t,x)Φ(t,x) for t∈I(x)t\in I(x)t∈I(x) is the value at ttt of one integral curve at xxx defined at ttt, chosen by the axiom of choice separately for each ttt. It is xxx otherwise.
  • Orbit. γ(y)={Φ(t,y):t∈I(y)}\gamma(y)=\{\Phi(t,y):t\in I(y)\}γ(y)={Φ(t,y):t∈I(y)}.
  • Limit set. ωσ(x)\omega_\sigma(x)ωσ​(x) is the set of z∈Mz\in Mz∈M admitting a sequence uk∈I(x)u_k\in I(x)uk​∈I(x) with:
    • uk→+∞u_k\to+\inftyuk​→+∞ (if σ=true\sigma=\text{true}σ=true) or uk→−∞u_k\to-\inftyuk​→−∞ (if σ=false\sigma=\text{false}σ=false);
    • Φ(uk,x)→z\Phi(u_k,x)\to zΦ(uk​,x)→z.
  • Periodic point. yyy is periodic when some T>0T>0T>0 has T∈I(y)T\in I(y)T∈I(y) and Φ(T,y)=y\Phi(T,y)=yΦ(T,y)=y.

Hypotheses. Let the following be given:

  • M⊆R2M\subseteq\mathbb{R}^2M⊆R2 open;
  • fff continuously differentiable on MMM;
  • a Boolean σ\sigmaσ;
  • x∈Mx\in Mx∈M;
  • ωσ(x)\omega_\sigma(x)ωσ​(x) is preconnected: it cannot be split into two disjoint nonempty relatively open pieces;
  • a point y∈R2y\in\mathbb{R}^2y∈R2 that is periodic;
  • f(y)≠0f(y)\neq0f(y)=0;
  • γ(y)⊆ωσ(x)\gamma(y)\subseteq\omega_\sigma(x)γ(y)⊆ωσ​(x).

Conclusion.

ωσ(x)=γ(y).\omega_\sigma(x)=\gamma(y).ωσ​(x)=γ(y).

Degenerate cases.

  • Location of yyy: the statement does not explicitly require y∈My\in My∈M. However, periodicity requires I(y)≠∅I(y)\neq\varnothingI(y)=∅, which forces y∈My\in My∈M.
  • Nonempty limit set: since yyy is periodic, 0∈I(y)0\in I(y)0∈I(y) and Φ(0,y)=y\Phi(0,y)=yΦ(0,y)=y, so γ(y)∋y\gamma(y)\ni yγ(y)∋y is nonempty. The inclusion hypothesis therefore forces ωσ(x)≠∅\omega_\sigma(x)\neq\varnothingωσ​(x)=∅.
  • Preconnectedness: it is also satisfied by the empty set, but that case is already excluded as above.
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 2026

    Confirmed by the mission captain (proposal self-audit).

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