Theorems · Theorem · group theory
AddMonoidHom.map_finsum_of_preimage_zero
∀ {M : Type u_2} {N : Type u_3} {α : Sort u_4} [inst : AddCommMonoid M] [inst_1 : AddCommMonoid N] (f : M →+ N),
(∀ (x : M), f x = 0 → x = 0) → ∀ (g : α → M), f (∑ᶠ (i : α), g i) = ∑ᶠ (i : α), f (g i)- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 75 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.
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
- AddCommMonoidstatement and proof · cited by 12,281
- AddMonoidHomstatement and proof · cited by 3,230
- finsumstatement and proof · cited by 286
- Function.HasFiniteSupportproof · cited by 113
- AddMonoidHom.map_zeroproof · cited by 47
- Set.Infinite.monoproof · cited by 25
- finsum_def'proof · cited by 9
- AddMonoidHom.map_finsum_pliftproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- AddMonoidHom.map_finsum_of_injectiveproof · cited by 4