AFTD Auto-Formalizing Theoretical Domains

team_rot_list

lemmaverified

The rotation line-up has edge probabilities team_w.

Statement

lemma team_rot_list (m : ℕ) :
    List.ofFn (fun i : Fin (2 * m + 3) => team_P m i (finRotate (2 * m + 3) i))
      = (3 / 4 : ℝ) :: (3 / 4 : ℝ) :: team_T m
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_TThe list 0, 1, 0, 1, …, 1, 0 (m ones, m+1 zeros).
  • team_T_lengthThe alternating list 0,1,0,1,...,0 used in the first counterexample has length 2m+1.
  • team_T_getThe k-th entry of the alternating list is 0 at even k and 1 at odd k.
  • team_wEdge probabilities on the cycle i → i+1 (mod n): 3/4, 3/4, 0, 1, 0, 1, …, 1, 0.
  • team_PThe instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.
  • team_rot_nextThe rotation i ↦ i + 1 (mod n) follows the cycle edges.
Used by 1

Lean source view module on GitHub

/-- The rotation line-up has edge probabilities `team_w`. -/lemma team_rot_list (m : ℕ) :    List.ofFn (fun i : Fin (2 * m + 3) => team_P m i (finRotate (2 * m + 3) i))      = (3 / 4 : ℝ) :: (3 / 4 : ℝ) :: team_T m := by  have hP : (fun i : Fin (2 * m + 3) => team_P m i (finRotate (2 * m + 3) i))      = fun i => team_w i := by    funext i    obtain ⟨hn, hne⟩ := team_rot_next m i    simp only [team_P, if_neg hne, if_pos hn]  rw [hP]  apply List.ext_getElem  · simp [team_T_length]  · intro k h1 h2    rw [List.getElem_ofFn]    unfold team_w    match k, h1, h2 with    | 0, _, _ => simp    | 1, _, _ => simp    | k + 2, h1, h2 =>      simp only [List.getElem_cons_succ]      rw [team_T_get m k (by simp [team_T_length] at h2 ⊢; omega)]      simp only [show ¬ (k + 2 ≤ 1) by omega, if_false]      simp
See it in the graphDiscuss this resultChallenge it