Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1 (positive invariance) — Φt(Att(X))⊂Att(X)\Phi_t(\mathrm{Att}(X))\subset\mathrm{Att}(X)Φt​(Att(X))⊂Att(X) for all t≥0t\ge0t≥0

Proved
StochApproxDyn.Attractor.attainableSet_isPositivelyInvariant

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

attainable-setp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-approximation

Let Φ\PhiΦ be a semiflow on a metric space MMM and let XXX be a process on (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) satisfying the standing assumptions of Section 7 (continuous paths, adapted to (Ft)(\mathcal F_t)(Ft​), condition (24) with a function w(t,δ,T)↓0w(t,\delta,T)\downarrow0w(t,δ,T)↓0). Then the set Att(X)\mathrm{Att}(X)Att(X) of attainable points is positively invariant under Φ\PhiΦ:

Φt(Att(X))⊂Att(X)for all t≥0.\Phi_t\big(\mathrm{Att}(X)\big)\subset\mathrm{Att}(X)\qquad\text{for all } t\ge0 .Φt​(Att(X))⊂Att(X)for all t≥0.

This is the second assertion of Lemma 7.1: if the process can come close to ppp at arbitrarily late times with positive probability, it can also come close to Φt(p)\Phi_t(p)Φt​(p), because condition (24) makes it follow the flow for a time ttt with high conditional probability.

Formalization Note The standing assumptions are those of the definition SatisfiesStandingAssumption; PPP is a probability measure.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_Attractor_Dynamics
import Definitions.Def_StochApproxDyn_Attractor_Process

open scoped NNReal ENNReal
open MeasureTheory
Formal statement
namespace StochApproxDyn.Attractor

/-- Lemma 7.1, second assertion (Benaïm 1999, p. 31): `Att(X)` is positively invariant under `Φ`. -/
theorem attainableSet_isPositivelyInvariant {Ω M : Type*} {m0 : MeasurableSpace Ω}
    [MetricSpace M] [MeasurableSpace M] [BorelSpace M] (Φ : Flow ℝ≥0 M) (P : Measure Ω)
    [IsProbabilityMeasure P] (ℱ : Filtration ℝ≥0 m0) (X : ℝ≥0 → Ω → M)
    (w : ℝ≥0 → ℝ≥0 → ℝ≥0 → ℝ≥0) (hX : SatisfiesStandingAssumption Φ P ℱ X w) :
    IsPositivelyInvariant Φ (attainableSet P X) := by sorry

end StochApproxDyn.Attractor
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 31, Section 7.1, Lemma 7.1 (second assertion)
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