Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.5 — some optimal UDPmin⁡\mathrm{UDP}_{\min}UDPmin​ price assignment uses only valuations as prices

Proved
RevenueOrdered.UDPmin.exists_optimal_valuation_prices

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

envy-free-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingunit-demand

Consider a UDPmin⁡\mathrm{UDP}_{\min}UDPmin​ instance with items [n][n][n], at least one consumer, interest sets BiB_iBi​ and valuations v1,…,vm>0v_1,\dots,v_m>0v1​,…,vm​>0. Then there is a price assignment ppp with

p(x)∈{v1,…,vm}for all x∈[n]p(x)\in\{v_1,\dots,v_m\}\quad\text{for all } x\in[n]p(x)∈{v1​,…,vm​}for all x∈[n]

that is optimal: revUDP(p′)≤revUDP(p)\mathrm{rev}_{\mathrm{UDP}}(p')\le\mathrm{rev}_{\mathrm{UDP}}(p)revUDP​(p′)≤revUDP​(p) for every positive price assignment p′p'p′, and revUDP(p)=OPTUDP\mathrm{rev}_{\mathrm{UDP}}(p)=\mathrm{OPT}_{\mathrm{UDP}}revUDP​(p)=OPTUDP​. In particular the supremum defining OPTUDP\mathrm{OPT}_{\mathrm{UDP}}OPTUDP​ is attained.

The lemma reduces the uncountable search over prices to a finite one; it is what makes the assortment instance of Theorem 4.6 reach the pricing optimum.

Formalization Note The price ppp is positive because valuations are. The paper's proof starts from an optimal assignment; here its existence is part of the statement.

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

/-- Lemma 4.5 (Berbeglia–Joret, arXiv:1606.01371v3, p. 17; proof in App. B, p. 30): some optimal
price assignment takes only valuations as prices. -/
theorem exists_optimal_valuation_prices {X M : Type*} [Fintype X] [Fintype M] [Nonempty M]
    (I : Instance X M) :
    ∃ p : X → ℝ, (∀ x, ∃ i, p x = I.v i) ∧
      (∀ p' : X → ℝ, (∀ x, 0 < p' x) → revenue I p' ≤ revenue I p) ∧
      revenue I p = optUDP 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, p. 17, Lemma 4.5 (proof in Appendix B, p. 30)
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