Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exchangeable affiliated PMF threshold comparison

Proved
MinBuying.pmf_threshold_comparison

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

min-buyingmtp2operations-researchpricingprobability

Let V∈R+nV\in\mathbb R_+^nV∈R+n​ have an exchangeable MTP2 probability mass function, where n>0n>0n>0. Fix any coordinate iii and thresholds a≤ba\le ba≤b, and suppose Pr⁡(max⁡jVj≥b)>0\Pr(\max_j V_j\ge b)>0Pr(maxj​Vj​≥b)>0. Then

Pr⁡(Vi<a∣max⁡jVj≥b)≤Pr⁡(Vi<a∣max⁡jVj≥a).\Pr(V_i<a\mid\max_j V_j\ge b)\le\Pr(V_i<a\mid\max_j V_j\ge a).Pr(Vi​<a∣jmax​Vj​≥b)≤Pr(Vi​<a∣jmax​Vj​≥a).

The second conditioning event also has positive probability. The result provides the threshold comparison used to eliminate differentiated prices and allows countably infinite support.

Preamble
import Definitions.Def_MinBuying_Symmetry

Formal statement
namespace MinBuying

/-- The exchangeable threshold comparison for a genuine probability mass
function, with no finite-support assumption. -/
theorem pmf_threshold_comparison (n : ℕ) (hn : 0 < n) (w : PMF (Valuations n))
    (hμ : ValidLaw w.toMeasure) (hex : Exchangeable w.toMeasure)
    (hmtp : MTP2 (fun v => (w v).toReal)) (i : Fin n) (a b : ℝ) (hab : a ≤ b)
    (hb : 0 < w.toMeasure (upperMaximumEvent b)) :
    (w.toMeasure (coordinateBelowAndUpperMaximumEvent i a b)).toReal /
        (w.toMeasure (upperMaximumEvent b)).toReal ≤
      (w.toMeasure (coordinateBelowAndUpperMaximumEvent i a a)).toReal /
        (w.toMeasure (upperMaximumEvent a)).toReal := 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, https://doi.org/10.2139/ssrn.5178133 . Supporting lemma for the proof of Theorem 2, ec2–ec3.

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