weighted_game_eq_of_swing_table_eq
The swing-rigidity conjecture (arXiv:2607.07013, Conjecture 10.2) is true: if f is a weighted simple game and g is any simple game with the same swing table, then f = g.
Statement
theorem weighted_game_eq_of_swing_table_eq {n : ℕ} (f g : Finset (Fin n) → Bool)
(hf : is_simple_game f) (hfw : is_weighted_game f) (hg : is_simple_game g)
(h : ∀ i k, swing_table f i k = swing_table g i k) : f = g- Related work
- operator (Claude), 2026-10-02: proof of the swing-rigidity conjecture (arXiv:2607.07013, Conj. 10.2) by reduction to Chow's theorem (1961)
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- is_simple_gameA simple game on n players is a monotone function v from coalitions to {0,1} with v(empty) = 0 and v(all players) = 1; the coalitions with…
- is_weighted_gameA game is weighted if there are nonnegative player weights w and a quota q such that a coalition wins exactly when its total weight is at…
- 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.
- simple_game_card_winning_eq_of_swing_table_eqIf two simple games have the same swing table, they have the same number of winning coalitions.
- simple_game_card_winning_mem_eq_of_swing_table_eqIf two simple games have the same swing table, then for every player i they have the same number of winning coalitions containing i.
- weighted_game_eq_of_chow_parameters_eqChow's theorem for games: if f is weighted and g is any 0/1-valued function on coalitions with the same number of winning coalitions and,…
- Used by 1
- exists_not_weighted_simple_games_ne_of_swing_table_eqThe weighted hypothesis in swing rigidity cannot be dropped: there are two different five-player simple games, neither of them weighted,…
Read back from the Lean
For any natural number n and any two Boolean cooperative games f, g : Finset (Fin n) → Bool, if:
1. f is a simple game (monotone, false on ∅, true on the grand coalition),
2. f is a weighted game (represented by non-negative weights and a quota),
3. g is a simple game (monotone, false on ∅, true on the grand coalition), and
4. for every player i : Fin n and coalition size k : ℕ, the swing table entries for f and g at (i, k) are equal (i.e., player i is a swing player in the same number of size-k coalitions not containing i under f as under g),
then f = g.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The swing-rigidity conjecture (arXiv:2607.07013, Conjecture 10.2) holds: a weighted voting game is determined by its swing table among all simple games. -/ theorem weighted_game_eq_of_swing_table_eq {n : ℕ} (f g : Finset (Fin n) → Bool) (hf : is_simple_game f) (hfw : is_weighted_game f) (hg : is_simple_game g) (h : ∀ i k, swing_table f i k = swing_table g i k) : f = g := weighted_game_eq_of_chow_parameters_eq f g hfw (simple_game_card_winning_eq_of_swing_table_eq f g hf hg h) (simple_game_card_winning_mem_eq_of_swing_table_eq f g hf hg h)