Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact probability mass of sorted exchangeable valuations, including ties

Proved
MinBuying.sorted_pmf_mass

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

exchangeabilitymin-buyingorder-statisticspricingprobability

Let www be an exchangeable probability mass function on Rn\mathbb R^nRn, and sort each valuation vector into nondecreasing order. For a nondecreasing vector vvv, let mx(v)m_x(v)mx​(v) denote the multiplicity of coordinate value xxx. The sorted law has mass

Pr⁡(sort⁡(V)=v)=n!∏x∈{v1,…,vn}mx(v)! w(v).\Pr(\operatorname{sort}(V)=v)=\frac{n!}{\prod_{x\in\{v_1,\ldots,v_n\}}m_x(v)!}\,w(v).Pr(sort(V)=v)=∏x∈{v1​,…,vn​}​mx​(v)!n!​w(v).

At a vector that is not nondecreasing, the sorted law has mass zero. The formula applies to arbitrary countable support and includes ties, supplying the exact orbit factor needed for the MTP2 order-statistic argument.

Preamble
import Definitions.Def_MinBuying_Symmetry

open scoped BigOperators
Formal statement
namespace MinBuying

/-- Exact mass of sorted exchangeable valuations, including ties. The orbit
size is n! divided by the product of the repeated-value multiplicity factorials. -/
theorem sorted_pmf_mass (n : ℕ) (w : PMF (Valuations n))
    (hex : Exchangeable w.toMeasure) :
    ∀ v : Valuations n,
      (Monotone v →
        ((w.map (fun z => z ∘ Tuple.sort z)) v).toReal =
          ((n.factorial : ℝ) /
            (∏ x ∈ Finset.univ.image v,
              (((Finset.univ.filter (fun i : Fin n => v i = x)).card).factorial : ℝ))) *
            (w v).toReal) ∧
      (¬ Monotone v → (w.map (fun z => z ∘ Tuple.sort z)) v = 0) := 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 finite-law lemma for the affiliation argument in Theorem 2. The proof reuses Mathlib permutation orbit-stabilizer and DomMulAct.stabilizer_card'.

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