Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 — almost-sure convergence under a weighted maximum norm contraction

Proved
AsyncSA.Contraction.theorem3

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 Assumption 5 holds: there are a vector x∗∈Rnx^*\in\mathbb R^nx∗∈Rn, a strictly positive weight vector vvv, and β∈[0,1)\beta\in[0,1)β∈[0,1) such that

∥F(y)−x∗∥v≤β∥y−x∗∥vfor every y∈Rn.\|F(y)-x^*\|_v\le\beta\|y-x^*\|_v\qquad\text{for every }y\in\mathbb R^n.∥F(y)−x∗∥v​≤β∥y−x∗∥v​for every y∈Rn.

Then x(t)→x∗x(t)\to x^*x(t)→x∗ with probability one, including when different coordinates are updated at different times using outdated values.

This is the paper's contraction-based convergence theorem and the mission's goal.

Formalization Note The witnesses x∗x^*x∗, vvv, and β\betaβ are explicit binders, equivalent to their existence in Assumption 5. The paper implicitly treats x(t)x(t)x(t) as adapted to F(t)\mathcal F(t)F(t); the statement includes adaptedness. No separate boundedness or Assumption 6 hypothesis is made.

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

open MeasureTheory Filter Topology

/-- Theorem 3, p. 189: almost-sure convergence to the contraction's fixed point. -/
theorem theorem3 {n : ℕ} {Ω : Type*} [m₀ : MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (𝓕 : Filtration ℕ m₀) (alg : Algorithm n Ω)
    (xstar v : Fin n → ℝ) (β : ℝ)
    (h1 : alg.Assumption1 P) (h2 : alg.Assumption2 P 𝓕)
    (hx : alg.Adapted 𝓕) (h3 : alg.Assumption3 P)
    (h5 : Assumption5 alg.F xstar v β) :
    ∀ᵐ ω ∂P, Tendsto (fun t => alg.x t ω) atTop (𝓝 xstar) := by sorry

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