Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.2.4 — (SEN) does not depend on the choice of distinguished state

Proved
SennottDP.SEN.prop_7_2_4_sen_any_state

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

average-costp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1sen-assumptions

Assume that the (SEN) assumptions hold for a distinguished state zzz (with some function MMM and constant LLL). Then for every other state xxx the (SEN) assumptions also hold with xxx as the distinguished state, for some nonnegative finite function MxM_xMx​ and some nonnegative finite constant LxL_xLx​:

(SEN)z  ⟹  (SEN)xfor all x∈S.\text{(SEN)}_z \;\Longrightarrow\; \text{(SEN)}_x \qquad \text{for all } x \in S.(SEN)z​⟹(SEN)x​for all x∈S.

Verifying (SEN) therefore only requires a convenient choice of reference state.

Preamble
import Mathlib
import Definitions.Def_SennottDP_SEN_Assumptions
Formal statement
namespace SennottDP.SEN

/-- Sennott (1999), Proposition 7.2.4, p. 137: assume that the (SEN) assumptions hold for a
distinguished state `z` (with some function `Mf` in (SEN2) and constant `L` in (SEN3)). Then
(SEN) holds if `z` is replaced by any other state `x`: there are a function `Mx` and a constant
`Lx` for which (SEN1)–(SEN3) hold with distinguished state `x`. -/
theorem prop_7_2_4_sen_any_state {S : Type} [Countable S] {Act : Type} (M : SennottDP.Discounted.MDC S Act) (z : S)
    (Mf : S → ℝ) (L : ℝ) (hSEN : SENAssumptions M z Mf L) (x : S) :
    ∃ (Mx : S → ℝ) (Lx : ℝ), SENAssumptions M x Mx Lx := by sorry

end SennottDP.SEN
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 137, Proposition 7.2.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