team_id_winProb2
lemmaverified
In the strengthened instance the identity line-up (all edges 1/2) wins with probability exactly 1/2.
Statement
lemma team_id_winProb2 (m : ℕ) : team_winProb (team_P2 m) 1 = 1 / 2- 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 3
- team_winProbWinning probability of a line-up in the Team Order problem of arXiv:2605.21234: team 1 wins if it wins at least ⌊n/2⌋ + 1 of the n…
- team_half_oddAn odd number 2m+3 of fair coins: at least m+2 heads with probability 1/2.
- team_P2The strengthened instance: p(i,i) = 1/2, p(i, i+1 mod n) = 1/2 - v'_i + v'_{i+1} - τ, all other entries 0.
- Used by 2
- team_thm4_part2_exists_falseEven the existential reading of Theorem 4 (2) of arXiv:2605.21234 is false, for every function ε in place of o(1): on the (2m+3)-player…
- team_gap_uniqueQuantitative form of the strengthened counterexample: for every m, the identity is the unique maximum-weight matching, its edges are all…
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_id_winProb2 (m : ℕ) : team_winProb (team_P2 m) 1 = 1 / 2 := by unfold team_winProb have hP : (fun i : Fin (2 * m + 3) => team_P2 m i ((1 : Equiv.Perm (Fin (2 * m + 3))) i)) = fun _ => (1 / 2 : ℝ) := by funext i; simp [team_P2] rw [hP, List.ofFn_const, show (2 * m + 3) / 2 + 1 = m + 2 by omega] exact team_half_odd m