Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 7.1, p. 14 — ‖v_s − T(v_s)‖∞ ≤ λ′^s ‖v₀ − T(v₀)‖∞ for every s ∈ ℕ

Proved
AccelVI.SafeAVI.residual_geometric

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

accelerationbellman-residualmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paper

Let (S,A,P,r,λ)(\mathbb S,\mathbb A,P,r,\lambda)(S,A,P,r,λ) be a valid finite MDP with a nonempty action set and Bellman operator TTT, let λ′∈[λ,1)\lambda'\in[\lambda,1)λ′∈[λ,1) and α,γ>0\alpha,\gamma>0α,γ>0, and let (vs)s≥0(v_s)_{s\ge0}(vs​)s≥0​ be the iterates of Safe Accelerated Value Iteration (Algorithm 1) started at v0∈RSv_0\in\mathbb R^{\mathbb S}v0​∈RS. Then for every s∈Ns\in\mathbb Ns∈N,

∥vs−T(vs)∥∞≤λ′ s ∥v0−T(v0)∥∞.\|v_s - T(v_s)\|_\infty \le \lambda'^{\,s}\,\|v_0 - T(v_0)\|_\infty .∥vs​−T(vs​)∥∞​≤λ′s∥v0​−T(v0​)∥∞​.

The Bellman residual of the safe scheme therefore decays geometrically at rate λ′\lambda'λ′, whichever mix of accelerated and value-iteration steps the test in Step 5 selects. Combined with the bound of the distance to v∗v^*v∗ by the residual, it yields the rate of Theorem 7.1.

Formalization Note ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ is Mathlib's sup norm on S → ℝ; vsv_svs​ is savi M lam' α γ v0 s.

Preamble
import Mathlib
import Definitions.Def_AccelVI_SafeAVI_Setting
Formal statement
namespace AccelVI.SafeAVI
theorem residual_geometric {S A : Type*} [Fintype S] [DecidableEq S] [Fintype A] [Nonempty A]
    (M : MDP S A) (hM : M.Valid) (lam' α γ : ℝ) (hlam' : M.lam ≤ lam') (hlam'1 : lam' < 1)
    (hα : 0 < α) (hγ : 0 < γ) (v0 : S → ℝ) (s : ℕ) :
    ‖savi M lam' α γ v0 s - bellman M (savi M lam' α γ v0 s)‖ ≤ lam' ^ s * ‖v0 - bellman M v0‖ := by sorry
end AccelVI.SafeAVI
Source
Goyal & Grand-Clément, A First-Order Approach to Accelerated Value Iteration, arXiv:1905.09963v7, p. 14, proof of Theorem 7.1, sentence beginning "Overall, we have proved by recursion"
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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