The Fundamental theorem of finitely generated abelian groups says that every finitely generated abelian group is isomorphic to
The rank of an abelian group and the invariant factors are uniquely determined, with the finite summand allowed to be absent. Equivalently, one can decompose the torsion subgroup into cyclic groups of prime-power orders. The infinite cyclic part and torsion part must both be included in the statement.
A nonzero polynomial of degree over a field has at most distinct roots in that field. For a proof, the factor theorem gives whenever . Distinct linear factors are coprime in , a unique factorization domain, so for distinct roots their product divides . Its degree is , giving . One may equivalently remove one linear factor at a time and argue by induction.
If the field has at least elements, this bound is attained by a product of distinct linear factors. For a fixed finite field with fewer than elements, the largest possible number of distinct roots is instead; multiplicities do not create more distinct roots. The zero polynomial is excluded since it has no finite degree.
Let be a finite subgroup of . It is abelian since multiplication in the field commutes. The structure theorem therefore writes as a product of cyclic groups with invariant factors , omitting trivial factors. Every element satisfies , so consists of roots of . The root bound from part (ii) gives
while the decomposition gives . Equality forces every factor except the last to be trivial. Hence is cyclic. The trivial subgroup is cyclic as well. This is the finite multiplicative subgroup of a field is cyclic theorem, proved here using the preceding two parts.
The infinite case is false. In , the group of all roots of unity is infinite, but every element has finite order. If it were cyclic, its generator would have finite order and the whole group would be finite, a contradiction.

Articles by others on the same topic (0)

There are currently no matching articles.