team_half_odd
lemmaverified
An odd number 2m+3 of fair coins: at least m+2 heads with probability 1/2.
Statement
lemma team_half_odd (m : ℕ) :
team_tail (List.replicate (2 * m + 3) (1 / 2 : ℝ)) (m + 2) = 1 / 2- Source
- step towards team_thm4_part2_false / team_thm4_part2_exists_false (The Team Order Problem: Maximizing the Probability of Matching Being Large Enough, SAGT 2024 (arXiv:2605.21234), Section 6, Theorem 4(2))
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- team_tailPoisson-binomial upper tail: team_tail [q₁, …, qₙ] t is the probability that at least t of n independent events with success probabilities…
- team_half_symmSymmetry of the fair binomial: S_k(t) + S_k(k+1-t) = 1.
- Used by 2
- team_id_winProb2In the strengthened instance the identity line-up (all edges 1/2) wins with probability exactly 1/2.
- team_id_winProbThe identity line-up wins with probability exactly 1/2.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- An odd number `2m+3` of fair coins: at least `m+2` heads with probability `1/2`. -/lemma team_half_odd (m : ℕ) : team_tail (List.replicate (2 * m + 3) (1 / 2 : ℝ)) (m + 2) = 1 / 2 := by have h := team_half_symm (2 * m + 3) (m + 2) (by omega) rw [show 2 * m + 3 + 1 - (m + 2) = m + 2 by omega] at h linarith