Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5(a) — the robust Bellman operator L_D maps V into V and is a λ-contraction

Proved
RobustDP.Discounted.theorem5a_contraction

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

contractiondynamic-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let (S,A,P,r,λ)(\mathcal S,\mathcal A,\mathcal P,r,\lambda)(S,A,P,r,λ) be a discounted ambiguous MDP and let D\mathcal DD be any nonempty set of deterministic Markov decision rules. Then LD\mathcal L_{\mathcal D}LD​ maps bounded functions to bounded functions, and for all bounded U,V:S→RU,V:\mathcal S\to\mathbb RU,V:S→R,

∥LDU−LDV∥≤λ ∥U−V∥.\|\mathcal L_{\mathcal D}U-\mathcal L_{\mathcal D}V\|\le\lambda\,\|U-V\|.∥LD​U−LD​V∥≤λ∥U−V∥.

Since λ<1\lambda<1λ<1, LD\mathcal L_{\mathcal D}LD​ is a contraction of the Banach space (V,∥⋅∥)(\mathbf V,\|\cdot\|)(V,∥⋅∥); this is the input to the Banach fixed point argument of Theorem 5(b).

Formalization Note D\mathcal DD is an arbitrary nonempty set of rules, as on the page ("Let D\mathcal DD be any subset"); nonemptiness excludes the empty supremum. ∥⋅∥\|\cdot\|∥⋅∥ is the supremum norm.

Preamble
import Mathlib
import Definitions.Def_RobustDP_Discounted_Model
import Definitions.Def_RobustDP_Discounted_Value
import Definitions.Def_RobustDP_Discounted_Bellman
Formal statement
namespace RobustDP.Discounted

theorem theorem5a_contraction {S A : Type*} [Countable S] [Countable A] (M : Model S A)
    (D : Set (DecisionRule M)) (hD : D.Nonempty) (U W : S → ℝ) (hU : IsBounded U)
    (hW : IsBounded W) :
    IsBounded (L M D U) ∧
      supNorm (fun s => L M D U s - L M D W s) ≤ M.lam * supNorm (fun s => U s - W s) := by sorry

end RobustDP.Discounted
Source
Iyengar, Robust dynamic programming, CORC Tech Report TR-2002-07 (rev. May 4, 2004), p. 9, Theorem 5(a), eq. (23)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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