team_T
def
The list 0, 1, 0, 1, …, 1, 0 (m ones, m+1 zeros).
Statement
def team_T : ℕ → List ℝ- 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 5
- team_rot_listThe rotation line-up has edge probabilities team_w.
- team_T_tailIn the alternating list 0,1,...,0 with m ones, at least m successes happen surely and more than m never.
- team_T_getThe k-th entry of the alternating list is 0 at even k and 1 at odd k.
- team_T_lengthThe alternating list 0,1,0,1,...,0 used in the first counterexample has length 2m+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
/-- The list `0, 1, 0, 1, …, 1, 0` (`m` ones, `m+1` zeros). -/ def team_T : ℕ → List ℝ := fun | 0 => [0] | m + 1 => 0 :: 1 :: team_T m