Theorems · Theorem · group theory
AddMonoidHom.map_finsum_plift
∀ {M : Type u_2} {N : Type u_3} {α : Sort u_4} [inst : AddCommMonoid M] [inst_1 : AddCommMonoid N] (f : M →+ N)
(g : α → M), Function.HasFiniteSupport (g ∘ PLift.down) → f (∑ᶠ (x : α), g x) = ∑ᶠ (x : α), f (g x)- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoidAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- Setproof · cited by 53,352
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumproof · cited by 5,195
- AddMonoidHomstatement and proof · cited by 3,230
- Function.supportproof · cited by 610
- map_sumproof · cited by 455
- Eq.geproof · cited by 375
- Set.Finite.toFinsetproof · cited by 351
- finsumstatement and proof · cited by 286
- Set.Finite.coe_toFinsetproof · cited by 124
- Function.HasFiniteSupportstatement and proof · cited by 113
Cited by3
Results whose statement or proof uses this declaration.
- AddMonoidHom.map_finsumproof · cited by 9
- AddMonoidHom.map_finsum_of_preimage_zeroproof · cited by 1
- AddMonoidHom.map_finsum_Propproof · cited by 1