team_T_tail
lemmaverified
In the alternating list 0,1,...,0 with m ones, at least m successes happen surely and more than m never.
Statement
lemma team_T_tail (m t : ℕ) : team_tail (team_T m) (t + m) = if t = 0 then 1 else 0
- 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
- Used by 1
- team_O_tailWith m sure wins, m+1 sure losses and two matches won with probability 3/4, winning at least m+2 matches has probability 9/16.
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_T_tail (m t : ℕ) : team_tail (team_T m) (t + m) = if t = 0 then 1 else 0 := by induction m generalizing t with | zero => simp [team_T, team_tail] | succ m ih => simp only [team_T, team_tail] rw [show t + (m + 1) - 1 = t + m by omega, ih] ring