Field theory and polynomials Theorem
Existence of finite fields of every prime power order
Builds on Existence of splitting fieldsFormal derivativeRepeated roots and the derivativeFinite field
Statement
Let be a prime number and let . Then there is a finite field of order .
Remarks
The proof: let be a splitting field of over . The derivative has no common root with , so has distinct roots in , by the criterion for repeated roots. The roots of form a subfield of , because and . This subfield has elements. So for each there is an irreducible polynomial of degree over .
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.
Reading path
To understand this page from the ground up, read these 60 pages in order. The foundations come first.
- Group concept
- Ring definition
- Commutative ring definition
- Ideal definition
- Polynomial ring definition
- Subring definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Ideal generated by a subset definition
- Maximal ideal definition
- Two-sided ideal definition
- Degree of a polynomial definition
- Field definition
- Formal derivative definition
- Polynomial evaluation definition
- Integral domain definition
- Principal ideal definition
- Quotient ring definition
- Associate elements definition
- Prime element definition
- The only ideals of a field are zero and the whole field statement
- Leading coefficient definition
- Subfield definition
- Finite field definition
- Irreducible element definition
- Field of fractions definition
- Root of a polynomial definition
- Euclidean domain definition
- Correspondence theorem for rings statement
- Greatest common divisor in an integral domain definition
- Principal ideal domain definition
- Irreducible polynomial definition
- Monic polynomial definition
- Field extension definition
- Degree of a product statement
- Split polynomial definition
- Unique factorisation domain definition
- Multiplicity of a root definition
- R/M is a field iff M is maximal statement
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Division algorithm for polynomials statement
- Content of a polynomial definition
- Degree of a field extension definition
- R[x] is an integral domain iff R is statement
- Intermediate field definition
- Repeated roots and the derivative statement
- Primitive polynomial definition
- Tower law statement
- K[x] is a Euclidean domain statement
- Field generated by adjoining elements definition
- K[x]/(f) is a field iff f is irreducible statement
- Product of primitive polynomials is primitive statement
- Splitting field definition
- Adjoining a root of a polynomial definition
- Gauss's lemma statement
- Polynomial ring over a UFD is a UFD statement
- Every polynomial has a root in some extension field statement
- Existence of splitting fields statement
- Existence of finite fields of every prime power order statement
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Finite_field, Existence and uniqueness
About this page
| Tag | 0T8M3YC5RG |
|---|---|
| URI | m2://0T8M3YC5RG |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 12E20 |
| Status | This copy of the site has no build data. Run m2 status 0T8M3YC5RG. |
| Uses | Existence of splitting fields, Formal derivative, Repeated roots and the derivative, Finite field |
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.