Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof sketch of Theorem 2.1, PDF p. 2 — |Y ∩ T| has the distribution B(k, 1/2)

Proved
MultiChoiceSecretary.Alg.card_inter_top_binomial

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

binomialp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-ordersecretary-problem

Let SSS be a finite set of nnn real numbers, 1≤k≤n1 \le k \le n1≤k≤n, and let TTT be the kkk largest elements of SSS. Let YYY be the set of the first mmm arrivals of a uniformly random order of SSS, with m∼B(n,1/2)m \sim B(n,1/2)m∼B(n,1/2) independent. Then ∣Y∩T∣|Y \cap T|∣Y∩T∣ has the binomial distribution B(k,1/2)B(k, 1/2)B(k,1/2): for every r≥0r \ge 0r≥0,

Pr⁡(∣Y∩T∣=r)=(kr)2−k.\Pr(|Y \cap T| = r) = \binom{k}{r}2^{-k}.Pr(∣Y∩T∣=r)=(rk​)2−k.

This is the "first consequence" of YYY being a uniform random subset in the proof sketch of Theorem 2.1.

Formalization Note. The hypothesis k≤nk \le nk≤n is added: the page leaves it implicit. For n<kn < kn<k the set TTT has nnn elements and ∣Y∩T∣∼B(n,1/2)|Y \cap T| \sim B(n,1/2)∣Y∩T∣∼B(n,1/2), not B(k,1/2)B(k,1/2)B(k,1/2).

Preamble
import Mathlib
import Definitions.Def_MultiChoiceSecretary_Alg_Setting
Formal statement
namespace MultiChoiceSecretary.Alg

theorem card_inter_top_binomial (S : Finset ℝ) (k : ℕ) (hk : 1 ≤ k) (hkn : k ≤ S.card) :
    ∀ r : ℕ, splitAvg S (fun Y => if (Y ∩ topK S k).card = r then 1 else 0) =
      (k.choose r : ℝ) / 2 ^ k := by sorry

end MultiChoiceSecretary.Alg
Source
Kleinberg, A multiple-choice secretary algorithm with applications to online auctions, SODA 2005, PDF p. 2, proof sketch of Theorem 2.1, "First, the random variable |Y ∩ T| has the distribution B(k, 1/2)."
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

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