Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — removing one product does not lower per-product revenue

Proved
ProductFraming.Nest.lemma_1

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

assortment-optimizationchoice-modelp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-framing

Let PPP be a choice model satisfying Assumption A1 and let the revenues be nonnegative, ri≥0r_i\ge0ri​≥0. For every set S⊆[n]S\subseteq[n]S⊆[n] with ∣S∣≥2|S|\ge2∣S∣≥2 there is a product i∈Si\in Si∈S such that

∑k∈S, k≠irkP(k,S∖{i})∣S∣−1 ≥ ∑k∈SrkP(k,S)∣S∣,\frac{\sum_{k\in S,\,k\ne i}r_kP(k,S\setminus\{i\})}{|S|-1}\ \ge\ \frac{\sum_{k\in S}r_kP(k,S)}{|S|},∣S∣−1∑k∈S,k=i​rk​P(k,S∖{i})​ ≥ ∣S∣∑k∈S​rk​P(k,S)​,

that is, R(S∖{i})/(∣S∣−1)≥R(S)/∣S∣R(S\setminus\{i\})/(|S|-1)\ge R(S)/|S|R(S∖{i})/(∣S∣−1)≥R(S)/∣S∣.

The paper cites this result from Davis, Topaloglu and Williamson (2015). It guarantees that step 2 of NEST(yyy) can always be carried out.

Formalization Note The hypothesis ri≥0r_i\ge0ri​≥0 is added: the paper speaks of unit revenues, and the lemma fails for negative ones (for S={1,2}S=\{1,2\}S={1,2}, P(k,S)=1/3P(k,S)=1/3P(k,S)=1/3, P(k,{k})=1/2P(k,\{k\})=1/2P(k,{k})=1/2, r=(−1,−1)r=(-1,-1)r=(−1,−1) the left side is −1/2-1/2−1/2 and the right side −1/3-1/3−1/3). S∖{i}S\setminus\{i\}S∖{i} is S.erase i, and cardinalities are cast to R\mathbb RR before subtracting.

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

open Finset

/-- Lemma 1 (Davis et al. 2015; Gallego, Li, Truong, Wang 2020, p. 8): for any `S` with `|S| ≥ 2`
there is `i ∈ S` with `R(S \ {i}) / (|S| − 1) ≥ R(S) / |S|`. The hypothesis `0 ≤ r` is added
(the lemma fails for negative revenues). -/
theorem lemma_1 (n : ℕ) (r : Fin n → ℝ) (hr : ∀ i, 0 ≤ r i) (P : Fin n → Finset (Fin n) → ℝ)
    (hP : IsChoiceModel P) (hA1 : SatisfiesA1 P) (S : Finset (Fin n)) (hS : 2 ≤ S.card) :
    ∃ i ∈ S, R r P S / (S.card : ℝ) ≤ R r P (S.erase i) / ((S.card : ℝ) - 1) := 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. 8, Lemma 1 (Davis et al. 2015)
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