Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.10), p. 14 — on 0 ≤ q ≤ q₀ the robust objective (1 − η)q + Π_{1,α}(q) equals m₁ − q(η − η₀)

Proved
HeavyTailNV.ZeroOrder.eq_3_10

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

distributionally-robust-optimizationnewsvendorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α>1\alpha>1α>1, mα>m1α>0m_\alpha>m_1^\alpha>0mα​>m1α​>0, η0=1−(m1α/mα)1/(α−1)\eta_0=1-(m_1^\alpha/m_\alpha)^{1/(\alpha-1)}η0​=1−(m1α​/mα​)1/(α−1) and q0=α−1α(mα/m1)1/(α−1)q_0=\frac{\alpha-1}{\alpha}(m_\alpha/m_1)^{1/(\alpha-1)}q0​=αα−1​(mα​/m1​)1/(α−1), and let Π1,α(q)=sup⁡F∈F1,αEF[d~−q]+\Pi_{1,\alpha}(q)=\sup_{F\in\mathcal F_{1,\alpha}}\mathbb E_F[\tilde d-q]^+Π1,α​(q)=supF∈F1,α​​EF​[d~−q]+. For every critical ratio η∈[0,1)\eta\in[0,1)η∈[0,1) and every qqq with 0≤q≤q00\le q\le q_00≤q≤q0​,

(1−η)q+Π1,α(q)=m1−q(η−1+(m1αmα)1/(α−1))=m1−q(η−η0).(1-\eta)q+\Pi_{1,\alpha}(q)=m_1-q\Big(\eta-1+\Big(\frac{m_1^\alpha}{m_\alpha}\Big)^{1/(\alpha-1)}\Big)=m_1-q(\eta-\eta_0).(1−η)q+Π1,α​(q)=m1​−q(η−1+(mα​m1α​​)1/(α−1))=m1​−q(η−η0​).

On the interval [0,q0][0,q_0][0,q0​] the robust newsvendor objective is affine in qqq with slope η0−η\eta_0-\etaη0​−η, so its minimizer over that interval is 000 when η<η0\eta<\eta_0η<η0​, q0q_0q0​ when η>η0\eta>\eta_0η>η0​, and any point when η=η0\eta=\eta_0η=η0​.

Formalization Note The paper writes (3.10) as an equality of minima over [0,q0][0,q_0][0,q0​]; the item states the pointwise identity of the two objectives on [0,q0][0,q_0][0,q0​], from which the equality of minima follows. The range η∈[0,1)\eta\in[0,1)η∈[0,1) is the paper's standing range of the critical ratio (p. 2).

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

/-- Display (3.10) (arXiv:1806.05379v2, p. 14): on `0 ≤ q ≤ q₀` the robust newsvendor objective
`(1 - η) q + Π_{1,α}(q)` equals `m₁ - q (η - η₀)`, for every critical ratio `η ∈ [0, 1)`. -/
theorem eq_3_10 (α m1 ma : ℝ) (hα : 1 < α) (hm1 : 0 < m1) (hma : m1 ^ α < ma) :
    ∀ η q : ℝ, 0 ≤ η → η < 1 → 0 ≤ q → q ≤ q0 m1 ma α →
      HeavyTailNV.Tail.robustCost m1 ma α η q = m1 - q * (η - eta0 m1 ma α) := by sorry

end HeavyTailNV.ZeroOrder
Source
Das, Dhara and Natarajan, On the heavy-tail behavior of the distributionally robust newsvendor, arXiv:1806.05379v2, p. 14, (3.10) in the proof of Proposition 3.2
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