AFTD Auto-Formalizing Theoretical Domains

team_weight_id

lemmaverified

The identity line-up has weight n/2.

Statement

lemma team_weight_id (m : ℕ) :
    team_weight (team_P m) (1 : Equiv.Perm (Fin (2 * m + 3))) = ((2 * m + 3 : ℕ) : ℝ) / 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 2
  • team_weightA line-up of team 1 against the fixed line-up of team 2 is a perfect matching, i.e. a permutation π of the n positions (player i of team 1…
  • team_PThe instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.
Used by 3
  • 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_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 identity line-up has weight `n/2`. -/lemma team_weight_id (m : ℕ) :    team_weight (team_P m) (1 : Equiv.Perm (Fin (2 * m + 3))) = ((2 * m + 3 : ℕ) : ℝ) / 2 := by  unfold team_weight team_P  simp  ring
See it in the graphDiscuss this resultChallenge it