Theorems · Theorem · group theory
Finset.sum_insert_zero
∀ {ι : Type u_1} {M : Type u_4} {s : Finset ι} {a : ι} [inst : AddCommMonoid M] {f : ι → M} [inst_1 : DecidableEq ι],
f a = 0 → ∑ x ∈ insert a s, f x = ∑ x ∈ s, f xThe sum of f over insert a s is the same as
the sum over s, as long as f a = 0.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoidDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumstatement and proof · cited by 5,195
- Finset.sum_insert_of_eq_zero_if_notMemproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Finset.weightedVSubOfPoint_insertproof · cited by 3
- mem_vectorSpan_iff_eq_weightedVSubproof · cited by 1