Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 402, after (14) — from (5) d_n ≥ 0, and from (4) 0 ≤ e_n ≤ [C + |α|]²

Proved
RobbinsMonroSA.Conv.dSeq_nonneg_eSeq_bound

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robbins-monrostochastic-approximation

Under the boundedness condition (4) with constant C>0C>0C>0, condition (5) on the regression function MMM, and the process (7)–(8), for every nnn,

dn≥0,0≤en≤[C+∣α∣]2,d_n \ge 0, \qquad 0 \le e_n \le [C + |\alpha|]^2,dn​≥0,0≤en​≤[C+∣α∣]2,

where dn=E[(xn−θ)(M(xn)−α)]d_n = E[(x_n-\theta)(M(x_n)-\alpha)]dn​=E[(xn​−θ)(M(xn​)−α)] and en=E[∫(y−α)2 dH(y∣xn)]e_n = E[\int (y-\alpha)^2\,dH(y\mid x_n)]en​=E[∫(y−α)2dH(y∣xn​)].

These sign and size facts turn the identity (14) into a supermartingale-type recursion for bnb_nbn​.

Formalization Note Indices are 0-based. All standing assumptions of §3 used by the claim, (4), (5) and (7)–(8), are hypotheses; (6) is not needed.

Preamble
import Mathlib
import Definitions.Def_RobbinsMonroSA_Conv_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RobbinsMonroSA.Conv

/-- p. 402, after (14). From (5), `d_n ≥ 0`; from (4), `0 ≤ e_n ≤ [C + |α|]²`. -/
theorem dSeq_nonneg_eSeq_bound {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (H : Kernel ℝ ℝ) [IsMarkovKernel H] (C : ℝ) (h4 : BoundedResponse H C) (α θ : ℝ)
    (a : ℕ → ℝ) (x1 : ℝ) (x y : ℕ → Ω → ℝ) (hxy : IsRMProcess P H a α x1 x y)
    (h5 : CrossesAt (regressionFn H) α θ) :
    ∀ n, 0 ≤ dSeq P H α θ x n ∧ 0 ≤ eSeq P H α x n ∧ eSeq P H α x n ≤ (C + |α|) ^ 2 := by sorry

end RobbinsMonroSA.Conv
Source
Robbins and Monro, A stochastic approximation method, Ann. Math. Statist. 22 (1951), p. 402, after (14)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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