Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.16 — generalized Poincaré–Bendixson theorem

Proved
TeschlODE.Planar.generalized_poincare_bendixson

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

dynamical-systemsordinary-differential-equationsp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1planar-systemspoincare-bendixson

Let MMM be an open subset of R2\mathbb{R}^2R2 and f∈C1(M,R2)f \in C^1(M, \mathbb{R}^2)f∈C1(M,R2). Fix x∈Mx \in Mx∈M and σ∈{±}\sigma \in \{\pm\}σ∈{±}, and suppose ωσ(x)≠∅\omega_\sigma(x) \neq \emptysetωσ​(x)=∅ is compact, connected, and contains only finitely many fixed points. Then one of the following holds:

(i) ωσ(x) is a fixed orbit;(ii) ωσ(x) is a regular periodic orbit;\text{(i) } \omega_\sigma(x) \text{ is a fixed orbit;}\quad \text{(ii) } \omega_\sigma(x) \text{ is a regular periodic orbit;}(i) ωσ​(x) is a fixed orbit;(ii) ωσ​(x) is a regular periodic orbit; (iii) ωσ(x) consists of finitely many fixed points {xj} and non-closed orbits γ(y) with ω±(y)∈{xj}.\text{(iii) } \omega_\sigma(x) \text{ consists of finitely many fixed points } \{x_j\} \text{ and non-closed orbits } \gamma(y) \text{ with } \omega_\pm(y) \in \{x_j\}.(iii) ωσ​(x) consists of finitely many fixed points {xj​} and non-closed orbits γ(y) with ω±​(y)∈{xj​}.

This classifies all compact connected limit sets of planar flows with finitely many equilibria; it is the capstone of Chapter 7.

Formalization Note. σ\sigmaσ is a Bool (true = +++). (i) is ωσ(x)={x0}\omega_\sigma(x) = \{x_0\}ωσ​(x)={x0​} with f(x0)=0f(x_0) = 0f(x0​)=0. (ii) is ωσ(x)=γ(y)\omega_\sigma(x) = \gamma(y)ωσ​(x)=γ(y) with yyy periodic and f(y)≠0f(y) \neq 0f(y)=0. (iii) is: every y∈ωσ(x)y \in \omega_\sigma(x)y∈ωσ​(x) with f(y)≠0f(y) \neq 0f(y)=0 lies on a non-closed orbit (yyy not periodic) with γ(y)⊆ωσ(x)\gamma(y) \subseteq \omega_\sigma(x)γ(y)⊆ωσ​(x), and ω+(y)={a}\omega_+(y) = \{a\}ω+​(y)={a}, ω−(y)={b}\omega_-(y) = \{b\}ω−​(y)={b} for fixed points a,b∈ωσ(x)a, b \in \omega_\sigma(x)a,b∈ωσ​(x) (the book's "ω±(y)∈{xj}\omega_\pm(y) \in \{x_j\}ω±​(y)∈{xj​}", a one-point set identified with its point). "Only finitely many fixed points" is Set.Finite of {y∈ωσ(x):f(y)=0}\{y \in \omega_\sigma(x) : f(y) = 0\}{y∈ωσ​(x):f(y)=0}; "connected" is IsPreconnected together with the separate nonemptiness hypothesis.

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, Theorem 7.16 (generalized Poincaré–Bendixson, pp. 223–224): let `M ⊆ ℝ²` be open,
`f ∈ C¹(M, ℝ²)`, `x ∈ M`, `σ ∈ {±}`, and suppose `ω_σ(x)` is nonempty, compact, connected and
contains only finitely many fixed points. Then
(i) `ω_σ(x)` is a fixed orbit `{x₀}` with `f x₀ = 0`; or
(ii) `ω_σ(x) = γ(y)` is a regular periodic orbit (`y` periodic, `f y ≠ 0`); or
(iii) every point `y ∈ ω_σ(x)` is a fixed point or lies on a non-closed orbit `γ(y) ⊆ ω_σ(x)`
whose limit sets `ω₊(y)` and `ω₋(y)` are single fixed points of `ω_σ(x)`. -/
theorem generalized_poincare_bendixson {M : Set (Fin 2 → ℝ)} (hM : IsOpen M)
    {f : (Fin 2 → ℝ) → Fin 2 → ℝ} (hf : ContDiffOn ℝ 1 f M) (σ : Bool)
    {x : Fin 2 → ℝ} (hx : x ∈ M)
    (hne : (omegaLimitSet f M σ x).Nonempty) (hcpt : IsCompact (omegaLimitSet f M σ x))
    (hconn : IsPreconnected (omegaLimitSet f M σ x))
    (hfin : {y | y ∈ omegaLimitSet f M σ x ∧ f y = 0}.Finite) :
    (∃ x₀, f x₀ = 0 ∧ omegaLimitSet f M σ x = {x₀}) ∨
    (∃ y, IsPeriodicPoint f M y ∧ f y ≠ 0 ∧ omegaLimitSet f M σ x = orbit f M y) ∨
    (∀ y ∈ omegaLimitSet f M σ x, f y = 0 ∨
      (orbit f M y ⊆ omegaLimitSet f M σ x ∧ ¬ IsPeriodicPoint f M y ∧
        ∃ a ∈ omegaLimitSet f M σ x, ∃ b ∈ omegaLimitSet f M σ x, f a = 0 ∧ f b = 0 ∧
          omegaLimitSet f M true y = {a} ∧ omegaLimitSet f M false y = {b})) := by sorry

end TeschlODE.Planar
Source
Teschl, Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012), pp. 223–224, Theorem 7.16
Read-back

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

