Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — the clairvoyant bound E[U(X)]≥VOPT\mathbb E[U(X)] \ge V^{OPT}E[U(X)]≥VOPT

Proved
ProductFraming.Nest.theorem_2

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-framingupper-bound

In the product framing model with nnn products, m≥1m\ge1m≥1 pages of capacity p≥1p\ge1p≥1, revenues rir_iri​, a choice model PPP and a page-count law λ\lambdaλ on [m][m][m], let U(x)=G(x⋅p)U(x)=G(x\cdot p)U(x)=G(x⋅p) be the optimal revenue of an assortment of at most x⋅px\cdot px⋅p products. Then the optimal expected revenue of problem (1) is at most the revenue of a seller who knows XXX in advance:

VOPT ≤ E[U(X)]=∑x∈[m]λ(x) U(x).V^{OPT}\ \le\ \mathbb E[U(X)]=\sum_{x\in[m]}\lambda(x)\,U(x).VOPT ≤ E[U(X)]=x∈[m]∑​λ(x)U(x).

This upper bound, which is easy to compute, is the benchmark against which the approximation ratios of the paper are proved.

Formalization Note No assumption beyond the model of §3 is used (no A1, A3, or sign condition on rrr).

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

open Finset

/-- Theorem 2 (Gallego, Li, Truong, Wang 2020, p. 7): the clairvoyant bound `E[U(X)] ≥ V^OPT`. -/
theorem theorem_2 (n m p : ℕ) (hm : 1 ≤ m) (hp : 1 ≤ p) (r : Fin n → ℝ)
    (P : Fin n → Finset (Fin n) → ℝ) (hP : IsChoiceModel P) (lam : ℕ → ℝ) (hlam : IsPageLaw m lam) :
    Vopt n m p r P lam ≤ ∑ x ∈ Icc 1 m, lam x * U p r P 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, p. 7, Theorem 2 (proof p. 34)
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