Theorem 1 — realization of long-run balance
ProvedRoslingAssembly.SeriesEquiv.theorem1_realization_LRBassembly-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 exceeds the largest initial pre-order position, then balance holds by period and thereafter.
This is the finite-time pathwise assertion behind Theorem 2.
Formalization Note The result is pathwise; the almost-sure existence of a threshold 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.