Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2 — at a worst case of (5), (U(x)/x) E[min⁡(X,x)](U(x)/x)\,\mathbb E[\min(X,x)](U(x)/x)E[min(X,x)] is constant

Proved
ProductFraming.Nest.proposition_2

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 and consider the bound-revealing program (5), with objective J(U,Λ)=max⁡x∈[m]U(x)xE[min⁡(X,x)]J(U,\Lambda)=\max_{x\in[m]}\frac{U(x)}{x}\mathbb E[\min(X,x)]J(U,Λ)=maxx∈[m]​xU(x)​E[min(X,x)] and optimal value γ\gammaγ. There is an optimal solution (U,Λ)(U,\Lambda)(U,Λ) of (5) at which

γ = U(x)x E[min⁡(X,x)]for all x∈[m].\gamma\ =\ \frac{U(x)}{x}\,\mathbb E[\min(X,x)]\qquad\text{for all }x\in[m].γ = xU(x)​E[min(X,x)]for all x∈[m].

This is the worst-case structure of UUU; Proposition 3 uses it to eliminate UUU from (5).

Formalization Note The paper states the proposition for "the" optimal solution without naming it (p. 10). It is formalized in the existential reading: some optimal solution has a constant g(x)=U(x)xE[min⁡(X,x)]g(x)=\frac{U(x)}{x}\mathbb E[\min(X,x)]g(x)=xU(x)​E[min(X,x)]. This is what the rest of the argument uses. The universal reading can fail when λ\lambdaλ vanishes on part of [m][m][m] at the optimum, since the rescaling in the proof is then impossible. Optimality is stated as J(U,Λ)≤J(U′,Λ′)J(U,\Lambda)\le J(U',\Lambda')J(U,Λ)≤J(U′,Λ′) for every feasible (U′,Λ′)(U',\Lambda')(U′,Λ′), which also says that the minimum is attained.

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

open Finset

/-- Proposition 2 (Gallego, Li, Truong, Wang 2020, p. 10), existential reading: problem (5) has an
optimal solution `(U, Λ)` at which `g(x) = (U(x)/x) E[min(X, x)]` is constant on `[m]`, equal
to the optimal value `γ`. -/
theorem proposition_2 (m : ℕ) (hm : 1 ≤ m) :
    ∃ U Λ : ℕ → ℝ, Feasible5 m U Λ ∧
      (∀ U' Λ' : ℕ → ℝ, Feasible5 m U' Λ' → J5 hm U Λ ≤ J5 hm U' Λ') ∧
      ∀ x ∈ Icc 1 m, U x / (x : ℝ) * EminTail Λ x = 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, p. 10, Proposition 2 (proof pp. 35–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