Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.1, proof, p. 13 — the affine and piecewise constant interpolations differ by at most 2Δ(t − 1, T + 1) + K sup γ̄

Proved
StochApproxDyn.Interpolation.interpAffine_sub_interpConst_le

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​). Suppose ∥F(xn)∥≤K\|F(x_n)\|\le K∥F(xn​)∥≤K for all nnn. Then there is t0≥1t_0\ge1t0​≥1 such that for all t≥t0t\ge t_0t≥t0​ and all T>0T>0T>0,

sup⁡t≤u≤t+T∥X(u)−X‾(u)∥≤2Δ(t−1,T+1)+sup⁡t≤u≤t+TKγˉ(u).\sup_{t\le u\le t+T}\|X(u)-\overline X(u)\|\le2\Delta(t-1,T+1)+\sup_{t\le u\le t+T}K\bar\gamma(u).t≤u≤t+Tsup​∥X(u)−X(u)∥≤2Δ(t−1,T+1)+t≤u≤t+Tsup​Kγˉ​(u).

In the proof of Proposition 4.1 this estimate shows that X−X‾→0X-\overline X\to0X−X→0 uniformly on windows of length TTT once A1 holds, so that F(X‾)F(\overline X)F(X) may be replaced by F(X)F(X)F(X) in Eq. (9).

Formalization Note "For ttt large enough" is the existential threshold t0t_0t0​, chosen independently of TTT; t0≥1t_0\ge1t0​≥1 makes Δ(t−1,⋅)\Delta(t-1,\cdot)Δ(t−1,⋅) a quantity on R+\mathbb R_+R+​. The bound KKK is a hypothesis on the iterates; in the paper it comes from A2 and the continuity of FFF (A2′ also yields it). Both suprema are real suprema over bounded nonempty sets: γˉ\bar\gammaγˉ​ takes finitely many values on [t,t+T][t,t+T][t,t+T].

Preamble
import Mathlib
import Definitions.Def_StochApproxDyn_Interpolation_Scheme

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

/-- Benaïm 1999, proof of Proposition 4.1, p. 13: if `‖F(x_n)‖ ≤ K` for all `n`, then for all `t`
large enough (with `t ≥ 1`) and every `T > 0`,
`sup_{t≤u≤t+T} ‖X(u) − X̄(u)‖ ≤ 2Δ(t − 1, T + 1) + sup_{t≤u≤t+T} K γ̄(u)`.
The threshold does not depend on `T`. -/
theorem interpAffine_sub_interpConst_le {d : ℕ}
    (F : EuclideanSpace ℝ (Fin d) → EuclideanSpace ℝ (Fin d)) (hF : Continuous F)
    (γ : ℕ → ℝ) (hγ : IsStepSizeSeq γ) (x U : ℕ → EuclideanSpace ℝ (Fin d))
    (hx : SatisfiesScheme F γ x U) (K : ℝ) (hK : ∀ n : ℕ, ‖F (x n)‖ ≤ K) :
    ∃ t₀ : ℝ, 1 ≤ t₀ ∧ ∀ t : ℝ, t₀ ≤ t → ∀ T : ℝ, 0 < T → ∀ u ∈ Set.Icc t (t + T),
      ‖interpAffine γ x u - interpConst γ x u‖ ≤
        2 * Delta γ U (t - 1) (T + 1) +
          sSup ((fun v => K * stepInterp γ v) '' Set.Icc t (t + T)) := by sorry

end StochApproxDyn.Interpolation
Source
Benaïm, Dynamics of Stochastic Approximation Algorithms, Séminaire de Probabilités XXXIII, LNM 1709 (1999), p. 13, proof of Proposition 4.1 (display following "Thus")
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