team_weight_le
lemmaverified
Every perfect matching has weight at most n/2.
Statement
open Finset in lemma team_weight_le (m : ℕ) (σ : Equiv.Perm (Fin (2 * m + 3))) : team_weight (team_P m) σ ≤ ((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 4
- 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.
- team_vColumn potentials of a dual certificate for the maximum-weight matching.
- team_dualDual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
- Used by 1
- team_id_maxWeightThe identity line-up (all edges 1/2) is a maximum-weight matching.
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.
open Finset in/-- Every perfect matching has weight at most `n/2`. -/lemma team_weight_le (m : ℕ) (σ : Equiv.Perm (Fin (2 * m + 3))) : team_weight (team_P m) σ ≤ ((2 * m + 3 : ℕ) : ℝ) / 2 := by unfold team_weight calc ∑ i, team_P m i (σ i) ≤ ∑ i, ((1 / 2 - team_v i) + team_v (σ i)) := Finset.sum_le_sum (fun i _ => team_dual m i (σ i)) _ = ∑ i : Fin (2 * m + 3), (1 / 2 : ℝ) - ∑ i, team_v i + ∑ i, team_v (σ i) := by rw [Finset.sum_add_distrib, Finset.sum_sub_distrib] _ = ((2 * m + 3 : ℕ) : ℝ) / 2 := by rw [Equiv.sum_comp σ team_v] simp ring