Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — XXX is an asymptotic pseudotrajectory iff d(Θt(X),Φ^∘Θt(X))→0d(\Theta^t(X),\hat\Phi\circ\Theta^t(X))\to0d(Θt(X),Φ^∘Θt(X))→0

Proved
StochApproxDyn.LimitSet.isAsymptoticPseudotrajectory_iff_tendsto_retraction

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

asymptotic-pseudotrajectorydynamical-systemsp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Φ\PhiΦ be a semiflow on a metric space (M,d)(M,d)(M,d), and use the translation semiflow Θ\ThetaΘ, the retraction Φ^(Y)=ΦY(0)\hat\Phi(Y)=\Phi^{Y(0)}Φ^(Y)=ΦY(0) and the distance ddd on C0(R+,M)C^0(\mathbb R_+,M)C0(R+​,M). A continuous function X:R+→MX:\mathbb R_+\to MX:R+​→M is an asymptotic pseudotrajectory of Φ\PhiΦ if and only if

lim⁡t→∞d(Θt(X),Φ^∘Θt(X))=0.\lim_{t\to\infty} d\big(\Theta^t(X),\hat\Phi\circ\Theta^t(X)\big)=0 .t→∞lim​d(Θt(X),Φ^∘Θt(X))=0.

In words: XXX is an asymptotic pseudotrajectory exactly when its forward orbit under the translation semiflow is attracted by the set SΦS_\PhiSΦ​ of genuine trajectories.

Formalization Note Stated on C0(R+,M)C^0(\mathbb R_+,M)C0(R+​,M) (Mathlib's C(ℝ≥0, M)) with dk(f,g)=sup⁡s∈[0,k]d(f(s),g(s))d_k(f,g)=\sup_{s\in[0,k]}d(f(s),g(s))dk​(f,g)=sups∈[0,k]​d(f(s),g(s)). The source's version on C0(R,M)C^0(\mathbb R,M)C0(R,M), with the extension Φp(t)=p\Phi^p(t)=pΦp(t)=p for t<0t<0t<0, 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
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me