Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Threshold-preserving PMF reduction of affiliated exchangeable laws

Proved
MinBuying.finite_affiliated_coarsening

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

min-buyingmtp2pricingprobability

Let μ\muμ be an exchangeable affiliated probability law on nnn nonnegative real-valued coordinates, and let S⊂RS\subset\mathbb RS⊂R be a finite set of thresholds. There exist a measurable map q:R→R≥0q:\mathbb R\to\mathbb R_{\ge0}q:R→R≥0​ and a probability mass function www such that the law of (q(V1),…,q(Vn))(q(V_1),\ldots,q(V_n))(q(V1​),…,q(Vn​)) for V∼μV\sim\muV∼μ is exactly the measure associated with www. This law is valid and exchangeable, its real-valued masses are MTP2, and for every t∈St\in St∈S and every x≥0x\ge0x≥0,

t≤q(x)⟺t≤x.t\le q(x)\quad\Longleftrightarrow\quad t\le x.t≤q(x)⟺t≤x.

Thus all affordability decisions at the selected thresholds can be preserved in a PMF model. The original law may have either a measurable pointwise-MTP2 density or a pointwise-MTP2 probability mass function.

Preamble
import Definitions.Def_MinBuying_Symmetry

open MeasureTheory

Formal statement
namespace MinBuying

theorem finite_affiliated_coarsening (n : ℕ) (μ : JointLaw n) (hμ : ValidLaw μ)
    (hex : Exchangeable μ) (haff : Affiliated μ) (S : Finset ℝ) :
    ∃ q : ℝ → ℝ, ∃ w : PMF (Valuations n),
      Measurable q ∧ (∀ x,0 ≤ q x) ∧
      (∀ t ∈ S, ∀ x,0 ≤ x → (t ≤ q x ↔ t ≤ x)) ∧
      w.toMeasure = Measure.map (fun v : Valuations n => fun i => q (v i)) μ ∧
      ValidLaw w.toMeasure ∧ Exchangeable w.toMeasure ∧ MTP2 (fun v => (w v).toReal) := by
  sorry

end MinBuying
Source
Supporting lemma for Theorem 2 of 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 . This proof introduces an exact threshold coarsening to transfer the PMF argument to the full density-or-PMF affiliation definition.

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