Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5 — E[min⁡(X,x)]≥E[min⁡(Z,x)]\mathbb E[\min(X,x)] \ge \mathbb E[\min(Z,x)]E[min(X,x)]≥E[min(Z,x)] for x≥0x \ge 0x≥0

Proved
ProductFraming.Nest.corollary_5

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

exponential-distributionnbuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let X∈[m]X\in[m]X∈[m] have law λ\lambdaλ satisfying Assumption A3 (NBUE), and let ZZZ be exponential with mean E[Z]=E[X]=μ\mathbb E[Z]=\mathbb E[X]=\muE[Z]=E[X]=μ. Then for all real x≥0x\ge0x≥0,

E[min⁡(X,x)]=∑y∈[m]λ(y)min⁡(y,x) ≥ E[min⁡(Z,x)].\mathbb E[\min(X,x)]=\sum_{y\in[m]}\lambda(y)\min(y,x)\ \ge\ \mathbb E[\min(Z,x)].E[min(X,x)]=y∈[m]∑​λ(y)min(y,x) ≥ E[min(Z,x)].

It bounds the denominators of the objective of (6) from below by their exponential counterparts.

Formalization Note The page prints the conclusion as "E[min⁡(X,x)]≥E[min⁡(X,x)]\mathbb E[\min(X,x)]\ge\mathbb E[\min(X,x)]E[min(X,x)]≥E[min(X,x)]", a typo: the proof ends with E[min⁡(Z,x)]\mathbb E[\min(Z,x)]E[min(Z,x)] on the right, which is what is formalized. The law of ZZZ is expMeasure with rate 1/μ1/\mu1/μ.

Preamble
import Mathlib
import Definitions.Def_ProductFraming_Nest_Model
Formal statement
namespace ProductFraming.Nest

open Finset MeasureTheory ProbabilityTheory

/-- Corollary 5 (Gallego, Li, Truong, Wang 2020, p. 37), with the page's typo corrected: if `X` is
NBUE and `Z` is exponential with `E[Z] = E[X]`, then `E[min(X, x)] ≥ E[min(Z, x)]` for all
`x ≥ 0`. -/
theorem corollary_5 (m : ℕ) (hm : 1 ≤ m) (lam : ℕ → ℝ) (hlam : IsPageLaw m lam) (hA3 : IsNBUE m lam) :
    ∀ x : ℝ, 0 ≤ x → ∫ z, min z x ∂(expMeasure (mean m lam)⁻¹) ≤ Emin m lam x := by sorry

end ProductFraming.Nest
Source
Gallego, Li, Truong, Wang, Approximation Algorithms for Product Framing and Pricing, Operations Research (2020), DOI 10.1287/opre.2019.1875, authors' accepted manuscript, A.2, p. 37, Corollary 5 (typo in the printed right-hand side corrected)
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