Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8, p. 940 — for all t ≤ T, f_t(v) is nondecreasing in v and z̄_t(v) ≤ z̄_T(v)

Disproved
ZipkinLostSales.Bounds.theorem_8

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

dynamic-programminginventorylost-salesoperations-researchp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the lost-sales model of §4 under its standing assumptions. For every period t≤Tt\le Tt≤T:

  1. the optimal cost ft(v)f_t(v)ft​(v) is nondecreasing on VVV for the componentwise order;
  2. for every v∈Vv\in Vv∈V, the optimal order is at most the last-period one:
zˉt(v)≤zˉT(v).\bar z_t(v)\le \bar z_T(v).zˉt​(v)≤zˉT​(v).

Here zˉt(v)\bar z_t(v)zˉt​(v) is the smallest minimizer of gt(v,⋅)g_t(v,\cdot)gt​(v,⋅) over z≥0z\ge0z≥0. With Lemma 6, part 2 shows that the bounds Z(sˉ)Z(\bar s)Z(sˉ) hold in every period.

Formalization Note Period t=T−kt=T-kt=T−k is indexed by k≥0k\ge0k≥0: ftf_tft​ is fB M (k+1) and zˉt\bar z_tzˉt​ is the least minimizer of gB M k; zˉT\bar z_TzˉT​ is the least minimizer of gB M 0 =q=q=q. Part 2 asserts that the least minimizers zzz of gt(v,⋅)g_t(v,\cdot)gt​(v,⋅) and z′z'z′ of gT(v,⋅)g_T(v,\cdot)gT​(v,⋅) exist and satisfy z≤z′z\le z'z≤z′. The identification of §4's recursion with §2's is not formalized.

Preamble
import Mathlib
import Definitions.Def_ZipkinLostSales_Bounds_Model
Formal statement
namespace ZipkinLostSales.Bounds

/-- Theorem 8, p. 940: for all `t ≤ T` (every `k`, `t = T − k`), `f_t(v)` is nondecreasing in `v`
on `V`, and the smallest optimal orders `z̄_t(v)` and `z̄_T(v)` exist and satisfy
`z̄_t(v) ≤ z̄_T(v)`. -/
theorem theorem_8 {L : ℕ} (M : Data) (hM : Assumptions L M) (k : ℕ) :
    MonotoneOn (fB M (k + 1)) (ZipkinLostSales.LNatural.V L) ∧
      ∀ v ∈ ZipkinLostSales.LNatural.V L,
        ∃ z z' : ℝ, IsOptOrder M k v z ∧ IsOptOrder M 0 v z' ∧ z ≤ z' := by sorry

end ZipkinLostSales.Bounds
Source
Zipkin, On the Structure of Lost-Sales Inventory Models, Oper. Res. 56 (2008), p. 940 (PDF p. 5), Theorem 8
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