Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The revenue of an assortment SSS equals the revenue of its price assignment pSp_SpS​

Proved
RevenueOrdered.UDPmin.rev_eq_revenue_priceOf

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

assortment-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingreduction

In the assortment instance built from a UDPmin⁡\mathrm{UDP}_{\min}UDPmin​ instance with at least one consumer (Theorem 4.6), for every assortment S⊆C=[n]×{v1,…,vm}S\subseteq\mathcal C=[n]\times\{v_1,\dots,v_m\}S⊆C=[n]×{v1​,…,vm​},

∑y∈SP(y,S) r(y) = revUDP(pS),\sum_{y\in S}\mathcal P(y,S)\,r(y)\ =\ \mathrm{rev}_{\mathrm{UDP}}(p_S),y∈S∑​P(y,S)r(y) = revUDP​(pS​),

where pS(x)=min⁡{v:(x,v)∈S}p_S(x)=\min\{v:(x,v)\in S\}pS​(x)=min{v:(x,v)∈S}, and pS(x)p_S(x)pS​(x) is a price above every valuation when SSS contains no pair with first coordinate xxx.

Consequently the optimum of the assortment instance is at most that of the pricing instance.

Formalization Note The paper's +∞+\infty+∞ price is the real 1+∑ivi1+\sum_i v_i1+∑i​vi​ (Remark, p. 18).

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 revenue of an assortment `S` of the Theorem 4.6 instance equals the revenue of its price
assignment `p_S` (Berbeglia–Joret, arXiv:1606.01371v3, §4.5.1, proof of Theorem 4.6, p. 19). -/
theorem rev_eq_revenue_priceOf {X M : Type*} [Fintype X] [DecidableEq X] [Fintype M] [Nonempty M]
    (I : Instance X M) (S : Finset (RedProd I)) :
    RevenueOrdered.Tightness.rev (redP I) (redRev I) S = revenue I (priceOf I S) := 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, p. 19
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