Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — equivalent series optimal policies

Proved
RoslingAssembly.SeriesEquiv.theorem2_equivalent_series

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

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

Suppose Rosling’s Assumption holds and the assembly system starts in long-run balance. Every policy optimal for Problem P is optimal for the equivalent pure series system with lead times LiL_iLi​, the same shortage coefficient p+H1p+H_1p+H1​, and holding coefficients hiαli−Lih_i\alpha^{l_i-L_i}hi​αli​−Li​. If Problem P has an optimal policy, every series-optimal policy is also optimal for P. Thus their optimal-policy sets coincide whenever P attains its minimum.

Opt⁡(P)⊆Opt⁡(Pseries),Opt⁡(P)≠∅⟹Opt⁡(Pseries)⊆Opt⁡(P).\operatorname{Opt}(P)\subseteq\operatorname{Opt}(P_{\mathrm{series}}),\qquad \operatorname{Opt}(P)\ne\varnothing\Longrightarrow\operatorname{Opt}(P_{\mathrm{series}})\subseteq\operatorname{Opt}(P).Opt(P)⊆Opt(Pseries​),Opt(P)=∅⟹Opt(Pseries​)⊆Opt(P).

The result reduces the policy comparison for an assembly tree to a pure series system.

Formalization Note Discounting is restricted to 0<α<10<\alpha<10<α<1. The converse is conditional on existence of a P optimum. The zero-lead-time boundary and well-formed initial pipeline are explicit repairs to assumptions implicit or missing in the printed statement. Feasibility is almost sure.

Preamble
import Definitions.Def_RoslingAssembly_SeriesEquiv_Cost
Formal statement
namespace RoslingAssembly.SeriesEquiv

/-- Rosling, Theorem 2, p. 569: equality of optimal policy classes for
the assembly and equivalent pure series systems. -/
theorem theorem2_equivalent_series (S : Model) (x0 : InitialPositions)
    [MeasureTheory.IsProbabilityMeasure S.ν]
    (hTree : S.ValidTree) (hDemand : S.ValidDemand)
    (hα : 0 < S.α ∧ S.α < 1) (hAssumption : S.Assumption)
    (hInitial : S.WellFormedInitial x0)
    (hBalance : S.InitiallyBalanced x0)
    (hZero : S.ZeroLeadBoundary x0) :
    (∀ π : Policy, S.Optimal x0 π → (S.series).Optimal x0 π) ∧
    ((∃ π : Policy, S.Optimal x0 π) →
      ∀ π : Policy, (S.series).Optimal x0 π → S.Optimal x0 π) := by sorry

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