Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2: consecutive candidate costs compare by their ratio

Proved
WagelmansELS.Efficient.proposition_2

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

convex-envelopelot-sizingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix 1≤i≤n1\le i\le n1≤i≤n. Let k∈Eik\in E_ik∈Ei​ be nonsentinel and let l=succ⁡i(k)l=\operatorname{succ}_i(k)l=succi​(k), so k<lk<lk<l are consecutive efficient periods. Write ri(k)=[G(k)−G(l)]/[D(k)−D(l)]r_i(k)=[G(k)-G(l)]/[D(k)-D(l)]ri​(k)=[G(k)−G(l)]/[D(k)−D(l)]. Then

ri(k)<ci⟹ci[D(i)−D(k)]+G(k)<ci[D(i)−D(l)]+G(l),r_i(k)<c_i\quad\Longrightarrow\quad c_i[D(i)-D(k)]+G(k)<c_i[D(i)-D(l)]+G(l),ri​(k)<ci​⟹ci​[D(i)−D(k)]+G(k)<ci​[D(i)−D(l)]+G(l),

and otherwise

ci[D(i)−D(k)]+G(k)≥ci[D(i)−D(l)]+G(l).c_i[D(i)-D(k)]+G(k)\ge c_i[D(i)-D(l)]+G(l).ci​[D(i)−D(k)]+G(k)≥ci​[D(i)−D(l)]+G(l).

The comparison explains why crossing the marginal-cost threshold changes the preferred efficient period. It is the numbered fact used by the paper's display after Proposition 2.

Formalization Note The successor is evaluated only at a nonsentinel efficient period, where the denominator is positive. Equality belongs to the “otherwise” case.

Preamble
import Mathlib
import Definitions.Def_WagelmansELS_Efficient_ThresholdRule
Formal statement
namespace WagelmansELS.Efficient

/-- Proposition 2, p. S149: the ratio decides which of two consecutive efficient
periods has the lower candidate cost. -/
theorem proposition_2 (P : Instance) (i k : ℕ)
    (hi : 1 ≤ i) (hin : i ≤ P.n)
    (hk : k ∈ P.E i) (hnext : k < P.n + 1) :
    (P.ratio i k < P.c i → P.score i k < P.score i (P.succ i k)) ∧
    (¬ P.ratio i k < P.c i → P.score i (P.succ i k) ≤ P.score i k) := by sorry

end WagelmansELS.Efficient
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S149, Proposition 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