Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3) — the expected truncated first stockout time of a set of sizes is at most the minimum over its sizes

Proved
FastFashion.Approx.eq_3_min_bound

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

inventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stopping-time

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 nonempty set of sizes D⊆S\mathcal D \subseteq \mathcal SD⊆S and every q∈NSq \in \mathbb N^{\mathcal S}q∈NS,

E[τD∧T]≤min⁡s∈DE[τs∧T].\mathbb E[\tau_{\mathcal D} \wedge T] \le \min_{s \in \mathcal D} \mathbb E[\tau_s \wedge T].E[τD​∧T]≤s∈Dmin​E[τs​∧T].

This is the first of the two approximation steps of §3.1.3, each of which produces an upper bound.

Formalization Note The paper writes "for any subset of sizes D⊂S\mathcal D \subset \mathcal SD⊂S"; the subset is required to be nonempty here, since the minimum over the empty set has no value. E[τs∧T]\mathbb E[\tau_s \wedge T]E[τs​∧T] is h{s}(q)h^{\{s\}}(q)h{s}(q).

Preamble
import Mathlib
import Definitions.Def_FastFashion_Structure_Model
Formal statement
namespace FastFashion.Approx

open MeasureTheory ProbabilityTheory

/-- Eq. (3) (Caro–Gallien, p. 12): for every nonempty set of sizes `D`,
`𝔼[τ_D ∧ T] ≤ min_{s ∈ D} 𝔼[τ_s ∧ T]`. -/
theorem eq_3_min_bound {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)
    (D : Finset S) (hD : D.Nonempty) (q : S → ℕ) :
    FastFashion.Structure.hA N P T D q ≤ D.inf' hD (fun s => FastFashion.Structure.hA N P T {s} q) := by sorry

end FastFashion.Approx
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 12, Eq. (3)
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