Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(36)–(42), pp. 404–405 — under (33)–(35), (M(x) − α)/(x − θ) ≥ δM′(θ)/2A_n for 0 < |x − θ| ≤ A_n

Proved
RobbinsMonroSA.Conv.eq_42

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

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

Let M:R→RM : \mathbb R \to \mathbb RM:R→R be nondecreasing (33), with M(θ)=αM(\theta) = \alphaM(θ)=α (34) and with derivative M′(θ)>0M'(\theta) > 0M′(θ)>0 at θ\thetaθ (35). Then there is a constant δ>0\delta > 0δ>0 such that for every AAA with δ/A≤1\delta/A \le 1δ/A≤1,

M(x)−αx−θ≥δM′(θ)2Afor 0<∣x−θ∣≤A.(42)\frac{M(x) - \alpha}{x - \theta} \ge \frac{\delta M'(\theta)}{2A} \qquad\text{for } 0 < |x - \theta| \le A. \tag{42}x−θM(x)−α​≥2AδM′(θ)​for 0<∣x−θ∣≤A.(42)

Applied with A=AnA = A_nA=An​ (which tends to infinity), this gives (25) with K=δM′(θ)/2>0K = \delta M'(\theta)/2 > 0K=δM′(θ)/2>0, so Lemma 2 applies under (33)–(35).

Formalization Note This is a deterministic statement about any function MMM. The paper's "we may assume without loss of generality that δ/An≤1\delta/A_n \le 1δ/An​≤1" is the hypothesis δ≤A\delta \le Aδ≤A; differentiability at θ\thetaθ is HasDerivAt M M' θ.

Preamble
import Mathlib
import Definitions.Def_RobbinsMonroSA_Conv_Setting

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace RobbinsMonroSA.Conv

/-- (36)–(42), pp. 404–405. If `M` is nondecreasing with `M(θ) = α` and `M′(θ) > 0`, there is
`δ > 0` such that for every `A ≥ δ`, `(M(z) - α)/(z - θ) ≥ δ M′(θ) / 2A` on `0 < |z - θ| ≤ A`. -/
theorem eq_42 (M : ℝ → ℝ) (α θ M' : ℝ) (h33 : Monotone M) (h34 : M θ = α)
    (h35 : HasDerivAt M M' θ) (h35pos : 0 < M') :
    ∃ δ : ℝ, 0 < δ ∧ ∀ A : ℝ, δ ≤ A → ∀ z : ℝ, 0 < |z - θ| → |z - θ| ≤ A →
      δ * M' / (2 * A) ≤ (M z - α) / (z - θ) := by sorry

end RobbinsMonroSA.Conv
Source
Robbins and Monro, A stochastic approximation method, Ann. Math. Statist. 22 (1951), pp. 404–405, (33)–(42)
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