team2_unique_maxWeight
theoremverified
The identity is the unique maximum-weight matching of the strengthened instance.
Statement
theorem team2_unique_maxWeight (m : ℕ) (M : Equiv.Perm (Fin (2 * m + 3))) :
team_isMaxWeight (team_P2 m) M ↔ M = 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 4
- team_isMaxWeightπ is a maximum-weight perfect matching.
- 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.
- team_weight2_idIn the strengthened instance the identity line-up has weight n/2.
- team_weight2_ltEvery line-up other than the identity has weight strictly below n/2.
- Used by 2
- 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_gap_uniqueQuantitative form of the strengthened counterexample: for every m, the identity is the unique maximum-weight matching, its edges are all…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The identity is the unique maximum-weight matching of the strengthened instance. -/theorem team2_unique_maxWeight (m : ℕ) (M : Equiv.Perm (Fin (2 * m + 3))) : team_isMaxWeight (team_P2 m) M ↔ M = 1 := by constructor · intro hM by_contra hne have h1 := hM 1 rw [team_weight2_id] at h1 have h2 := team_weight2_lt m M hne linarith · rintro rfl σ rw [team_weight2_id] by_cases hσ : σ = 1 · rw [hσ, team_weight2_id] · exact (team_weight2_lt m σ hσ).le