team_next
def
The cycle successor relation on positions.
Statement
def team_next {m : ℕ} (i j : Fin (2 * m + 3)) : Prop
- 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_nextThe rotation i ↦ i + 1 (mod n) follows the cycle edges.
- team_dualDual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
- 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_PThe instance: p(i,i) = 1/2, p(i, i+1 mod n) = team_w i, all other entries 0.
Lean source view module on GitHub
/-- The cycle successor relation on positions. -/ def team_next {m : ℕ} (i j : Fin (2 * m + 3)) : Prop := j.val = i.val + 1 ∨ (i.val = 2 * m + 2 ∧ j.val = 0) instance team_next_decidable {m : ℕ} (i j : Fin (2 * m + 3)) : Decidable (team_next i j) := by unfold team_next; infer_instance