Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.16, p. 34 — rounding blue prices up to the red cost levels keeps L∗L^*L∗ valid and does not decrease revenue

Proved
RevenueOrdered.Stackelberg.roundUp_revenue_le

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stackelberg-pricing

Let (M,R,B,c)(M,R,B,c)(M,R,B,c) be a Stackelberg Matroid instance with distinct red costs c1<⋯<ckc_1<\dots<c_kc1​<⋯<ck​, let p:B→R>0p:B\to\mathbb R_{>0}p:B→R>0​ be a price assignment and L∗L^*L∗ an ordering of R∪BR\cup BR∪B the customer may use under ppp. Define the rounded prices

p^(e)={min⁡{ci:ci≥p(e)}if p(e)≤ck,+∞if p(e)>ck.\hat p(e)=\begin{cases}\min\{c_i: c_i\ge p(e)\}&\text{if } p(e)\le c_k,\\ +\infty&\text{if } p(e)>c_k.\end{cases}p^​(e)={min{ci​:ci​≥p(e)}+∞​if p(e)≤ck​,if p(e)>ck​.​

Then L∗L^*L∗ is still an ordering the customer may use under p^\hat pp^​, and the revenue does not decrease:

∑e∈B∩greedyM(R∪B,L∗)p(e)≤∑e∈B∩greedyM(R∪B,L∗)p^(e).\sum_{e\in B\cap\mathrm{greedy}_M(R\cup B,L^*)}p(e)\le\sum_{e\in B\cap\mathrm{greedy}_M(R\cup B,L^*)}\hat p(e).e∈B∩greedyM​(R∪B,L∗)∑​p(e)≤e∈B∩greedyM​(R∪B,L∗)∑​p^​(e).

This justifies restricting attention to prices in {c1,…,ck}∪{+∞}\{c_1,\dots,c_k\}\cup\{+\infty\}{c1​,…,ck​}∪{+∞} when bounding the Stackelberg optimum from above. The paper asserts it, noting that a blue element priced above ckc_kck​ is never bought because RRR contains a base.

Formalization Note The price +∞+\infty+∞ is abovePrice =1+∑f∈Rc(f)=1+\sum_{f\in R}c(f)=1+∑f∈R​c(f). The paper modifies ppp one element at a time; here all prices are rounded at once.

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, p. 34 (Berbeglia–Joret, arXiv:1606.01371v3): rounding every blue
price up to the next red cost level `c_i` (or to `+∞` if it exceeds `c_k`) keeps the
customer's ordering valid and does not decrease the RevenueOrdered.Ratio.revenue. -/
theorem roundUp_revenue_le {α : Type*} (I : Instance α) (p : α → ℝ)
    (hp : ∀ e ∈ I.B, 0 < p e) (L' : List α) (hL' : I.IsCustomerOrder p L') :
    I.IsCustomerOrder (roundUp I p) L' ∧
      I.stackRevenue p L' ≤ I.stackRevenue (roundUp I 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, p. 34, 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