Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 — y*(i) ≤ S*_n(i) < S⁺(i) and r⁻⁻(i) ≤ r⁻(i) ≤ r*_n(i) ≤ r⁺(i) for all n ≥ 1

Proved
SongZipkinFluct.FixedCost.theorem4

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

boundsinventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ss-policy

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), let y+(i)y^+(i)y+(i) be the smallest minimizer of G+(i,⋅)G^+(i,\cdot)G+(i,⋅), ymin⁡+=min⁡iy+(i)y^+_{\min} = \min_i y^+(i)ymin+​=mini​y+(i), and y∗(i)y^*(i)y∗(i) the smallest minimizer of G0(i,⋅)G_0(i,\cdot)G0​(i,⋅). Then the bounds S+(i)S^+(i)S+(i), r+(i)r^+(i)r+(i), r−(i)r^-(i)r−(i), r−−(i)r^{--}(i)r−−(i) of p. 358 exist, and for all n≥1n \ge 1n≥1 and i∈Ii \in Ii∈I, with Sn∗(i)S^*_n(i)Sn∗​(i), rn∗(i)r^*_n(i)rn∗​(i) the parameters of Theorem 3(b):

y∗(i)≤Sn∗(i)<S+(i),y^*(i) \le S^*_n(i) < S^+(i),y∗(i)≤Sn∗​(i)<S+(i), r−−(i)≤r−(i)≤rn∗(i)≤r+(i).r^{--}(i) \le r^-(i) \le r^*_n(i) \le r^+(i).r−−(i)≤r−(i)≤rn∗​(i)≤r+(i).

These bounds, of the type Veinott (1966) gave for discrete-time models without a world variable, localize the optimal nnn-stage parameters in a box computed from the myopic cost G+G^+G+ and the linear model alone, uniformly in nnn.

Formalization Note The existence of S+S^+S+, r+r^+r+, r−r^-r−, r−−r^{--}r−−, taken for granted in the paper when it defines them, is part of the conclusion; y+y^+y+, ymin⁡+y^+_{\min}ymin+​, y∗y^*y∗, Sn∗S^*_nSn∗​, rn∗r^*_nrn∗​ are taken through their defining properties.

Preamble
import Mathlib
import Definitions.Def_SongZipkinFluct_FixedCost_Bounds

open Filter Topology
Formal statement
namespace SongZipkinFluct.FixedCost

open Model

/-- Theorem 4 (p. 358; proof p. 368) of Song and Zipkin (1993). Fixed-cost model of §3.2
(`K = K̄F̃_L(α) > 0`, `W₀ = W_∞`, `G₀ = G_∞` of the linear model). Let `y⁺(i)` be the smallest
minimizer of `G⁺(i, ·)`, `y⁺_min = min_i y⁺(i)`, `y*(i)` the smallest minimizer of `G₀(i, ·)`.
Then the bounds of p. 358,

* `S⁺(i) = min{y ≥ y⁺(i) : G⁺(i, y) − G⁺(i, y⁺(i)) > γK}`,
* `r⁺(i) = max{y < y⁺(i) : G⁺(i, y) − G⁺(i, y⁺(i)) > (1 − γ)K}`,
* `r⁻(i) = max{y < y*(i) : G₀(i, y) − G₀(i, y*(i)) > K}`,
* `r⁻⁻(i) = max{y < y⁺_min : G⁺(i, y) − G⁺(i, y⁺_min) > K}`,

exist, and for all `n ≥ 1` and `i ∈ I`, with `S*_n(i)`, `r*_n(i)` as in Theorem 3(b):

* (a) `y*(i) ≤ S*_n(i) < S⁺(i)`;
* (b) `r⁻⁻(i) ≤ r⁻(i) ≤ r*_n(i) ≤ r⁺(i)`.

Formalization Note: every minimizer and extremal integer is taken through its defining property
(`IsLeast`/`IsGreatest`), never through `sInf`/`sSup` on `ℤ`. The existence of `S⁺`, `r⁺`,
`r⁻`, `r⁻⁻`, which the paper takes for granted when it defines them, is part of the
conclusion. -/
theorem theorem4 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I] (M : Model I)
    (hM : M.Standing) (hA1 : M.α * M.cbar < M.p) (hK : 0 < M.Kbar)
    (yplus : I → ℤ) (hyplus : IsYPlus M yplus) (ymin : ℤ) (hymin : IsYPlusMin yplus ymin)
    (ystar : I → ℤ) (hystar : IsYStar M ystar) :
    ((∃ Splus, IsSPlus M yplus Splus) ∧ (∃ rplus, IsRPlus M yplus rplus) ∧
        (∃ rminus, IsRMinus M ystar rminus) ∧ (∃ rmm, IsRMinusMinus M ymin rmm)) ∧
      ∀ (Splus rplus rminus rmm : I → ℤ) (rs Ss : ℕ → I → ℤ),
        IsSPlus M yplus Splus → IsRPlus M yplus rplus → IsRMinus M ystar rminus →
        IsRMinusMinus M ymin rmm → IsStageParams M rs Ss →
        ∀ n : ℕ, 1 ≤ n → ∀ i : I,
          (ystar i ≤ Ss n i ∧ Ss n i < Splus i) ∧
          (rmm i ≤ rminus i ∧ rminus i ≤ rs n i ∧ rs n i ≤ rplus i) := 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. 358, Theorem 4 (proof p. 368)
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