Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4, p. 587 — decreasing density favors the upper reflected order

Proved
BoundedNV.RareEvent.profit_reflection_positive

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

newsvendorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1rare-event-bias

Let demand have density fff supported on [a,b][a,b][a,b], with 0≤a<b0\le a<b0≤a<b, and let m=(a+b)/2m=(a+b)/2m=(a+b)/2. Suppose p>0p>0p>0, c=p(1−F(m))c=p(1-F(m))c=p(1−F(m)), and fff is strictly decreasing on [a,b][a,b][a,b]. Then, for every 0<y≤(b−a)/20<y\le(b-a)/20<y≤(b−a)/2,

π(m+y)>π(m−y).\pi(m+y)>\pi(m-y).π(m+y)>π(m−y).

This is the strict profit comparison in equation (50), which drives the logit choice density toward the less likely high-demand end.

Formalization Note The paper says “decreasing”; strict decrease is required for its displayed strict inequality. A constant density with the optimum at the midpoint gives equality.

Preamble
import Mathlib
import Definitions.Def_BoundedNV_RareEvent_Logit
Formal statement
namespace BoundedNV.RareEvent

/-- The strict inequality in (50), p. 587. -/
theorem profit_reflection_positive (f : ℝ → ℝ) (p c a b y : ℝ)
    (hf : BoundedNV.ExpFam.IsDemandDensity f) (ha : 0 ≤ a) (hab : a < b)
    (hsupp : ∀ x ∉ Set.Icc a b, f x = 0)
    (hp : 0 < p) (hy : 0 < y) (hyr : y ≤ (b - a) / 2)
    (hfractile : c = p * (1 - BoundedNV.Uniform.demandCDF f ((a + b) / 2)))
    (hanti : StrictAntiOn f (Set.Icc a b)) :
    BoundedNV.Uniform.nvProfit f p c ((a + b) / 2 - y) <
      BoundedNV.Uniform.nvProfit f p c ((a + b) / 2 + y) := by sorry

end BoundedNV.RareEvent
Source
Su, Bounded Rationality in Newsvendor Models, Manufacturing & Service Operations Management 10(4), 2008, p. 587 (PDF 22), proof of Proposition 4, eq. (50)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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