Math 2.0

statement theorem

Existence of finite fields of every prime power order

Statement

Let pp be a prime number and let n≥1n \ge 1. Then there is a finite field of order q=pnq = p^n.

Remarks

The proof: let LL be a splitting field of f=xq−xf = x^q - x over Fp\mathbb{F}_p. The derivative f′=qxq−1−1=−1f' = q x^{q-1} - 1 = -1 has no common root with ff, so ff has qq distinct roots in LL, by the criterion for repeated roots. The roots of ff form a subfield of LL, because (a+b)q=aq+bq(a + b)^q = a^q + b^q and (ab)q=aqbq(a b)^q = a^q b^q. This subfield has qq elements. So for each nn there is an irreducible polynomial of degree nn over Fp\mathbb{F}_p.

History

E. H. Moore first proved the classification of finite fields in 1893: there is a field of each prime power order, and all fields of a given order are isomorphic.

Explanations

L1 human

The field with pnp^n elements is made of the roots of xpn−xx^{p^n} - x. The proof checks that these roots are distinct and closed under the field operations.

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 60 nodes in this order. The foundations come first, and the list ends with this node.

  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Ideal definition
  5. Polynomial ring definition
  6. Subring definition
  7. Unit of a ring definition
  8. Zero divisor definition
  9. Divisibility in a commutative ring definition
  10. Ideal generated by a subset definition
  11. Maximal ideal definition
  12. Two-sided ideal definition
  13. Degree of a polynomial definition
  14. Field definition
  15. Formal derivative definition
  16. Polynomial evaluation definition
  17. Integral domain definition
  18. Principal ideal definition
  19. Quotient ring definition
  20. Associate elements definition
  21. Prime element definition
  22. The only ideals of a field are zero and the whole field statement
  23. Leading coefficient definition
  24. Subfield definition
  25. Finite field definition
  26. Irreducible element definition
  27. Field of fractions definition
  28. Root of a polynomial definition
  29. Euclidean domain definition
  30. Correspondence theorem for rings statement
  31. Greatest common divisor in an integral domain definition
  32. Principal ideal domain definition
  33. Irreducible polynomial definition
  34. Monic polynomial definition
  35. Field extension definition
  36. Degree of a product statement
  37. Split polynomial definition
  38. Unique factorisation domain definition
  39. Multiplicity of a root definition
  40. R/M is a field iff M is maximal statement
  41. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  42. Division algorithm for polynomials statement
  43. Content of a polynomial definition
  44. Degree of a field extension definition
  45. R[x] is an integral domain iff R is statement
  46. Intermediate field definition
  47. Repeated roots and the derivative statement
  48. Primitive polynomial definition
  49. Tower law statement
  50. K[x] is a Euclidean domain statement
  51. Field generated by adjoining elements definition
  52. K[x]/(f) is a field iff f is irreducible statement
  53. Product of primitive polynomials is primitive statement
  54. Splitting field definition
  55. Adjoining a root of a polynomial definition
  56. Gauss's lemma statement
  57. Polynomial ring over a UFD is a UFD statement
  58. Every polynomial has a root in some extension field statement
  59. Existence of splitting fields statement
  60. Existence of finite fields of every prime power order statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Finite_field, Existence and uniqueness