AFTD Auto-Formalizing Theoretical Domains

swing_table_cast_eq_sum

theoremverified

For a monotone game, T(i, k) equals the sum over coalitions S of size k not containing i of v(S with i) - v(S).

Statement

theorem swing_table_cast_eq_sum {n : ℕ} (v : Finset (Fin n) → Bool)
    (hv : ∀ S T, S ⊆ T → v S = true → v T = true) (i : Fin n) (k : ℕ) :
    (swing_table v i k : ℝ) = ∑ S ∈ Finset.univ.filter (fun S : Finset (Fin n) => i ∉ S ∧ S.card = k),
      ((if v (insert i S) then 1 else 0) - (if v S then 1 else 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 2
  • sum_swing_table_eqFor a monotone game, the sum over all players of T(i, k) equals (k+1) w(k+1) - (n-k) w(k), where w(k) is the number of winning coalitions…
  • sum_range_swing_table_eqFor a monotone game, player i's total swing count (the sum of T(i, k) over k) equals 2 A_i - |W|, where A_i is the number of winning…

Lean source view module on GitHub

/-- For a monotone game, the swing count `T i k` is the sum, over coalitions `S` of size `k` not containing `i`, of `v(S ∪ {i}) - v(S)`. -/theorem swing_table_cast_eq_sum {n : ℕ} (v : Finset (Fin n) → Bool)    (hv : ∀ S T, S ⊆ T → v S = true → v T = true) (i : Fin n) (k : ℕ) :    (swing_table v i k : ℝ) = ∑ S ∈ Finset.univ.filter (fun S : Finset (Fin n) => i ∉ S ∧ S.card = k),      ((if v (insert i S) then 1 else 0) - (if v S then 1 else 0)) := by  have e : (Finset.univ.filter fun S : Finset (Fin n) =>      i ∉ S ∧ S.card = k ∧ v (insert i S) = true ∧ v S = false)      = (Finset.univ.filter fun S : Finset (Fin n) => i ∉ S ∧ S.card = k).filter          (fun S => v (insert i S) = true ∧ v S = false) := by    ext S; simp [and_assoc]  unfold swing_table  rw [e, Finset.card_filter]  push_cast  apply Finset.sum_congr rfl  intro S _  have := hv S (insert i S) (Finset.subset_insert i S)  cases h1 : v (insert i S) <;> cases h2 : v S <;> simp_all
See it in the graphDiscuss this resultChallenge it