Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1(d)–(i) — monotone values, differences and levels

Proved
SongZipkinFluct.Linear.theorem1_di

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

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

For the zero-fixed-cost recursion started at W0=0W_0=0W0​=0, both WnW_nWn​ and GnG_nGn​ are nonnegative and nondecreasing in stage number. Their forward differences are ordered, and the smallest minimizers yn∗(i)y_n^*(i)yn∗​(i) are nonincreasing in nnn. Below the smallest myopic level ymin⁡+y^+_{\min}ymin+​, the difference of GnG_nGn​ equals the strictly negative difference of G+G^+G+. In particular,

0≤ymin⁡+≤yn∗(i),yn+1∗(i)≤yn∗(i).0\le y^+_{\min}\le y_n^*(i),\qquad y_{n+1}^*(i)\le y_n^*(i).0≤ymin+​≤yn∗​(i),yn+1∗​(i)≤yn∗​(i).

The inequalities control the limit of the integer basestock levels.

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

/-- Song and Zipkin (1993), Theorem 1(d)--(i), printed "Theorem 4",
p. 357. `K=0` and `W₀=0` are the subsection's choices. `ymin` is
the actual least member of the range of the myopic minimizer levels,
not an integer infimum with a default value. -/
theorem theorem1_di {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) (hA : M.Assumption1) :
    ∃ (ys : ℕ → I → ℤ) (yplus : I → ℤ) (ymin : ℤ),
      (∀ i : I, SmallestMinimizer (M.Gplus i) (yplus i)) ∧
      IsLeast (Set.range yplus) ymin ∧
      (∀ n : ℕ, 1 ≤ n → ∀ i : I,
        SmallestMinimizer (M.Glin n i) (ys n i)) ∧
      (∀ n : ℕ, 1 ≤ n → ∀ i : I, ∀ x : ℤ,
        0 ≤ M.Wlin (n - 1) i x ∧
        M.Wlin (n - 1) i x ≤ M.Wlin n i x ∧
        0 ≤ Delta (M.Wlin (n - 1)) i x ∧
        Delta (M.Wlin (n - 1)) i x ≤ Delta (M.Wlin n) i x) ∧
      (∀ n : ℕ, 1 ≤ n → ∀ i : I, ∀ y : ℤ,
        0 ≤ M.Glin n i y ∧
        M.Glin n i y ≤ M.Glin (n + 1) i y ∧
        Delta (M.Glin n) i y ≤ Delta (M.Glin (n + 1)) i y) ∧
      (∀ n : ℕ, 1 ≤ n → ∀ i : I, ys (n + 1) i ≤ ys n i) ∧
      0 ≤ ymin ∧
      ∀ n : ℕ, 1 ≤ n → ∀ i : I,
        ymin ≤ ys n i ∧
        ∀ y : ℤ, y < ymin →
          Delta (M.Glin n) i y = Delta M.Gplus i y ∧
          Delta M.Gplus i y < 0 := 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. 357, Theorem 1 (printed "Theorem 4"), parts (d)–(i)
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