Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.7.1 — (SEN) implies (H*), and (H*) implies (H)

Proved
SennottDP.SEN.prop_7_7_1_sen_hstar_h

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

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

Let zzz be a distinguished state. The three assumption sets are nested:

(SEN)  ⟹  (H∗)  ⟹  (H).\text{(SEN)} \;\Longrightarrow\; \text{(H}^*\text{)} \;\Longrightarrow\; \text{(H)}.(SEN)⟹(H∗)⟹(H).

Precisely: if (SEN) holds with the function MMM in (SEN2) and the constant LLL in (SEN3), then (H*) holds with the same MMM and the constant function L(⋅)≡LL(\cdot) \equiv LL(⋅)≡L; and if (H*) holds with functions MMM and LLL, then (H) holds with the same MMM and LLL.

The (H) assumptions weaken (SEN3) by allowing the lower bound on hαh_\alphahα​ to be a function, at the price of the integrability conditions (H4)–(H5); (H*5) is a sufficient condition for (H5) that is easier to check.

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

/-- Sennott (1999), Proposition 7.7.1, p. 158: (SEN) ⇒ (H*) ⇒ (H). With the witnesses made
explicit: if (SEN) holds for `z` with function `Mf` and constant `L`, then (H*) holds for `z`
with `Mf` and the constant function `L(·) = L`; and if (H*) holds for `z` with functions `Mf`,
`Lf`, then (H) holds for `z` with the same `Mf`, `Lf`. -/
theorem prop_7_7_1_sen_hstar_h {S : Type} [Countable S] {Act : Type} (M : SennottDP.Discounted.MDC S Act) (z : S) :
    (∀ (Mf : S → ℝ) (L : ℝ), SENAssumptions M z Mf L → HStarAssumptions M z Mf (fun _ => L)) ∧
      ∀ Mf Lf : S → ℝ, HStarAssumptions M z Mf Lf → HAssumptions M z Mf Lf := by sorry

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