Subset probability bound for the exchangeable construction
ProvedMinBuying.exchangeable_subset_boundmin-buyingoperations-researchpricingprobability
For positive integer and integer , let . Then . The left side is the probability that a uniformly chosen -element subset of has maximum element .
Preamble
import Mathlib
Formal statement
namespace MinBuying
theorem exchangeable_subset_bound (n i : ℕ) (hn : 0 < n) (hi : i < n) :
let k := max 1 (n / (2*(n-i)))
1 / (4*((n-i : ℕ) : ℝ)) ≤ (i.choose (k-1) : ℝ) / (n.choose k : ℝ) := 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 3, ec6–ec7, Eq.(EC.9) and the following lower bound, translated to zero-based indices.