AFTD Auto-Formalizing Theoretical Domains

exists_not_weighted_simple_games_ne_of_swing_table_eq

theoremverifiedformalization

The weighted hypothesis in swing rigidity cannot be dropped: there are two different five-player simple games, neither of them weighted, with the same swing table.

Statement

theorem exists_not_weighted_simple_games_ne_of_swing_table_eq :
    ∃ f g : Finset (Fin 5) → Bool, is_simple_game f ∧ is_simple_game g ∧
      ¬ is_weighted_game f ∧ ¬ is_weighted_game g ∧
      (∀ i k, swing_table f i k = swing_table g i k) ∧ f ≠ g
Formalizes
What Semivalues Cannot See: The Information Content of Anonymous Marginal Values, arXiv:2607.07013, Example 10.1 (the displayed pair, which the paper states is 'both non-weighted' and has equal swing tables); our Lean proof derives non-weightedness from weighted_game_eq_of_swing_table_eq
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • 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…
  • 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.
  • weighted_game_eq_of_swing_table_eqThe 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…

Lean source view module on GitHub

/-- The weighted hypothesis in swing rigidity cannot be dropped: there are two different simple games, neither of them weighted, with the same swing table. -/theorem exists_not_weighted_simple_games_ne_of_swing_table_eq :    ∃ f g : Finset (Fin 5) → Bool, is_simple_game f ∧ is_simple_game g ∧      ¬ is_weighted_game f ∧ ¬ is_weighted_game g ∧      (∀ i k, swing_table f i k = swing_table g i k) ∧ f ≠ g := by  obtain ⟨f, g, hf, hg, h, hne⟩ := exists_simple_games_ne_of_swing_table_eq  refine ⟨f, g, hf, hg, fun hw => hne (weighted_game_eq_of_swing_table_eq f g hf hw hg h),    fun hw => hne (weighted_game_eq_of_swing_table_eq g f hg hw hf fun i k => (h i k).symm).symm, h, hne⟩
See it in the graphDiscuss this resultChallenge it