Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5 — the sequences U^k and L^k converge to x*

Proved
AsyncSA.Monotone.lemma5

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

fixed-pointmonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn satisfy Assumption 4 with unique fixed point x∗x^*x∗ (monotone, continuous, unique fixed point, and F(x)−re≤F(x−re)≤F(x+re)≤F(x)+reF(x)-re\le F(x-re)\le F(x+re)\le F(x)+reF(x)−re≤F(x−re)≤F(x+re)≤F(x)+re for all xxx and all r>0r>0r>0). Fix r>0r>0r>0 and let Uk,LkU^k,L^kUk,Lk be defined by U0=x∗+reU^0=x^*+reU0=x∗+re, L0=x∗−reL^0=x^*-reL0=x∗−re and

Uk+1=Uk+F(Uk)2,Lk+1=Lk+F(Lk)2.U^{k+1}=\frac{U^k+F(U^k)}{2},\qquad L^{k+1}=\frac{L^k+F(L^k)}{2}.Uk+1=2Uk+F(Uk)​,Lk+1=2Lk+F(Lk)​.

Then

lim⁡k→∞Uk=x∗andlim⁡k→∞Lk=x∗.\lim_{k\to\infty}U^k=x^*\qquad\text{and}\qquad\lim_{k\to\infty}L^k=x^* .k→∞lim​Uk=x∗andk→∞lim​Lk=x∗.

Together with the bracketing Lk≤x(t)≤UkL^k\le x(t)\le U^kLk≤x(t)≤Uk for large ttt, this is what turns the envelope argument of §5 into convergence of x(t)x(t)x(t) to x∗x^*x∗.

Formalization Note Convergence is in Rn\mathbb R^nRn (Fin n → ℝ with its product topology, equivalently the maximum norm). The statement holds for every r>0r>0r>0, as in Lemma 4.

Preamble
import Mathlib
import Definitions.Def_AsyncSA_Monotone_Model
Formal statement
namespace AsyncSA.Monotone

open Filter Topology

theorem lemma5 {n : ℕ} (F : (Fin n → ℝ) → Fin n → ℝ) (xstar : Fin n → ℝ) (r : ℝ)
    (h4 : Assumption4 F xstar) (hr : 0 < r) :
    Tendsto (Useq F xstar r) atTop (𝓝 xstar) ∧ Tendsto (Lseq F xstar r) atTop (𝓝 xstar) := by sorry

end AsyncSA.Monotone
Source
Tsitsiklis, Asynchronous Stochastic Approximation and Q-Learning, Machine Learning 16 (1994), p. 193, §5, Lemma 5
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