Theorems · Theorem · group theory
CommGroup.exists_apply_ne_one_of_hasEnoughRootsOfUnity
∀ (G : Type u_1) (M : Type u_2) [inst : CommGroup G] [Finite G] [inst_2 : CommMonoid M]
[hM : HasEnoughRootsOfUnity M (Monoid.exponent G)] {a : G}, a ≠ 1 → ∃ φ, φ a ≠ 1If G is a finite commutative group of exponent n and M is a commutative monoid
with enough nth roots of unity, then for each a ≠ 1 in G, there exists a
group homomorphism φ : G → Mˣ such that φ a ≠ 1.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 165 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.coestatement · cited by 62,936
- MonoidHomstatement · 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
- ZModproof · cited by 1,024
- CommGroupstatement and proof · cited by 990
- Monoid.exponentstatement and proof · cited by 128
- HasEnoughRootsOfUnitystatement and proof · cited by 56
- HasEnoughRootsOfUnity.exists_primitiveRootproof · cited by 5
- HasEnoughRootsOfUnity.of_dvdproof · cited by 5
- ZMod.exists_monoidHom_apply_ne_oneproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- CommGroup.forall_apply_eq_apply_iffproof · cited by 1
- MulChar.exists_apply_ne_one_of_hasEnoughRootsOfUnityproof · cited by 1