AFTD Auto-Formalizing Theoretical Domains

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
  • team_wEdge probabilities on the cycle i → i+1 (mod n): 3/4, 3/4, 0, 1, 0, 1, …, 1, 0.
  • team_PThe instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.
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

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
See it in the graphDiscuss this resultChallenge it