Theorems · Theorem · group theory
Finset.sum_erase
∀ {ι : Type u_1} {M : Type u_4} [inst : AddCommMonoid M] [inst_1 : DecidableEq ι] (s : Finset ι) {f : ι → M} {a : ι},
f a = 0 → ∑ x ∈ s.erase a, f x = ∑ x ∈ s, f xIf a function applied at a point is 0, a sum is unchanged by
removing that point, if present, from a Finset.
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 68 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.
Cites7
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.erasestatement · cited by 455
- Finset.sum_subsetproof · cited by 79
- Finset.sdiff_subsetproof · cited by 21
- Finset.sdiff_singleton_eq_eraseproof · cited by 16
Cited by5
Results whose statement or proof uses this declaration.
- Caratheodory.mem_convexHull_eraseproof · cited by 1
- Finset.sum_eraseNoneproof · cited by 1
- Finset.subsetSum_erase_zeroproof · cited by 1
- Finset.weightedVSubOfPoint_eraseproof · cited by 1
- add_finsum_cond_neproof · cited by 0