team_wins
def
Number of successes in an outcome vector.
Statement
open Finset in def team_wins {n : ℕ} (ω : Fin n → Bool) : ℕ
- 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
- none listed
- Used by 2
- team_tail_eq_sumteam_tail equals the explicit sum over outcome vectors Σ_ω [t ≤ #wins(ω)] Π_i (q_i if ω_i else 1 - q_i).
- team_wins_consThe number of wins of an outcome vector with a prepended result b is [b] plus the number of wins of the rest.
Lean source view module on GitHub
open Finset in /-- Number of successes in an outcome vector. -/ def team_wins {n : ℕ} (ω : Fin n → Bool) : ℕ := ∑ i, if ω i = true then 1 else 0