Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (52): 1n∑i=1nUi+1(f,T)−1n∑i=1nUi(f∘ΦT,T)→0\frac1n\sum_{i=1}^n U_{i+1}(f,T)-\frac1n\sum_{i=1}^n U_i(f\circ\Phi_T,T)\to0n1​∑i=1n​Ui+1​(f,T)−n1​∑i=1n​Ui​(f∘ΦT​,T)→0 a.s.

Proved
StochApproxDyn.WeakAPT.block_average_difference_eq52

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

dynamical-systemsp2o-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. Then there is a set Ω(f,T)⊂Ω\Omega(f,T)\subset\OmegaΩ(f,T)⊂Ω of full measure such that for all ω∈Ω(f,T)\omega\in\Omega(f,T)ω∈Ω(f,T)

lim⁡n→∞ 1n∑i=1nUi+1(f,T)−1n∑i=1nUi(f∘ΦT,T)=0.(52)\lim_{n\to\infty}\ \frac1n\sum_{i=1}^n U_{i+1}(f,T)-\frac1n\sum_{i=1}^n U_i(f\circ\Phi_T,T)=0. \tag{52}n→∞lim​ n1​i=1∑n​Ui+1​(f,T)−n1​i=1∑n​Ui​(f∘ΦT​,T)=0.(52)

In words: along almost every path, the time average of fff and the time average of f∘ΦTf\circ\Phi_Tf∘ΦT​ over the first nTnTnT units of time differ by o(n)o(n)o(n) after normalisation by nnn. Combined with weak convergence of occupation measures (Eq. (53)), this yields ∫f∘ΦT dμ=∫f dμ\int f\circ\Phi_T\,d\mu=\int f\,d\mu∫f∘ΦT​dμ=∫fdμ for every limit point μ\muμ.

Formalization Note "There is a set of full measure on which ..." is stated as "for PPP-almost every ω\omegaω ...".

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. (52), p. 63: if `X` is a weak asymptotic
pseudotrajectory of `Φ`, `f : M → [0, 1]` is uniformly continuous and `T > 0`, then almost surely
`(1/n) ∑_{i=1}^n U_{i+1}(f,T) - (1/n) ∑_{i=1}^n U_i(f ∘ Φ_T, T) → 0`. -/
theorem block_average_difference_eq52
    {Ω 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 n : ℕ => (1 / (n : ℝ)) * ∑ i ∈ Finset.Icc 1 n, blockIntegral X f T (i + 1) ω -
        (1 / (n : ℝ)) * ∑ i ∈ Finset.Icc 1 n, blockIntegral X (f ∘ Φ T) T i ω)
      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. 63 (PDF p. 64), Eq. (52)
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