Affiliation and exchangeability after rejection conditioning
OpenMinBuying.affiliated_rejection_conditioningaffiliationmin-buyingpricingprobability
Let have an exchangeable affiliated probability law supported on nonnegative valuations. Affiliation is the paper's density-or-PMF MTP2 condition. For a real threshold , suppose . Then the conditional law of the remaining vector
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.