Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.16, pp. 34–35 — for prices in {c1,…,ck}∪{+∞}\{c_1,\dots,c_k\}\cup\{+\infty\}{c1​,…,ck​}∪{+∞}, rev(Sp)\mathrm{rev}(S_p)rev(Sp​) equals the Stackelberg revenue of ppp

Proved
RevenueOrdered.Stackelberg.revenue_assortmentOfPrices_eq

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

assortment-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stackelberg-pricing

In the assortment instance built from a Stackelberg Matroid instance (M,R,B,c)(M,R,B,c)(M,R,B,c) (with an admissible ordering LLL of R∪CR\cup\mathcal CR∪C), let p:B→R>0p:B\to\mathbb R_{>0}p:B→R>0​ take every value either in {c1,…,ck}\{c_1,\dots,c_k\}{c1​,…,ck​} or above every red cost (the paper's +∞+\infty+∞), and let L∗L^*L∗ be an ordering of R∪BR\cup BR∪B the customer may use under ppp. Put

Sp={(e,p(e)):e∈greedyM(R∪B,L∗)}⊆C.S_p=\{(e,p(e)): e\in\mathrm{greedy}_M(R\cup B,L^*)\}\subseteq\mathcal C.Sp​={(e,p(e)):e∈greedyM​(R∪B,L∗)}⊆C.

Then

∑y∈SpP(y,Sp) r(y)=∑e∈B∩greedyM(R∪B,L∗)p(e).\sum_{y\in S_p}\mathcal P(y,S_p)\,r(y)=\sum_{e\in B\cap\mathrm{greedy}_M(R\cup B,L^*)}p(e).y∈Sp​∑​P(y,Sp​)r(y)=e∈B∩greedyM​(R∪B,L∗)∑​p(e).

Together with the rounding step, this shows that the optimum of the assortment instance is at least the optimum of the Stackelberg Matroid instance.

Formalization Note SpS_pSp​ is formalized as the set of products (e,q)∈C(e,q)\in\mathcal C(e,q)∈C with e∈greedyM(R∪B,L∗)e\in\mathrm{greedy}_M(R\cup B,L^*)e∈greedyM​(R∪B,L∗) and q=p(e)q=p(e)q=p(e). Note that P\mathcal PP is defined with the fixed ordering LLL of R∪CR\cup\mathcal CR∪C, not with the ordering induced by L∗L^*L∗.

Preamble
import Mathlib
import Definitions.Def_RevenueOrdered_Stackelberg_Model
import Definitions.Def_RevenueOrdered_Stackelberg_Greedy
import Definitions.Def_RevenueOrdered_Stackelberg_Instance
import Definitions.Def_RevenueOrdered_Stackelberg_Assortment

open Classical
Formal statement
namespace RevenueOrdered.Stackelberg

/-- Proof of Theorem 4.16, pp. 34–35 (Berbeglia–Joret, arXiv:1606.01371v3): for a price
assignment `p` whose blue prices are red cost levels `c_i` or exceed every red cost (the paper's
`+∞`), and an ordering `L*` the customer may use, the assortment
`S_p = {(e, p(e)) : e ∈ greedy_M(R ∪ B, L*)}` earns the Stackelberg RevenueOrdered.Ratio.revenue of `p`. -/
theorem revenue_assortmentOfPrices_eq {α : Type*} (I : Instance α)
    (L : List (α ⊕ (α × ℝ))) (hL : IsAuxOrder I L) (p : α → ℝ)
    (hp : ∀ e ∈ I.B, 0 < p e) (hlev : ∀ e ∈ I.B, p e ∈ costs I ∨ ∀ f ∈ I.R, I.c f < p e)
    (L' : List α) (hL' : I.IsCustomerOrder p L') :
    RevenueOrdered.Ratio.revenue (choiceProb I L) (prodRevenue I) (assortmentOfPrices I p L') =
      I.stackRevenue p L' := by sorry

end RevenueOrdered.Stackelberg
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, pp. 34–35, proof of Theorem 4.16
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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