Theorems · Theorem · group theory
Finset.sum_comp_equiv
∀ {ι : Type u_1} {κ : Type u_2} {M : Type u_4} {s : Finset ι} [inst : AddCommMonoid M] {f : κ → M} (e : ι ≃ κ),
s.sum (f ∘ ⇑e) = (Finset.map e.toEmbedding s).sum f- Cited by
- 5 results in Mathlib
- Foundations
- Depth 56 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.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- Equivstatement and proof · cited by 8,337
- Finset.sumstatement and proof · cited by 5,195
- Finset.sum_congrproof · cited by 2,323
- Finset.mapstatement · cited by 747
- Equiv.toEmbeddingstatement and proof · cited by 254
- Finset.sum_mapproof · cited by 115
Cited by5
Results whose statement or proof uses this declaration.
- Affine.Simplex.exsphere_reindexproof · cited by 5
- Affine.Simplex.setInterior_reindexproof · cited by 2
- Affine.Simplex.excenterWeights_reindexproof · cited by 1
- Affine.Simplex.touchpointWeights_reindexproof · cited by 0
- Affine.Simplex.excenterExists_reindexproof · cited by 0