Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1(a)–(c) — convex finite-stage basestock problems

Proved
SongZipkinFluct.Linear.theorem1_ac

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

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

In the zero-fixed-cost model with zero terminal cost, for every n≥1n\ge1n≥1 and every world state iii, Gn(i,⋅)G_n(i,\cdot)Gn​(i,⋅) is convex and diverges at both ends. It therefore has a finite smallest minimizer yn∗(i)y_n^*(i)yn∗​(i). The finite-stage minimum is attained by ordering up to the greater of the current position and yn∗(i)y_n^*(i)yn∗​(i), and Wn(i,⋅)W_n(i,\cdot)Wn​(i,⋅) is convex.

Wn(i,x)=Gn(i,max⁡{x,yn∗(i)}).W_n(i,x)=G_n(i,\max\{x,y_n^*(i)\}).Wn​(i,x)=Gn​(i,max{x,yn∗​(i)}).

This is the finite-stage basestock assertion used in the limiting argument.

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

/-- Song and Zipkin (1993), Theorem 1(a)--(c), printed "Theorem 4",
p. 357. The finite-horizon problem has `K=0`, `W₀=0` as in §3.1.
Part (b) is the assertion that the minimum in (13) is attained by the
world-dependent basestock decision; `W_n` is the optimal n-stage cost
by the recursion's definition. -/
theorem theorem1_ac {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) (hA : M.Assumption1) :
    ∃ ys : ℕ → I → ℤ,
      (∀ n : ℕ, 1 ≤ n → ∀ i : I,
        IntConvex (M.Glin n i) ∧ CoerciveInt (M.Glin n i) ∧
        SmallestMinimizer (M.Glin n i) (ys n i) ∧
        ∀ x : ℤ, M.Wlin n i x = M.Glin n i (max x (ys n i))) ∧
      ∀ n : ℕ, 1 ≤ n → ∀ i : I, IntConvex (M.Wlin n 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. 357, Theorem 1 (printed "Theorem 4"), parts (a)–(c)
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