AFTD Auto-Formalizing Theoretical Domains

team_T2_tail

lemmaverified

For the list 0,b,...,0 with m copies of b, the probability of at least m successes is at least b^m.

Statement

lemma team_T2_tail (b : ℝ) (hb : 0 ≤ b ∧ b ≤ 1) (m : ℕ) : b ^ m ≤ team_tail (team_T2 b m) m
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 4
  • 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_T2The list 0, b, 0, b, …, b, 0 (m copies of b).
  • team_tail_nonnegUpper-tail probabilities of independent events with probabilities in [0,1] are nonnegative.
  • team_T2_memIf b is in [0,1], every entry of the list 0,b,...,0 is in [0,1].
Used by 1
  • team_rot_winProb2The rotation line-up of the strengthened instance wins with probability at least 1/2 + 1/40.

Lean source view module on GitHub

lemma team_T2_tail (b : ℝ) (hb : 0 ≤ b ∧ b ≤ 1) (m : ℕ) : b ^ m ≤ team_tail (team_T2 b m) m := by  induction m with  | zero => simp [team_T2, team_tail]  | succ m ih =>    simp only [team_T2, team_tail]    rw [show m + 1 - 1 = m by omega]    have h1 := team_tail_nonneg (team_T2 b m) (team_T2_mem b hb m) (m + 1)    have h2 := team_tail_nonneg (team_T2 b m) (team_T2_mem b hb m) m    have hbm : 0 ≤ b ^ m := pow_nonneg hb.1 m    rw [pow_succ]    nlinarith
See it in the graphDiscuss this resultChallenge it