Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.16, pp. 32–33 — the choice probabilities P((e,q),S)=1∣B∣[(e,q)∈greedyM′(R∪S,L)]\mathcal P((e,q),S)=\tfrac{1}{|B|}[(e,q)\in\mathrm{greedy}_{M'}(R\cup S,L)]P((e,q),S)=∣B∣1​[(e,q)∈greedyM′​(R∪S,L)] are regular

Proved
RevenueOrdered.Stackelberg.choiceProb_isRegular

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

discrete-choicematroidsp2o-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, C=B×{c1,…,ck}\mathcal C=B\times\{c_1,\dots,c_k\}C=B×{c1​,…,ck​} and M′M'M′ the auxiliary matroid on R∪CR\cup\mathcal CR∪C. Let LLL be a linear ordering of R∪CR\cup\mathcal CR∪C that is non-decreasing in cost (c(f)c(f)c(f) for f∈Rf\in Rf∈R, qqq for (e,q)∈C(e,q)\in\mathcal C(e,q)∈C) and puts elements of C\mathcal CC before red elements of equal cost. Define, for S⊆CS\subseteq\mathcal CS⊆C and (e,q)∈C(e,q)\in\mathcal C(e,q)∈C,

P((e,q),S)={1/∣B∣if (e,q)∈greedyM′(R∪S,L),0otherwise,P(0,S)=1−∑(e,q)∈SP((e,q),S).\mathcal P((e,q),S)=\begin{cases}1/|B| & \text{if }(e,q)\in\mathrm{greedy}_{M'}(R\cup S,L),\\0&\text{otherwise,}\end{cases}\qquad \mathcal P(0,S)=1-\sum_{(e,q)\in S}\mathcal P((e,q),S).P((e,q),S)={1/∣B∣0​if (e,q)∈greedyM′​(R∪S,L),otherwise,​P(0,S)=1−(e,q)∈S∑​P((e,q),S).

Then P\mathcal PP is a regular discrete choice model: it satisfies axioms (i), (ii), (iii) and (iv), including axiom (iv) for the no-purchase option.

This is the first step of the proof of Theorem 4.16; it shows that the Stackelberg Matroid problem is an assortment problem under a regular model, to which the bounds of §3 apply.

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

/-- Regularity of the choice model of the proof of Theorem 4.16 (Berbeglia–Joret,
arXiv:1606.01371v3, pp. 32–33): for every ordering `L` of `R ∪ 𝒞` that is non-decreasing in cost
with `𝒞` before `R` on ties, `𝒫((e, q), S) = 1/|B|·[(e, q) ∈ greedy_{M′}(R ∪ S, L)]` satisfies
axioms (i)–(iv). -/
theorem choiceProb_isRegular {α : Type*} (I : Instance α) (L : List (α ⊕ (α × ℝ)))
    (hL : IsAuxOrder I L) :
    RevenueOrdered.Ratio.IsRegular (choiceProb I 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. 32–33, proof of Theorem 4.16 ("Let us prove that P is a regular discrete choice model")
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