sum_not_mem_eq_insert
theoremverified
For any function G on coalitions, the sum of G(S with i) over coalitions S avoiding i equals the sum of G(T) over coalitions T containing i.
Statement
theorem sum_not_mem_eq_insert {n : ℕ} (G : Finset (Fin n) → ℝ) (i : Fin n) : ∑ S ∈ Finset.univ.filter (fun S : Finset (Fin n) => i ∉ S), G (insert i S) = ∑ T ∈ Finset.univ.filter (fun T : Finset (Fin n) => i ∈ T), G T
- 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- Used by 1
- 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
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.
/-- Adding `i` is a bijection from the sets avoiding `i` onto the sets containing `i`. -/theorem sum_not_mem_eq_insert {n : ℕ} (G : Finset (Fin n) → ℝ) (i : Fin n) : ∑ S ∈ Finset.univ.filter (fun S : Finset (Fin n) => i ∉ S), G (insert i S) = ∑ T ∈ Finset.univ.filter (fun T : Finset (Fin n) => i ∈ T), G T := by apply Finset.sum_nbij' (fun S => insert i S) (fun T => T.erase i) · intro S hS; simp · intro T hT; simp · intro S hS simp only [Finset.mem_filter, Finset.mem_univ, true_and] at hS exact Finset.erase_insert hS · intro T hT simp only [Finset.mem_filter, Finset.mem_univ, true_and] at hT exact Finset.insert_erase hT · intro S _; rfl