Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2(a)–(b) — pointwise value limits and minimizers

Proved
SongZipkinFluct.Linear.theorem2_ab

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

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

The transformed finite-stage values WnW_nWn​ and auxiliary costs GnG_nGn​ converge pointwise to finite functions W∞W_\inftyW∞​ and G∞G_\inftyG∞​. The first is convex in inventory position and diverges as the position tends upward; the second is convex and diverges at both ends. Consequently G∞(i,⋅)G_\infty(i,\cdot)G∞​(i,⋅) has a finite smallest minimizer y∗(i)y^*(i)y∗(i) in every world state.

Wn(i,x)→W∞(i,x),Gn(i,y)→G∞(i,y).W_n(i,x)\to W_\infty(i,x),\qquad G_n(i,y)\to G_\infty(i,y).Wn​(i,x)→W∞​(i,x),Gn​(i,y)→G∞​(i,y).

These limits are the objects in the infinite-horizon basestock theorem.

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

/-- Song and Zipkin (1993), Theorem 2(a)--(b), p. 357. The limits are
the finite pointwise suprema of the nondecreasing sequences from
Theorem 1. The existence of a smallest minimizer is a conclusion. -/
theorem theorem2_ab {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) (hA : M.Assumption1) :
    (∀ i : I, ∀ x : ℤ,
      Filter.Tendsto (fun n : ℕ => M.Wlin n i x) Filter.atTop (nhds (M.Winf i x))) ∧
    (∀ i : I, IntConvex (M.Winf i) ∧
      Filter.Tendsto (M.Winf i) Filter.atTop Filter.atTop) ∧
    (∀ i : I, ∀ y : ℤ,
      Filter.Tendsto (fun n : ℕ => M.Glin (n + 1) i y)
        Filter.atTop (nhds (M.Ginf i y))) ∧
    (∀ i : I, IntConvex (M.Ginf i) ∧ CoerciveInt (M.Ginf i)) ∧
    ∃ ystar : I → ℤ,
      ∀ i : I, SmallestMinimizer (M.Ginf i) (ystar 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 2, parts (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