Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.8 — if X(0)∈K⊂B(A)X(0)\in K\subset B(A)X(0)∈K⊂B(A) and dX(T)<δd_X(T)<\deltadX​(T)<δ then L(X)⊂AL(X)\subset AL(X)⊂A

Proved
StochApproxDyn.Attractor.limitSet_subset_of_stepDeviation_lt

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

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

Let Φ\PhiΦ be a semiflow on a locally compact metric space MMM, let A⊂MA\subset MA⊂M be an attractor with basin B(A)B(A)B(A), and let K⊂B(A)K\subset B(A)K⊂B(A) be a nonempty compact set. Then there exist numbers T>0T>0T>0 and δ>0\delta>0δ>0, depending only on KKK (and on Φ\PhiΦ and AAA), such that for every asymptotic pseudotrajectory X:R+→MX:\mathbb R_+\to MX:R+​→M of Φ\PhiΦ,

X(0)∈K  and  dX(T)<δ⟹L(X)⊂A,X(0)\in K\ \text{ and }\ d_X(T)<\delta\quad\Longrightarrow\quad L(X)\subset A,X(0)∈K  and  dX​(T)<δ⟹L(X)⊂A,

where dX(T)=sup⁡k∈Nd(ΦT(X(kT)),X(kT+T))d_X(T)=\sup_{k\in\mathbb N}d(\Phi_T(X(kT)),X(kT+T))dX​(T)=supk∈N​d(ΦT​(X(kT)),X(kT+T)) and L(X)L(X)L(X) is the limit set of XXX.

A point of the basin is carried into AAA by the flow; the lemma says the same holds for an asymptotic pseudotrajectory whose one-step errors over windows of length TTT are uniformly small. It is the deterministic step in the proof of Theorem 7.3.

Formalization Note TTT and δ\deltaδ are quantified before XXX, so they cannot depend on the trajectory. dX(T)d_X(T)dX​(T) is computed in ℝ≥0∞, and dX(T)<δd_X(T)<\deltadX​(T)<δ is a strict inequality in ℝ≥0∞, i.e. exactly "the supremum is below δ\deltaδ".

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_Attractor_Dynamics

open scoped NNReal ENNReal
Formal statement
namespace StochApproxDyn.Attractor

/-- Lemma 6.8 (Benaïm 1999, p. 28). -/
theorem limitSet_subset_of_stepDeviation_lt {M : Type*} [MetricSpace M] [LocallyCompactSpace M]
    (Φ : Flow ℝ≥0 M) (A : Set M) (hA : StochApproxDyn.LimitSet.IsAttractor Φ A) (K : Set M) (hKne : K.Nonempty)
    (hK : IsCompact K) (hKB : K ⊆ StochApproxDyn.LimitSet.basin Φ A) :
    ∃ T : ℝ≥0, 0 < T ∧ ∃ δ : ℝ≥0, 0 < δ ∧
      ∀ X : ℝ≥0 → M, StochApproxDyn.LimitSet.IsAsymptoticPseudotrajectory Φ X → X 0 ∈ K →
        stepDeviation Φ X T < (δ : ℝ≥0∞) → StochApproxDyn.LimitSet.limitSet X ⊆ A := by sorry

end StochApproxDyn.Attractor
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 28, Section 6.3, Lemma 6.8 (with Eq. (23))
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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