AFTD Auto-Formalizing Theoretical Domains

team_rot_val

lemmaverified

The rotation i ↦ i + 1 (mod n) in coordinates.

Statement

lemma team_rot_val (m : ℕ) (i : Fin (2 * m + 3)) :
    (finRotate (2 * m + 3) i).val = if i.val = 2 * m + 2 then 0 else i.val + 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
Used by 2
  • team_rot_nextThe rotation i ↦ i + 1 (mod n) follows the cycle edges.
  • 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

/-- The rotation `i ↦ i + 1 (mod n)` in coordinates. -/lemma team_rot_val (m : ℕ) (i : Fin (2 * m + 3)) :    (finRotate (2 * m + 3) i).val = if i.val = 2 * m + 2 then 0 else i.val + 1 := by  have hc := coe_finRotate (n := 2 * m + 2) i  by_cases hl : i = Fin.last (2 * m + 2)  · rw [if_pos hl] at hc    rw [hc]    subst hl    simp  · rw [if_neg hl] at hc    rw [hc]    have : i.val ≠ 2 * m + 2 := fun h => hl (Fin.ext (by simp [h]))    simp [this]
See it in the graphDiscuss this resultChallenge it