Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7.12 — a minimal compact σ invariant set is a periodic orbit

Proved
TeschlODE.Planar.minimal_set_is_periodic_orbit

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

dynamical-systemsordinary-differential-equationsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1periodic-orbitplanar-systems

Let M⊆R2M \subseteq \mathbb{R}^2M⊆R2 be open and f∈C1(M,R2)f \in C^1(M, \mathbb{R}^2)f∈C1(M,R2). A nonempty, compact, σ\sigmaσ invariant set C⊆MC \subseteq MC⊆M is minimal if it contains no proper σ\sigmaσ invariant subset that is nonempty and compact (p. 195). Every minimal compact σ\sigmaσ invariant set is a periodic orbit:

C=γ(x)for some periodic point x∈C.C = \gamma(x) \quad\text{for some periodic point } x \in C.C=γ(x)for some periodic point x∈C.

In dimension three and higher this fails (orbits can be dense on an invariant torus), so the corollary isolates what is special about the plane.

Formalization Note. σ\sigmaσ invariance is written out as γσ(x)⊆C\gamma_\sigma(x) \subseteq Cγσ​(x)⊆C for all x∈Cx \in Cx∈C (6.17); minimality as: every nonempty compact σ\sigmaσ invariant D⊆CD \subseteq CD⊆C equals CCC. A fixed orbit (period zero) counts as a periodic orbit.

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

/-- Teschl, Corollary 7.12 (p. 222), with the definition of a minimal set from p. 195: let
`M ⊆ ℝ²` be open and `f ∈ C¹(M, ℝ²)`. Let `C ⊆ M` be a minimal compact `σ` invariant set, i.e.
`C` is nonempty, compact and `σ` invariant (`γ_σ(x) ⊆ C` for `x ∈ C`, (6.17)), and every nonempty
compact `σ` invariant subset of `C` equals `C`. Then `C` is a periodic orbit: `C = γ(x)` for a
periodic point `x ∈ C` (a fixed point, of period zero, is allowed). -/
theorem minimal_set_is_periodic_orbit {M : Set (Fin 2 → ℝ)} (hM : IsOpen M)
    {f : (Fin 2 → ℝ) → Fin 2 → ℝ} (hf : ContDiffOn ℝ 1 f M) (σ : Bool)
    {C : Set (Fin 2 → ℝ)} (hCM : C ⊆ M) (hCne : C.Nonempty) (hCc : IsCompact C)
    (hCinv : ∀ x ∈ C, halfOrbit f M σ x ⊆ C)
    (hCmin : ∀ D ⊆ C, D.Nonempty → IsCompact D → (∀ x ∈ D, halfOrbit f M σ x ⊆ D) → D = C) :
    ∃ x ∈ C, IsPeriodicPoint f M x ∧ C = orbit f M x := by sorry

end TeschlODE.Planar
Source
Teschl, Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012), p. 222, Corollary 7.12 (minimal sets: p. 195)
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.
  • Orbit. γ(x)={Φ(t,x):t∈I(x)}\gamma(x)=\{\Phi(t,x):t\in I(x)\}γ(x)={Φ(t,x):t∈I(x)}.
  • Half-orbit. γσ(x)={Φ(t,x):t∈I(x), t>0}\gamma_\sigma(x)=\{\Phi(t,x):t\in I(x),\ t>0\}γσ​(x)={Φ(t,x):t∈I(x), t>0} for σ=true\sigma=\text{true}σ=true, and the same with t<0t<0t<0 for σ=false\sigma=\text{false}σ=false. The point xxx itself is not automatically included.
  • Periodic point. xxx is periodic when some T>0T>0T>0 has T∈I(x)T\in I(x)T∈I(x) and Φ(T,x)=x\Phi(T,x)=xΦ(T,x)=x.

Hypotheses. Let the following be given:

  • M⊆R2M\subseteq\mathbb{R}^2M⊆R2 open;
  • fff continuously differentiable on MMM;
  • a Boolean σ\sigmaσ;
  • a set C⊆R2C\subseteq\mathbb{R}^2C⊆R2 with all of:
    • C⊆MC\subseteq MC⊆M;
    • C≠∅C\neq\varnothingC=∅;
    • CCC compact;
    • σ\sigmaσ-invariance: γσ(x)⊆C\gamma_\sigma(x)\subseteq Cγσ​(x)⊆C for every x∈Cx\in Cx∈C;
    • minimality: every set D⊆CD\subseteq CD⊆C that is nonempty, compact and satisfies γσ(x)⊆D\gamma_\sigma(x)\subseteq Dγσ​(x)⊆D for all x∈Dx\in Dx∈D equals CCC.

Conclusion. There exists a point x∈Cx\in Cx∈C such that xxx is periodic and

C=γ(x).C=\gamma(x).C=γ(x).

Degenerate cases.

  • Fixed points: f(x)=0f(x)=0f(x)=0 is not excluded for the point produced.
  • Single-point sets: a one-point set C={p}C=\{p\}C={p} satisfies the hypotheses as soon as γσ(p)⊆{p}\gamma_\sigma(p)\subseteq\{p\}γσ​(p)⊆{p}. That condition holds, for example, when γσ(p)\gamma_\sigma(p)γσ​(p) is empty. For such CCC the theorem asserts that ppp is periodic, which in particular requires I(p)I(p)I(p) to contain a positive time TTT with Φ(T,p)=p\Phi(T,p)=pΦ(T,p)=p, and that γ(p)={p}\gamma(p)=\{p\}γ(p)={p}.
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