team_dual
lemmaverified
Dual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
Statement
lemma team_dual (m : ℕ) (i j : Fin (2 * m + 3)) :
team_P m i j ≤ (1 / 2 - team_v i) + team_v j- 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 5
- team_wEdge probabilities on the cycle i → i+1 (mod n): 3/4, 3/4, 0, 1, 0, 1, …, 1, 0.
- team_nextThe cycle successor relation on positions.
- 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_v_boundsThe column potentials of the first dual certificate lie in [0,1/2].
- Used by 1
- team_weight_leEvery perfect matching has weight at most n/2.
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.
/-- Dual feasibility: `p(i,j) ≤ (1/2 - v_i) + v_j`. -/lemma team_dual (m : ℕ) (i j : Fin (2 * m + 3)) : team_P m i j ≤ (1 / 2 - team_v i) + team_v j := by have hi := i.isLt have hj := j.isLt unfold team_P by_cases hji : j = i · subst hji; simp · rw [if_neg hji] by_cases hn : team_next i j · rw [if_pos hn] unfold team_next at hn unfold team_w team_v rcases hn with h | ⟨h1, h2⟩ · split_ifs <;> (try norm_num) <;> omega · split_ifs <;> (try norm_num) <;> omega · rw [if_neg hn] have := team_v_bounds i have := team_v_bounds j linarith