team_w
def
Edge probabilities on the cycle i → i+1 (mod n): 3/4, 3/4, 0, 1, 0, 1, …, 1, 0.
Statement
noncomputable def team_w {m : ℕ} (i : Fin (2 * m + 3)) : ℝ
- 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 4
- team_rot_listThe rotation line-up has edge probabilities team_w.
- team_dualDual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
- team_PThe instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.
- team_P_boundsAll entries of the first Team Order instance are probabilities in [0,1].
Lean source view module on GitHub
/-- Edge probabilities on the cycle `i → i+1 (mod n)`: `3/4, 3/4, 0, 1, 0, 1, …, 1, 0`. -/ noncomputable def team_w {m : ℕ} (i : Fin (2 * m + 3)) : ℝ := if i.val ≤ 1 then 3 / 4 else if i.val % 2 = 0 then 0 else 1