Math 2.0

Field theory and polynomials Proof

Proof that finite subgroups of the multiplicative group of a field are cyclic

Builds on FieldGroup of units of a ringAbelian groupExponent of a groupg to the order of the group is the identityA polynomial over a field has at most as many roots as its degreeA finite abelian group is cyclic iff its exponent equals its order

Proof

  1. Let KK be a field, and let GG be a finite subgroup of the group of units K×K^\times. Let n=∣G∣n = \abs{G}.
  2. Multiplication in KK is commutative, so GG is an abelian group.
  3. Every g∈Gg \in G satisfies gn=1g^n = 1. So some positive integer mm has gm=1g^m = 1 for all g∈Gg \in G.
  4. Let ee be the exponent of GG: the least positive integer with ge=1g^e = 1 for all g∈Gg \in G. By step 3, e≤ne \le n.
  5. Every element of GG is a root in KK of the polynomial xe−1∈K[x]x^e - 1 \in K[x], which is nonzero of degree ee.
  6. This polynomial has at most ee roots in KK. The nn elements of GG are distinct roots, so n≤en \le e.
  7. By steps 4 and 6, the exponent ee equals ∣G∣=n\abs{G} = n.
  8. A finite abelian group whose exponent equals its order is cyclic. So GG is cyclic.

Idea

In a field, the equation xe=1x^e = 1 has at most ee solutions. So the exponent of a finite subgroup of K×K^\times cannot be smaller than its order. For an abelian group, exponent equal to order means that one element has the full order.

Reading path

