Theorem 5.5 — on a compact space, is internally chain recurrent
ProvedStochApproxDyn.LimitSet.chainRecurrentSet_isInternallyChainRecurrentchain-recurrencedynamical-systemsp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a semiflow on a nonempty compact metric space , and let be its set of chain recurrent points. Then
it is compact and invariant, for all , and every point of is chain recurrent for the restricted semiflow , i.e. by pseudo-orbits that stay in .
The theorem was proved by Conley for flows; it says that chain recurrence does not need excursions outside the chain recurrent set.
Formalization Note is assumed nonempty ([Nonempty M]), because internally chain recurrent sets are nonempty by definition; for the set is empty.
Preamble
import Mathlib import Definitions.Def_StochApproxDyn_LimitSet_ChainRecurrence open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet
/-- Theorem 5.5 (Benaïm 1999, p. 23): if `M` is a (nonempty) compact metric space, the chain
recurrent set `R(Φ)` of a semiflow `Φ` on `M` is internally chain recurrent. -/
theorem chainRecurrentSet_isInternallyChainRecurrent {M : Type*} [MetricSpace M]
[CompactSpace M] [Nonempty M] (Φ : Flow ℝ≥0 M) :
IsInternallyChainRecurrent Φ (chainRecurrentSet Φ) := by sorry
end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 23, Theorem 5.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.