Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Subset probability bound for the exchangeable construction

Proved
MinBuying.exchangeable_subset_bound

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

min-buyingoperations-researchpricingprobability

For positive integer nnn and integer 0≤i<n0\le i<n0≤i<n, let k=max⁡{1,⌊n/[2(n−i)]⌋}k=\max\{1,\lfloor n/[2(n-i)]\rfloor\}k=max{1,⌊n/[2(n−i)]⌋}. Then (ik−1)/(nk)≥1/[4(n−i)]\binom{i}{k-1}/\binom{n}{k}\ge 1/[4(n-i)](k−1i​)/(kn​)≥1/[4(n−i)]. The left side is the probability that a uniformly chosen kkk-element subset of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1} has maximum element iii.

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.

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