Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.7.1 — under D and D.2 with finite S and J* > −∞, ε-optimal policies exist

Proved
BertsekasShreve.Monotone.cor5_7_1_finite_state_eps_optimal

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

dynamic-programmingepsilon-optimal-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1uniform-decrease

In the abstract monotone dynamic programming model (state space SSS, constraint sets U(x)U(x)U(x), monotone mapping HHH, terminal function J0>−∞J_0>-\inftyJ0​>−∞, policy costs Jπ=lim⁡N(Tμ0⋯TμN−1)(J0)J_\pi=\lim_N(T_{\mu_0}\cdots T_{\mu_{N-1}})(J_0)Jπ​=limN​(Tμ0​​⋯TμN−1​​)(J0​) and optimal cost J∗=inf⁡πJπJ^*=\inf_\pi J_\piJ∗=infπ​Jπ​), assume

  1. Assumption D: J0(x)≥H(x,u,J0)J_0(x)\ge H(x,u,J_0)J0​(x)≥H(x,u,J0​) for all x∈Sx\in Sx∈S, u∈U(x)u\in U(x)u∈U(x);
  2. Assumption D.2 holds for some scalar α>0\alpha>0α>0;
  3. SSS is a finite set;
  4. J∗(x)>−∞J^*(x)>-\inftyJ∗(x)>−∞ for all x∈Sx\in Sx∈S.

Then for every ε>0\varepsilon>0ε>0 there exists an ε\varepsilonε-optimal policy, i.e. a policy πε\pi_\varepsilonπε​ with

J∗≤Jπε≤J∗+ε.J^*\le J_{\pi_\varepsilon}\le J^*+\varepsilon.J∗≤Jπε​​≤J∗+ε.

It is the counterpart under Assumption D of the existence of ε\varepsilonε-optimal policies under Assumption I (Proposition 5.1 and Proposition 5.6(a)).

Formalization Note The model and the assumptions are the published MonotoneDP.Decrease definitions. Because J∗>−∞J^*>-\inftyJ∗>−∞ is assumed, the book's general ε\varepsilonε-optimality convention reduces to the displayed inequality; at states with J∗(x)=+∞J^*(x)=+\inftyJ∗(x)=+∞ the bound is +∞+\infty+∞.

Preamble
import Mathlib
import Definitions.Def_MonotoneDP_Decrease_Model
import Definitions.Def_MonotoneDP_Decrease_Assumptions
Formal statement
namespace BertsekasShreve.Monotone

/-- Bertsekas & Shreve (1996), p. 80, Corollary 5.7.1: let D and D.2 hold, let `S` be a finite set,
and let `J*(x) > −∞` for all `x ∈ S`. Then for every `ε > 0` there is a policy `π_ε` with
`J* ≤ J_{π_ε} ≤ J* + ε`. -/
theorem cor5_7_1_finite_state_eps_optimal {S C : Type*} [Finite S]
    (m : MonotoneDP.Decrease.Model S C)
    (hD : m.AssumptionD) (hD2 : ∃ α : ℝ, m.AssumptionD2 α) (hfin : ∀ x : S, ⊥ < m.Jstar x) :
    ∀ ε : ℝ, 0 < ε → ∃ π : m.Policy,
      m.Jstar ≤ m.Jpi π ∧ m.Jpi π ≤ fun x => m.Jstar x + (ε : EReal) := by sorry

end BertsekasShreve.Monotone
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 80, Corollary 5.7.1
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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