Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 7, p. 19 — the conservative policy loses at most ξ/(1−γ) in its own MDP: V̂^π − V̂^{π̂c} ≤ ξ/(1−γ)

Proved
BreakingSample.Conservative.lemma_7

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

conservative-planningmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-function

Let M^=(S,A,P^,r,γ)\widehat{\mathcal M} = (\mathcal S, \mathcal A, \widehat P, r, \gamma)M=(S,A,P,r,γ) be a finite discounted MDP (kernel P^\widehat PP, rewards in [0,1][0,1][0,1], γ∈(0,1)\gamma\in(0,1)γ∈(0,1)) with a linearly ordered action set, and let Q^⋆\widehat Q^\starQ​⋆, V^⋆\widehat V^\starV⋆ be its optimal Q- and value functions. Let ς≤ξ\varsigma \le \xiς≤ξ and let π^c\widehat\pi_{\mathrm c}πc​ follow the conservative rule π^c(s)=min⁡{a:Q^⋆(s,a)>V^⋆(s)−ς}\widehat\pi_{\mathrm c}(s) = \min\{a : \widehat Q^\star(s,a) > \widehat V^\star(s) - \varsigma\}πc​(s)=min{a:Q​⋆(s,a)>V⋆(s)−ς}. Then for every deterministic policy π\piπ and every state sss,

V^π(s)−V^π^c(s)≤ξ1−γ.\widehat V^{\pi}(s) - \widehat V^{\widehat\pi_{\mathrm c}}(s) \le \frac{\xi}{1-\gamma}.Vπ(s)−Vπc​(s)≤1−γξ​.

In the paper π=π⋆\pi = \pi^\starπ=π⋆, the optimal policy of the true MDP, and P^\widehat PP is the empirical kernel; the bound controls the middle term of the decomposition (51) of V⋆−Vπ^cV^\star - V^{\widehat\pi_{\mathrm c}}V⋆−Vπc​.

Formalization Note The statement holds for any kernel and for any policy π\piπ in place of π⋆\pi^\starπ⋆, which is stronger than the page (the paper's proof ends with V^π⋆≤V^⋆\widehat V^{\pi^\star} \le \widehat V^\starVπ⋆≤V⋆, valid for every π\piπ). Only ς≤ξ\varsigma \le \xiς≤ξ is assumed; the rule cannot hold for ς≤0\varsigma \le 0ς≤0, so ς∈[0,ξ]\varsigma \in [0,\xi]ς∈[0,ξ] of the page is implied.

Preamble
import Mathlib
import Definitions.Def_BreakingSample_Perturbed_Model
import Definitions.Def_BreakingSample_Conservative_Rule
Formal statement
namespace BreakingSample.Conservative

theorem lemma_7 {S A : Type} [Fintype S] [DecidableEq S] [Fintype A] [LinearOrder A] [Nonempty A]
    (P : S → A → S → ℝ) (r : S → A → ℝ) (γ : ℝ) (hM : BreakingSample.Perturbed.IsDiscountedMDP P r γ)
    (ξ ς : ℝ) (hς : ς ≤ ξ) (πc : S → A)
    (hc : IsConservative (BreakingSample.Perturbed.optQ P r γ) (BreakingSample.Perturbed.optValue P r γ) ς πc) (π : S → A) :
    ∀ s, BreakingSample.Perturbed.value P r γ π s - BreakingSample.Perturbed.value P r γ πc s ≤ ξ / (1 - γ) := by sorry

end BreakingSample.Conservative
Source
arXiv:2005.12900v8, Lemma 7, p. 19, (52); proof in App. B.6, p. 33
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me