Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: uniform optimality under exchangeability and affiliation

Proved
MinBuying.theorem2_affiliated

by mikeh · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

min-buyingoperations-researchpricingprobability

For a positive finite number of min-buying products, an exchangeable affiliated nonnegative joint valuation law, and the source's finite attained optima with positive uniform revenue, optimal differentiated and uniform revenues coincide. Affiliation is represented by either an MTP2 joint density or an MTP2 probability mass function.

Preamble
import Definitions.Def_MinBuying_Symmetry

Formal statement
namespace MinBuying

/-- Theorem 2 (p.13). Affiliation covers the density and PMF alternatives of
Definition 1; the discrete case includes ties among valuation coordinates. -/
theorem theorem2_affiliated (n : ℕ) (hn : 0 < n) (μ : JointLaw n)
    (hμ : ValidLaw μ) (hex : Exchangeable μ) (haff : Affiliated μ)
    (hopt : WellPosed μ) :
    DPRevenue μ = UPRevenue μ := by
  sorry

end MinBuying
Source
Titing Cui, Michael L. Hamilton, Jourdain Lamperski, and Kasra Ganjizadeh Tari, Unit-Demand Pricing for Min-Buying Customers, September 27, 2026 manuscript, 47 PDF pages (main pp.1–27; companion ec1–ec20). https://doi.org/10.2139/ssrn.5178133 . p.13, Theorem 2; Definition 1 pp.12–13; standing conventions p.7.
Read-back

What the Lean code literally says, in plain math · gpt-6-astra

For every integer n>0n>0n>0, let μ\muμ be a probability measure on Rn\mathbb R^nRn such that all coordinates are nonnegative simultaneously μ\muμ-almost surely. Assume μ\muμ is invariant under every map (xi)i↦(xσ(i))i(x_i)_i\mapsto(x_{\sigma(i)})_i(xi​)i​↦(xσ(i)​)i​ for a permutation σ\sigmaσ of the coordinates, and assume one of the following alternatives holds: either μ\muμ has an everywhere nonnegative, Borel-measurable real density fff with respect to Lebesgue measure on Rn\mathbb R^nRn, satisfying f(x)f(y)≤f(x∨y)f(x∧y)f(x)f(y)\le f(x\vee y)f(x\wedge y)f(x)f(y)≤f(x∨y)f(x∧y) for every x,y∈Rnx,y\in\mathbb R^nx,y∈Rn, or μ\muμ is the measure of a probability mass function www on Rn\mathbb R^nRn whose real point masses satisfy w(x)w(y)≤w(x∨y)w(x∧y)w(x)w(y)\le w(x\vee y)w(x\wedge y)w(x)w(y)≤w(x∨y)w(x∧y) for every x,y∈Rnx,y\in\mathbb R^nx,y∈Rn. Here ∨\vee∨ and ∧\wedge∧ mean coordinatewise maximum and minimum, and the mass-function alternative does not require finite support. For a measure λ\lambdaλ on a finite real coordinate space and a price vector ppp, let Mp(x)M_p(x)Mp​(x) be the minimum of the numbers pip_ipi​ over those indices satisfying pi≤xip_i\le x_ipi​≤xi​, with Mp(x)=0M_p(x)=0Mp​(x)=0 when there is no such index, and put Rλ(p)=∫Mp(x) dλ(x)R_\lambda(p)=\int M_p(x)\,d\lambda(x)Rλ​(p)=∫Mp​(x)dλ(x). Write Dλ=sup⁡{Rλ(p):pi≥0 for every i}D_\lambda=\sup\{R_\lambda(p):p_i\ge0\text{ for every }i\}Dλ​=sup{Rλ​(p):pi​≥0 for every i} and Uλ=sup⁡{Rλ(r1):r≥0}U_\lambda=\sup\{R_\lambda(r\mathbf1):r\ge0\}Uλ​=sup{Rλ​(r1):r≥0}, where the suprema are taken in R\mathbb RR and r1r\mathbf1r1 is the constant price vector. Write W(λ)W(\lambda)W(λ) for the conjunction that both sets defining DλD_\lambdaDλ​ and UλU_\lambdaUλ​ are bounded above, there is a vector ppp with every pi≥0p_i\ge0pi​≥0 and Rλ(p)=DλR_\lambda(p)=D_\lambdaRλ​(p)=Dλ​, there is an r≥0r\ge0r≥0 with Rλ(r1)=UλR_\lambda(r\mathbf1)=U_\lambdaRλ​(r1)=Uλ​, and Uλ>0U_\lambda>0Uλ​>0. If W(μ)W(\mu)W(μ) holds, then Dμ=UμD_\mu=U_\muDμ​=Uμ​. In particular, boundedness of both feasible revenue sets, attainment of each supremum, and strict positivity of the uniform supremum are assumptions of this equality, and the optimized price sets include zero prices.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikeh · Oct 31, 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