AFTD Auto-Formalizing Theoretical Domains

team_O_tail

lemmaverified

With 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.

Statement

lemma team_O_tail (m : ℕ) :
    team_tail ((3 / 4 : ℝ) :: (3 / 4 : ℝ) :: team_T m) (m + 2) = 9 / 16
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 3
  • 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).
  • team_T_tailIn the alternating list 0,1,...,0 with m ones, at least m successes happen surely and more than m never.
Used by 1

Lean source view module on GitHub

/-- With `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`. -/lemma team_O_tail (m : ℕ) :    team_tail ((3 / 4 : ℝ) :: (3 / 4 : ℝ) :: team_T m) (m + 2) = 9 / 16 := by  simp only [team_tail]  rw [show m + 2 - 1 - 1 = 0 + m by omega, show m + 2 - 1 = 1 + m by omega,    show m + 2 = 2 + m by omega]  rw [team_T_tail, team_T_tail, team_T_tail]  norm_num
See it in the graphDiscuss this resultChallenge it