For the Abelian case of Cauchy theorem for groups, use induction on . Choose . If divides , then has order . Otherwise is a nontrivial normal subgroup of order prime to , and has smaller order still divisible by . Induction gives a coset of order ; any lift has order divisible by , because the order of its image divides its own order. A suitable power of then has order . This uses no classification of finite Abelian groups.
The map partitions into disjoint two-element sets , so is even. Since is even, is even as well. This complement contains the identity and consists of elements with . It therefore contains at least one further element , and that element has order two. Thus every finite group of even order contains an involution, without using Cauchy theorem for groups.
By Lagrange's theorem, a nonidentity element in a group of order four has order two or four. In the latter case the group is cyclic. Otherwise every nonidentity element has order two, and while , so the group is Abelian. Choose distinct nonidentity elements . Their cyclic subgroups meet trivially and is the fourth element, so gives an isomorphism . Hence
No classification of finite Abelian groups is used.
By Cauchy theorem for groups, choose of order and of order two. The subgroup has index two, hence is normal, and . Thus generate . Conjugation by has with and . Since is prime, or .
If , the two generators commute and has order , so is cyclic. If , then and . The two involutions generate , because . Hence is dihedral in the stated convention. Thus
where denotes the dihedral group of order . In both cases is a proper nontrivial normal subgroup, so is not simple.

Articles by others on the same topic (0)

There are currently no matching articles.