Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 8.5 — a trapping region yields a nonempty, invariant, compact, connected attracting set ω+(E)\omega_+(E)ω+​(E)

Proved
TeschlODE.HigherDim.trapping_region_attracting

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

attractordynamical-systemslimit-setp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1trapping-region

Let M⊆RnM \subseteq \mathbb{R}^nM⊆Rn be open, f∈C1(M,Rn)f \in C^1(M, \mathbb{R}^n)f∈C1(M,Rn), and Φ\PhiΦ the flow of x˙=f(x)\dot x = f(x)x˙=f(x) on MMM. Let EEE be a trapping region. Then

Λ=ω+(E)=⋂t≥0Φ(t,E)(8.10)\Lambda = \omega_+(E) = \bigcap_{t \ge 0} \Phi(t, E) \qquad (8.10)Λ=ω+​(E)=t≥0⋂​Φ(t,E)(8.10)

is a nonempty, invariant, compact, and connected attracting set.

Lemma 8.5 is how attracting sets are found in practice: exhibit a region into which the vector field points (for the Lorenz equation, a sublevel set of a Liapunov-type function), and ω+(E)\omega_+(E)ω+​(E) is the attractor.

Formalization Note. The standing assumptions of Chapter 6 (MMM open, f∈C1f \in C^1f∈C1) are binders. The book assumes the flow complete in Chapter 8; the statement uses the local flow, which is more general: the trapping-region definition already makes every point of E‾\overline EE forward complete. "Invariant" is the book's two-sided invariance (every orbit through Λ\LambdaΛ stays in Λ\LambdaΛ); "attracting" is W+(Λ)W^+(\Lambda)W+(Λ) being a neighborhood of Λ\LambdaΛ.

Preamble
import Mathlib
import Definitions.Def_TeschlODE_HigherDim_IsIntegralCurve
import Definitions.Def_TeschlODE_HigherDim_IsMaximalFlow
import Definitions.Def_TeschlODE_HigherDim_omegaPlusSet
import Definitions.Def_TeschlODE_HigherDim_stableSet
import Definitions.Def_TeschlODE_HigherDim_IsInvariant
import Definitions.Def_TeschlODE_HigherDim_IsAttracting
import Definitions.Def_TeschlODE_HigherDim_IsTrappingRegion
Formal statement
namespace TeschlODE.HigherDim

