Lemma 5.2 — a trapping region with compact closure contains an attractor
ProvedStochApproxDyn.LimitSet.exists_attractor_of_mapsTo_closureattractordynamical-systemsp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a semiflow on a metric space . Let be a nonempty open set with compact closure , and suppose that
Then there exists an attractor whose basin contains .
This lemma, due to Conley, converts a trapping region into an attractor. It is the step that links attractors to chain recurrence in Proposition 5.3.
Formalization Note The hypothesis is added: the source omits it, but for the hypotheses hold and no attractor (which is nonempty by definition) can lie in .
Preamble
import Mathlib import Definitions.Def_StochApproxDyn_LimitSet_Attractor open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet
/-- Lemma 5.2 (Benaïm 1999, p. 22): if `U ⊂ M` is a nonempty open set with compact closure and
`Φ_T(Ū) ⊂ U` for some `T > 0`, then there is an attractor `A ⊂ U` whose basin contains `Ū`. -/
theorem exists_attractor_of_mapsTo_closure {M : Type*} [MetricSpace M] (Φ : Flow ℝ≥0 M)
(U : Set M) (hUo : IsOpen U) (hUne : U.Nonempty) (hUc : IsCompact (closure U))
(T : ℝ≥0) (hT : 0 < T) (hTU : Φ T '' closure U ⊆ U) :
∃ A : Set M, IsAttractor Φ A ∧ A ⊆ U ∧ closure U ⊆ basin Φ A := by sorry
end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 22, Lemma 5.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.