Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2007/ib/paper-1/10g/iii/solution

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.

New to topics? Read the docs here!