(16), p. 57 — for t ≥ K the upstream inventory y_t is N(y₀, σ²Σ_{i=0}^{K−1}(1 + (L + i)α)²)
ProvedGravesIMA.Stages.eq_16Throughout, time is indexed by the integers, , and is the single-stage system of Graves (1999, §2) driven by a shock sequence : demand , for ; the exponentially weighted moving-average forecast , ; orders for and for with lead time ; inventory for , with the initial inventory free. The two-stage system of §3 adds an upstream stage with lead time that sees the orders as its demand: forecast , with ; orders for and for ; inventory for , with free.
The shocks , , are random variables on a probability space ; they are measurable, mutually independent, and each has law . The system equations hold for every outcome , and the initial inventory is a deterministic constant. The upstream initial inventory is a constant.
Then for every period , the upstream inventory is normally distributed with
The standard deviation of measures the upstream safety-stock requirement. It depends on the downstream lead time as well as on the upstream lead time whenever .
Formalization Note Independence is iIndepFun of the family indexed by the subtype ; shocks at are never read by the model. "Normally distributed with mean and standard deviation " is the law equality P.map X = gaussianReal m (s²); the variance is passed as Real.toNNReal of a sum of squares times , which is nonnegative, so no clipping occurs. Each is assumed measurable, so the pushforward measures are genuine laws.
import Mathlib import Definitions.Def_GravesIMA_Stages_Model open MeasureTheory ProbabilityTheory
namespace GravesIMA.Stages
theorem eq_16 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(σ : ℝ) (ε : ℤ → Ω → ℝ) (hmeas : ∀ t, Measurable (ε t))
(hind : iIndepFun (fun t : {s : ℤ // 1 ≤ s} => ε t) P)
(hlaw : ∀ t : ℤ, 1 ≤ t → P.map (ε t) = gaussianReal 0 (Real.toNNReal (σ ^ 2)))
(μ α : ℝ) (hα0 : 0 ≤ α) (hα1 : α ≤ 1) (L K : ℕ) (d F q x G p y : ℤ → Ω → ℝ)
(hsys : ∀ ω, IsTwoStage μ α L K (fun s => ε s ω) (fun s => d s ω) (fun s => F s ω)
(fun s => q s ω) (fun s => x s ω) (fun s => G s ω) (fun s => p s ω) (fun s => y s ω))
(y0 : ℝ) (hy0 : ∀ ω, y 0 ω = y0) (t : ℤ) (ht1 : 1 ≤ t) (htK : (K : ℤ) ≤ t) :
P.map (y t) = gaussianReal y0
(Real.toNNReal (σ ^ 2 * ∑ i ∈ Finset.range K, (1 + ((L : ℝ) + i) * α) ^ 2)) := by sorry
end GravesIMA.Stages
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.