Theorems · Inductive type · group theory
AddChar
(A : Type u_1) → [AddMonoid A] → (M : Type u_2) → [Monoid M] → Type (max u_1 u_2)
AddChar A M is the type of maps A → M, for A an additive monoid and M a multiplicative
monoid, which intertwine addition in A with multiplication in M.
We only put the typeclasses needed for the definition, although in practice we are usually
interested in much more specific cases (e.g. when A is a group and M a commutative ring).
- Defined in
- Mathlib.Algebra.Group.AddChar
- Cited by
- 286 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 3 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by338
Results whose statement or proof uses this declaration.
- Real.fourierCharstatement · cited by 59
- VectorFourier.fourierIntegralstatement and proof · cited by 36
- gaussSumstatement and proof · cited by 29
- AddChar.mulShiftstatement and proof · cited by 26
- AddChar.IsPrimitivestatement and proof · cited by 22
- ZMod.stdAddCharstatement · cited by 19
- AddChar.map_zero_eq_onestatement and proof · cited by 17
- ZMod.toCirclestatement · cited by 14
- Matrix.GeneralLinearGroup.upperRightHomstatement · cited by 14
- AddChar.map_add_eq_mulstatement and proof · cited by 13
- AddChar.doubleDualEmbstatement and proof · cited by 11
- AddChar.extstatement and proof · cited by 11
Showing the 200 most cited of 338.