AFTD Auto-Formalizing Theoretical Domains

team_weight

def

A 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 meets player π i of team 2). Its weight is the expected number of wins Σ_i p(i, π i) (arXiv:2605.21234, Section 6).

Statement

open Finset in
noncomputable def team_weight {n : ℕ} (P : Fin n → Fin n → ℝ) (π : Equiv.Perm (Fin n)) : ℝ
Defined in
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough, SAGT 2024 (arXiv:2605.21234), Section 6, Theorem 4(2); formalized by the operator (Claude), 2026-10-05
Verified
05 Oct 2026
Axioms
none listed
Used by 10
  • team_thm4_part2Theorem 4 (2) of arXiv:2605.21234, with the o(1) term made explicit as a function ε: for all large n, every instance, every maximum-weight…
  • team_weight2_idIn the strengthened instance the identity line-up has weight n/2.
  • 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_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…
  • team_isMaxWeightπ is a maximum-weight perfect 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…
  • team_weight_leEvery perfect matching has weight at most n/2.
  • team_weight_idThe identity line-up has weight n/2.
  • team_weight2_ltEvery line-up other than the identity has weight strictly below n/2.
  • team_thm4_part2_existsTheorem 4 (2) of arXiv:2605.21234 under its most generous (existential) reading: some maximum-weight matching M* satisfies the bound.

Lean source view module on GitHub

open Finset in
/-- A 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 meets player `π i` of team 2). Its weight is the expected number of wins `Σ_i p(i, π i)` (arXiv:2605.21234, Section 6). -/
noncomputable def team_weight {n : ℕ} (P : Fin n → Fin n → ℝ) (π : Equiv.Perm (Fin n)) : ℝ :=
  ∑ i, P i (π i)
See it in the graphDiscuss this resultChallenge it