team_rot_next
lemmaverified
The rotation i ↦ i + 1 (mod n) follows the cycle edges.
Statement
lemma team_rot_next (m : ℕ) (i : Fin (2 * m + 3)) :
team_next i (finRotate (2 * m + 3) i) ∧ finRotate (2 * m + 3) i ≠ 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 2
- team_nextThe cycle successor relation on positions.
- team_rot_valThe rotation i ↦ i + 1 (mod n) in coordinates.
- Used by 2
- team_rot_listThe rotation line-up has edge probabilities team_w.
- team_P2_rotIn the strengthened instance the rotation line-up i -> i+1 uses the cycle edge probabilities team_w2.
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 rotation `i ↦ i + 1 (mod n)` follows the cycle edges. -/lemma team_rot_next (m : ℕ) (i : Fin (2 * m + 3)) : team_next i (finRotate (2 * m + 3) i) ∧ finRotate (2 * m + 3) i ≠ i := by have hc := team_rot_val m i have hi := i.isLt constructor · unfold team_next split_ifs at hc with h · right; exact ⟨h, hc⟩ · left; exact hc · intro h have h' := congrArg Fin.val h split_ifs at hc <;> omega