Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (2) — greedy prefix value at a minimizing period

Proved
WagelmansELS.DualGreedy.equation_2

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

dynamic-programminglot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix a positive-demand period jjj and an index 1≤k≤j1\le k\le j1≤k≤j attaining the minimum in the greedy formula for vjv_jvj​. Assume the induction hypothesis that the greedy prefix value through k−1k-1k−1 is F(k−1)F(k-1)F(k−1). Then

∑t=1jdtvt=fk+ckdk,j+F(k−1).\sum_{t=1}^{j}d_tv_t=f_k+c_kd_{k,j}+F(k-1).t=1∑j​dt​vt​=fk​+ck​dk,j​+F(k−1).

This is Equation (2) of the paper. The minimizing-index equality and the induction hypothesis are explicit assumptions; the monotonicity needed in its derivation remains a conclusion of the separate milestone.

Preamble
import Mathlib
import Definitions.Def_WagelmansELS_DualGreedy_Greedy
Formal statement
namespace WagelmansELS.DualGreedy

theorem equation_2 (P : Instance) (v : ℕ → ℝ)
    (hd : ∀ t, 1 ≤ t → t ≤ P.n → 0 ≤ P.d t)
    (hf : ∀ i, 1 ≤ i → i ≤ P.n → 0 ≤ P.f i)
    (hv : IsGreedyForward P v)
    (j k : ℕ) (hj1 : 1 ≤ j) (hjn : j ≤ P.n) (hdj : 0 < P.d j)
    (hk1 : 1 ≤ k) (hkj : k ≤ j)
    (hk : v j = greedyBound P v k j)
    (hind : objective P v (k - 1) = F P (k - 1)) :
    objective P v j = P.f k + P.c k * demand P k j + F P (k - 1) := by sorry

end WagelmansELS.DualGreedy
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S153, Eq. (2) and the preceding sentence
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