Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (51): E(Ui+1(f,T)−Ui(f∘ΦT,T)∣F(i−1)T)→0E(U_{i+1}(f,T)-U_i(f\circ\Phi_T,T)\mid\mathcal F_{(i-1)T})\to0E(Ui+1​(f,T)−Ui​(f∘ΦT​,T)∣F(i−1)T​)→0 a.s. for a weak asymptotic pseudotrajectory

Proved
StochApproxDyn.WeakAPT.conditional_drift_eq51

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

dynamical-systemsmartingalesp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-approximation

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space with a filtration {Ft}t≥0\{\mathcal F_t\}_{t\ge0}{Ft​}t≥0​, let (M,d)(M,d)(M,d) be a separable metric space with its Borel σ\sigmaσ-algebra, let Φ\PhiΦ be a semiflow on MMM, and let XXX be a weak asymptotic pseudotrajectory of Φ\PhiΦ. Let f:M→[0,1]f:M\to[0,1]f:M→[0,1] be uniformly continuous, let T>0T>0T>0, and let Un(g,T)=∫(n−1)TnTg(X(s)) dsU_n(g,T)=\int_{(n-1)T}^{nT}g(X(s))\,dsUn​(g,T)=∫(n−1)TnT​g(X(s))ds for n≥1n\ge1n≥1 and g=fg=fg=f or g=f∘ΦTg=f\circ\Phi_Tg=f∘ΦT​. Then, almost surely,

lim⁡i→∞E(Ui+1(f,T)−Ui(f∘ΦT,T) ∣ F(i−1)T)=0.(51)\lim_{i\to\infty}E\Big(U_{i+1}(f,T)-U_i(f\circ\Phi_T,T)\ \Big|\ \mathcal F_{(i-1)T}\Big)=0. \tag{51}i→∞lim​E(Ui+1​(f,T)−Ui​(f∘ΦT​,T) ​ F(i−1)T​)=0.(51)

Since Ui+1(f,T)−Ui(f∘ΦT,T)=∫(i−1)TiT[f(X(s+T))−f(ΦT(X(s)))] dsU_{i+1}(f,T)-U_i(f\circ\Phi_T,T)=\int_{(i-1)T}^{iT}\big[f(X(s+T))-f(\Phi_T(X(s)))\big]\,dsUi+1​(f,T)−Ui​(f∘ΦT​,T)=∫(i−1)TiT​[f(X(s+T))−f(ΦT​(X(s)))]ds, this says that, conditionally on the past, the process over the next window is on average indistinguishable from the image under ΦT\Phi_TΦT​ of the process over the current window. This is the step of the proof of Theorem 10.1 where the weak asymptotic pseudotrajectory property enters.

Formalization Note Conditional expectations are Mathlib's condExp. The value at i=0i=0i=0 is irrelevant for the limit.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_WeakAPT_WeakAsymptoticPseudotrajectory
import Definitions.Def_StochApproxDyn_WeakAPT_BlockIntegral
Formal statement
namespace StochApproxDyn.WeakAPT

open MeasureTheory Filter Topology
open scoped NNReal

/-- Benaïm (1999), §10, proof of Theorem 10.1, Eq. (51), p. 62: if `X` is a weak asymptotic
pseudotrajectory of `Φ`, `f : M → [0, 1]` is uniformly continuous and `T > 0`, then almost surely
`E(U_{i+1}(f,T) - U_i(f ∘ Φ_T, T) | 𝓕_{(i-1)T}) → 0` as `i → ∞`. -/
theorem conditional_drift_eq51
    {Ω M : Type*} {m0 : MeasurableSpace Ω} [MetricSpace M] [TopologicalSpace.SeparableSpace M]
    [MeasurableSpace M] [BorelSpace M]
    (P : Measure Ω) [IsProbabilityMeasure P] (ℱ : Filtration ℝ≥0 m0)
    (Φ : Flow ℝ≥0 M) (X : ℝ≥0 → Ω → M)
    (hX : IsWeakAsymptoticPseudotrajectory P ℱ Φ X)
    (f : M → ℝ) (hf : UniformContinuous f) (hf01 : ∀ y, f y ∈ Set.Icc (0 : ℝ) 1)
    (T : ℝ≥0) (hT : 0 < T) :
    ∀ᵐ ω ∂P, Tendsto
      (fun i : ℕ => (P[blockIntegral X f T (i + 1) - blockIntegral X (f ∘ Φ T) T i |
        ℱ (((i - 1 : ℕ) : ℝ≥0) * T)]) ω)
      atTop (𝓝 0) := by sorry

end StochApproxDyn.WeakAPT
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), DOI 10.1007/BFb0096509, Section 10, proof of Theorem 10.1, p. 62 (PDF p. 63), Eq. (51)
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