To understand this page from the ground up, read these 136 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of cancellation in an integral domain, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof that equivalence classes form a partition, Proof that g to the n equals 1 iff the order divides n, Proof that R[x] is an integral domain iff R is, Proof that g to the order of the group is the identity, Proof that the order of an element divides the order of the group, Proof of the degree of a product over an integral domain, Proof of strong induction from ordinary induction, Proof of the laws of exponents in a group, Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime, Proof that a polynomial over a field has at most as many roots as its degree, Proof of the remainder theorem, Proof that a finite abelian group is cyclic iff its exponent equals its order, Proof that the order of a cyclic subgroup equals the order of its generator, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the uniqueness of inverses, Proof that cyclic groups of the same order are isomorphic, Proof of Lagrange's theorem, Proof of the factor theorem, Proof that cosets have the same cardinality as the subgroup.

  1. Binary operation definition
  2. Definition by recursion concept
  3. Divisibility definition
  4. Element definition
  5. Group concept
  6. Left coset concept
  7. Mathematical induction concept
  8. Natural numbers object
  9. Peano axioms concept
  10. Proposition concept
  11. Vector space definition
  12. Commutativity definition
  13. Identity element definition
  14. Greatest common divisor definition
  15. Set definition
  16. Direct product of groups definition
  17. Group homomorphism definition
  18. Order of a group definition
  19. Ring definition
  20. Subgroup definition
  21. Successor function definition
  22. Conjunction definition
  23. Disjunction definition
  24. Implication definition
  25. Predicate definition
  26. External direct sum definition
  27. Inverse element definition
  28. Abelian group definition
  29. Coprime integers definition
  30. Empty set object
  31. Family of sets definition
  32. Ordered pair definition
  33. Group isomorphism definition
  34. Intersection definition
  35. Addition of natural numbers definition
  36. Union definition
  37. Commutative ring definition
  38. Polynomial ring definition
  39. Ring homomorphism definition
  40. Unit of a ring definition
  41. Zero divisor definition
  42. Left coset definition
  43. Right coset definition
  44. Set-builder notation concept
  45. The successor function is injective statement
  46. Zero is not a successor statement
  47. Biconditional definition
  48. Existential quantifier definition
  49. Universal quantifier definition
  50. Proof of the uniqueness of inverses proof
  51. Cartesian product definition
  52. Disjoint sets definition
  53. Order on the natural numbers definition
  54. Proof of the commutativity of addition by induction proof
  55. Group of units of a ring definition
  56. Divisibility in a commutative ring definition
  57. Subset definition
  58. Degree of a polynomial definition
  59. Polynomial evaluation definition
  60. Union of a family of sets definition
  61. Field definition
  62. Axiom of extensionality statement
  63. Integral domain definition
  64. Uniqueness quantifier definition
  65. Uniqueness of inverses statement
  66. Binary relation definition
  67. Commutativity of addition statement
  68. Partition of a set definition
  69. Leading coefficient definition
  70. Root of a polynomial definition
  71. Proof of cancellation in an integral domain proof
  72. Evaluation homomorphism definition
  73. Proof of strong induction from ordinary induction proof
  74. Reflexive relation definition
  75. Symmetric relation definition
  76. Transitive relation definition
  77. Proof of the laws of exponents in a group proof
  78. Monic polynomial definition
  79. Strong induction statement
  80. Multiplicity of a root definition
  81. Function definition
  82. Proof of the degree of a product over an integral domain proof
  83. Proof of the remainder theorem proof
  84. Cancellation in an integral domain statement
  85. Equivalence relation definition
  86. Laws of exponents in a group statement
  87. Proof of the well-ordering principle from strong induction proof
  88. Codomain definition
  89. Injective function definition
  90. Division algorithm for polynomials statement
  91. Degree of a product statement
  92. Order of an element definition
  93. Well-ordering principle statement
  94. Cyclic subgroup generated by an element definition
  95. Surjective function definition
  96. Remainder theorem statement
  97. Equivalence class definition
  98. Proof that R[x] is an integral domain iff R is proof
  99. Exponent of a group definition
  100. Proof of the division algorithm proof
  101. Cyclic group definition
  102. Bijective function definition
  103. Proof that equivalence classes form a partition proof
  104. Proof of the factor theorem proof
  105. R[x] is an integral domain iff R is statement
  106. Division algorithm statement
  107. Equinumerous sets definition
  108. Equivalence classes form a partition statement
  109. Factor theorem statement
  110. Cardinality definition
  111. Proof of Bézout's identity proof
  112. Proof that g to the n equals 1 iff the order divides n proof
  113. Proof that a polynomial over a field has at most as many roots as its degree proof
  114. g to the n equals 1 iff the order divides n statement
  115. Bézout's identity statement
  116. A polynomial over a field has at most as many roots as its degree statement
  117. Proof that cosets have the same cardinality as the subgroup proof
  118. Proof of the generalized Euclid's lemma proof
  119. Proof that the order of a cyclic subgroup equals the order of its generator proof
  120. Cosets have the same cardinality as the subgroup statement
  121. Generalized Euclid's lemma statement
  122. Order of a cyclic subgroup equals the order of its generator statement
  123. Proof of Lagrange's theorem proof
  124. Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime proof
  125. Proof that cyclic groups of the same order are isomorphic proof
  126. Lagrange's theorem statement
  127. Proof that the order of an element divides the order of the group proof
  128. Cyclic groups of the same order are isomorphic statement
  129. Product of cyclic groups is cyclic iff the orders are coprime statement
  130. Order of an element divides the order of the group statement
  131. Proof that g to the order of the group is the identity proof
  132. Classification of finite abelian groups statement
  133. g to the order of the group is the identity statement
  134. Proof that a finite abelian group is cyclic iff its exponent equals its order proof
  135. A finite abelian group is cyclic iff its exponent equals its order statement
  136. Proof that finite subgroups of the multiplicative group of a field are cyclic proof

Where this leads

18 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Finite_field, Multiplicative structure
About this page
TagA2VZWSBS4B
URIm2://A2VZWSBS4B
Kindproof
WritingW0 stub
MSC12E20
ProvesFinite subgroups of the multiplicative group of a field are cyclic
UsesField, Group of units of a ring, Abelian group, Exponent of a group, g to the order of the group is the identity, A polynomial over a field has at most as many roots as its degree, A finite abelian group is cyclic iff its exponent equals its order
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.