Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2 — convergence of finite-stage basestock levels

Proved
SongZipkinFluct.Linear.corollary2

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

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

For each world state iii, the integer sequence of finite-stage smallest minimizers converges to a finite limit y∞∗(i)y_\infty^*(i)y∞∗​(i). If ymin⁡+y^+_{\min}ymin+​ is the smallest myopic basestock level, then for every n≥1n\ge1n≥1,

0≤ymin⁡+≤y∞∗(i)≤yn∗(i)≤y1∗(i)=y+(i).0\le y^+_{\min}\le y_\infty^*(i)\le y_n^*(i)\le y_1^*(i)=y^+(i).0≤ymin+​≤y∞∗​(i)≤yn∗​(i)≤y1∗​(i)=y+(i).

The limit is an integer because the sequence is bounded and monotone on the integers.

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

/-- Song and Zipkin (1993), Corollary 2, p. 357. The integer sequence
is indexed by the paper's stage `n≥1`; its convergence is stated via
the zero-based sequence `n ↦ ys (n+1)`. -/
theorem corollary2 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) (hA : M.Assumption1) :
    ∃ (ys : ℕ → I → ℤ) (yplus yinf : I → ℤ) (ymin : ℤ),
      (∀ i : I, SmallestMinimizer (M.Gplus i) (yplus i)) ∧
      IsLeast (Set.range yplus) ymin ∧
      (∀ n : ℕ, 1 ≤ n → ∀ i : I,
        SmallestMinimizer (M.Glin n i) (ys n i)) ∧
      (∀ i : I, Filter.Tendsto (fun n : ℕ => ys (n + 1) i)
        Filter.atTop (nhds (yinf i))) ∧
      0 ≤ ymin ∧
      ∀ n : ℕ, 1 ≤ n → ∀ i : I,
        ymin ≤ yinf i ∧ yinf i ≤ ys n i ∧
        ys n i ≤ ys 1 i ∧ ys 1 i = yplus 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, Corollary 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