AFTD Auto-Formalizing Theoretical Domains

team_v

def

Column potentials of a dual certificate for the maximum-weight matching.

Statement

noncomputable def team_v {m : ℕ} (j : 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 5
  • team_dualDual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
  • team_P2_rotIn the strengthened instance the rotation line-up i -> i+1 uses the cycle edge probabilities team_w2.
  • team_weight_leEvery perfect matching has weight at most n/2.
  • team_v_boundsThe column potentials of the first dual certificate lie in [0,1/2].
  • team_v2Scaled column potentials v'_j = (1 - 2τ) v_j (range 1/2 - τ).

Lean source view module on GitHub

/-- Column potentials of a dual certificate for the maximum-weight matching. -/
noncomputable def team_v {m : ℕ} (j : Fin (2 * m + 3)) : ℝ :=
  if j.val = 0 then 0 else if j.val = 1 then 1 / 4 else if j.val % 2 = 0 then 1 / 2 else 0
See it in the graphDiscuss this resultChallenge it