Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (2) — gλ(q)=λS+E[τS+∧T]+∑s∈S−λsE[τS+∪{s}∧T]g_\lambda(q) = \lambda_{\mathcal S^+}\mathbb E[\tau_{\mathcal S^+}\wedge T] + \sum_{s\in\mathcal S^-}\lambda_s\mathbb E[\tau_{\mathcal S^+\cup\{s\}}\wedge T]gλ​(q)=λS+​E[τS+​∧T]+∑s∈S−​λs​E[τS+∪{s}​∧T]

Proved
FastFashion.Structure.eq_2_optional_sampling

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

inventoryoptional-samplingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-process

Let (Ns)s∈S(N_s)_{s \in \mathcal S}(Ns​)s∈S​ be an independent Poisson family with rates λs>0\lambda_s > 0λs​>0 on a probability space, let T>0T > 0T>0, let S+\mathcal S^+S+ be the major sizes and S−=S∖S+\mathcal S^- = \mathcal S \setminus \mathcal S^+S−=S∖S+ the minor sizes. Write λS+=∑s∈S+λs\lambda_{\mathcal S^+} = \sum_{s \in \mathcal S^+} \lambda_sλS+​=∑s∈S+​λs​ and hA(q)=E[τA∧T]h^{\mathcal A}(q) = \mathbb E[\tau_{\mathcal A} \wedge T]hA(q)=E[τA​∧T]. Then for every inventory vector q∈NSq \in \mathbb N^{\mathcal S}q∈NS, the expected sales gλ(q)=E[G(q)]g_\lambda(q) = \mathbb E[G(q)]gλ​(q)=E[G(q)] of (1) satisfy

gλ(q)=λS+ E[τS+∧T]+∑s∈S−λs E[τS+∪{s}∧T].(2)g_\lambda(q) = \lambda_{\mathcal S^+}\,\mathbb E[\tau_{\mathcal S^+} \wedge T] + \sum_{s \in \mathcal S^-} \lambda_s\, \mathbb E[\tau_{\mathcal S^+ \cup \{s\}} \wedge T]. \qquad (2)gλ​(q)=λS+​E[τS+​∧T]+s∈S−∑​λs​E[τS+∪{s}​∧T].(2)

Identity (2) is the step where the Poisson rates enter: it rewrites the expected sales, defined through the counting processes evaluated at random times, as a positive linear combination of the functions hAh^{\mathcal A}hA with A=S+\mathcal A = \mathcal S^+A=S+ and A=S+∪{s}\mathcal A = \mathcal S^+ \cup \{s\}A=S+∪{s}. Appendix §5.1 restates it as g=λS+hS++∑s∈S−λshS+∪{s}g = \lambda_{\mathcal S^+} h^{\mathcal S^+} + \sum_{s \in \mathcal S^-} \lambda_s h^{\mathcal S^+ \cup \{s\}}g=λS+​hS++∑s∈S−​λs​hS+∪{s}, and the proof of Proposition 1 rests on it.

Formalization Note gλg_\lambdagλ​ is defined as the expectation of GGG from (1), not by formula (2), so this is a genuine identity. When S+=∅\mathcal S^+ = \emptysetS+=∅, τ∅=+∞\tau_\emptyset = +\inftyτ∅​=+∞ and the first term vanishes.

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

open MeasureTheory ProbabilityTheory

theorem eq_2_optional_sampling {S Ω : Type*} [Fintype S] [DecidableEq S] [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P] (lam : S → ℝ) (N : S → ℝ → Ω → ℕ) (T : ℝ)
    (hN : IsPoissonFamily lam N P) (hlam : ∀ s, 0 < lam s) (hT : 0 < T)
    (Sp : Finset S) :
    ∀ q : S → ℕ, expectedSales N P Sp T q =
      (∑ s ∈ Sp, lam s) * hA N P T Sp q + ∑ s ∈ Spᶜ, lam s * hA N P T (insert s Sp) q := by sorry

end FastFashion.Structure
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), pp. 11–12, §3.1.3, Eq. (2); restated p. 31, Appendix §5.1
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