Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 proof: uniform-price domination under affiliation

Proved
MinBuying.affiliated_policy_domination

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

min-buyingoperations-researchpricingprobability

For every feasible price vector under an exchangeable affiliated nonnegative joint probability law with a positive finite number of coordinates, one of the coordinate prices earns weakly greater revenue when charged uniformly. This policy assertion uses no optimum-attainment assumption and covers the density-or-PMF affiliation scope of Definition 1.

Preamble
import Definitions.Def_MinBuying_Symmetry

Formal statement
namespace MinBuying

/-- The stronger own-vector domination statement from the proof of Theorem 2
(ec3--ec5), formulated without assuming an optimizing vector is attained. -/
theorem affiliated_policy_domination (n : ℕ) (hn : 0 < n) (μ : JointLaw n)
    (hμ : ValidLaw μ) (hex : Exchangeable μ) (haff : Affiliated μ)
    (p : Prices n) (hp : FeasiblePrices p) :
    ∃ i : Fin n, Revenue μ p ≤ uniformRevenue μ (p i) := 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 . PDF pp.30–32/ec3–ec5, proof of Theorem 2.
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 every coordinate is 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 every price vector p=(pi)i<np=(p_i)_{i<n}p=(pi​)i<n​ with all pi≥0p_i\ge0pi​≥0, define Rμ(p)R_\mu(p)Rμ​(p) as the integral of the minimum price pip_ipi​ among indices with pi≤xip_i\le x_ipi​≤xi​, using payment 000 at a valuation vector xxx when no such index exists. Then there is an index i<ni<ni<n for which Rμ(p)≤Rμ(pi1)R_\mu(p)\le R_\mu(p_i\mathbf1)Rμ​(p)≤Rμ​(pi​1), where the right-hand side sets every coordinate's price equal to the original price pip_ipi​. This is a statement about each given feasible vector and a price drawn from its entries. It includes zero and repeated prices and makes no assumption that any revenue optimum is attained or is strictly positive; n=0n=0n=0 is excluded.

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