Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3 — 1/γ=max⁡ΛE[X/E[min⁡(X,Y)∣X]]1/\gamma = \max_\Lambda \mathbb E[X/\mathbb E[\min(X,Y)\mid X]]1/γ=maxΛ​E[X/E[min(X,Y)∣X]]

Proved
ProductFraming.Nest.proposition_3

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

bound-revealing-programp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-framing

Fix m≥1m\ge1m≥1. Let γ\gammaγ be the optimal value of program (5), and let YYY be independent of XXX with the same law. Then the minimum γ\gammaγ of (5) is attained, and 1/γ1/\gamma1/γ is the optimal value of program (6):

1γ=max⁡Λ E[XE[min⁡(X,Y)∣X]]=max⁡Λ ∑x∈[m]λ(x) x∑y=1xΛ(y)\frac1\gamma=\max_{\Lambda}\ \mathbb E\Big[\frac{X}{\mathbb E[\min(X,Y)\mid X]}\Big]=\max_\Lambda\ \sum_{x\in[m]}\lambda(x)\,\frac{x}{\sum_{y=1}^{x}\Lambda(y)}γ1​=Λmax​ E[E[min(X,Y)∣X]X​]=Λmax​ x∈[m]∑​λ(x)∑y=1x​Λ(y)x​

subject to 1=Λ(1)≥Λ(2)≥⋯≥Λ(m)≥01=\Lambda(1)\ge\Lambda(2)\ge\dots\ge\Lambda(m)\ge01=Λ(1)≥Λ(2)≥⋯≥Λ(m)≥0 and Λ(x+1)∑y=1mΛ(y)≥∑y=x+1mΛ(y)\Lambda(x+1)\sum_{y=1}^{m}\Lambda(y)\ge\sum_{y=x+1}^{m}\Lambda(y)Λ(x+1)∑y=1m​Λ(y)≥∑y=x+1m​Λ(y) for x=1,…,m−1x=1,\dots,m-1x=1,…,m−1, where λ(x)=Λ(x)−Λ(x+1)\lambda(x)=\Lambda(x)-\Lambda(x+1)λ(x)=Λ(x)−Λ(x+1) and Λ(m+1)=0\Lambda(m+1)=0Λ(m+1)=0.

This reduces the min–max program (5) to a maximization over NBUE distributions only, which is then bounded by the exponential case.

Formalization Note The statement asserts the existence of γ\gammaγ that is the least value of the objective of (5) over its feasible set, and that 1/γ1/\gamma1/γ is the greatest value of the objective of (6) over its feasible set (both attained).

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

open Finset

/-- Proposition 3 (Gallego, Li, Truong, Wang 2020, p. 10): the minimum `γ` of (5) is attained, and
`1/γ` is the maximum of `E[X / E[min(X, Y) | X]]` over the tails `Λ` feasible for (6). -/
theorem proposition_3 (m : ℕ) (hm : 1 ≤ m) :
    ∃ γ : ℝ, IsLeast {J : ℝ | ∃ U Λ : ℕ → ℝ, Feasible5 m U Λ ∧ J = J5 hm U Λ} γ ∧
      IsGreatest {t : ℝ | ∃ Λ : ℕ → ℝ, Feasible6 m Λ ∧ t = ratio6 m Λ} (1 / γ) := 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, p. 10, Proposition 3 (proof p. 36)
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