Theorems · Theorem · group theory
finsum_mem_insert
∀ {α : Type u_1} {M : Type u_5} [inst : AddCommMonoid M] {a : α} {s : Set α} (f : α → M),
a ∉ s → s.Finite → ∑ᶠ (i : α) (_ : i ∈ insert a s), f i = f a + ∑ᶠ (i : α) (_ : i ∈ s), f iGiven a finite set s and an element a ∉ s, the sum of f i over i ∈ insert a s
equals f a plus the sum of f i over i ∈ s.
- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 87 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoid
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.
- Setstatement and proof · cited by 53,352
- AddCommMonoidstatement and proof · cited by 12,281
- Set.Finitestatement and proof · cited by 1,814
- Function.supportproof · cited by 610
- finsumstatement · cited by 286
- Set.Finite.inter_of_leftproof · cited by 31
- finsum_mem_insert'proof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Set.Finite.encard_biUnionproof · cited by 1
- finsum_mem_pairproof · cited by 0