Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 3 — the Bellman operator T is a λ-contraction of (ℝⁿ, ‖·‖∞)

Proved
AccelVI.SafeAVI.bellman_contraction

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

bellman-operatorcontractionmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (S,A,P,r,λ)(\mathbb S,\mathbb A,P,r,\lambda)(S,A,P,r,λ) be a finite MDP with a nonempty action set, in which every PiaP_{ia}Pia​ is a probability distribution over next states and λ∈(0,1)\lambda\in(0,1)λ∈(0,1), and let TTT be its Bellman operator T(v)i=max⁡a{ria+λPia⊤v}T(v)_i = \max_{a}\{r_{ia} + \lambda P_{ia}^\top v\}T(v)i​=maxa​{ria​+λPia⊤​v}. Then for all v,w∈RSv,w\in\mathbb R^{\mathbb S}v,w∈RS,

∥T(v)−T(w)∥∞≤λ ∥v−w∥∞.\|T(v) - T(w)\|_\infty \le \lambda\,\|v - w\|_\infty .∥T(v)−T(w)∥∞​≤λ∥v−w∥∞​.

This is the basic fact behind value iteration and behind every convergence argument for the safe accelerated scheme: it bounds the residual after a value-iteration step and ties the residual to the distance to the fixed point.

Formalization Note ∥⋅∥∞\|\cdot\|_\infty∥⋅∥∞​ is Mathlib's sup norm on S → ℝ.

Preamble
import Mathlib
import Definitions.Def_AccelVI_SafeAVI_Setting
Formal statement
namespace AccelVI.SafeAVI
theorem bellman_contraction {S A : Type*} [Fintype S] [DecidableEq S] [Fintype A] [Nonempty A]
    (M : MDP S A) (hM : M.Valid) (v w : S → ℝ) :
    ‖bellman M v - bellman M w‖ ≤ M.lam * ‖v - w‖ := by sorry
end AccelVI.SafeAVI
Source
Goyal & Grand-Clément, A First-Order Approach to Accelerated Value Iteration, arXiv:1905.09963v7, p. 3, §2, sentence after (2.1)
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