Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — almost-sure boundedness under weighted linear growth

Proved
AsyncSA.Contraction.theorem1

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

asynchronous-iterationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1q-learningstochastic-approximation

Consider the asynchronous stochastic approximation iteration of §2 under Assumptions 1, 2, and 3. Suppose the map FFF satisfies Assumption 6: for some positive weight vector vvv, β∈[0,1)\beta\in[0,1)β∈[0,1), and D∈RD\in\mathbb RD∈R,

∥F(y)∥v≤β∥y∥v+Dfor all y∈Rn.\|F(y)\|_v\le\beta\|y\|_v+D\qquad\text{for all }y\in\mathbb R^n.∥F(y)∥v​≤β∥y∥v​+Dfor all y∈Rn.

Then, with probability one, there is a finite bound MMM on every coordinate ∣xi(t)∣|x_i(t)|∣xi​(t)∣ at every time ttt. The bound may depend on the sample path.

This boundedness theorem is the intermediate result used in the proof of contraction-based convergence.

Formalization Note The paper uses adaptedness of x(t)x(t)x(t) implicitly, through measurability of its running maximum; it is explicit here. Conditional moments are generalized measurable-set statements. The uniform squared-step-size bound is chosen before the almost-sure quantifier.

Preamble
import Mathlib
import Definitions.Def_AsyncSA_Contraction_Model
Formal statement
namespace AsyncSA.Contraction

open MeasureTheory Filter Topology

/-- Theorem 1, p. 189: sample-path boundedness under Assumption 6. -/
theorem theorem1 {n : ℕ} {Ω : Type*} [m₀ : MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (𝓕 : Filtration ℕ m₀) (alg : Algorithm n Ω)
    (h1 : alg.Assumption1 P) (h2 : alg.Assumption2 P 𝓕)
    (hx : alg.Adapted 𝓕) (h3 : alg.Assumption3 P)
    (h6 : Assumption6 alg.F) :
    ∀ᵐ ω ∂P, ∃ M : ℝ, ∀ t j, |alg.x t ω j| ≤ M := by sorry

end AsyncSA.Contraction
Source
Tsitsiklis, Asynchronous Stochastic Approximation and Q-Learning, Machine Learning 16 (1994), p. 189, §2, Theorem 1; proof pp. 190–192, §4
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