Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4, p. 15 — three elementary inequalities for β ∈ (0,1), η ∈ (−1/(1−β), 1/β)

Proved
DataDrivenNV.WMS.lemma4_three_inequalities

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

elementary-inequalitylogarithmp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let β∈(0,1)\beta\in(0,1)β∈(0,1) and η∈(−11−β,1β)\eta\in\big(-\frac1{1-\beta},\frac1\beta\big)η∈(−1−β1​,β1​). Then

(11−β+η)log⁡(1+η(1−β))+(1β−η)log⁡(1−ηβ)−min⁡{β,1−β} η2 ≥ 0,\Big(\frac1{1-\beta}+\eta\Big)\log\big(1+\eta(1-\beta)\big)+\Big(\frac1\beta-\eta\Big)\log(1-\eta\beta)-\min\{\beta,1-\beta\}\,\eta^2\ \ge\ 0,(1−β1​+η)log(1+η(1−β))+(β1​−η)log(1−ηβ)−min{β,1−β}η2 ≥ 0,
β1−βlog⁡1β−β ≥ 0,\frac{\beta}{1-\beta}\log\frac1\beta-\beta\ \ge\ 0,1−ββ​logβ1​−β ≥ 0,
1−ββlog⁡11−β−(1−β) ≥ 0.\frac{1-\beta}{\beta}\log\frac1{1-\beta}-(1-\beta)\ \ge\ 0.β1−β​log1−β1​−(1−β) ≥ 0.

With η=γ1/γ0\eta=\gamma_1/\gamma_0η=γ1​/γ0​ and β=b/(b+h)\beta=b/(b+h)β=b/(b+h) these give zq∗,γ0,γ1∗≥1γ0min⁡(b,h)b+hz^*_{q^*,\gamma_0,\gamma_1}\ge\frac1{\gamma_0}\frac{\min(b,h)}{b+h}zq∗,γ0​,γ1​∗​≥γ0​1​b+hmin(b,h)​ in each of the three cases of the proof of Proposition 2.

Formalization Note Logarithms are natural logarithms. The last two inequalities do not involve η\etaη; they are kept in one statement as printed.

Preamble
import Mathlib
import Definitions.Def_LogConcaveOn
import Definitions.Def_DataDrivenNV_WMS_Setting
Formal statement
namespace DataDrivenNV.WMS

open MeasureTheory

/-- **Lemma 4** (p. 15): for `β ∈ (0,1)` and `η ∈ (−1/(1−β), 1/β)`, three elementary inequalities. -/
theorem lemma4_three_inequalities (β η : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
    (hη0 : -(1 / (1 - β)) < η) (hη1 : η < 1 / β) :
    0 ≤ (1 / (1 - β) + η) * Real.log (1 + η * (1 - β)) + (1 / β - η) * Real.log (1 - η * β)
        - min β (1 - β) * η ^ 2 ∧
    0 ≤ β / (1 - β) * Real.log (1 / β) - β ∧
    0 ≤ (1 - β) / β * Real.log (1 / (1 - β)) - (1 - β) := by sorry

end DataDrivenNV.WMS
Source
Levi, Perakis & Uichanco, The Data-Driven Newsvendor Problem: New Bounds and Insights, authors' accepted manuscript (MIT DSpace), p. 15, Lemma 4; proof EC.6, pp. ec9–ec10
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