Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 — existence and nonnegativity of myopic levels

Proved
SongZipkinFluct.Linear.corollary1

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

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

If αcˉ≥p\alpha\bar c\ge pαcˉ≥p, each myopic cost G+(i,⋅)G^+(i,\cdot)G+(i,⋅) is nondecreasing, the case denoted y+(i)=−∞y^+(i)=-\inftyy+(i)=−∞ by the paper. If αcˉ<p\alpha\bar c<pαcˉ<p, every world state has a finite, nonnegative smallest minimizer y+(i)y^+(i)y+(i), and its myopic cost is nonnegative everywhere.

y+(i)≥0,G+(i,y)≥0(i∈I, y∈Z).y^+(i)\ge0,\qquad G^+(i,y)\ge0\quad(i\in I,\ y\in\mathbb Z).y+(i)≥0,G+(i,y)≥0(i∈I, y∈Z).

The latter case is the standing regime for the subsequent linear-cost results.

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

/-- Song and Zipkin (1993), Corollary 1, p. 356. The paper sets
`y⁺(i)=-∞` when `G⁺(i,·)` is nondecreasing; the first clause states
that monotonicity directly. In the second case a finite smallest
minimizer exists and is nonnegative. -/
theorem corollary1 {I : Type*} [Countable I] [Nonempty I] [DecidableEq I]
    (M : Model I) :
    (M.p ≤ M.α * M.cbar → ∀ i : I, Monotone (M.Gplus i)) ∧
    (M.Assumption1 → ∀ i : I,
      (∃ y : ℤ, SmallestMinimizer (M.Gplus i) y ∧ 0 ≤ y) ∧
      ∀ y : ℤ, 0 ≤ M.Gplus i y) := 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. 356, Corollary 1
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