Throughout, points of the plane are pairs (p1,p2)∈R2(p_1,p_2)\in\mathbb{R}^2(p1​,p2​)∈R2. The statement uses three notions defined elsewhere and imported: omegaLimitSet, orbit and IsPeriodicPoint. Their bodies were not given with this declaration, so this read-back treats them as opaque. It writes:

  • ωσ(x)\omega_\sigma(x)ωσ​(x) for omegaLimitSet f M σ x, a subset of R2\mathbb{R}^2R2 that depends on fff, MMM, a Boolean flag σ\sigmaσ and a point xxx;
  • γ(y)\gamma(y)γ(y) for orbit f M y, a subset of R2\mathbb{R}^2R2 that depends on fff, MMM and yyy;
  • "yyy is periodic" for IsPeriodicPoint f M y, a property of yyy that depends on fff and MMM.

The code alone does not show which Boolean value (true\texttt{true}true or false\texttt{false}false) corresponds to forward time and which to backward time, if either does. It also does not show how these notions behave at points outside MMM.

Data and hypotheses. Let:

  • M⊆R2M\subseteq\mathbb{R}^2M⊆R2 be an open set;
  • f:R2→R2f:\mathbb{R}^2\to\mathbb{R}^2f:R2→R2 be a function defined on all of R2\mathbb{R}^2R2 that is continuously differentiable (class C1C^1C1) on MMM. Nothing is assumed about fff outside MMM.
  • σ∈{true,false}\sigma\in\{\texttt{true},\texttt{false}\}σ∈{true,false};
  • x∈Mx\in Mx∈M.

Assume all four of the following:

  1. ωσ(x)\omega_\sigma(x)ωσ​(x) is nonempty.
  2. ωσ(x)\omega_\sigma(x)ωσ​(x) is compact.
  3. ωσ(x)\omega_\sigma(x)ωσ​(x) is preconnected: it cannot be split into two disjoint relatively open nonempty pieces. Together with nonemptiness, this is the same as connected.
  4. The set of zeros of fff inside ωσ(x)\omega_\sigma(x)ωσ​(x) is finite:
{ y∈ωσ(x):f(y)=0 } is finite.\{\,y\in\omega_\sigma(x) : f(y)=0\,\}\ \text{is finite.}{y∈ωσ​(x):f(y)=0} is finite.

Conclusion. At least one of the following three alternatives holds (inclusive "or").

  1. (i) There is a point x0∈R2x_0\in\mathbb{R}^2x0​∈R2 with f(x0)=0f(x_0)=0f(x0​)=0 and
ωσ(x)={x0}.\omega_\sigma(x)=\{x_0\}.ωσ​(x)={x0​}.

The code does not separately require x0∈Mx_0\in Mx0​∈M.

  1. (ii) There is a point y∈R2y\in\mathbb{R}^2y∈R2 such that:

    • yyy is periodic (in the sense of IsPeriodicPoint f M);
    • f(y)≠0f(y)\neq 0f(y)=0;
    • ωσ(x)=γ(y)\omega_\sigma(x)=\gamma(y)ωσ​(x)=γ(y).
  2. (iii) For every y∈ωσ(x)y\in\omega_\sigma(x)y∈ωσ​(x), either f(y)=0f(y)=0f(y)=0, or all of the following hold:

    • γ(y)⊆ωσ(x)\gamma(y)\subseteq\omega_\sigma(x)γ(y)⊆ωσ​(x);
    • yyy is not periodic;
    • there exist points a,b∈ωσ(x)a,b\in\omega_\sigma(x)a,b∈ωσ​(x) with f(a)=0f(a)=0f(a)=0, f(b)=0f(b)=0f(b)=0 and
ωtrue(y)={a},ωfalse(y)={b}.\omega_{\texttt{true}}(y)=\{a\},\qquad \omega_{\texttt{false}}(y)=\{b\}.ωtrue​(y)={a},ωfalse​(y)={b}.

Here aaa and bbb are not required to be distinct. Both limit sets of yyy are taken with the same fff and MMM.

Degenerate cases. The dimension is fixed at 2, so there is no zero-dimensional or one-element-type case. MMM cannot be empty, because x∈Mx\in Mx∈M.

  • If ωσ(x)\omega_\sigma(x)ωσ​(x) is empty for some xxx (whether that can happen depends on the unseen definition), the hypotheses fail and the theorem says nothing about that xxx.
  • Alternative (iii) is automatically true at every yyy that is a zero of fff. So if every point of ωσ(x)\omega_\sigma(x)ωσ​(x) is a zero of fff, (iii) holds with no further content. By finiteness and connectedness, ωσ(x)\omega_\sigma(x)ωσ​(x) is then a single zero, which also satisfies (i).
  • The alternatives are not stated to be mutually exclusive.
  • Whether a zero of fff counts as "periodic" depends on the unseen definition. (ii) excludes such points explicitly by requiring f(y)≠0f(y)\neq 0f(y)=0.
  • The hypotheses do not require ωσ(x)⊆M\omega_\sigma(x)\subseteq Mωσ​(x)⊆M. If the definitions allow points of ωσ(x)\omega_\sigma(x)ωσ​(x) outside MMM, the conditions f(y)=0f(y)=0f(y)=0 or f(y)≠0f(y)\neq 0f(y)=0 at those points involve values of fff that are not constrained by the C1C^1C1 hypothesis. Likewise, γ(y)\gamma(y)γ(y), "periodic" and ωtrue/false(y)\omega_{\texttt{true}/\texttt{false}}(y)ωtrue/false​(y) at such points take whatever values the definitions assign outside MMM.
  • Whether any of the hypotheses can actually be satisfied, or is vacuous for some inputs, cannot be determined without the bodies of omegaLimitSet, orbit and IsPeriodicPoint.
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