Field theory and polynomials Proof
Proof that a finite field of order q is the splitting field of x^q - x
Builds on Finite fieldThe order of a finite field is a prime powerPrime subfieldEvery element of a finite field of order q satisfies x^q = xSplit polynomialField generated by adjoining elementsSplitting field
Proof
- Let be a finite field of order , with prime. By the prime power theorem, , where is the characteristic of . By unique factorisation of , .
- Let be the prime subfield of . It is the copy of the multiples of , as in that theorem.
- The polynomial has coefficients , and , so , and is a field extension.
- By the factorisation of , in . So splits over , and its roots are exactly the elements of .
- The field generated over by the roots of is . This is the smallest subfield of that contains , so it is .
- By steps 4 and 5, satisfies both conditions of a splitting field of over .
Idea
Every element of is a root of , and this polynomial has no other roots. So it splits over , and its roots already make up the whole field.
Reading path
To understand this page from the ground up, read these 151 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 of the first isomorphism theorem for rings, Proof that a ring homomorphism is injective iff its kernel is zero, 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 the characteristic of an integral domain is zero or prime, 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 finite field is a prime power, 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 that every element of a finite field of order q satisfies x^q = x, Proof of the factor theorem, Proof that cosets have the same cardinality as the subgroup, Proof of the universal property of the quotient ring.
- Binary operation definition
- Definition by recursion concept
- Divisibility definition
- Element definition
- Group concept
- Left coset concept
- Mathematical induction concept
- Natural numbers object
- Peano axioms concept
- Proposition concept
- Vector space definition
- Identity element definition
- Prime number definition
- Set definition
- Order of a group definition
- Ring definition
- Subgroup definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Linear combination definition
- Linear subspace definition
- Inverse element definition
- Composite number definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Characteristic of a ring definition
- Commutative ring definition
- Ideal definition
- Intersection definition
- Polynomial ring definition
- Ring homomorphism definition
- Subring definition
- Unit of a ring definition
- Zero divisor definition
- Union definition
- Addition of natural numbers definition
- Left coset definition
- Right coset definition
- Set-builder notation concept
- The successor function is injective statement
- Zero is not a successor statement
- Biconditional definition
- Existential quantifier definition
- Universal quantifier definition
- Linear independence definition
- Linear span definition
- Proof of the uniqueness of inverses proof
- Cartesian product definition
- Disjoint sets definition
- Divisibility in a commutative ring definition
- Two-sided ideal definition
- Group of units of a ring definition
- Degree of a polynomial definition
- Field definition
- Polynomial evaluation definition
- Proof of the commutativity of addition by induction proof
- Subset definition
- Integral domain definition
- Kernel of a ring homomorphism definition
- Ring isomorphism definition
- Order on the natural numbers definition
- Axiom of extensionality statement
- Union of a family of sets definition
- Uniqueness quantifier definition
- Spanning set definition
- Uniqueness of inverses statement
- Quotient ring definition
- Proof that the characteristic of an integral domain is zero or prime proof
- Binary relation definition
- Leading coefficient definition
- Finite field definition
- Proof of cancellation in an integral domain proof
- Root of a polynomial definition
- Evaluation homomorphism definition
- Subfield definition
- Partition of a set definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Basis definition
- Proof of the laws of exponents in a group proof
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Monic polynomial definition
- The characteristic of an integral domain is zero or prime statement
- Proof of the universal property of the quotient ring proof
- Multiplicity of a root definition
- Prime subfield definition
- Proof of the remainder theorem proof
- Proof of the degree of a product over an integral domain proof
- Field extension definition
- Split polynomial definition
- Cancellation in an integral domain statement
- Function definition
- Strong induction statement
- Equivalence relation definition
- Laws of exponents in a group statement
- Division algorithm for polynomials statement
- Universal property of the quotient ring statement
- Degree of a product statement
- Intermediate field definition
- Degree of a field extension definition
- Proof of the well-ordering principle from strong induction proof
- Codomain definition
- Injective function definition
- Order of an element definition
- Cyclic subgroup generated by an element definition
- Remainder theorem statement
- Proof that R[x] is an integral domain iff R is proof
- Field generated by adjoining elements definition
- Equivalence class definition
- Well-ordering principle statement
- Proof that a ring homomorphism is injective iff its kernel is zero proof
- Surjective function definition
- Proof of the factor theorem proof
- Proof of the division algorithm proof
- Proof that equivalence classes form a partition proof
- R[x] is an integral domain iff R is statement
- Bijective function definition
- Splitting field definition
- A ring homomorphism is injective iff its kernel is zero statement
- Division algorithm statement
- Factor theorem statement
- Equinumerous sets definition
- Equivalence classes form a partition statement
- Proof of the first isomorphism theorem for rings proof
- Proof that g to the n equals 1 iff the order divides n proof
- Cardinality definition
- First isomorphism theorem for rings statement
- Proof that a polynomial over a field has at most as many roots as its degree proof
- g to the n equals 1 iff the order divides n statement
- A polynomial over a field has at most as many roots as its degree statement
- Proof that the order of a finite field is a prime power proof
- Proof that cosets have the same cardinality as the subgroup proof
- Proof that the order of a cyclic subgroup equals the order of its generator proof
- The order of a finite field is a prime power statement
- Cosets have the same cardinality as the subgroup statement
- Order of a cyclic subgroup equals the order of its generator statement
- Proof of Lagrange's theorem proof
- Lagrange's theorem statement
- Proof that the order of an element divides the order of the group proof
- Order of an element divides the order of the group statement
- Proof that g to the order of the group is the identity proof
- g to the order of the group is the identity statement
- Proof that every element of a finite field of order q satisfies x^q = x proof
- Every element of a finite field of order q satisfies x^q = x statement
- Proof that a finite field of order q is the splitting field of x^q - x proof
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Finite_field, Existence and uniqueness
About this page
| Tag | SAMGPXF14S |
|---|---|
| URI | m2://SAMGPXF14S |
| Kind | proof |
| Writing | W0 stub |
| MSC | 12E20 |
| Proves | A finite field of order q is the splitting field of x^q - x |
| Uses | Finite field, The order of a finite field is a prime power, Prime subfield, Every element of a finite field of order q satisfies x^q = x, Split polynomial, Field generated by adjoining elements, Splitting field |
| Changed | 4 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.