Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7.5.4 — increasing VαV_\alphaVα​ plus a 000 standard policy gives (SEN)

Proved
SennottDP.BOR.sen_of_monotone_value

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

average-costp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

Let S={0,1,2,… }S=\{0,1,2,\dots\}S={0,1,2,…} and assume that Vα(i)V_\alpha(i)Vα​(i) is increasing in iii for every α∈(0,1)\alpha\in(0,1)α∈(0,1). If there exists a 000 standard (randomized stationary) policy, then the (SEN) assumptions hold for the distinguished state 000. Moreover every limit function hhh is nonnegative and increasing in iii:

0≤h(i)≤h(i+1),i≥0.0\le h(i)\le h(i+1),\qquad i\ge0.0≤h(i)≤h(i+1),i≥0.

This is the route to (SEN3) through a structural property of the discount value function.

Preamble
import Mathlib
import Definitions.Def_SennottDP_BOR_Assumptions

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

/-- Sennott (1999), Corollary 7.5.4, p. 144. Let `S = {0, 1, 2, …}` and assume `V_α` is
increasing in `i` for every `α ∈ (0,1)`. If there exists a `0` standard (randomized stationary)
policy, then the (SEN) assumptions hold (for the distinguished state `0`), and every limit function
is nonnegative and increasing in `i`. -/
theorem sen_of_monotone_value {Act : Type} (M : SennottDP.Discounted.MDC ℕ Act)
    (hmono : ∀ α : ℝ, 0 < α → α < 1 → Monotone (valueFn M α))
    (hd : ∃ d : RandStationaryPolicy M, IsZStandard d.toPolicy 0) :
    SEN M 0 ∧ ∀ h : ℕ → ℝ, IsLimitFunction M 0 h → (∀ i, 0 ≤ h i) ∧ Monotone h := by sorry

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