Lemma 3.1 — is an asymptotic pseudotrajectory iff
ProvedStochApproxDyn.LimitSet.isAsymptoticPseudotrajectory_iff_tendsto_retractionasymptotic-pseudotrajectorydynamical-systemsp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a semiflow on a metric space , and use the translation semiflow , the retraction and the distance on . A continuous function is an asymptotic pseudotrajectory of if and only if
In words: is an asymptotic pseudotrajectory exactly when its forward orbit under the translation semiflow is attracted by the set of genuine trajectories.
Formalization Note Stated on (Mathlib's C(ℝ≥0, M)) with . The source's version on , with the extension for , is false for semiflows (a periodic trajectory is a counterexample); the half-line version is the one the source's surrounding text describes.
Preamble
import Mathlib import Definitions.Def_StochApproxDyn_LimitSet_AsymptoticPseudotrajectory import Definitions.Def_StochApproxDyn_LimitSet_TranslationSemiflow open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet
/-- Lemma 3.1 (Benaïm 1999, p. 10), on `C⁰(ℝ₊, M)`: a continuous `X : ℝ₊ → M` is an asymptotic
pseudotrajectory of `Φ` iff `d(Θ^t(X), Φ̂(Θ^t(X))) → 0` as `t → ∞`. -/
theorem isAsymptoticPseudotrajectory_iff_tendsto_retraction {M : Type*} [MetricSpace M]
(Φ : Flow ℝ≥0 M) (X : C(ℝ≥0, M)) :
IsAsymptoticPseudotrajectory Φ X ↔
Filter.Tendsto
(fun t : ℝ≥0 => uniformCompactDist (translate t X) (retraction Φ (translate t X)))
Filter.atTop (nhds 0) := by sorry
end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 10, Lemma 3.1 (read on C⁰(ℝ₊, M))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.