team_T_length
lemmaverified
The alternating list 0,1,0,1,...,0 used in the first counterexample has length 2m+1.
Statement
lemma team_T_length (m : ℕ) : (team_T m).length = 2 * m + 1- 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_TThe list 0, 1, 0, 1, …, 1, 0 (m ones, m+1 zeros).
- Used by 1
- team_rot_listThe rotation line-up has edge probabilities team_w.
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_T_length (m : ℕ) : (team_T m).length = 2 * m + 1 := by induction m with | zero => rfl | succ m ih => simp [team_T, ih]; ring