AFTD Auto-Formalizing Theoretical Domains

team_weight2_id

lemmaverified

In the strengthened instance the identity line-up has weight n/2.

Statement

lemma team_weight2_id (m : ℕ) :
    team_weight (team_P2 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_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 2
  • team2_unique_maxWeightThe identity is the unique maximum-weight matching of the strengthened instance.
  • 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_weight2_id (m : ℕ) :    team_weight (team_P2 m) (1 : Equiv.Perm (Fin (2 * m + 3))) = ((2 * m + 3 : ℕ) : ℝ) / 2 := by  unfold team_weight team_P2  simp  ring
See it in the graphDiscuss this resultChallenge it