Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 — characterization of precompact asymptotic pseudotrajectories

Proved
StochApproxDyn.LimitSet.isAsymptoticPseudotrajectory_characterization

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 let X:R+→MX:\mathbb R_+\to MX:R+​→M be a continuous function whose image has compact closure in MMM. Consider the assertions

  1. XXX is an asymptotic pseudotrajectory of Φ\PhiΦ;
  2. XXX is uniformly continuous, and every limit point of {Θt(X)}\{\Theta^t(X)\}{Θt(X)} lies in SΦS_\PhiSΦ​, i.e. whenever tk→∞t_k\to\inftytk​→∞ and Θtk(X)→Y\Theta^{t_k}(X)\to YΘtk​(X)→Y in C0(R+,M)C^0(\mathbb R_+,M)C0(R+​,M), then Y=ΦpY=\Phi^pY=Φp for some p∈Mp\in Mp∈M;
  3. the family {Θt(X)}t≥0\{\Theta^t(X)\}_{t\ge0}{Θt(X)}t≥0​ is relatively compact in C0(R+,M)C^0(\mathbb R_+,M)C0(R+​,M).

Then (1) and (2) are equivalent, and they imply (3):

(1)  ⟺  (2),(1)  ⟹  (3).(1)\iff(2),\qquad (1)\implies(3).(1)⟺(2),(1)⟹(3).

This identifies precompact asymptotic pseudotrajectories as the uniformly continuous curves whose long-run translates look like trajectories of Φ\PhiΦ, and supplies the compactness needed for the limit set theorem.

Formalization Note C0(R+,M)C^0(\mathbb R_+,M)C0(R+​,M) is Mathlib's C(ℝ≥0, M) with the compact-open topology, which is the topology of uniform convergence on compact intervals and is the topology of the distance ddd. Limit points are limits along sequences tk→∞t_k\to\inftytk​→∞, k∈Nk\in\mathbb Nk∈N. Relative compactness is compactness of the closure of {Θt(X):t≥0}\{\Theta^t(X):t\ge0\}{Θt(X):t≥0}. The source states the result on C0(R,M)C^0(\mathbb R,M)C0(R,M); for a semiflow that version is false (see Lemma 3.1), and the half-line reading is used.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_LimitSet_AsymptoticPseudotrajectory
import Definitions.Def_StochApproxDyn_LimitSet_TranslationSemiflow

open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet

/-- Theorem 3.2 (Benaïm 1999, pp. 10–11), on `C⁰(ℝ₊, M)` with the compact-open topology
(uniform convergence on compact intervals). For a continuous `X : ℝ₊ → M` with relatively compact
image: (i) `X` is an asymptotic pseudotrajectory of `Φ` iff (ii) `X` is uniformly continuous and
every limit point `Y = lim_k Θ^{t_k}(X)`, `t_k → ∞`, lies in `S_Φ`; and (i) implies
(iii) `{Θ^t(X)}_{t ≥ 0}` is relatively compact. -/
theorem isAsymptoticPseudotrajectory_characterization {M : Type*} [MetricSpace M]
    (Φ : Flow ℝ≥0 M) (X : C(ℝ≥0, M)) (hX : IsCompact (closure (Set.range X))) :
    (IsAsymptoticPseudotrajectory Φ X ↔
      (UniformContinuous X ∧
        ∀ Y : C(ℝ≥0, M), (∃ τ : ℕ → ℝ≥0, Filter.Tendsto τ Filter.atTop Filter.atTop ∧
            Filter.Tendsto (fun k => translate (τ k) X) Filter.atTop (nhds Y)) →
          Y ∈ trajectorySpace Φ)) ∧
    (IsAsymptoticPseudotrajectory Φ X →
      IsCompact (closure (Set.range fun t : ℝ≥0 => translate t X))) := by sorry

end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), pp. 10–11, Theorem 3.2 and its footnote 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