swing_table_eq_zero_of_lt
theoremverified
In a game on n players, T(i, k) = 0 whenever k > n.
Statement
theorem swing_table_eq_zero_of_lt {n : ℕ} (v : Finset (Fin n) → Bool) (i : Fin n) (k : ℕ)
(hk : n < k) : swing_table v i k = 0- Source
- step towards weighted_game_eq_of_swing_table_eq (swing rigidity, What Semivalues Cannot See: The Information Content of Anonymous Marginal Values, arXiv:2607.07013, Conj. 10.2)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- swing_tableThe swing table of a game: T(i, k) is the number of coalitions S of size k not containing i such that S together with i wins while S loses.
- Used by 1
- exists_simple_games_ne_of_swing_table_eqExample 10.1 of arXiv:2607.07013: the five-player simple games with minimal winning coalitions {1,2,3}, {0,2,4}, {0,3,4}, {1,3,4} and…
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.
/-- A swing table vanishes at sizes larger than the number of players. -/theorem swing_table_eq_zero_of_lt {n : ℕ} (v : Finset (Fin n) → Bool) (i : Fin n) (k : ℕ) (hk : n < k) : swing_table v i k = 0 := by unfold swing_table rw [Finset.card_eq_zero, Finset.filter_eq_empty_iff] intro S _ h have := Finset.card_le_univ S simp only [Fintype.card_fin] at this omega