Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2(b) — the linear-model limit G0(i,⋅)=G∞(i,⋅)G_0(i,\cdot) = G_\infty(i,\cdot)G0​(i,⋅)=G∞​(i,⋅) has a smallest minimizer y∗(i)y^*(i)y∗(i)

Proved
SongZipkinFluct.FixedCost.ystar_exists

by tianyipeng · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventorymarkov-decision-processss-policy

Consider the fluctuating-demand inventory model under the standing hypotheses and Assumption 1 (αcˉ<p\alpha\bar c < pαcˉ<p). Let G0(i,⋅)=G∞(i,⋅)G_0(i,\cdot) = G_\infty(i,\cdot)G0​(i,⋅)=G∞​(i,⋅) be the limit of the linear order-cost model (fixed cost K=0K=0K=0, terminal cost W0≡0W_0\equiv 0W0​≡0), i.e. G0(i,y)=sup⁡n≥1Gn(i,y)G_0(i,y) = \sup_{n\ge1} G_n(i,y)G0​(i,y)=supn≥1​Gn​(i,y) for the value iteration (10).

Claim (Theorem 2(b)). For every world state iii, the function y↦G0(i,y)y\mapsto G_0(i,y)y↦G0​(i,y) on Z\mathbb ZZ has a smallest global minimizer y∗(i)y^*(i)y∗(i) (it is convex and tends to +∞+\infty+∞ as ∣y∣→∞|y|\to\infty∣y∣→∞). This y∗(i)y^*(i)y∗(i) is the optimal world-dependent base-stock level of the linear model, and serves as the lower bound y∗(i)≤S∗(i)y^*(i)\le S^*(i)y∗(i)≤S∗(i) in the fixed-cost model.

Preamble
import Mathlib
import Definitions.Def_SongZipkinFluct_FixedCost_Bounds
Formal statement
namespace SongZipkinFluct.FixedCost

open Model

/-- Song and Zipkin (1993), Theorem 2(b), p. 357, in the encoding of the fixed-cost model:
under the standing hypotheses and Assumption 1 (`αc̄ < p`), for every world state `i` the limit
`G₀(i, ·) = G_∞(i, ·)` of the linear order-cost model (`K = 0`, `W₀ ≡ 0`) has a smallest global
minimizer `y*(i)`. -/
theorem ystar_exists {I : Type*} [Countable I] [Nonempty I] [DecidableEq I] (M : Model I)
    (hM : M.Standing) (hA1 : M.α * M.cbar < M.p) :
    ∃ ystar, IsYStar M ystar := 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. 357, Theorem 2(b) (y*(i) as used on p. 358)

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