Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2, NEST(y) step 2 — a run of NEST(y) always exists

Proved
ProductFraming.Nest.nest_run_exists

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

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

Let PPP be a choice model satisfying Assumption A1, let ri≥0r_i\ge0ri​≥0, and let m,p≥1m,p\ge1m,p≥1. For every y∈[m]y\in[m]y∈[m] there are sets S(1),…,S(y)⊆[n]S(1),\dots,S(y)\subseteq[n]S(1),…,S(y)⊆[n] forming a run of NEST(yyy): S(y)S(y)S(y) is an optimal solution of problem (2) with bound y⋅py\cdot py⋅p, and for x=y−1,…,1x=y-1,\dots,1x=y−1,…,1,

S(x)⊆S(x+1),∣S(x)∣=min⁡(∣S(x+1)∣, x⋅p),R(S(x))∣S(x)∣≥R(S(x+1))∣S(x+1)∣.S(x)\subseteq S(x+1),\qquad |S(x)|=\min(|S(x+1)|,\,x\cdot p),\qquad \frac{R(S(x))}{|S(x)|}\ge\frac{R(S(x+1))}{|S(x+1)|}.S(x)⊆S(x+1),∣S(x)∣=min(∣S(x+1)∣,x⋅p),∣S(x)∣R(S(x))​≥∣S(x+1)∣R(S(x+1))​.

The paper asserts this right after the description of the algorithm ("Lemma 1 ensures that we can always find such a set S(x)S(x)S(x)"). It shows that the guarantee of Theorem 3, which is stated for every run, is not about an empty set of runs.

Formalization Note The hypothesis ri≥0r_i\ge0ri​≥0 is added, as for Lemma 1.

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

open Finset

/-- §4.2, NEST(y) step 2, p. 9 (Gallego, Li, Truong, Wang 2020): "Lemma 1 ensures that we can always
find such a set S(x)." Every NEST(y), `y ∈ [m]`, has a run. The hypothesis `0 ≤ r` is added. -/
theorem nest_run_exists (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) :
    ∀ y ∈ Icc 1 m, ∃ S : ℕ → Finset (Fin n), IsNestRun p r P y S := 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, §4.2, NEST(y) step 2, p. 9
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