Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.15 — at most one orbit in ω_σ(x) connects two given fixed points

Proved
TeschlODE.Planar.unique_connecting_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, σ∈{±}\sigma \in \{\pm\}σ∈{±}, and suppose ωσ(x)\omega_\sigma(x)ωσ​(x) is compact. Let x±∈ωσ(x)x_\pm \in \omega_\sigma(x)x±​∈ωσ​(x) be distinct fixed points. Then there exists at most one orbit γ(y)⊆ωσ(x)\gamma(y) \subseteq \omega_\sigma(x)γ(y)⊆ωσ​(x) with

ω+(y)={x+},ω−(y)={x−}.\omega_+(y) = \{x_+\}, \qquad \omega_-(y) = \{x_-\}.ω+​(y)={x+​},ω−​(y)={x−​}.

Formalization Note. "At most one" is stated as: two such orbits γ(y1),γ(y2)\gamma(y_1), \gamma(y_2)γ(y1​),γ(y2​) are equal. The book's ω±(y)=x±\omega_\pm(y) = x_\pmω±​(y)=x±​ identifies a one-point set with its point.

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

/-- Teschl, Lemma 7.15 (p. 223): let `M ⊆ ℝ²` be open, `f ∈ C¹(M, ℝ²)`, `x ∈ M`, `σ ∈ {±}`, and
suppose `ω_σ(x)` is compact. Let `x₊ ≠ x₋` be fixed points in `ω_σ(x)`. Then there is at most one
orbit `γ(y) ⊆ ω_σ(x)` with `ω₊(y) = {x₊}` and `ω₋(y) = {x₋}`: any two such orbits coincide. -/
theorem unique_connecting_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) (hcpt : IsCompact (omegaLimitSet f M σ x))
    {xp xm : Fin 2 → ℝ} (hxp : xp ∈ omegaLimitSet f M σ x) (hxm : xm ∈ omegaLimitSet f M σ x)
    (hfxp : f xp = 0) (hfxm : f xm = 0) (hne : xp ≠ xm)
    {y₁ y₂ : Fin 2 → ℝ}
    (h₁ : orbit f M y₁ ⊆ omegaLimitSet f M σ x)
    (h₁p : omegaLimitSet f M true y₁ = {xp}) (h₁m : omegaLimitSet f M false y₁ = {xm})
    (h₂ : orbit f M y₂ ⊆ omegaLimitSet f M σ x)
    (h₂p : omegaLimitSet f M true y₂ = {xp}) (h₂m : omegaLimitSet f M false y₂ = {xm}) :
    orbit f M y₁ = 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. 223, Lemma 7.15
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 ppp 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)=p\varphi(0)=pφ(0)=p;
    • φ(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(p)I(p)I(p) is the union of the intervals of all integral curves at ppp.
  • Flow. Φ(t,p)\Phi(t,p)Φ(t,p) for t∈I(p)t\in I(p)t∈I(p) is the value at ttt of one integral curve at ppp defined at ttt, chosen by the axiom of choice separately for each ttt. It is ppp otherwise.
  • Orbit. γ(p)={Φ(t,p):t∈I(p)}\gamma(p)=\{\Phi(t,p):t\in I(p)\}γ(p)={Φ(t,p):t∈I(p)}.
  • Limit sets. For a Boolean τ\tauτ, ωτ(p)\omega_\tau(p)ωτ​(p) is the set of z∈Mz\in Mz∈M admitting a sequence uk∈I(p)u_k\in I(p)uk​∈I(p) with:
    • uk→+∞u_k\to+\inftyuk​→+∞ (if τ=true\tau=\text{true}τ=true) or uk→−∞u_k\to-\inftyuk​→−∞ (if τ=false\tau=\text{false}τ=false);
    • Φ(uk,p)→z\Phi(u_k,p)\to zΦ(uk​,p)→z.
  • Notation. Write ω+=ωtrue\omega_+=\omega_{\text{true}}ω+​=ωtrue​ and ω−=ωfalse\omega_-=\omega_{\text{false}}ω−​=ωfalse​.

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 with ωσ(x)\omega_\sigma(x)ωσ​(x) compact;
  • points x+,x−∈ωσ(x)x_+,x_-\in\omega_\sigma(x)x+​,x−​∈ωσ​(x) with f(x+)=0f(x_+)=0f(x+​)=0, f(x−)=0f(x_-)=0f(x−​)=0 and x+≠x−x_+\neq x_-x+​=x−​;
  • points y1,y2∈R2y_1,y_2\in\mathbb{R}^2y1​,y2​∈R2 such that, for i=1,2i=1,2i=1,2:
γ(yi)⊆ωσ(x),ω+(yi)={x+},ω−(yi)={x−}.\gamma(y_i)\subseteq\omega_\sigma(x),\qquad \omega_+(y_i)=\{x_+\},\qquad \omega_-(y_i)=\{x_-\}.γ(yi​)⊆ωσ​(x),ω+​(yi​)={x+​},ω−​(yi​)={x−​}.

Conclusion.

γ(y1)=γ(y2).\gamma(y_1)=\gamma(y_2).γ(y1​)=γ(y2​).

Degenerate cases.

  • Location of yiy_iyi​: membership yi∈My_i\in Myi​∈M is not stated. It follows from ω±(yi)\omega_\pm(y_i)ω±​(yi​) being nonempty, which requires I(yi)≠∅I(y_i)\neq\varnothingI(yi​)=∅.
  • Nonempty limit set: the hypotheses force ωσ(x)\omega_\sigma(x)ωσ​(x) to contain at least the two distinct points x±x_\pmx±​, so it cannot be empty.
  • yiy_iyi​ equal to x+x_+x+​ or x−x_-x−​: not excluded.
  • Fixed points in the definitions: the limit sets ω±(yi)\omega_\pm(y_i)ω±​(yi​) are computed with the choice-based flow. The conditions f(x±)=0f(x_\pm)=0f(x±​)=0 are the only information given about x±x_\pmx±​ beyond membership in ωσ(x)\omega_\sigma(x)ωσ​(x).
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