AFTD Auto-Formalizing Theoretical Domains

team_T2_length

lemmaverified

The list 0,b,0,b,...,0 with m copies of b has length 2m+1.

Statement

lemma team_T2_length (b : ℝ) (m : ℕ) : (team_T2 b m).length = 2 * m + 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_T2The list 0, b, 0, b, …, b, 0 (m copies of b).
Used by 1
  • team_rot_list2The 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.

Lean source view module on GitHub

lemma team_T2_length (b : ℝ) (m : ℕ) : (team_T2 b m).length = 2 * m + 1 := by  induction m with  | zero => rfl  | succ m ih => simp [team_T2, ih]; ring
See it in the graphDiscuss this resultChallenge it