Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 — VNEST≥(6/π2) VOPTV^{NEST} \ge (6/\pi^2)\, V^{OPT}VNEST≥(6/π2)VOPT

Proved
ProductFraming.Nest.theorem_3

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

approximation-algorithmnbuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-framing

Consider the product framing problem with nnn products, m≥1m\ge1m≥1 pages of capacity p≥1p\ge1p≥1, nonnegative revenues rir_iri​, a choice model PPP satisfying Assumption A1, and a page-count law λ\lambdaλ on [m][m][m] that is NBUE (Assumption A3). For each y∈[m]y\in[m]y∈[m] let Sy(1),…,Sy(y)S_y(1),\dots,S_y(y)Sy​(1),…,Sy​(y) be any run of NEST(yyy) (with an exact solution of problem (2), i.e. A2 with ε=0\varepsilon=0ε=0), and let VNEST=max⁡y∈[m]VNEST(y)V^{NEST}=\max_{y\in[m]}V^{NEST(y)}VNEST=maxy∈[m]​VNEST(y) be the best expected revenue among the framings these runs display. Then

VNEST ≥ 6π2 VOPT.V^{NEST}\ \ge\ \frac{6}{\pi^2}\,V^{OPT}.VNEST ≥ π26​VOPT.

This is the main result of the paper on product framing: NEST earns at least 6/π2≈0.6086/\pi^2\approx0.6086/π2≈0.608 of the optimal expected revenue, although problem (1) is NP-hard.

Formalization Note The guarantee is stated for every choice of the runs, since the algorithm's choices are arbitrary; that runs exist is a separate milestone. The hypothesis ri≥0r_i\ge0ri​≥0 is added (unit revenues; Lemmas 1 and 2 need it). A2 is used with ε=0\varepsilon=0ε=0, as in the paper; with ε>0\varepsilon>0ε>0 the paper states that the bound scales by (1−ε)(1-\varepsilon)(1−ε), which is not formalized. Pages are 1-based and "not displayed" is page 000.

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

open Finset

/-- Theorem 3 (Gallego, Li, Truong, Wang 2020, p. 10): under A1, A2 with `ε = 0` and A3,
`V^{NEST} ≥ (6/π²) V^{OPT}`, for every choice of the NEST(y) runs `runs y`, `y ∈ [m]`. The
hypothesis `0 ≤ r` is added. -/
theorem theorem_3 (n m p : ℕ) (hm : 1 ≤ m) (hp : 1 ≤ p) (r : Fin n → ℝ) (hr : ∀ i, 0 ≤ r i)
    (P : Fin n → Finset (Fin n) → ℝ) (hP : IsChoiceModel P) (hA1 : SatisfiesA1 P)
    (lam : ℕ → ℝ) (hlam : IsPageLaw m lam) (hA3 : IsNBUE m lam)
    (runs : ℕ → ℕ → Finset (Fin n)) (hruns : ∀ y ∈ Icc 1 m, IsNestRun p r P y (runs y)) :
    6 / Real.pi ^ 2 * Vopt n m p r P lam ≤ VNEST hm r P lam runs := 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, Theorem 3 (proof pp. 37–38)
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