AFTD Auto-Formalizing Theoretical Domains

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
  • 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_TThe list 0, 1, 0, 1, …, 1, 0 (m ones, m+1 zeros).
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

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
See it in the graphDiscuss this resultChallenge it