The group order is its cardinality, . The order of a group element is
where is the identity element. In a finite group such an always exists, since two nonnegative powers of must coincide.
Lagrange's theorem states that for a subgroup of a finite group ,
The left cosets of partition , and multiplication by a coset representative is a bijection from onto that coset, explaining the formula. If is prime, then is either or , so or . Thus the correct conclusion is no proper nontrivial subgroup. The trivial subgroup is proper for every group of prime order, so the wording in the question needs this qualification.
Let . The powers
are distinct: equality of two with exponents between and would give a smaller positive power equal to . Reducing exponents modulo proves closure and supplies inverses, so this is a cyclic subgroup of group order . Lagrange's theorem now gives
Choose in a group of prime group order . Its order of a group element divides by (c) and is not , hence equals . Consequently its cyclic subgroup already contains all elements of :
Thus every nonidentity element is a group generator.
By (d), every group of group order three is a cyclic group. Writing its elements as , every product is determined by ; the multiplication table is
The map is a bijective group homomorphism to addition modulo three. Therefore
so there is exactly one such group up to isomorphism.
Closure of the componentwise operation follows from closure in each factor. For three pairs, associativity holds coordinatewise:
The identity element is and the inverse element of is . These verify all group axioms for the direct product of groups. Counting independent choices gives
The subset contains the identity and is closed under products and inverses, so it is a subgroup. For any in the product and ,
Conjugation by gives the reverse inclusion, and hence
This is the definition of a normal subgroup.

Articles by others on the same topic (0)

There are currently no matching articles.