Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, pp. 37–38 — γ≥6/π2\gamma \ge 6/\pi^2γ≥6/π2

Proved
ProductFraming.Nest.gamma_ge_six_div_pi_sq

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. Every feasible solution (U,Λ)(U,\Lambda)(U,Λ) of the bound-revealing program (5) has objective value at least 6/π26/\pi^26/π2:

max⁡x∈[m]U(x)x E[min⁡(X,x)] ≥ 6π2.\max_{x\in[m]}\frac{U(x)}{x}\,\mathbb E[\min(X,x)]\ \ge\ \frac{6}{\pi^2}.x∈[m]max​xU(x)​E[min(X,x)] ≥ π26​.

Equivalently, the optimal value of (5) satisfies γ≥6/π2\gamma\ge6/\pi^2γ≥6/π2.

This is the bound-revealing core of the analysis: combined with Theorem 2, Proposition 1 and Lemma 2 it gives Theorem 3.

Formalization Note The statement avoids naming γ\gammaγ by quantifying over all feasible solutions; E[min⁡(X,x)]=∑y=1xΛ(y)\mathbb E[\min(X,x)]=\sum_{y=1}^{x}\Lambda(y)E[min(X,x)]=∑y=1x​Λ(y).

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

open Finset

/-- Proof of Theorem 3, conclusion (Gallego, Li, Truong, Wang 2020, A.2, pp. 37–38): `γ ≥ 6/π²`,
i.e. every feasible solution of (5) has objective value at least `6/π²`. -/
theorem gamma_ge_six_div_pi_sq (m : ℕ) (hm : 1 ≤ m) :
    ∀ U Λ : ℕ → ℝ, Feasible5 m U Λ → 6 / Real.pi ^ 2 ≤ J5 hm U Λ := 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, Proof of Theorem 3, 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