Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2(d) — the limit solves the optimality equation

Proved
SongZipkinFluct.Linear.theorem2_d

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

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

The pointwise limits W∞W_\inftyW∞​ and G∞G_\inftyG∞​ satisfy the zero-fixed-cost optimality equation (2). For each state (i,x)(i,x)(i,x), its minimum over feasible order-up-to positions is attained both by the smallest global minimizer y∗(i)y^*(i)y∗(i) and by the limiting finite-stage level y∞∗(i)y_\infty^*(i)y∞∗​(i), after taking the maximum with xxx.

W∞(i,x)=min⁡y≥xG∞(i,y)=G∞(i,max⁡{x,y∗(i)})=G∞(i,max⁡{x,y∞∗(i)}).W_\infty(i,x)=\min_{y\ge x}G_\infty(i,y)=G_\infty(i,\max\{x,y^*(i)\})=G_\infty(i,\max\{x,y_\infty^*(i)\}).W∞​(i,x)=y≥xmin​G∞​(i,y)=G∞​(i,max{x,y∗(i)})=G∞​(i,max{x,y∞∗​(i)}).

This identifies the basestock decisions that solve the limit equation.

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

/-- Song and Zipkin (1993), Theorem 2(d), p. 358. Equation (2) at
`K=0` says `G∞=contG W∞` and `W∞` is its minimum over feasible
order-up-to levels. The displayed equalities attest both minimizers. -/
theorem theorem2_d {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) (hA : M.Assumption1) :
    ∃ (ys : ℕ → I → ℤ) (ystar yinf : I → ℤ),
      (∀ n : ℕ, 1 ≤ n → ∀ i : I,
        SmallestMinimizer (M.Glin n i) (ys n i)) ∧
      (∀ i : I, Filter.Tendsto (fun n : ℕ => ys (n + 1) i)
        Filter.atTop (nhds (yinf i))) ∧
      (∀ i : I, SmallestMinimizer (M.Ginf i) (ystar i)) ∧
      (∀ i : I, ∀ y : ℤ, M.Ginf i (yinf i) ≤ M.Ginf i y) ∧
      (∀ i : I, ∀ y : ℤ, M.Ginf i y = M.contG M.Winf i y) ∧
      ∀ i : I, ∀ x : ℤ,
        (∀ y : ℤ, x ≤ y → M.Winf i x ≤ M.Ginf i y) ∧
        M.Winf i x = M.Ginf i (max x (ystar i)) ∧
        M.Winf i x = M.Ginf i (max x (yinf i)) := 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. 358, Theorem 2(d)
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