Math 2.0

statement theorem

Finite subgroups of the multiplicative group of a field are cyclic

Statement

Let KK be a field and let GG be a finite subgroup of the multiplicative group K×K^\times. Then GG is cyclic.

Remarks

The proof: for each dd, the elements g∈Gg \in G with gd=1g^d = 1 are roots of xd−1x^d - 1. So there are at most dd of them, by the bound on the number of roots, and a finite group with this property is cyclic. For K=CK = \mathbb{C}, the finite subgroups of C×\mathbb{C}^\times are the groups of the nn-th roots of unity. The statement fails for division rings: the quaternion group {±1,±i,±j,±k}\{\pm 1, \pm i, \pm j, \pm k\} is a finite subgroup of the nonzero quaternions that is not cyclic.

Explanations

L1 human

In a field, the equation xd=1x^d = 1 has at most dd solutions. This forces every finite group of nonzero elements to be generated by one element.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 20 nodes in this order. The foundations come first, and the list ends with this node.

Group, concept, no evidence levelGroupconceptRing, definition, no evidence levelRingdefinitionCommutative ring, definition, no evidence levelCommutative ringdefinitionPolynomial ring, definition, no evidence levelPolynomial ringdefinitionUnit of a ring, definition, no evidence levelUnit of a ringdefinitionZero divisor, definition, no evidence levelZero divisordefinitionDegree of a polynomial, definition, no evidence levelDegree of a polynomialdefinitionGroup of units of a ring, definition, no evidence levelGroup of units of a r…definitionPolynomial evaluation, definition, no evidence levelPolynomial evaluationdefinitionIntegral domain, definition, no evidence levelIntegral domaindefinitionLeading coefficient, definition, no evidence levelLeading coefficientdefinitionRoot of a polynomial, definition, no evidence levelRoot of a polynomialdefinitionMonic polynomial, definition, no evidence levelMonic polynomialdefinitionMultiplicity of a root, definition, no evidence levelMultiplicity of a rootdefinitionDegree of a product, statement, no evidence levelDegree of a productstatementDivision algorithm for polynomials, statement, no evidence levelDivision algorithm fo…statementRemainder theorem, statement, no evidence levelRemainder theoremstatementFactor theorem, statement, no evidence levelFactor theoremstatementA polynomial over a field has at most as many roots as its degree, statement, no evidence levelA polynomial over a f…statementFinite subgroups of the multiplicative group of a field are cyclic, statement, no evidence levelFinite subgroups of t…statement
Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Unit of a ring definition
  6. Zero divisor definition
  7. Degree of a polynomial definition
  8. Group of units of a ring definition
  9. Polynomial evaluation definition
  10. Integral domain definition
  11. Leading coefficient definition
  12. Root of a polynomial definition
  13. Monic polynomial definition
  14. Multiplicity of a root definition
  15. Degree of a product statement
  16. Division algorithm for polynomials statement
  17. Remainder theorem statement
  18. Factor theorem statement
  19. A polynomial over a field has at most as many roots as its degree statement
  20. Finite subgroups of the multiplicative group of a field are cyclic statement

What depends on this

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Finite_field, Multiplicative structure