AFTD Auto-Formalizing Theoretical Domains

team_T_get

lemmaverified

The k-th entry of the alternating list is 0 at even k and 1 at odd k.

Statement

lemma team_T_get (m : ℕ) (k : ℕ) (hk : k < (team_T m).length) :
    (team_T m)[k] = if k % 2 = 0 then 0 else 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
Built on 1
  • team_TThe list 0, 1, 0, 1, …, 1, 0 (m ones, m+1 zeros).
Used by 1

Lean source view module on GitHub

lemma team_T_get (m : ℕ) (k : ℕ) (hk : k < (team_T m).length) :    (team_T m)[k] = if k % 2 = 0 then 0 else 1 := by  induction m generalizing k with  | zero =>    simp [team_T] at hk    subst hk; simp [team_T]  | succ m ih =>    match k, hk with    | 0, _ => simp [team_T]    | 1, _ => simp [team_T]    | k + 2, hk =>      simp only [team_T, List.getElem_cons_succ]      rw [ih k (by simp [team_T] at hk; omega)]      simp
See it in the graphDiscuss this resultChallenge it