Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.2, p. 13 — η₀ ∈ (0,1); q* = 0 for η ∈ [0, η₀); every optimal q* ≥ q₀ > 0 for η ∈ (η₀, 1); [0, q₀] optimal at η = η₀

Proved
HeavyTailNV.ZeroOrder.proposition_3_2

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

distributionally-robust-optimizationmoment-problemnewsvendorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α>1\alpha>1α>1 and mα>m1α>0m_\alpha>m_1^\alpha>0mα​>m1α​>0, let F1,α\mathcal F_{1,\alpha}F1,α​ be the set of laws on [0,∞)[0,\infty)[0,∞) with mean m1m_1m1​ and α\alphaα-th moment mαm_\alphamα​, and consider the distributionally robust newsvendor problem

min⁡q≥0 ((1−η)q+sup⁡F∈F1,αEF[d~−q]+)(3.2)\min_{q\ge 0}\ \Big((1-\eta)q+\sup_{F\in\mathcal F_{1,\alpha}}\mathbb E_F[\tilde d-q]^+\Big)\tag{3.2}q≥0min​ ((1−η)q+F∈F1,α​sup​EF​[d~−q]+)(3.2)

with critical ratio η∈[0,1)\eta\in[0,1)η∈[0,1). Define the threshold critical ratio and the threshold order quantity

η0=1−(m1αmα)1/(α−1),q0=α−1α(mαm1)1/(α−1).\eta_0=1-\Big(\frac{m_1^\alpha}{m_\alpha}\Big)^{1/(\alpha-1)},\qquad q_0=\frac{\alpha-1}{\alpha}\Big(\frac{m_\alpha}{m_1}\Big)^{1/(\alpha-1)}.η0​=1−(mα​m1α​​)1/(α−1),q0​=αα−1​(m1​mα​​)1/(α−1).

Then η0∈(0,1)\eta_0\in(0,1)η0​∈(0,1), and:

  1. for every η∈[0,η0)\eta\in[0,\eta_0)η∈[0,η0​), the only optimal order quantity is q∗=0q^*=0q∗=0;
  2. for every η∈(η0,1)\eta\in(\eta_0,1)η∈(η0​,1), an optimal order quantity exists, and every optimal order quantity q∗q^*q∗ satisfies q∗>0q^*>0q∗>0 and q∗≥q0q^*\ge q_0q∗≥q0​;
  3. for η=η0\eta=\eta_0η=η0​, every q∈[0,q0]q\in[0,q_0]q∈[0,q0​] is an optimal order quantity.

For any moment order α>1\alpha>1α>1, however high, there is a range of small critical ratios in which the robust newsvendor orders nothing; this generalizes the zero-order region of Scarf's mean–variance model (α=2\alpha=2α=2).

Formalization Note "The optimal order quantity is given as q∗=0q^*=0q∗=0" in (a) is stated as: the set of minimizers of (3.2) over q≥0q\ge0q≥0 is exactly {0}\{0\}{0}. In (b) the existence of an optimal order quantity is stated explicitly, so that the lower bound is not vacuous; strict positivity is stated as a separate conjunct. Optimality is over q∈[0,∞)q\in[0,\infty)q∈[0,∞) as in (3.2), not over R\mathbb RR.

Preamble
import Mathlib
import Definitions.Def_HeavyTailNV_ZeroOrder_Model
Formal statement
namespace HeavyTailNV.ZeroOrder

/-- Proposition 3.2 (arXiv:1806.05379v2, p. 13). With `η₀ = 1 - (m₁^α/m_α)^{1/(α-1)} ∈ (0, 1)`:
(a) for `η ∈ [0, η₀)` the unique optimal order quantity of (3.2) is `q* = 0`;
(b) for `η ∈ (η₀, 1)` an optimal order quantity exists, and every optimal order quantity is
strictly positive and at least `q₀ = ((α - 1)/α)(m_α/m₁)^{1/(α-1)}`;
(c) for `η = η₀` every `q ∈ [0, q₀]` is an optimal order quantity. -/
theorem proposition_3_2 (α m1 ma : ℝ) (hα : 1 < α) (hm1 : 0 < m1) (hma : m1 ^ α < ma) :
    eta0 m1 ma α ∈ Set.Ioo 0 1 ∧
    (∀ η : ℝ, 0 ≤ η → η < eta0 m1 ma α →
      {q : ℝ | IsOptimalOrder m1 ma α η q} = {0}) ∧
    (∀ η : ℝ, eta0 m1 ma α < η → η < 1 →
      (∃ q : ℝ, IsOptimalOrder m1 ma α η q) ∧
      ∀ q : ℝ, IsOptimalOrder m1 ma α η q → 0 < q ∧ q0 m1 ma α ≤ q) ∧
    (∀ q ∈ Set.Icc 0 (q0 m1 ma α), IsOptimalOrder m1 ma α (eta0 m1 ma α) q) := by sorry

end HeavyTailNV.ZeroOrder
Source
Das, Dhara and Natarajan, On the heavy-tail behavior of the distributionally robust newsvendor, arXiv:1806.05379v2, p. 13, Proposition 3.2 (proof p. 14)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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