Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1 — expected sales are non-decreasing, discretely concave in each variable, and supermodular

Proved
FastFashion.Structure.proposition_1

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

discrete-concavityinventoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-processsupermodularity

Let S=S+∪S−\mathcal S = \mathcal S^+ \cup \mathcal S^-S=S+∪S− be a finite set of sizes split into major and minor sizes, 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 be the time between replenishments, and let g(q)=E[G(q)]g(q) = \mathbb E[G(q)]g(q)=E[G(q)] be the expected sales of equation (1) as a function of the inventory vector q∈NSq \in \mathbb N^{\mathcal S}q∈NS. Write Δsg(q)=g(q+es)−g(q)\Delta_s g(q) = g(q + e_s) - g(q)Δs​g(q)=g(q+es​)−g(q). Then

  1. ggg is non-decreasing: q≤q′q \le q'q≤q′ componentwise implies g(q)≤g(q′)g(q) \le g(q')g(q)≤g(q′);
  2. ggg is discretely concave in each variable: Δsg(q+es)≤Δsg(q)\Delta_s g(q + e_s) \le \Delta_s g(q)Δs​g(q+es​)≤Δs​g(q) for all qqq and sss;
  3. the marginal differences are non-decreasing in the other variables: Δsg(q)≤Δsg(q+es′)\Delta_s g(q) \le \Delta_s g(q + e_{s'})Δs​g(q)≤Δs​g(q+es′​) for all qqq and all s≠s′s \ne s's=s′;
  4. ggg is supermodular on the lattice NS\mathbb N^{\mathcal S}NS:
g(q)+g(q′)≤g(q∨q′)+g(q∧q′)for all q,q′∈NS.g(q) + g(q') \le g(q \vee q') + g(q \wedge q') \qquad \text{for all } q, q' \in \mathbb N^{\mathcal S}.g(q)+g(q′)≤g(q∨q′)+g(q∧q′)for all q,q′∈NS.

The proposition shows that the sales model captures the two qualitative features the inventory allocation needs: decreasing marginal returns to shipping more of a size to a store, and complementarity across sizes induced by the policy of removing a garment from display when a major size runs out.

Formalization Note The paper writes "non-decreasing in xsx_sxs​", a typo for qsq_sqs​. Items 2 and 3 are the paper's "That is" reading; item 4 is the word "supermodular" in Topkis's lattice sense (the published platform definition SupermodularOn on the whole lattice). Both are stated because the paper states both. No hypothesis is placed on the set of major sizes; for S+=∅\mathcal S^+ = \emptysetS+=∅ the first sum in (1) is empty and τS+=+∞\tau_{\mathcal S^+} = +\inftyτS+​=+∞.

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

open MeasureTheory ProbabilityTheory

theorem proposition_1 {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) :
    Monotone (expectedSales N P Sp T) ∧
    (∀ (q : S → ℕ) (s : S),
      delta (expectedSales N P Sp T) s (q + Pi.single s 1)
        ≤ delta (expectedSales N P Sp T) s q) ∧
    (∀ (q : S → ℕ) (s s' : S), s ≠ s' →
      delta (expectedSales N P Sp T) s q
        ≤ delta (expectedSales N P Sp T) s (q + Pi.single s' 1)) ∧
    Supermodularity.Monotonicity.SupermodularOn (expectedSales N P Sp T) Set.univ := by sorry

end FastFashion.Structure
Source
Caro & Gallien, Inventory Management of a Fast-Fashion Retail Network, working paper (August 2, 2007), p. 11, Proposition 1; proof pp. 30–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