Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — uniform finite bounds on Wₙ

Proved
SongZipkinFluct.Linear.lemma4

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

dynamic-programminginventorymarkov-modulated-demandp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Suppose the terminal transformed cost W0W_0W0​ lies between zero and a finite nondecreasing bound W0B(x)W_0^B(x)W0B​(x) for every world state. Then a finite nondecreasing function WB(x)W^B(x)WB(x) bounds every later stage cost uniformly in the world state and stage number:

0≤W0(i,x)≤W0B(x)⟹0≤Wn(i,x)≤WB(x)(n≥1).0\le W_0(i,x)\le W_0^B(x)\quad\Longrightarrow\quad 0\le W_n(i,x)\le W^B(x)\qquad(n\ge1).0≤W0​(i,x)≤W0B​(x)⟹0≤Wn​(i,x)≤WB(x)(n≥1).

This bound keeps the infinite-state continuation sums finite. The model's discounted fixed cost KKK is used in the recursion.

Preamble
import Mathlib
import Definitions.Def_SongZipkinFluct_Linear_Dynamics
Formal statement
namespace SongZipkinFluct.Linear

/-- Song and Zipkin (1993), Lemma 4, p. 356, displays (11)--(12).
Here `K=M.K` is the model's discounted fixed order cost. The hypothesis
on `W₀` is exactly (11), and no summability of the recursion is assumed. -/
theorem lemma4 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) (hA : M.Assumption1)
    (W₀ : I → ℤ → ℝ)
    (WBound₀ : ℤ → ℝ) (hmono₀ : Monotone WBound₀)
    (hbound₀ : ∀ i x, 0 ≤ W₀ i x ∧ W₀ i x ≤ WBound₀ x) :
    ∃ WBound : ℤ → ℝ, Monotone WBound ∧
      ∀ n : ℕ, 1 ≤ n → ∀ i x, 0 ≤ M.W M.K W₀ n i x ∧
        M.W M.K W₀ n i x ≤ WBound x := by sorry

end SongZipkinFluct.Linear
Source
Song and Zipkin, Inventory Control in a Fluctuating Demand Environment, Oper. Res. 41(2):351–370 (1993), DOI 10.1287/opre.41.2.351, p. 356, Lemma 4, (11)–(12)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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