Lemma 8.5 — a trapping region yields a nonempty, invariant, compact, connected attracting set
ProvedTeschlODE.HigherDim.trapping_region_attractingLet be open, , and the flow of on . Let be a trapping region. Then
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 is the attractor.
Formalization Note. The standing assumptions of Chapter 6 ( open, ) 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 forward complete. "Invariant" is the book's two-sided invariance (every orbit through stays in ); "attracting" is being a neighborhood of .
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
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Inputs. Fix the following:
- a natural number ;
- an open set (Euclidean);
- a map that is on ;
- time sets ;
- a map .
Hypothesis on . is a maximal flow of on . This means that for every all of the following hold:
- is open and order-connected and contains ;
- ;
- and for all ;
- every curve with that is an integral curve of in on an open order-connected has and on .
Hypothesis on . is a trapping region. This means all of the following:
- is open, nonempty and connected;
- is compact and ;
- for every and every : and .
The set . Let be the set of for which there are sequences and with and .
Conclusion. All of the following hold:
- , where .
- is nonempty.
- is invariant: , and for all and .
- is compact.
- is connected, which includes being nonempty.
- is attracting. This means is invariant and the set
contains an open set that contains .
Degenerate cases. The trapping-region hypothesis forces . If , is a single point ; the only possible is , , and on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.