Theorems · Definition · group theory
CommGroup.monoidHomMonoidHomEquiv
(G : Type u_1) →
(M : Type u_2) →
[inst : CommGroup G] →
[Finite G] → [inst_2 : CommMonoid M] → [hM : HasEnoughRootsOfUnity M (Monoid.exponent G)] → ((G →* Mˣ) →* Mˣ) ≃* GThe MulEquiv between the double dual (G →* Mˣ) →* Mˣ of a finite commutative group G
and itself where M is a commutative monoid with enough nth roots of unity, where n is
the exponent of G.
The image g of η : (G →* Mˣ) →* Mˣ is such that, for all φ : G →* Mˣ, we have φ g = η g,
see CommGroup.apply_monoidHomMonoidHomEquiv.
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 169 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- MonoidHomstatement and proof · cited by 3,629
- Finitestatement and proof · cited by 3,029
- Unitsstatement and proof · cited by 2,804
- CommMonoidstatement and proof · cited by 2,264
- MulEquivstatement · cited by 1,142
- CommGroupstatement and proof · cited by 990
- MulEquiv.symmproof · cited by 482
- Monoid.exponentstatement and proof · cited by 128
- Equiv.ofBijectiveproof · cited by 70
- HasEnoughRootsOfUnitystatement and proof · cited by 56
- MulEquiv.mk'proof · cited by 0
Cited by7
Results whose statement or proof uses this declaration.
- CommGroup.subgroupOrderIsoSubgroupMonoidHomproof · cited by 7
- CommGroup.monoidHomMonoidHomEquiv_symm_apply_applystatement and proof · cited by 2
- MulChar.mulCharEquivproof · cited by 2
- CommGroup.mem_subgroupOrderIsoSubgroupMonoidHom_iffproof · cited by 0
- CommGroup.mem_subgroupOrderIsoSubgroupMonoidHom_symm_iffproof · cited by 0
- CommGroup.monoidHomMonoidHomEquiv.congr_simpstatement and proof · cited by 0
- CommGroup.apply_monoidHomMonoidHomEquivstatement and proof · cited by 0