A group has a closed binary operation, associativity, an identity, and an inverse for each element. For a finite group, Lagrange's theorem states for each subgroup , so divides .
The order of a group element is the least positive with , or infinity if none exists. In a finite group the powers form the cyclic subgroup of that order; Lagrange's theorem proves . If is prime and , its order must be . Thus generates the whole group, proving .
If every nonidentity element has order two, every element is its own inverse. Then . This proves that a group of exponent two is abelian.
In a group of order six, element orders divide six. If there were no element of order three or six, every nonidentity element would have order two, making the group abelian by the preceding argument. Choose and . Then is a subgroup of order four: its elements are distinct, it is closed because commute and square to , and each element is its own inverse. This contradicts Lagrange's theorem, since four does not divide six. Hence an element of order three or six exists.
Suppose have order three but . Their cyclic subgroups have trivial intersection: any common nonidentity element would generate both subgroups and force or . The nine products , , are distinct. Indeed implies in that intersection, so and modulo three. Nine distinct elements cannot fit in a group of order six, proving the claim without assuming commutativity.
If an element has order six, it generates , so . Otherwise choose an element of order three. The preceding result excludes any further order-three elements outside , and there are no elements of order six by assumption. Each of the other three elements must therefore have order two. ThusThe noncyclic case is the symmetric group on three points, as the classification of a group of order six further identifies.
Articles by others on the same topic
There are currently no matching articles.