team_tail_nonneg
lemmaverified
Upper-tail probabilities of independent events with probabilities in [0,1] are nonnegative.
Statement
lemma team_tail_nonneg (L : List ℝ) (hL : ∀ x ∈ L, 0 ≤ x ∧ x ≤ 1) (t : ℕ) :
0 ≤ team_tail L t- 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 2
- team_T2_tailFor the list 0,b,...,0 with m copies of b, the probability of at least m successes is at least b^m.
- 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
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_nonneg (L : List ℝ) (hL : ∀ x ∈ L, 0 ≤ x ∧ x ≤ 1) (t : ℕ) : 0 ≤ team_tail L t := by induction L generalizing t with | nil => simp [team_tail]; split_ifs <;> norm_num | cons p ps ih => have hp := hL p (by simp) have ih' : ∀ s, 0 ≤ team_tail ps s := fun s => ih (fun x hx => hL x (by simp [hx])) s simp only [team_tail] have := ih' (t - 1) have := ih' t nlinarith