AFTD Auto-Formalizing Theoretical Domains

team_P2_bounds

lemmaverified

All entries of the strengthened Team Order instance are probabilities in [0,1].

Statement

lemma team_P2_bounds (m : ℕ) (i j : Fin (2 * m + 3)) :
    0 ≤ team_P2 m i j ∧ team_P2 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 3
  • team_tau_posThe slack tau = 1/(100(m+1)) is positive.
  • team_v2_boundsThe scaled column potentials lie in [0, (1-2 tau)/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 1
  • 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…

Lean source view module on GitHub

lemma team_P2_bounds (m : ℕ) (i j : Fin (2 * m + 3)) :    0 ≤ team_P2 m i j ∧ team_P2 m i j ≤ 1 := by  have hi := team_v2_bounds i  have hj := team_v2_bounds j  have ht := team_tau_pos m  unfold team_P2  split_ifs <;> constructor <;> linarith
See it in the graphDiscuss this resultChallenge it