Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (4)–(5) — E[τs∧T]\mathbb E[\tau_s \wedge T]E[τs​∧T] as a sum of Poisson tail probabilities and of incomplete Gamma ratios

Proved
FastFashion.Approx.eq_4_5_single_size

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

incomplete-gammainventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-process

In the setting of the model file (independent Poisson family with rates λs>0\lambda_s > 0λs​>0, period T>0T > 0T>0), for every size sss and every q∈NSq \in \mathbb N^{\mathcal S}q∈NS,

E[τs∧T]=1λs∑k=1qsP(Ns(T)≥k)=∑k=1qsγ(k,λsT)λs Γ(k),\mathbb E[\tau_s \wedge T] = \frac{1}{\lambda_s}\sum_{k=1}^{q_s} \mathbb P\big(N_s(T) \ge k\big) = \sum_{k=1}^{q_s} \frac{\gamma(k, \lambda_s T)}{\lambda_s\,\Gamma(k)},E[τs​∧T]=λs​1​k=1∑qs​​P(Ns​(T)≥k)=k=1∑qs​​λs​Γ(k)γ(k,λs​T)​,

where Γ(k)=(k−1)!\Gamma(k) = (k-1)!Γ(k)=(k−1)! and γ(a,b)=∫0bva−1e−v dv\gamma(a,b) = \int_0^b v^{a-1}e^{-v}\,dvγ(a,b)=∫0b​va−1e−vdv is the lower incomplete Gamma function.

The formula makes the minimum operand of (3) explicitly computable and exhibits it as a sum of qsq_sqs​ terms.

Formalization Note Both equalities are stated as a conjunction. P(E)\mathbb P(E)P(E) is the real number (P E).toReal. Each index kkk ranges over 1,…,qs1, \dots, q_s1,…,qs​, so γ(k,⋅)\gamma(k, \cdot)γ(k,⋅) and (k−1)!(k-1)!(k−1)! are evaluated only at k≥1k \ge 1k≥1. The empty sum (qs=0q_s = 0qs​=0) gives E[τs(0)∧T]=0\mathbb E[\tau_s(0) \wedge T] = 0E[τs​(0)∧T]=0.

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
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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