Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix §5.1, first sentence — on every sample path the sales G(q)G(q)G(q) are non-decreasing in qqq

Proved
FastFashion.Structure.sales_monotone_pathwise

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

inventorymonotonicityp2o-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, S+⊆S\mathcal S^+ \subseteq \mathcal SS+⊆S the major sizes, TTT a time horizon, and G(q)G(q)G(q) the random sales of equation (1). Then for every outcome ω\omegaω the map

q⟼G(q)(ω),q∈NS,q \longmapsto G(q)(\omega), \qquad q \in \mathbb N^{\mathcal S},q⟼G(q)(ω),q∈NS,

is non-decreasing for the componentwise order: if qs≤qs′q_s \le q'_sqs​≤qs′​ for every size sss, then G(q)(ω)≤G(q′)(ω)G(q)(\omega) \le G(q')(\omega)G(q)(ω)≤G(q′)(ω).

This is the sample-path form of the monotonicity part of Proposition 1: more inventory of any size delays every virtual stockout time and hence every stopping time in (1), and the counting processes are non-decreasing. Taking expectations gives the first assertion of Proposition 1.

Formalization Note Only the path properties of the Poisson family are used (start at zero, non-decreasing right-continuous paths with unit jumps); the statement is made under the full IsPoissonFamily hypothesis, with no assumption on the rates or on TTT, since the claim holds for every TTT.

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

open MeasureTheory ProbabilityTheory

theorem sales_monotone_pathwise {S Ω : Type*} [Fintype S] [DecidableEq S] [MeasurableSpace Ω]
    (P : Measure Ω) (lam : S → ℝ) (N : S → ℝ → Ω → ℕ) (Sp : Finset S) (T : ℝ)
    (hN : IsPoissonFamily lam N P) :
    ∀ ω : Ω, Monotone (fun q : S → ℕ => sales N Sp T q ω) := by sorry

end FastFashion.Structure
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 30, Appendix §5.1, Proof of Proposition 1, first sentence (parenthetical)
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