Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (6) — E[τs∧T]\mathbb E[\tau_s \wedge T]E[τs​∧T] is the lower envelope of its discrete tangents (coefficients index-corrected)

Proved
FastFashion.Approx.eq_6_tangent_envelope

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

concavityincomplete-gammainventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

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]=min⁡i∈N∪{∞}{ai(λs)(qs−i)+bi(λs)},\mathbb E[\tau_s \wedge T] = \min_{i \in \mathbb N \cup \{\infty\}} \big\{a_i(\lambda_s)(q_s - i) + b_i(\lambda_s)\big\},E[τs​∧T]=i∈N∪{∞}min​{ai​(λs​)(qs​−i)+bi​(λs​)},

where ai(λ)=γ(i+1,λT)/(λ i!)a_i(\lambda) = \gamma(i+1,\lambda T)/(\lambda\, i!)ai​(λ)=γ(i+1,λT)/(λi!), bi(λ)=∑k=0i−1ak(λ)b_i(\lambda) = \sum_{k=0}^{i-1} a_k(\lambda)bi​(λ)=∑k=0i−1​ak​(λ), and the tangent with index ∞\infty∞ is the constant TTT. That is, every discrete tangent lies above E[τs∧T]\mathbb E[\tau_s \wedge T]E[τs​∧T] at qsq_sqs​, and some tangent equals it.

This representation is what the approximation (8) truncates to finitely many tangents.

Formalization Note Corrected coefficients. The paper prints ak=γ(k,λsT)/(λsΓ(k))a_k = \gamma(k,\lambda_s T)/(\lambda_s\Gamma(k))ak​=γ(k,λs​T)/(λs​Γ(k)) and bi=∑k=0i−1akb_i = \sum_{k=0}^{i-1} a_kbi​=∑k=0i−1​ak​, under which b1=a0b_1 = a_0b1​=a0​ involves Γ(0)\Gamma(0)Γ(0) and (6) fails; the slopes here are re-indexed so that aka_kak​ is the (k+1)(k+1)(k+1)-th term of (5), matching the paper's own description of aka_kak​. Minimum. The paper takes the minimum over i∈Ni \in \mathbb Ni∈N and extends a,ba, ba,b to i=∞i = \inftyi=∞; the statement takes it over N∪{∞}\mathbb N \cup \{\infty\}N∪{∞}, and the infinite tangent does not change the minimum. The minimum is stated as IsLeast of the set of tangent values (lower bound and attainment), not as a real infimum.

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

open MeasureTheory ProbabilityTheory

/-- Eq. (6) (Caro–Gallien, p. 12), with the slopes re-indexed so that `a_k` is the `(k+1)`-th term
of (5): `𝔼[τ_s ∧ T]` is the least value of the discrete tangents
`a_i(λ_s)(q_s − i) + b_i(λ_s)`, `i ∈ ℕ ∪ {∞}` (the tangent at `∞` being the constant `T`), and the
least value is attained. -/
theorem eq_6_tangent_envelope {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 → ℕ) :
    IsLeast (Set.range fun i : WithTop ℕ => tangent (lam s) T i (q 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. (6) (a_k index corrected)
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