Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — realization of long-run balance

Proved
RoslingAssembly.SeriesEquiv.theorem1_realization_LRB

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

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

Fix a nonnegative demand path and a feasible policy satisfying the production bounds of Lemmas 1 and 2. Long-run balance, once present, persists into the next period. If accumulated demand through period sss exceeds the largest initial pre-order position, then balance holds by period s+MN+1s+M_N+1s+MN​+1 and thereafter.

∑r=1sξr>max⁡1≤i≤NXi1⟹∀t≥s+MN+1, long-run balance at t.\sum_{r=1}^{s}\xi_r>\max_{1\le i\le N}X_{i1}\quad\Longrightarrow\quad\forall t\ge s+M_N+1,\ \text{long-run balance at }t.r=1∑s​ξr​>1≤i≤Nmax​Xi1​⟹∀t≥s+MN​+1, long-run balance at t.

This is the finite-time pathwise assertion behind Theorem 2.

Formalization Note The result is pathwise; the almost-sure existence of a threshold sss from positive mean demand is separate. Past pipeline consistency is explicit.

Preamble
import Definitions.Def_RoslingAssembly_SeriesEquiv_Dynamics
Formal statement
namespace RoslingAssembly.SeriesEquiv

/-- Rosling, Theorem 1, pp. 568–569: preservation and a deterministic
realization bound after accumulated demand overtakes initial inventory. -/
theorem theorem1_realization_LRB (S : Model) (x0 : InitialPositions)
    (π : Policy) (ω : ℕ → ℝ) (hTree : S.ValidTree)
    (hInitial : S.WellFormedInitial x0)
    (hDemandNonneg : ∀ k, 0 ≤ ω k)
    (hFeasible : S.PathFeasible x0 π ω)
    (hLemma1 : ∀ t ≥ 1, ∀ i ∈ Finset.Icc 1 S.N,
      S.NoExcessAt x0 π ω i t)
    (hLemma2 : ∀ t ≥ 1, ∀ i ∈ Finset.Icc 1 S.N,
      S.MinProductionAt x0 π ω i t) :
    (∀ t ≥ 1, S.LongRunBalance x0 π ω t →
      S.LongRunBalance x0 π ω (t + 1)) ∧
    (∀ s : ℕ, (∑ r ∈ Finset.range s, ω r) >
      (Finset.Icc 1 S.N).sup' (by
        have hn : 1 ∈ Finset.Icc 1 S.N := Finset.mem_Icc.mpr ⟨le_refl 1, hTree.1⟩
        exact Finset.nonempty_iff_ne_empty.mpr (Finset.ne_empty_of_mem hn))
        (fun i => x0 i 1) →
      ∀ t ≥ s + S.M S.N + 1, S.LongRunBalance x0 π ω t) := by sorry

end RoslingAssembly.SeriesEquiv
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Oper. Res. 37(4), 1989, pp. 568–569, Theorem 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