Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 15 — a log-concave pdf lies below its exponential envelope γ₀e^{γ₁(x−t)}

Proved
DataDrivenNV.WMS.lemma2_exponential_envelope

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

densitylog-concavep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let fff be a log-concave probability density on R\mathbb RR and let ttt be a point with f(t)=γ0>0f(t)=\gamma_0>0f(t)=γ0​>0 (so ttt is in the support of fff). Suppose γ1∈∂log⁡f(t)\gamma_1\in\partial\log f(t)γ1​∈∂logf(t), i.e. log⁡f(x)≤log⁡f(t)+γ1(x−t)\log f(x)\le\log f(t)+\gamma_1(x-t)logf(x)≤logf(t)+γ1​(x−t) whenever f(x)>0f(x)>0f(x)>0. Then for every x∈Rx\in\mathbb Rx∈R,

f(x) ≤ γ0 eγ1(x−t).f(x)\ \le\ \gamma_0\,e^{\gamma_1(x-t)} .f(x) ≤ γ0​eγ1​(x−t).

Fixing a supergradient of log⁡f\log flogf bounds how fast the density can grow or decay; this envelope is what makes the truncated exponential (12) dominate every density of the class Lq∗,γ0,γ1\mathbb L_{q^*,\gamma_0,\gamma_1}Lq∗,γ0​,γ1​​.

Formalization Note "ttt in its support" is expressed by f(t)=γ0>0f(t)=\gamma_0>0f(t)=γ0​>0. The bound is claimed at every xxx, including the points where f(x)=0f(x)=0f(x)=0.

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

open MeasureTheory

/-- **Lemma 2** (p. 15): if `f` is a log-concave pdf, `f(t) = γ₀ > 0` and `γ₁ ∈ ∂ log f(t)`, then
`f(x) ≤ γ₀ e^{γ₁ (x − t)}` for every `x`. -/
theorem lemma2_exponential_envelope (f : ℝ → ℝ) (hf : IsPdf f)
    (hlc : ConvexOptimization.LogConcaveOn Set.univ f)
    (t γ₀ γ₁ : ℝ) (hγ₀ : 0 < γ₀) (hft : f t = γ₀) (hsg : IsLogSupergradient f t γ₁) :
    ∀ x, f x ≤ γ₀ * Real.exp (γ₁ * (x - t)) := 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 2; proof EC.4, p. ec9
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