Centralizer-commutator product decomposition for finite groups
This article states and (possibly) proves a fact that involves two finite groups of relatively prime order, requiring the additional datum that at least one of them is solvable. Due to the Feit-Thompson theorem, we know that for two finite groups of relatively prime orders, one of them is solvable. Hence, the additional datum of solvability can be dropped. However, the proof of the Feit-Thompson theorem is considered heavy machinery.
View more such facts
This article states and (possibly) proves a fact about a finite group and a Coprime automorphism group (?): a subgroup of the automorphism group whose order is relatively prime to the order of the group itself.
View other such facts
Suppose is a finite group and is a subgroup of such that the orders of and are relatively prime. Then, we have:
- Centralizer-commutator product decomposition for abelian groups
- Centralizer-commutator product decomposition for finite nilpotent groups
- Centralizer-commutator product decomposition for finite groups and cyclic automorphism group
- Coprime implies one is solvable: This notorious corollary of the Feit-Thompson theorem states that given two finite groups whose orders are relatively prime, at least one of them is solvable.
- Centralizer of coprime automorphism group in homomorphic image equals image of centralizer if either is solvable