Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The choice model P=1m∑iPi\mathcal P=\frac1m\sum_i\mathcal P_iP=m1​∑i​Pi​ of Theorem 4.6 is regular

Proved
RevenueOrdered.UDPmin.reduction_isRegular

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

assortment-optimizationdiscrete-choicep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reduction

For every UDPmin⁡\mathrm{UDP}_{\min}UDPmin​ instance with at least one consumer, the choice model P(y,S)=1m∑i=1mPi(y,S)\mathcal P(y,S)=\frac1m\sum_{i=1}^m\mathcal P_i(y,S)P(y,S)=m1​∑i=1m​Pi​(y,S) on C=[n]×{v1,…,vm}\mathcal C=[n]\times\{v_1,\dots,v_m\}C=[n]×{v1​,…,vm​}, where Pi\mathcal P_iPi​ spreads probability 111 uniformly over the set Qi(S)Q_i(S)Qi​(S) of cheapest acceptable copies of consumer iii's items, is a regular discrete choice model: it satisfies axioms (i)–(iv), including

P(0,S) ≥ P(0,S′)for all S⊆S′⊆C.\mathcal P(0,S)\ \ge\ \mathcal P(0,S')\qquad\text{for all } S\subseteq S'\subseteq\mathcal C.P(0,S) ≥ P(0,S′)for all S⊆S′⊆C.

This is the part of Theorem 4.6 that places UDPmin⁡\mathrm{UDP}_{\min}UDPmin​ inside the scope of the paper's guarantees for regular models.

Preamble
import Mathlib
import Definitions.Def_RevenueOrdered_UDPmin_Model
import Definitions.Def_RevenueOrdered_UDPmin_Pricing
import Definitions.Def_RevenueOrdered_UDPmin_Reduction
Formal statement
namespace RevenueOrdered.UDPmin

/-- The choice model of Theorem 4.6 is regular (Berbeglia–Joret, arXiv:1606.01371v3, §4.5.1,
proof of Theorem 4.6, pp. 17–18). -/
theorem reduction_isRegular {X M : Type*} [Fintype X] [DecidableEq X] [Fintype M] [Nonempty M]
    (I : Instance X M) :
    IsRegular (redP I) := by sorry

end RevenueOrdered.UDPmin
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, §4.5.1, proof of Theorem 4.6, pp. 17–18
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