team_tail_zero
lemmaverified
The probability of at least 0 successes is 1.
Statement
lemma team_tail_zero (L : List ℝ) : team_tail L 0 = 1- 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 1
- team_tailPoisson-binomial upper tail: team_tail [q₁, …, qₙ] t is the probability that at least t of n independent events with success probabilities…
- Used by 1
- team_half_symmSymmetry of the fair binomial: S_k(t) + S_k(k+1-t) = 1.
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.
lemma team_tail_zero (L : List ℝ) : team_tail L 0 = 1 := by induction L with | nil => simp [team_tail] | cons p ps ih => simp [team_tail, ih]