Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.7 (i) — the limit set of a precompact asymptotic pseudotrajectory is internally chain transitive

Proved
StochApproxDyn.LimitSet.limitSet_isInternallyChainTransitive

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

asymptotic-pseudotrajectorychain-recurrencedynamical-systemsp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-approximation

Let Φ\PhiΦ be a semiflow on an arbitrary metric space (M,d)(M,d)(M,d) (not assumed compact, complete or locally compact). Let X:R+→MX:\mathbb R_+\to MX:R+​→M be an asymptotic pseudotrajectory of Φ\PhiΦ which is precompact, i.e. its image X(R+)X(\mathbb R_+)X(R+​) has compact closure in MMM. Then the limit set

L(X)=⋂t≥0X([t,∞))‾L(X)=\bigcap_{t\ge0}\overline{X([t,\infty))}L(X)=t≥0⋂​X([t,∞))​

is internally chain transitive: it is nonempty, compact and invariant (Φt(L(X))=L(X)\Phi_t(L(X))=L(X)Φt​(L(X))=L(X) for all t≥0t\ge0t≥0), and for all a,b∈L(X)a,b\in L(X)a,b∈L(X) and all δ>0\delta>0δ>0, T>0T>0T>0 there is a (δ,T)(\delta,T)(δ,T)-pseudo-orbit of Φ\PhiΦ from aaa to bbb all of whose points lie in L(X)L(X)L(X).

This is the limit set theorem of Benaïm and Hirsch. Combined with the fact that interpolated stochastic approximation processes are asymptotic pseudotrajectories of the mean ODE, it says that such algorithms converge to internally chain transitive sets of the ODE, and so reduces their asymptotic analysis to the dynamics of the ODE.

Formalization Note A semiflow is Mathlib's Flow ℝ≥0 M and XXX is a function ℝ≥0 → M; continuity of XXX is part of being an asymptotic pseudotrajectory. Nonemptiness of L(X)L(X)L(X) is part of the conclusion, not a hypothesis.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_LimitSet_AsymptoticPseudotrajectory
import Definitions.Def_StochApproxDyn_LimitSet_ChainRecurrence

open scoped NNReal
Formal statement
namespace StochApproxDyn.LimitSet

/-- Theorem 5.7 (i) (Benaïm 1999, p. 24): let `Φ` be a semiflow on an arbitrary metric space `M`
and `X : ℝ₊ → M` a precompact asymptotic pseudotrajectory of `Φ`. Then its limit set
`L(X) = ⋂_{t ≥ 0} closure (X([t, ∞)))` is internally chain transitive. -/
theorem limitSet_isInternallyChainTransitive {M : Type*} [MetricSpace M] (Φ : Flow ℝ≥0 M)
    (X : ℝ≥0 → M) (hX : IsAsymptoticPseudotrajectory Φ X)
    (hpre : IsCompact (closure (Set.range X))) :
    IsInternallyChainTransitive Φ (limitSet X) := by sorry

end StochApproxDyn.LimitSet
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 24, Theorem 5.7 (i)
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