Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5(d) — W_∞ and G_∞ satisfy the optimality equation (2)

Proved
SongZipkinFluct.FixedCost.theorem5d

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

dynamic-programminginventoryoptimality-equationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

In the fixed-cost model (standing hypotheses, αcˉ<p\alpha\bar c < pαcˉ<p, K>0K > 0K>0, W0=W∞W_0 = W_\inftyW0​=W∞​ of the linear model), the limits W∞W_\inftyW∞​, G∞G_\inftyG∞​ satisfy the optimality equation (2): for all iii and xxx the minimum below is attained and

W∞(i,x)=min⁡y≥x{Kδ(y−x)+G∞(i,y)},W_\infty(i, x) = \min_{y \ge x}\{K\delta(y - x) + G_\infty(i, y)\},W∞​(i,x)=y≥xmin​{Kδ(y−x)+G∞​(i,y)},

and for all iii and yyy

G∞(i,y)=G+(i,y)+βλic+β{λiW∞(i,y−1)+∑j≠iqijW∞(j,y)+(μ−λi−qi)W∞(i,y)}.G_\infty(i, y) = G^+(i, y) + \beta\lambda_i c + \beta\Big\{\lambda_i W_\infty(i, y-1) + \sum_{j\ne i} q_{ij}W_\infty(j, y) + (\mu - \lambda_i - q_i)W_\infty(i, y)\Big\}.G∞​(i,y)=G+(i,y)+βλi​c+β{λi​W∞​(i,y−1)+j=i∑​qij​W∞​(j,y)+(μ−λi​−qi​)W∞​(i,y)}.

Equation (2) is the transformed form W=cx+VW = cx + VW=cx+V of the infinite-horizon optimality equation (1), so this identifies W∞W_\inftyW∞​ as a solution of the Bellman equation of the fixed-cost problem.

Preamble
import Mathlib
import Definitions.Def_SongZipkinFluct_FixedCost_Bounds

open Filter Topology
Formal statement
namespace SongZipkinFluct.FixedCost

open Model

/-- Theorem 5(d) (p. 359) of Song and Zipkin (1993). Fixed-cost model of §3.2
(`K = K̄F̃_L(α) > 0`, `W₀ = W_∞` of the linear model). The limits `W_∞`, `G_∞` satisfy the
optimality equation (2) (p. 355):
`W_∞(i, x) = min_{y ≥ x} {Kδ(y − x) + G_∞(i, y)}` (the minimum is attained) and
`G_∞(i, y) = G⁺(i, y) + βλ_i c + β{λ_i W_∞(i, y − 1) + Σ_{j≠i} q_ij W_∞(j, y) + (μ − λ_i − q_i) W_∞(i, y)}`.
-/
theorem theorem5d {I : Type*} [Countable I] [Nonempty I] [DecidableEq I] (M : Model I)
    (hM : M.Standing) (hA1 : M.α * M.cbar < M.p) (hK : 0 < M.Kbar) :
    (∀ (i : I) (x : ℤ), IsLeast
        (Set.range fun y : {y : ℤ // x ≤ y} => M.K * SongZipkinFluct.Linear.delta (y.1 - x) + GinfK M i y.1)
        (WinfK M i x)) ∧
      ∀ (i : I) (y : ℤ), GinfK M i y = contG M (WinfK M) i y := by sorry

end SongZipkinFluct.FixedCost
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. 359, Theorem 5(d); p. 355, (2)
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