team_P_bounds
lemmaverified
All entries of the first Team Order instance are probabilities in [0,1].
Statement
lemma team_P_bounds (m : ℕ) (i j : Fin (2 * m + 3)) : 0 ≤ team_P m i j ∧ team_P m i j ≤ 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 2
- Used by 1
- team_thm4_part2_falseTheorem 4 (2) of arXiv:2605.21234 is false, whatever function is used for its o(1) term: for every m, on the (2m+3)-player instance the…
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_P_bounds (m : ℕ) (i j : Fin (2 * m + 3)) : 0 ≤ team_P m i j ∧ team_P m i j ≤ 1 := by unfold team_P team_w split_ifs <;> norm_num