Eqs. (4)–(5) — as a sum of Poisson tail probabilities and of incomplete Gamma ratios
ProvedFastFashion.Approx.eq_4_5_single_sizeincomplete-gammainventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-process
In the setting of the model file (independent Poisson family with rates , period ), for every size and every ,
where and is the lower incomplete Gamma function.
The formula makes the minimum operand of (3) explicitly computable and exhibits it as a sum of terms.
Formalization Note Both equalities are stated as a conjunction. is the real number (P E).toReal. Each index ranges over , so and are evaluated only at . The empty sum () gives .
Preamble
import Mathlib import Definitions.Def_FastFashion_Structure_Model import Definitions.Def_FastFashion_Approx_Tangents
Formal statement
namespace FastFashion.Approx
open MeasureTheory ProbabilityTheory
/-- Eqs. (4)–(5) (Caro–Gallien, p. 12): for every size `s`,
`𝔼[τ_s ∧ T] = (1/λ_s) ∑_{k=1}^{q_s} ℙ(N_s(T) ≥ k) = ∑_{k=1}^{q_s} γ(k, λ_s T) / (λ_s Γ(k))`,
with `Γ(k) = (k − 1)!`. -/
theorem eq_4_5_single_size {S Ω : Type*} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (lam : S → ℝ) (N : S → ℝ → Ω → ℕ)
(hN : FastFashion.Structure.IsPoissonFamily lam N P) (hlam : ∀ s, 0 < lam s) (T : ℝ) (hT : 0 < T)
(s : S) (q : S → ℕ) :
FastFashion.Structure.hA N P T {s} q =
(1 / lam s) * ∑ k ∈ Finset.Icc 1 (q s), (P {ω | k ≤ N s T ω}).toReal ∧
FastFashion.Structure.hA N P T {s} q =
∑ k ∈ Finset.Icc 1 (q s),
lowerGamma k (lam s * T) / (lam s * (Nat.factorial (k - 1) : ℝ)) := by sorry
end FastFashion.Approx
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 12, Eqs. (4)–(5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.