AFTD Auto-Formalizing Theoretical Domains

team_rot_winProb

lemmaverified

The rotation line-up wins with probability 9/16.

Statement

lemma team_rot_winProb (m : ℕ) :
    team_winProb (team_P m) (finRotate (2 * m + 3)) = 9 / 16
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 4
  • 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_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.
  • team_PThe instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.
  • team_rot_listThe rotation line-up has edge probabilities team_w.
Used by 2
  • team_gapQuantitative form: on the instance of size 2m+3, the optimal line-up beats the all-1/2 maximum-weight matching by at least 1/16, while the…
  • 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

/-- The rotation line-up wins with probability `9/16`. -/lemma team_rot_winProb (m : ℕ) :    team_winProb (team_P m) (finRotate (2 * m + 3)) = 9 / 16 := by  unfold team_winProb  rw [team_rot_list, show (2 * m + 3) / 2 + 1 = m + 2 by omega]  exact team_O_tail m
See it in the graphDiscuss this resultChallenge it