Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2: the envelope endpoints are efficient

Proved
WagelmansELS.Efficient.endpoint_efficient

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

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

For each 1≤i≤n1\le i\le n1≤i≤n, the point at the largest plotted abscissa is (D(i+1),G(i+1))(D(i+1),G(i+1))(D(i+1),G(i+1)). In particular, for every later plotted period ttt with the same abscissa, G(i+1)≤G(t)G(i+1)\le G(t)G(i+1)≤G(t). The periods i+1i+1i+1 and n+1n+1n+1 are efficient:

i+1∈Ei,n+1∈Ei.i+1\in E_i,\qquad n+1\in E_i.i+1∈Ei​,n+1∈Ei​.

This identifies the two endpoint breakpoints and ensures the efficient-period set is nonempty.

Formalization Note If equal abscissae and heights occur, the earliest index is kept. The last demand is positive, so the sentinel is the only plotted period at abscissa zero.

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

/-- Section 2, p. S147: the right endpoint of the envelope is `(D(i+1),G(i+1))`;
p. S148 declares the left endpoint `(0,0)` a breakpoint. -/
theorem endpoint_efficient (P : Instance) (i : ℕ) (hi : 1 ≤ i) (hin : i ≤ P.n) :
    (∀ t ∈ Finset.Ioc i (P.n + 1), i + 1 < t → P.D t = P.D (i + 1) →
      P.G (i + 1) ≤ P.G t) ∧
    P.IsEfficient i (i + 1) ∧ P.IsEfficient i (P.n + 1) := by sorry

end WagelmansELS.Efficient
Source
Wagelmans, Van Hoesel and Kolen, Economic Lot Sizing, Oper. Res. 40 Supp. 1 (1992), p. S147, Section 2, sentence beginning “It follows that g(d_{i+1,n}) = G(i + 1)”; p. S148, endpoint breakpoints
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