team_P2_rot
lemmaverified
In the strengthened instance the rotation line-up i -> i+1 uses the cycle edge probabilities team_w2.
Statement
lemma team_P2_rot (m : ℕ) (i : Fin (2 * m + 3)) :
team_P2 m i (finRotate (2 * m + 3) i) = team_w2 i- 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 6
- team_vColumn potentials of a dual certificate for the maximum-weight matching.
- team_rot_valThe rotation i ↦ i + 1 (mod n) in coordinates.
- team_rot_nextThe rotation i ↦ i + 1 (mod n) follows the cycle edges.
- team_v2Scaled column potentials v'_j = (1 - 2τ) v_j (range 1/2 - τ).
- 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_w2Edge probabilities of the rotation in the strengthened instance.
- Used by 1
- team_rot_list2The edge probabilities of the rotation in the strengthened instance are 3/4 - 3tau/2, 3/4 - 3tau/2, followed by 0, 1-2tau, 0, ..., 0.
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.
lemma team_P2_rot (m : ℕ) (i : Fin (2 * m + 3)) : team_P2 m i (finRotate (2 * m + 3) i) = team_w2 i := by obtain ⟨hn, hne⟩ := team_rot_next m i have hc := team_rot_val m i have hi := i.isLt simp only [team_P2, if_neg hne, if_pos hn] unfold team_v2 team_v team_w2 generalize finRotate (2 * m + 3) i = j at hc split_ifs at hc ⊢ <;> first | ring1 | (exfalso; omega)