Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10 — IVI↓πIVI_{\downarrow\pi}IVI↓π​ and IVI↑πIVI_{\uparrow\pi}IVI↑π​ are contraction mappings

Proved
BoundedParamMDP.IntervalEval.theorem10_contraction

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

contractiondynamic-programmingmarkov-decision-processesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M↕M_\updownarrowM↕​ be a bounded-parameter MDP with finite state set QQQ and finite nonempty action set AAA, and let π:Q→A\pi:Q\to Aπ:Q→A be a policy. Consider the lower- and upper-bound operators of interval policy evaluation, as maps on the space V‾\overline VV of value functions with the sup norm ∥v∥=max⁡q∣v(q)∣\|v\|=\max_{q}|v(q)|∥v∥=maxq​∣v(q)∣:

IVI↓π(v)(p)=min⁡M∈M↕VIM,π(v)(p),IVI↑π(v)(p)=max⁡M∈M↕VIM,π(v)(p).IVI_{\downarrow\pi}(v)(p)=\min_{M\in M_\updownarrow}VI_{M,\pi}(v)(p),\qquad IVI_{\uparrow\pi}(v)(p)=\max_{M\in M_\updownarrow}VI_{M,\pi}(v)(p).IVI↓π​(v)(p)=M∈M↕​min​VIM,π​(v)(p),IVI↑π​(v)(p)=M∈M↕​max​VIM,π​(v)(p).

Theorem 10. Both IVI↓πIVI_{\downarrow\pi}IVI↓π​ and IVI↑πIVI_{\uparrow\pi}IVI↑π​ are contraction mappings: for each of them, TTT, there is λ∈[0,1)\lambda\in[0,1)λ∈[0,1) with

∥Tv−Tu∥≤λ ∥v−u∥for all u,v∈V‾.\|T v-T u\|\le\lambda\,\|v-u\|\qquad\text{for all }u,v\in\overline V.∥Tv−Tu∥≤λ∥v−u∥for all u,v∈V.

Together with Theorem 11 and the Banach fixed-point theorem, this gives the convergence of interval policy evaluation.

Formalization Note. The statement asserts the existence of a modulus, as the paper's notion of contraction mapping does; it does not fix the modulus to γ\gammaγ.

Preamble
import Mathlib
import Definitions.Def_BoundedParamMDP_Optimal_MDP
import Definitions.Def_BoundedParamMDP_Optimal_BMDP
import Definitions.Def_BoundedParamMDP_IntervalEval_IntervalPolicyEvaluation
Formal statement
namespace BoundedParamMDP.IntervalEval

/-- Theorem 10 (Givan–Leach–Dean 2000, p. 21; restated p. 43): for any policy `π`, the
interval policy evaluation operators `IVI↓π` and `IVI↑π`, viewed as maps from value functions
to value functions, are contraction mappings for the sup norm. -/
theorem theorem10_contraction {Q A : Type*} [Fintype Q] [Fintype A] [Nonempty A]
    (B : BoundedParamMDP.Optimal.BMDP Q A) (π : BoundedParamMDP.Optimal.Policy Q A) :
    IsContraction (IVIlo B π) ∧ IsContraction (IVIhi B π) := by sorry

end BoundedParamMDP.IntervalEval
Source
Givan, Leach, Dean, Bounded-parameter Markov decision processes, Artificial Intelligence (2000), DOI 10.1016/S0004-3702(00)00047-3, manuscript of May 22, 2000, p. 21, Theorem 10 (restated with proof pp. 43–44)
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