Math 2.0

Field theory and polynomials Proof

Proof that every element of a finite field of order q satisfies x^q = x

Builds on Finite fieldGroup of units of a ringg to the order of the group is the identityA polynomial over a field has at most as many roots as its degreeDegree of a polynomial

Proof

  1. Let FF be a finite field with qq elements. Let F×F^\times be its group of units.
  2. In a field, every nonzero element is a unit. So F×=F∖{0}F^\times = F \setminus \set{0}, and F×F^\times is a group of order q−1q - 1.
  3. Let a∈Fa \in F with a≠0a \neq 0. Then aq−1=1a^{q-1} = 1, since aa lies in the finite group F×F^\times of order q−1q - 1.
  4. Multiplying by aa gives aq=aa^q = a.
  5. For a=0a = 0 we have aq=0=aa^q = 0 = a, since q≥1q \ge 1. So aq=aa^q = a for every a∈Fa \in F.
  6. Let f=xq−xf = x^q - x and g=∏a∈F(x−a)g = \prod_{a \in F} (x - a) in F[x]F[x]. Both are monic of degree qq.
  7. So the leading terms cancel in h=f−gh = f - g, and hh is 00 or has degree less than qq.
  8. Every a∈Fa \in F is a root of ff by step 5. It is also a root of gg, because gg has the factor x−ax - a. So every a∈Fa \in F is a root of hh.
  9. Thus hh has qq distinct roots in FF. A nonzero polynomial of degree less than qq has fewer than qq roots. So h=0h = 0.
  10. Hence xq−x=∏a∈F(x−a)x^q - x = \prod_{a \in F} (x - a) in F[x]F[x].

Idea

The nonzero elements form a group of order q−1q - 1, so Lagrange's theorem gives aq−1=1a^{q-1} = 1 for them. Then all qq elements are roots of xq−xx^q - x. A monic polynomial of degree qq with qq known distinct roots is the product of the linear factors, because the difference would have too many roots.

Reading path

To understand this page from the ground up, read these 115 pages in order. The foundations come first. The path takes the proofs Proof of cancellation in an integral domain, 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 polynomial over a field has at most as many roots as its degree, Proof of the remainder theorem, 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 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. Identity element definition
  12. Set definition
  13. Order of a group definition
  14. Ring definition
  15. Subgroup definition
  16. Successor function definition
  17. Conjunction definition
  18. Disjunction definition
  19. Implication definition
  20. Predicate definition
  21. Inverse element definition
  22. Empty set object
  23. Family of sets definition
  24. Ordered pair definition
  25. Commutative ring definition
  26. Polynomial ring definition
  27. Ring homomorphism definition
  28. Unit of a ring definition
  29. Zero divisor definition
  30. Intersection definition
  31. Union definition
  32. Left coset definition
  33. Right coset definition
  34. Addition of natural numbers definition
  35. Set-builder notation concept
  36. The successor function is injective statement
  37. Zero is not a successor statement
  38. Biconditional definition
  39. Existential quantifier definition
  40. Universal quantifier definition
  41. Proof of the uniqueness of inverses proof
  42. Cartesian product definition
  43. Divisibility in a commutative ring definition
  44. Degree of a polynomial definition
  45. Disjoint sets definition
  46. Polynomial evaluation definition
  47. Field definition
  48. Group of units of a ring definition
  49. Integral domain definition
  50. Subset definition
  51. Proof of the commutativity of addition by induction proof
  52. Axiom of extensionality statement
  53. Order on the natural numbers definition
  54. Union of a family of sets definition
  55. Uniqueness quantifier definition
  56. Uniqueness of inverses statement
  57. Leading coefficient definition
  58. Binary relation definition
  59. Proof of cancellation in an integral domain proof
  60. Root of a polynomial definition
  61. Evaluation homomorphism definition
  62. Finite field definition
  63. Partition of a set definition
  64. Commutativity of addition statement
  65. Proof of strong induction from ordinary induction proof
  66. Monic polynomial definition
  67. Proof of the laws of exponents in a group proof
  68. Reflexive relation definition
  69. Symmetric relation definition
  70. Transitive relation definition
  71. Multiplicity of a root definition
  72. Proof of the degree of a product over an integral domain proof
  73. Proof of the remainder theorem proof
  74. Cancellation in an integral domain statement
  75. Function definition
  76. Strong induction statement
  77. Laws of exponents in a group statement
  78. Division algorithm for polynomials statement
  79. Equivalence relation definition
  80. Degree of a product statement
  81. Codomain definition
  82. Injective function definition
  83. Proof of the well-ordering principle from strong induction proof
  84. Cyclic subgroup generated by an element definition
  85. Order of an element definition
  86. Remainder theorem statement
  87. Proof that R[x] is an integral domain iff R is proof
  88. Surjective function definition
  89. Equivalence class definition
  90. Well-ordering principle statement
  91. Proof of the factor theorem proof
  92. Bijective function definition
  93. R[x] is an integral domain iff R is statement
  94. Proof that equivalence classes form a partition proof
  95. Proof of the division algorithm proof
  96. Equinumerous sets definition
  97. Factor theorem statement
  98. Division algorithm statement
  99. Equivalence classes form a partition statement
  100. Cardinality definition
  101. Proof that g to the n equals 1 iff the order divides n proof
  102. Proof that a polynomial over a field has at most as many roots as its degree proof
  103. g to the n equals 1 iff the order divides n statement
  104. A polynomial over a field has at most as many roots as its degree statement
  105. Proof that cosets have the same cardinality as the subgroup proof
  106. Proof that the order of a cyclic subgroup equals the order of its generator proof
  107. Cosets have the same cardinality as the subgroup statement
  108. Order of a cyclic subgroup equals the order of its generator statement
  109. Proof of Lagrange's theorem proof
  110. Lagrange's theorem statement
  111. Proof that the order of an element divides the order of the group proof
  112. Order of an element divides the order of the group statement
  113. Proof that g to the order of the group is the identity proof
  114. g to the order of the group is the identity statement
  115. Proof that every element of a finite field of order q satisfies x^q = x proof

Where this leads

15 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Finite_field, Multiplicative structure
About this page
TagWF7HV1W1BH
URIm2://WF7HV1W1BH
Kindproof
WritingW0 stub
MSC12E20
ProvesEvery element of a finite field of order q satisfies x^q = x
UsesFinite field, Group of units of a ring, g to the order of the group is the identity, A polynomial over a field has at most as many roots as its degree, Degree of a polynomial
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.