Lagrange's theorem states that for a subgroup of a finite group ,in particular, divides . Here is the subgroup index, the number of left cosets of .
The order of a group element is the least positive integer such that . It exists because is finite. The cyclic subgroup consists of exactly , so has order . Applying Lagrange's theorem to this subgroup gives
A map is a group isomorphism if it is a bijection and a group homomorphism, meaningSuch a map from a group to itself is an group automorphism. Its inverse is also a group homomorphism: if and , then .
Write . A group homomorphism from this cyclic group is determined by the image of , because . Each choice , with , gives a well-defined group homomorphism. It is an group automorphism exactly when generates .
For a prime number , every is coprime to , so the powers of run through all of . The choice gives the trivial group homomorphism and fails to be bijective. Consequently
For , define . Since is a normal subgroup, this sends into itself. It preserves multiplication, and its inverse is conjugation by , so it is an group automorphism of . MoreoverThus is a group homomorphism, induced by the group action of conjugation.
If is trivial, every element of commutes with every element of . Henceis a group homomorphism, since . Its image of a group homomorphism is a subgroup containing both and , and every product lies in , so its image is exactly . If , then , so . Thus is injective and gives
The stabilizer subgroup of for this conjugation group action is its normalizerIf it is all of , the equality holds for every , which is precisely the definition of a normal subgroup.
If instead , the orbit-stabilizer theorem says that the group orbit of has size . Every conjugate is isomorphic to , with group isomorphism , so this group orbit is a subset of . ThereforeThe group action need not be transitive on all of ; this one group orbit supplies the lower bound.
By Lagrange's theorem, every nonidentity group element has order , , or . If some element has order , its seventh and fifth powers have orders and , respectively, and we are done.
Otherwise every nonidentity element has order or . Distinct subgroups of a given prime number order intersect only in the identity: a shared nonidentity element generates both. If there were no element of order , the nonidentity elements would therefore partition into sets of six, the nonidentity elements of the cyclic subgroups of order seven. This would force , a contradiction. If there were no element of order , the analogous partition into sets of four would force , again a contradiction. Thus elements of both orders exist.
Let and be subgroups of orders five and seven, which exist by i. Their normalizers contain and , respectively. By Lagrange's theorem, has order or , and has order or . If either has order , its subgroup is normal by iv.
Suppose neither is normal. Then iv gives at least seven distinct subgroups of order five and at least five distinct subgroups of order seven. Distinct subgroups of the same prime order intersect only in the identity, and a subgroup of order five and one of order seven also intersect only in the identity by Lagrange's theorem. Thus would have at leastnonidentity elements, contradicting . Hence at least one of is a normal subgroup.
Choose a normal subgroup of prime order as in ii, and choose a subgroup of the other prime order . Their intersection is trivial by Lagrange's theorem. Both are cyclic groups, and ii gives .
The image of a group homomorphism from iii has order dividing , because its kernel of a group homomorphism partitions into equally sized cosets. Its order also divides by Lagrange's theorem. Butso is trivial in either case. By iii, has order and therefore equals .
If and generate and , the element has order , since its th power is the identity exactly when both and divide . Thus this direct product of groups is cyclic, and
Articles by others on the same topic
There are currently no matching articles.