Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix §5.1 — hA(q)=E[τA∧T]h^{\mathcal A}(q) = \mathbb E[\tau_{\mathcal A}\wedge T]hA(q)=E[τA​∧T] is supermodular

Proved
FastFashion.Structure.hA_supermodular

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

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

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, and let T>0T > 0T>0. For every set of sizes A⊆S\mathcal A \subseteq \mathcal SA⊆S, the function

hA(q)=E[τA∧T],q∈NS,h^{\mathcal A}(q) = \mathbb E[\tau_{\mathcal A} \wedge T], \qquad q \in \mathbb N^{\mathcal S},hA(q)=E[τA​∧T],q∈NS,

is supermodular on the lattice NS\mathbb N^{\mathcal S}NS: hA(q)+hA(q′)≤hA(q∨q′)+hA(q∧q′)h^{\mathcal A}(q) + h^{\mathcal A}(q') \le h^{\mathcal A}(q \vee q') + h^{\mathcal A}(q \wedge q')hA(q)+hA(q′)≤hA(q∨q′)+hA(q∧q′) for all q,q′q, q'q,q′.

Together with identity (2), this gives the supermodularity of the expected sales function in Proposition 1.

Formalization Note Supermodularity is Topkis's notion, the published platform definition SupermodularOn with the whole lattice as domain.

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

open MeasureTheory ProbabilityTheory

theorem hA_supermodular {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) :
    ∀ A : Finset S, Supermodularity.Monotonicity.SupermodularOn (hA N P T A) Set.univ := by sorry

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