Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4.1, Eq. (9) — the interpolated process solves the integral form of (7)

Proved
StochApproxDyn.Interpolation.interpAffine_sub_eq_integral

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

p2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-approximation

Let F:Rd→RdF:\mathbb R^d\to\mathbb R^dF:Rd→Rd be continuous, let the step sizes satisfy γn≥0\gamma_n\ge0γn​≥0, ∑nγn=∞\sum_n\gamma_n=\infty∑n​γn​=∞, γn→0\gamma_n\to0γn​→0, and let {xn}\{x_n\}{xn​} follow the scheme xn+1−xn=γn+1(F(xn)+Un+1)x_{n+1}-x_n=\gamma_{n+1}(F(x_n)+U_{n+1})xn+1​−xn​=γn+1​(F(xn​)+Un+1​). Let XXX be the affine interpolation of {xn}\{x_n\}{xn​} on the time scale τn=∑i≤nγi\tau_n=\sum_{i\le n}\gamma_iτn​=∑i≤n​γi​, X‾\overline XX the piecewise constant interpolation and U‾\overline UU the piecewise constant interpolation of the perturbations. Then for every t≥0t\ge0t≥0

X(t)−X(0)=∫0t[F(X‾(s))+U‾(s)] ds.X(t)-X(0)=\int_0^t\big[F(\overline X(s))+\overline U(s)\big]\,ds .X(t)−X(0)=∫0t​[F(X(s))+U(s)]ds.

Equation (9) turns the discrete recursion into an integral equation that differs from the integral form of x˙=F(x)\dot x=F(x)x˙=F(x) only by the replacement of XXX with X‾\overline XX and by the noise integral; every later comparison with the flow of FFF starts from it.

Formalization Note The integral is the interval integral of a piecewise constant function, which is integrable on [0,t][0,t][0,t] under the standing assumptions, so no junk value enters.

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_Interpolation_Scheme

open scoped NNReal Topology
open Filter
Formal statement
namespace StochApproxDyn.Interpolation

/-- Benaïm 1999, §4.1, Eq. (9), p. 12: under the standing assumptions on `γ` and the recursion (7),
the affine interpolated process solves the integral form of (7):
`X(t) − X(0) = ∫_0^t [F(X̄(s)) + Ū(s)] ds` for every `t ≥ 0`. -/
theorem interpAffine_sub_eq_integral {d : ℕ}
    (F : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (hF : Continuous F)
    (γ : ℕ → ℝ) (hγ : IsStepSizeSeq γ) (x U : ℕ → EuclideanSpace ℝ (Fin d))
    (hx : SatisfiesScheme F γ x U) (t : ℝ) (ht : 0 ≤ t) :
    interpAffine γ x t - interpAffine γ x 0 =
      ∫ s in (0 : ℝ)..t, (F (interpConst γ x s) + noiseInterp γ U s) := by sorry

end StochApproxDyn.Interpolation
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 12, Section 4.1, Eq. (9)
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