Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — no excess production

Proved
RoslingAssembly.SeriesEquiv.lemma1_no_excess_production

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

assembly-systemdynamic-programminginventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Under Rosling’s Assumption, let π\piπ be an optimal policy and put mit=min⁡k>iXktMk−Mim_{it}=\min_{k>i}X^{M_k-M_i}_{kt}mit​=mink>i​XktMk​−Mi​​. For every item and period, almost surely,

Yit=Xitif Xit≥mit,Xit≤Yit≤mitif Xit≤mit.Y_{it}=X_{it}\quad\text{if }X_{it}\ge m_{it},\qquad X_{it}\le Y_{it}\le m_{it}\quad\text{if }X_{it}\le m_{it}.Yit​=Xit​if Xit​≥mit​,Xit​≤Yit​≤mit​if Xit​≤mit​.

The bound rules out producing an item beyond what can be made available as end product within its total lead time.

Formalization Note The minimum is +∞+\infty+∞ for the last item. The inequalities hold almost surely because policies may differ on null histories; 0<α<10<\alpha<10<α<1 and consistent initial histories are explicit.

Preamble
import Definitions.Def_RoslingAssembly_SeriesEquiv_Cost
Formal statement
namespace RoslingAssembly.SeriesEquiv

/-- Rosling, Lemma 1 and (6), p. 568. -/
theorem lemma1_no_excess_production (S : Model) (x0 : InitialPositions)
    (π : Policy) [MeasureTheory.IsProbabilityMeasure S.ν]
    (hTree : S.ValidTree) (hDemand : S.ValidDemand)
    (hα : 0 < S.α ∧ S.α < 1) (hAssumption : S.Assumption)
    (hInitial : S.WellFormedInitial x0) (hOptimal : S.Optimal x0 π) :
    ∀ᵐ ω ∂(MeasureTheory.Measure.infinitePi fun _ : ℕ => S.ν),
      ∀ t ≥ 1, ∀ i ∈ Finset.Icc 1 S.N,
        S.NoExcessAt x0 π ω i t := by sorry

end RoslingAssembly.SeriesEquiv
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Oper. Res. 37(4), 1989, p. 568, Lemma 1, eq. (6); proof pp. 576–577
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