AFTD Auto-Formalizing Theoretical Domains

team_rot_list2

lemmaverified

The 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.

Statement

lemma team_rot_list2 (m : ℕ) :
    List.ofFn (fun i : Fin (2 * m + 3) => team_P2 m i (finRotate (2 * m + 3) i))
      = (3 / 4 - 3 / 2 * team_tau m) :: (3 / 4 - 3 / 2 * team_tau m)
          :: team_T2 (1 - 2 * team_tau m) 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 7
  • team_tauSlack parameter τ_m = 1/(100(m+1)).
  • 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_T2The list 0, b, 0, b, …, b, 0 (m copies of b).
  • team_T2_lengthThe list 0,b,0,b,...,0 with m copies of b has length 2m+1.
  • team_T2_getThe k-th entry of the list 0,b,...,0 is 0 at even k and b at odd k.
  • team_w2Edge probabilities of the rotation in the strengthened instance.
  • team_P2_rotIn the strengthened instance the rotation line-up i -> i+1 uses the cycle edge probabilities team_w2.
Used by 1
  • team_rot_winProb2The rotation line-up of the strengthened instance wins with probability at least 1/2 + 1/40.

Lean source view module on GitHub

lemma team_rot_list2 (m : ℕ) :    List.ofFn (fun i : Fin (2 * m + 3) => team_P2 m i (finRotate (2 * m + 3) i))      = (3 / 4 - 3 / 2 * team_tau m) :: (3 / 4 - 3 / 2 * team_tau m)          :: team_T2 (1 - 2 * team_tau m) m := by  have hP : (fun i : Fin (2 * m + 3) => team_P2 m i (finRotate (2 * m + 3) i))      = fun i => team_w2 i := by    funext i    exact team_P2_rot m i  rw [hP]  apply List.ext_getElem  · simp [team_T2_length]  · intro k h1 h2    rw [List.getElem_ofFn]    unfold team_w2    match k, h1, h2 with    | 0, _, _ => simp    | 1, _, _ => simp    | k + 2, h1, h2 =>      simp only [List.getElem_cons_succ]      rw [team_T2_get _ m k (by simp [team_T2_length] at h2 ⊢; omega)]      simp only [show ¬ (k + 2 ≤ 1) by omega, if_false]      simp
See it in the graphDiscuss this resultChallenge it