Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1: only efficient periods are needed in the minimum

Proved
WagelmansELS.Efficient.proposition_1

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

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

For a period 1≤i≤n1\le i\le n1≤i≤n, let EiE_iEi​ be the efficient periods of the plotted points (D(t),G(t))(D(t),G(t))(D(t),G(t)). Then EiE_iEi​ is nonempty and

min⁡i<t≤n+1{ci[D(i)−D(t)]+G(t)}=min⁡t∈Ei{ci[D(i)−D(t)]+G(t)}.\min_{i<t\le n+1}\{c_i[D(i)-D(t)]+G(t)\} =\min_{t\in E_i}\{c_i[D(i)-D(t)]+G(t)\}.i<t≤n+1min​{ci​[D(i)−D(t)]+G(t)}=t∈Ei​min​{ci​[D(i)−D(t)]+G(t)}.

Thus every excluded period is dominated for the candidate-cost calculation by an efficient period. This reduces the backward recursion to lower-envelope vertices.

Formalization Note The finite attained minima use Finset.inf', whose domain is explicitly nonempty. The setup cost fif_ifi​ is absent from both sides because it is common to all candidates.

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

/-- Proposition 1, p. S148: removing non-breakpoint periods leaves the minimum unchanged. -/
theorem proposition_1 (P : Instance) (i : ℕ) (hi : 1 ≤ i) (hin : i ≤ P.n) :
    (P.E i).Nonempty ∧
    ∀ h : (P.E i).Nonempty,
      (Finset.Ioc i (P.n + 1)).inf' (by simp; omega) (P.score i) =
        (P.E i).inf' h (P.score i) := by sorry

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