Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.4.1 — hα(i)≤ciz(θi)h_\alpha(i)\le c_{iz}(\theta_i)hα​(i)≤ciz​(θi​), hence (SEN2)

Proved
SennottDP.BOR.relValue_le_passageCost

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

average-costdynamic-programmingfirst-passagep2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let zzz be a distinguished state and α∈(0,1)\alpha\in(0,1)α∈(0,1) with Vα(z)<∞V_\alpha(z)<\inftyVα​(z)<∞, and let hα(i)=Vα(i)−Vα(z)h_\alpha(i)=V_\alpha(i)-V_\alpha(z)hα​(i)=Vα​(i)−Vα​(z). If i≠zi\ne zi=z and θi∈ℜ∗(i,z)\theta_i\in\Re^*(i,z)θi​∈ℜ∗(i,z) (from iii the policy reaches zzz with probability one, in finite expected time and at finite expected cost), then

hα(i)≤ciz(θi).h_\alpha(i)\le c_{iz}(\theta_i).hα​(i)≤ciz​(θi​).

Hence, if Vα(z)<∞V_\alpha(z)<\inftyVα​(z)<∞ for every α∈(0,1)\alpha\in(0,1)α∈(0,1) and every i≠zi\neq zi=z has such a policy θi\theta_iθi​, then (SEN2) holds for zzz with M(i)=ciz(θi)M(i)=c_{iz}(\theta_i)M(i)=ciz​(θi​) for i≠zi\ne zi=z and M(z)=0M(z)=0M(z)=0.

This is the basic way of verifying the upper bound (SEN2) through first passage costs.

Formalization Note hαh_\alphahα​ is valued in the extended reals; the inequality also asserts Vα(i)<∞V_\alpha(i)<\inftyVα​(i)<∞. The value M(z)=0M(z)=0M(z)=0 is the book's remark on p. 133 (hα(z)=0h_\alpha(z)=0hα​(z)=0).

Preamble
import Mathlib
import Definitions.Def_SennottDP_BOR_Assumptions

open scoped ENNReal NNReal
open Filter Topology
Formal statement
namespace SennottDP.BOR

/-- Sennott (1999), Lemma 7.4.1, p. 140. Let `z` be a distinguished state and `α ∈ (0,1)` with
`V_α(z) < ∞`. If `i ≠ z` and `θ ∈ ℜ*(i,z)`, then `h_α(i) ≤ c_{iz}(θ)`. Hence, if `V_α(z) < ∞`
for every `α ∈ (0,1)` and every `i ≠ z` has a policy `θ_i ∈ ℜ*(i,z)`, then (SEN2) holds for `z`
with `M(i) = c_{iz}(θ_i)` for `i ≠ z` and `M(z) = 0`. -/
theorem relValue_le_passageCost {S Act : Type} [Countable S] [DecidableEq S] (M : SennottDP.Discounted.MDC S Act) (z : S) :
    (∀ α : ℝ, 0 < α → α < 1 → valueFn M α z < ⊤ →
      ∀ i, i ≠ z → ∀ θ : SennottDP.Discounted.Policy M, InRStar θ i {z} →
        relValue M z α i ≤ ((passageCost θ i {z} : ℝ≥0∞) : EReal)) ∧
    ((∀ α : ℝ, 0 < α → α < 1 → valueFn M α z < ⊤) →
      ∀ θ : S → SennottDP.Discounted.Policy M, (∀ i, i ≠ z → InRStar (θ i) i {z}) →
        SEN2 M z (fun i => if i = z then 0 else (passageCost (θ i) i {z}).toReal)) := by sorry

end SennottDP.BOR
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 140, Lemma 7.4.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