/-- Teschl, Lemma 8.5, p. 232, (8.10): for a trapping region `E` of the flow of a `C¹` vector
field on the open set `M ⊆ ℝⁿ`, `Λ = ω₊(E) = ⋂_{t ≥ 0} Φ(t, E)` is a nonempty, invariant,
compact, and connected attracting set. -/
theorem trapping_region_attracting {n : ℕ}
    (f : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (M : Set (EuclideanSpace ℝ (Fin n))) (hM : IsOpen M) (hf : ContDiffOn ℝ 1 f M)
    (I : EuclideanSpace ℝ (Fin n) → Set ℝ)
    (Φ : ℝ → EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hΦ : IsMaximalFlow f M I Φ)
    (E : Set (EuclideanSpace ℝ (Fin n))) (hE : IsTrappingRegion M I Φ E) :
    omegaPlusSet M I Φ E = (⋂ t : ℝ, ⋂ (_ : 0 ≤ t), Φ t '' E) ∧
      (omegaPlusSet M I Φ E).Nonempty ∧ IsInvariant M I Φ (omegaPlusSet M I Φ E) ∧
      IsCompact (omegaPlusSet M I Φ E) ∧ IsConnected (omegaPlusSet M I Φ E) ∧
      IsAttracting M I Φ (omegaPlusSet M I Φ E) := by sorry

end TeschlODE.HigherDim
Source
Teschl, Ordinary Differential Equations and Dynamical Systems (author's preliminary version of AMS GSM 140, 2012), p. 232, Lemma 8.5, Eq. (8.10)
Read-back

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

Inputs. Fix the following:

  • a natural number nnn;
  • an open set M⊆RnM \subseteq \mathbb{R}^nM⊆Rn (Euclidean);
  • a map f:Rn→Rnf : \mathbb{R}^n \to \mathbb{R}^nf:Rn→Rn that is C1C^1C1 on MMM;
  • time sets I(x)⊆RI(x) \subseteq \mathbb{R}I(x)⊆R;
  • a map Φ:R×Rn→Rn\Phi : \mathbb{R} \times \mathbb{R}^n \to \mathbb{R}^nΦ:R×Rn→Rn.

Hypothesis on (I,Φ)(I, \Phi)(I,Φ). (I,Φ)(I,\Phi)(I,Φ) is a maximal flow of fff on MMM. This means that for every x∈Mx \in Mx∈M all of the following hold:

  • I(x)I(x)I(x) is open and order-connected and contains 000;
  • Φ(0,x)=x\Phi(0,x) = xΦ(0,x)=x;
  • Φ(t,x)∈M\Phi(t,x) \in MΦ(t,x)∈M and ∂tΦ(t,x)=f(Φ(t,x))\partial_t \Phi(t,x) = f(\Phi(t,x))∂t​Φ(t,x)=f(Φ(t,x)) for all t∈I(x)t \in I(x)t∈I(x);
  • every curve ψ\psiψ with ψ(0)=x\psi(0) = xψ(0)=x that is an integral curve of fff in MMM on an open order-connected J∋0J \ni 0J∋0 has J⊆I(x)J \subseteq I(x)J⊆I(x) and ψ=Φ(⋅,x)\psi = \Phi(\cdot,x)ψ=Φ(⋅,x) on JJJ.

Hypothesis on EEE. E⊆RnE \subseteq \mathbb{R}^nE⊆Rn is a trapping region. This means all of the following:

  • EEE is open, nonempty and connected;
  • E‾\overline{E}E is compact and E‾⊆M\overline{E} \subseteq ME⊆M;
  • for every x∈E‾x \in \overline{E}x∈E and every t>0t > 0t>0: t∈I(x)t \in I(x)t∈I(x) and Φ(t,x)∈E\Phi(t,x) \in EΦ(t,x)∈E.

The set Λ\LambdaΛ. Let Λ=ω+(E)\Lambda = \omega_+(E)Λ=ω+​(E) be the set of y∈My \in My∈M for which there are sequences xk∈Ex_k \in Exk​∈E and tk∈I(xk)t_k \in I(x_k)tk​∈I(xk​) with tk→+∞t_k \to +\inftytk​→+∞ and Φ(tk,xk)→y\Phi(t_k,x_k) \to yΦ(tk​,xk​)→y.

Conclusion. All of the following hold:

  1. Λ=⋂t≥0Φt(E)\displaystyle \Lambda = \bigcap_{t \ge 0} \Phi_t(E)Λ=t≥0⋂​Φt​(E), where Φt(E)={Φ(t,x):x∈E}\Phi_t(E) = \{\Phi(t,x) : x \in E\}Φt​(E)={Φ(t,x):x∈E}.
  2. Λ\LambdaΛ is nonempty.
  3. Λ\LambdaΛ is invariant: Λ⊆M\Lambda \subseteq MΛ⊆M, and Φ(t,x)∈Λ\Phi(t,x) \in \LambdaΦ(t,x)∈Λ for all x∈Λx \in \Lambdax∈Λ and t∈I(x)t \in I(x)t∈I(x).
  4. Λ\LambdaΛ is compact.
  5. Λ\LambdaΛ is connected, which includes being nonempty.
  6. Λ\LambdaΛ is attracting. This means Λ\LambdaΛ is invariant and the set
W+(Λ)={x∈M:[0,∞)⊆I(x), lim⁡s→+∞inf⁡w∈Λ∥Φ(s,x)−w∥=0}W^+(\Lambda) = \Big\{x \in M : [0,\infty) \subseteq I(x),\ \lim_{s\to+\infty} \inf_{w\in\Lambda}\|\Phi(s,x) - w\| = 0\Big\}W+(Λ)={x∈M:[0,∞)⊆I(x), s→+∞lim​w∈Λinf​∥Φ(s,x)−w∥=0}

contains an open set that contains Λ\LambdaΛ.

Degenerate cases. The trapping-region hypothesis forces E≠∅E \neq \emptysetE=∅. If n=0n = 0n=0, R0\mathbb{R}^0R0 is a single point {0}\{0\}{0}; the only possible EEE is {0}=M\{0\} = M{0}=M, f≡0f \equiv 0f≡0, and Φ(t,0)=0\Phi(t,0) = 0Φ(t,0)=0 on I(0)=RI(0) = \mathbb{R}I(0)=R.

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