team_v_bounds
lemmaverified
The column potentials of the first dual certificate lie in [0,1/2].
Statement
lemma team_v_bounds {m : ℕ} (j : Fin (2 * m + 3)) : 0 ≤ team_v j ∧ team_v j ≤ 1 / 2- 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_vColumn potentials of a dual certificate for the maximum-weight matching.
- Used by 4
- team_dualDual feasibility: p(i,j) ≤ (1/2 - v_i) + v_j.
- thermomajorization_diff_zeroFor any dimension n and population vectors x and y, the thermomajorization prefix difference thermomajorization_diff x y 0 at rank 0…
- one_mem_pos_diag_matricesFor every dimension n, the n-by-n identity matrix belongs to the set of positive diagonal matrices.
- team_v2_boundsThe scaled column potentials lie in [0, (1-2 tau)/2].
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
lemma team_v_bounds {m : ℕ} (j : Fin (2 * m + 3)) : 0 ≤ team_v j ∧ team_v j ≤ 1 / 2 := by unfold team_v split_ifs <;> norm_num