AFTD Auto-Formalizing Theoretical Domains

team_P

def

The instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.

Statement

noncomputable def team_P (m : ℕ) (i j : Fin (2 * m + 3)) : ℝ
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
none listed
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_nextThe cycle successor relation on positions.
Used by 10
  • team_rot_listThe rotation line-up has edge probabilities team_w.
  • team_dualDual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
  • 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_id_maxWeightThe identity line-up (all edges 1/2) is a maximum-weight matching.
  • team_id_winProbThe identity line-up wins with probability exactly 1/2.
  • 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…
  • team_P_boundsAll entries of the first Team Order instance are probabilities in [0,1].
  • team_weight_leEvery perfect matching has weight at most n/2.
  • team_rot_winProbThe rotation line-up wins with probability 9/16.
  • team_weight_idThe identity line-up has weight n/2.

Lean source view module on GitHub

/-- The instance: `p(i,i) = 1/2`, `p(i, i+1 mod n) = team_w i`, all other entries `0`. -/
noncomputable def team_P (m : ℕ) (i j : Fin (2 * m + 3)) : ℝ :=
  if j = i then 1 / 2 else if team_next i j then team_w i else 0
See it in the graphDiscuss this resultChallenge it