Multiplicative group of a field 2026-10-31
For a field , the nonzero elements form an abelian group under multiplication, called its multiplicative group. Products of nonzero elements are nonzero because a field has no nonzero zero divisors; multiplication is associative and commutative, the identity is , and every nonzero element has an inverse. Thus every finite subgroup of is a finite abelian group. The finite subgroup of a field multiplicative group is cyclic theorem uses the root bound for a polynomial to prove a stronger restriction on such subgroups.
Past exam of the mathematics course of the University of Cambridge 2016 ia Paper 3 8D Solution Created 2026-09-24 Updated 2026-10-06
The Möbius group consists of all Möbius transformations of the Riemann sphere , with operation function composition. A nonzero-determinant matrix represents the map . If , its pole maps to and maps to ; if , the map is affine and fixes . Nonzero scalar multiples of represent the same transformation.
Define by this action for . Substitution of fractional-linear expressions shows , so is a group homomorphism. Any invertible matrix can be rescaled into the special linear group: choose with , which is possible because every nonzero complex number has a square root. This does not change the transformation, proving surjectivity. A transformation represented by is the identity only if fixing , and forces and . The determinant-one condition then gives . ThusFor the fixed-point claim, a nonidentity Möbius transformation has at least one fixed point of a Möbius transformation: when the finite fixed points solve a quadratic, and when infinity is fixed. A quadratic shows there can be no more than two distinct fixed points unless the transformation is the identity. Suppose there is exactly one. Conjugate it to infinity by a Möbius transformation. The resulting map has form , since it fixes infinity. If it also has the finite fixed point , a contradiction. Hence it is with . Its th power is , never the identity for . Conjugation preserves order, so a nonidentity finite-order Möbius transformation has exactly two fixed points.
Now let be a finite abelian subgroup of the Möbius group. First suppose it contains an element of order greater than two. Conjugate the two fixed points of to and , so , with a root of unity of order greater than two. Every element commuting with permutes its fixed-point set, because . A Möbius transformation preserving each of is ; one exchanging them is . In the second case and , so commuting would force , impossible. Thus all elements of are scalings. A finite subgroup of a field multiplicative group is cyclic; here one can see this directly by choosing the least common multiple of all element orders and observing that the scalars lie among the th roots of unity, a cyclic group. Hence is cyclic.
Otherwise every nonidentity element of has order two. If is nontrivial, choose and conjugate it to . The action of on has image of order at most two. Its kernel consists of scalings , and the order-two condition forces , so the kernel has at most two elements. Hence . Orders one and two give cyclic groups; order four with all nonidentity elements involutions gives , generated by any two distinct nonidentity elements. Both possibilities occur: scalings by roots of unity give every finite cyclic group, and gives the Klein four group. The classification is
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 3 18I a Solution Created 2026-09-24 Updated 2026-09-25
Let be a finite subgroup of and let be its exponent of a finite group. A finite abelian group contains an element whose order is its exponent: combine elements of maximal prime-power order across the primary components. Hence .
Every satisfies , so all elements are roots in the field of the nonzero polynomial . The Lagrange root bound over a field gives . Therefore , and the element of order generates . This proves that a finite subgroup of a field multiplicative group is cyclic.
Primitive-root modulus classification Created 2026-09-24 Updated 2026-11-05
With the one-element unit group convention at , a positive integer modulus admits a primitive root exactly whenwhere is an odd prime and .
For existence, the finite subgroup of a field multiplicative group is cyclic theorem supplies a primitive root modulo . At least one of and satisfies the primitive-root lifting criterion: if , thenThus lifting a primitive root to odd prime powers gives every . The Chinese remainder theorem for unit groups identifies with because is trivial. The moduli two and four are checked directly.
For exclusion, a cyclic group has at most two solutions of . If a modulus has two distinct odd prime factors, or is divisible by both four and an odd prime number, independent sign choices under the Chinese remainder theorem give at least four such units. A pure power with also has the four distinct roots and . These cover every omitted case.
When a primitive root exists, their number is . If generates the unit group of size , its power has multiplicative order , so exactly the coprime exponent classes generate. Here is Euler's totient function.
A finite abelian group is a cyclic group if and only if it has at most one subgroup of each order dividing its order. A cyclic group has exactly one subgroup of order for each , generated by the th power of a generator.
Conversely, the structure theorem for finitely generated modules over a principal ideal domain expresses as with . If , choose a prime number . The first and second summands then provide distinct subgroups of order , contradicting the hypothesis. Hence , so is cyclic, including the trivial group when . This criterion combines with the root bound for a polynomial to prove that a finite subgroup of a field multiplicative group is cyclic.