Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma D.1 (convex-quantile contraction): if Y has convex quantile Q and Y^[t] has quantile Q(tu), then NV(Y^[t])≤t·NV(Y) and NV(Z+Y^[t])≤(1-t)NV(Z)+t·NV(Z+Y)≤NV(Z+Y)

Proved
OWMR.convex_quantile_contraction

by Ming Hu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventoryinventory-theoryoperations-researchrenewal-theorystochastic-control

Let (Ω,P)(\Omega,\mathbb P)(Ω,P) be a probability space, Y,Y[t],ZY,Y^{[t]},ZY,Y[t],Z real random variables, Q:R→RQ:\mathbb R\to\mathbb RQ:R→R nondecreasing and convex on (0,1)(0,1)(0,1), 0<t≤10<t\le10<t≤1 and a,b>0a,b>0a,b>0. Suppose YYY is integrable with quantile function QQQ, that is, YYY has the law of Q(V)Q(V)Q(V) for VVV uniform on (0,1)(0,1)(0,1); Y[t]Y^{[t]}Y[t] has quantile function u↦Q(tu)u\mapsto Q(tu)u↦Q(tu) on (0,1)(0,1)(0,1); and ZZZ is integrable and independent of YYY and of Y[t]Y^{[t]}Y[t]. With NVa,b(X)=inf⁡zE[a(z−X)++b(X−z)+]\mathrm{NV}_{a,b}(X)=\inf_z\mathbb E[a(z-X)^++b(X-z)^+]NVa,b​(X)=infz​E[a(z−X)++b(X−z)+] as in (D.1) (the paper's minimum, written as an infimum),

NVa,b(Y[t])≤t NVa,b(Y),NVa,b(Z+Y[t])≤(1−t)NVa,b(Z)+t NVa,b(Z+Y)≤NVa,b(Z+Y).\mathrm{NV}_{a,b}(Y^{[t]})\le t\,\mathrm{NV}_{a,b}(Y),\qquad \mathrm{NV}_{a,b}(Z+Y^{[t]})\le(1-t)\mathrm{NV}_{a,b}(Z)+t\,\mathrm{NV}_{a,b}(Z+Y)\le\mathrm{NV}_{a,b}(Z+Y).NVa,b​(Y[t])≤tNVa,b​(Y),NVa,b​(Z+Y[t])≤(1−t)NVa,b​(Z)+tNVa,b​(Z+Y)≤NVa,b​(Z+Y).

The quantile function may be unbounded; only integrability of YYY and ZZZ is assumed.

Preamble
import Mathlib.Probability.Independence.Basic
import Mathlib.MeasureTheory.Integral.Bochner.Basic
import Mathlib.MeasureTheory.Measure.Lebesgue.Basic
import Mathlib.Analysis.Convex.Function

open MeasureTheory ProbabilityTheory
open scoped ENNReal NNReal
Formal statement
namespace OWMR
theorem convex_quantile_contraction {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (Q : ℝ → ℝ) (hQm : MonotoneOn Q (Set.Ioo 0 1))
    (hQc : ConvexOn ℝ (Set.Ioo 0 1) Q) (Y Yt Z : Ω → ℝ) (hY : Measurable Y)
    (hYt : Measurable Yt) (hZ : Measurable Z) (hYi : Integrable Y P) (hZi : Integrable Z P)
    (t a b : ℝ) (ht0 : 0 < t) (ht1 : t ≤ 1) (ha : 0 < a) (hb : 0 < b)
    (hYlaw : P.map Y = (volume.restrict (Set.Ioo 0 1)).map Q)
    (hYtlaw : P.map Yt = (volume.restrict (Set.Ioo 0 1)).map (fun u => Q (t * u)))
    (hZY : IndepFun Z Y P) (hZYt : IndepFun Z Yt P) :
    let NV : (Ω → ℝ) → ℝ := fun X =>
      ⨅ z : ℝ, ∫ ω, (a * max (z - X ω) 0 + b * max (X ω - z) 0) ∂P
    NV Yt ≤ t * NV Y ∧
      NV (fun ω => Z ω + Yt ω) ≤ (1 - t) * NV Z + t * NV (fun ω => Z ω + Y ω) ∧
      (1 - t) * NV Z + t * NV (fun ω => Z ω + Y ω) ≤ NV (fun ω => Z ω + Y ω) := by sorry
end OWMR
Source
M. Hu, "A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems", working paper (manuscript of November 2026), Appendix D, Lemma D.1 (Convex-Quantile Contraction) with the optimized loss (D.1) and inequalities (D.2) and (D.3), p. E.24; proof in Appendix D.1, p. E.27.
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Ming Hu · Nov 17, 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