Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Affiliation and exchangeability after rejection conditioning

Open
MinBuying.affiliated_rejection_conditioning

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

affiliationmin-buyingpricingprobability

Let (V0,V1,…,Vn)(V_0,V_1,\ldots,V_n)(V0​,V1​,…,Vn​) have an exchangeable affiliated probability law supported on nonnegative valuations. Affiliation is the paper's density-or-PMF MTP2 condition. For a real threshold aaa, suppose Pr⁡(V0<a)>0\Pr(V_0<a)>0Pr(V0​<a)>0. Then the conditional law of the remaining vector

(V1,…,Vn)∣{V0<a}(V_1,\ldots,V_n)\mid\{V_0<a\}(V1​,…,Vn​)∣{V0​<a}

is again a nonnegative probability law, exchangeable, and affiliated. This is the closure step that lets the induction for optimal uniform pricing continue after the cheapest item has been rejected.

Preamble
import Definitions.Def_MinBuying_Symmetry

open MeasureTheory
Formal statement
namespace MinBuying

/-- Closure step in the proof of Theorem 2, ec3: condition on rejection of the
first item and retain the remaining coordinates. -/
theorem affiliated_rejection_conditioning (n : ℕ) (μ : JointLaw (n+1))
    (hμ : ValidLaw μ) (hex : Exchangeable μ) (haff : Affiliated μ)
    (a : ℝ) (hB : 0 < μ {v : Valuations (n+1) | v 0 < a}) :
    let ν : JointLaw n := Measure.map (fun v : Valuations (n+1) => fun i : Fin n => v i.succ)
      (ProbabilityTheory.cond μ {v : Valuations (n+1) | v 0 < a})
    ValidLaw ν ∧ Exchangeable ν ∧ Affiliated ν := by
  sorry

end MinBuying
Source
Cui, Hamilton, Lamperski, and Ganjizadeh Tari, Unit-Demand Pricing for Min-Buying Customers, September 27, 2026 manuscript, https://doi.org/10.2139/ssrn.5178133, electronic companion ec3, proof of Theorem 2, closure under conditioning on an interval and marginalization; Definition 1 for affiliation.

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