Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5(a), (b) — W_n → W_∞ and G_n → G_∞ pointwise; the limits are K-convex and coercive

Proved
SongZipkinFluct.FixedCost.theorem5ab

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

inventoryk-convexityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-iteration

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), for every world state iii:

  1. the sequence Wn(i,x)W_n(i, x)Wn​(i,x) converges, for every xxx, to W∞(i,x)W_\infty(i, x)W∞​(i,x); W∞(i,x)W_\infty(i, x)W∞​(i,x) is KKK-convex in xxx and lim⁡x→+∞W∞(i,x)=+∞\lim_{x\to+\infty} W_\infty(i, x) = +\inftylimx→+∞​W∞​(i,x)=+∞;
  2. the sequence Gn(i,y)G_n(i, y)Gn​(i,y) converges, for every yyy, to G∞(i,y)G_\infty(i, y)G∞​(i,y); G∞(i,y)G_\infty(i, y)G∞​(i,y) is KKK-convex in yyy and lim⁡∣y∣→∞G∞(i,y)=+∞\lim_{|y|\to\infty} G_\infty(i, y) = +\inftylim∣y∣→∞​G∞​(i,y)=+∞.

These are the limiting properties that carry the finite-horizon (r,S)(r, S)(r,S) structure to the infinite horizon.

Formalization Note W∞W_\inftyW∞​ and G∞G_\inftyG∞​ are defined as suprema over nnn; the theorem asserts that the sequences converge to them.

Preamble
import Mathlib
import Definitions.Def_SongZipkinFluct_FixedCost_Bounds

open Filter Topology
Formal statement
namespace SongZipkinFluct.FixedCost

open Model

/-- Theorem 5(a), (b) (p. 359) of Song and Zipkin (1993). Fixed-cost model of §3.2
(`K = K̄F̃_L(α) > 0`, `W₀ = W_∞` of the linear model). For all `i`:

* (a) `W_n(i, x)` converges, for every `x`, to `W_∞(i, x)`; `W_∞(i, ·)` is `K`-convex and
  `W_∞(i, x) → +∞` as `x → +∞`;
* (b) `G_n(i, y)` converges, for every `y`, to `G_∞(i, y)`; `G_∞(i, ·)` is `K`-convex and
  `G_∞(i, y) → +∞` as `|y| → ∞`.

Formalization Note: `W_∞` and `G_∞` are defined as the suprema over `n` (`WinfK`, `GinfK`); the
theorem asserts that the sequences converge to them. -/
theorem theorem5ab {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 : ℤ, Tendsto (fun n => Wfix M n i x) atTop (𝓝 (WinfK M i x))) ∧
        LConvex M.K (WinfK M i) ∧ Tendsto (WinfK M i) atTop atTop) ∧
      ((∀ y : ℤ, Tendsto (fun n => Gfix M n i y) atTop (𝓝 (GinfK M i y))) ∧
        LConvex M.K (GinfK M i) ∧ Tendsto (GinfK M i) atTop atTop ∧
        Tendsto (GinfK M i) atBot atTop) := 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(a), (b)
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