Rejection conditioning preserves validity and exchangeability of the remaining valuations
ProvedMinBuying.rejection_valid_exchangeablemin-buyingmtp2operations-researchpricingprobability
For any nonnegative exchangeable probability law on item valuations, conditioning on the positive-probability event and then retaining coordinates produces a nonnegative exchangeable probability law. This result does not require affiliation.
Preamble
import Definitions.Def_MinBuying_Symmetry open MeasureTheory open scoped BigOperators ENNReal
Formal statement
namespace MinBuying
theorem rejection_valid_exchangeable (n : ℕ) (μ : JointLaw (n+1)) (hμ : ValidLaw μ)
(hex : Exchangeable μ) (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 ν := 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 . Proof of Theorem 2, ec3: conditioning on rejection of the first item and retaining the remaining coordinates.