AFTD Auto-Formalizing Theoretical Domains

team_T2

def

The list 0, b, 0, b, …, b, 0 (m copies of b).

Statement

def team_T2 (b : ℝ) : ℕ → List ℝ
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
none listed
Used by 6
  • team_T2_memIf b is in [0,1], every entry of the list 0,b,...,0 is in [0,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.
  • team_T2_getThe k-th entry of the list 0,b,...,0 is 0 at even k and b at odd k.
  • team_T2_tailFor the list 0,b,...,0 with m copies of b, the probability of at least m successes is at least b^m.
  • team_T2_lengthThe list 0,b,0,b,...,0 with m copies of b has length 2m+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

/-- The list `0, b, 0, b, …, b, 0` (`m` copies of `b`). -/
def team_T2 (b : ℝ) : ℕ → List ℝ := fun
  | 0 => [0]
  | m + 1 => 0 :: b :: team_T2 b m
See it in the graphDiscuss this resultChallenge it