How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Algebraic Extensions, Extension Degree, and Finite Fields
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- The Fundamental Theorem of Finite Abelian Groups
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
A field extension is a vector space over its base, so the published theory of bases and dimension measures its size: a basis has a well-defined cardinality and every element has unique coordinates with respect to it. The published simple-extension theorem describes an element algebraic over the base by its minimal polynomial, presents the subfield it generates as a quotient of a polynomial ring, and reads the degree off a power basis. Splitting fields exist for every nonzero polynomial and are unique up to base isomorphism; the root bound for polynomials over a domain, the cyclicity of a finite subgroup of the units of a domain, and Euclid's lemma are the tools the finite-field arguments rest on.
The page defines the degree of an extension, proves the product-basis lemma and the tower law, and derives that finite extensions are algebraic, that finitely generated algebraic extensions are finite, that the elements algebraic over the base form a subfield, and that algebraicity is transitive; relative algebraic closure and a degree bound for composita follow. Prime subfields and the Frobenius endomorphism lead to finite fields: their orders are prime powers, their multiplicative groups are cyclic, and the roots of construct the unique field of each prime-power order. The page then proves the subfield lattice, the factorization of , existence of irreducibles in every degree, and simplicity of finite-field extensions, and ends with an explicitly algebraic notion of constructibility, its quadratic tower description, the power-of-two degree obstruction, and the cube-root-of-two counterexample.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The degree of a finite field extension
Definition
Let be a field extension. Scalar multiplication by , together with addition in , makes an -vector space. The extension is finite when this vector space is finite-dimensional. In that case its degree is
No numerical degree is assigned here to an infinite-dimensional extension.
A finite extension has degree one if and only if the two fields are equal
Statement
For a finite field extension ,
Facts & Assumptions
Given: A finite extension .
The degree is the dimension of as an -vector space (The degree of a finite field extension).
With respect to a one-element basis, every vector has a unique one-coordinate expression (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
Proof
Suppose and choose a one-element basis . By [L2], write with . Since , one has , so . Every is therefore of the form with , and hence lies in the embedded copy of .
Conversely, if , then is a basis of over itself, so [L1] gives .
Step 1.1 gives , while the extension already has , so .
Steps 1.1, 1.2, and 2.1 prove both directions.
Products of bases form a basis in a tower of finite extensions
Statement
Let be fields. If is an -basis of and is a -basis of , then
is an -basis of .
Facts & Assumptions
Given: A tower and the two finite bases in the Statement.
A basis is a linearly independent spanning set (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
Every vector has unique coordinates with respect to an ordered basis (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
Proof
For , use the -basis to write with , then use the -basis to write . Thus , so the products span over .
Suppose with . Grouping by gives . Independence of the makes every inner coefficient zero, and independence of the then makes every .
The products span and are independent, hence form an -basis.
Tower law for finite extensions:
Statement
Let be fields. If and are finite, then is finite and
Facts & Assumptions
Given: Finite extensions and .
Products of an -basis of and a -basis of form an -basis of (Products of bases form a basis in a tower of finite extensions).
Extension degree is the size of a finite basis (The degree of a finite field extension).
Proof
Choose bases of sizes and .
By [L1], their pairwise products form an -basis of .
Hence is finite and [L2] gives .
The degree of an intermediate field divides the degree of a finite extension
Statement
If and is finite, then and are finite and
Facts & Assumptions
Given: A tower with finite.
For finite subextensions the tower law is (Tower law for finite extensions: ).
Assuming the Axiom of Choice, if spans then there is a basis of with (Every spanning subset of a vector space contains a basis).
A linearly independent subset of a space spanned by vectors has at most elements (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with ).
Proof
Apply [L2] to the spanning set of the -vector space to obtain an -basis . This set is independent in the -space , so [L3] makes finite; hence is finite.
Any finite -basis of is also a finite -spanning set of . Applying [L2] over gives a finite -basis, so is finite.
The tower law [L1] now applies and writes as times the natural number , proving the divisibility.
Every finite field extension is algebraic
Statement
Every finite field extension is algebraic: each is a root of a nonzero polynomial in .
Facts & Assumptions
Given: A finite extension of degree and an element .
Degree means that has an -basis of size (The degree of a finite field extension).
Any vectors in a space spanned by vectors are linearly dependent (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with ).
An element is algebraic over when a nonzero polynomial in vanishes at it (Algebraic and transcendental elements and algebraic extensions).
Proof
The vectors lie in the -dimensional -space , so [L2] gives coefficients , not all zero, with .
The polynomial is nonzero and satisfies , so is algebraic by [L3].
Since was arbitrary, the extension is algebraic. The case cannot occur for a field extension because .
An element is algebraic over if and only if its simple extension is finite
Statement
For an element of an extension ,
If is algebraic with minimal polynomial of degree , then .
Facts & Assumptions
Given: A field extension and an element .
If is algebraic with minimal polynomial of degree , then is a basis of and its degree is (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Every element of a finite extension is algebraic over the base (Every finite field extension is algebraic).
Proof
If is algebraic, [L1] gives a finite power basis of and the stated degree.
Conversely, if is finite, [L2] says every element of , in particular , is algebraic over .
These are the two implications of the equivalence.
Finitely generated field extensions
Definition
Let be a field extension and let . The notation
means the smallest subfield of containing and all the . An extension is finitely generated when for some finite list. For the empty list, .
An extension generated by finitely many algebraic elements is finite
Statement
If are algebraic over , then is finite.
Facts & Assumptions
Given: A field extension containing elements algebraic over .
The field is obtained by adjoining the finite list of generators (Finitely generated field extensions ).
An algebraic element generates a finite simple extension (An element is algebraic over if and only if its simple extension is finite).
Degrees multiply in a finite tower (Tower law for finite extensions: ).
An element algebraic over satisfies a nonzero polynomial in (Algebraic and transcendental elements and algebraic extensions).
Proof
Put and for . By [L4], the nonzero polynomial over satisfied by also belongs to , so is algebraic over . Thus [L2] makes finite.
Repeated application of [L3] makes finite, with degree equal to the product of the simple-step degrees.
By [L1], . If , this is of degree one, so the boundary case also holds.
The elements of an extension algebraic over the base field form a subfield
Statement
For a field extension , the set
is a subfield of containing .
Facts & Assumptions
Given: A field extension and algebraic elements .
A field generated by finitely many algebraic elements is finite over the base (An extension generated by finitely many algebraic elements is finite).
Every element of a finite extension is algebraic over the base (Every finite field extension is algebraic).
A subset containing and closed under subtraction, multiplication, and inverses of nonzero elements is a subfield (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).
Algebraic means annihilated by a nonzero polynomial over the base field (Algebraic and transcendental elements and algebraic extensions).
Proof
Every is algebraic over , since it is a root of , so and in particular .
By [L1], is finite. Thus [L2] makes all of its elements algebraic over , including and .
If , then and is algebraic by the same argument.
Therefore satisfies the subfield criterion [L3] and is a subfield containing .
The relative algebraic closure of in an extension
Definition
For a field extension , the relative algebraic closure of in is
By The elements of an extension algebraic over the base field form a subfield, this set is a subfield of containing .
Algebraicity is transitive in towers of field extensions
Statement
If , the extension is algebraic, and is algebraic, then is algebraic.
Facts & Assumptions
Given: A tower with and algebraic, and an element .
Finitely many algebraic generators produce a finite extension (An extension generated by finitely many algebraic elements is finite).
An algebraic element generates a finite simple extension (An element is algebraic over if and only if its simple extension is finite).
Finite degrees multiply in a tower (Tower law for finite extensions: ).
Every finite extension is algebraic (Every finite field extension is algebraic).
Algebraicity means satisfying a nonzero polynomial over the base (Algebraic and transcendental elements and algebraic extensions).
Proof
Since is algebraic over , choose a nonzero polynomial with value zero at .
Every coefficient is algebraic over . Hence is finite over by [L1].
The same polynomial lies in , so is algebraic over and [L2] makes finite. The tower law [L3] makes finite.
By [L4], is algebraic over . Since was arbitrary, is algebraic.
The relative algebraic closure of in has no further algebraic elements inside
Statement
Let . If is algebraic over , then . Equivalently, is relatively algebraically closed in .
Facts & Assumptions
Given: A field extension , its relative algebraic closure , and an element algebraic over .
The field consists exactly of the elements of algebraic over (The relative algebraic closure of in an extension ).
Algebraicity is transitive in towers of field extensions (Algebraicity is transitive in towers of field extensions).
An algebraic element generates a finite simple extension (An element is algebraic over if and only if its simple extension is finite).
Every finite extension is algebraic (Every finite field extension is algebraic).
Proof
By [L1], every element of is algebraic over , so is algebraic.
The element is algebraic over by hypothesis, so [L3] makes finite and [L4] makes it algebraic. Applying [L2] to shows that is algebraic over .
By [L1], an element of algebraic over belongs to , hence .
For finite subextensions in a common field,
Statement
Let and be finite subextensions of a common field. Then their compositum is finite and
Facts & Assumptions
Given: Finite subextensions and inside a field .
The compositum is the smallest subfield of containing (The composite of two subfields is the subfield generated by their union).
Extension degree is the size of a finite basis (The degree of a finite field extension).
Assuming the Axiom of Choice, if spans then there is a basis of with (Every spanning subset of a vector space contains a basis).
Every finite extension is algebraic (Every finite field extension is algebraic).
A field generated by finitely many algebraic elements is finite over the base (An extension generated by finitely many algebraic elements is finite).
Proof
Choose -bases of and of . The -span of the products contains and and is closed under addition and multiplication, because products are reduced separately in the two bases.
By [L4], every and is algebraic over , so [L5] makes finite over . Every is therefore algebraic over .
If , take a nonzero annihilating polynomial, factor out its largest power of , and cancel the corresponding nonzero power of in the ambient field. This gives with . Then , so is a field.
Since is a field containing , [L1] gives ; the reverse inclusion is clear from the product span, so .
The products span . By [L3] they contain a basis of at most elements, so [L2] yields .
The prime subfield as the intersection of all subfields
Definition
Let be a field. Its prime subfield is
The family is nonempty because it contains . Its intersection is a subfield: every member contains and and is closed under subtraction, multiplication, and inversion of nonzero elements, so the intersection has the same properties. It is the unique smallest subfield of .
The characteristic of a field is zero or a prime number
Statement
The characteristic of a field is either or a prime number.
Facts & Assumptions
Given: A field .
If the set of positive with is nonempty, the characteristic is its least element; otherwise it is (The characteristic of a ring: the least with when one exists, and otherwise).
A natural number greater than is prime exactly when it has no factorization into two natural numbers strictly between and itself (Prime and composite integers: is prime when and its only positive divisors are and ).
A field is an integral domain, so a product of two nonzero elements cannot be zero (Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring).
Proof
If no positive multiple of is zero, [L1] gives characteristic . Otherwise write . Since , one has .
Suppose, for contradiction, that this positive is not prime. By [L2], write with and .
Minimality of gives and , while their product is . This contradicts [L3].
Therefore the positive characteristic is prime, completing both cases.
A field's prime subfield is isomorphic to in characteristic zero and to in characteristic
Statement
Let be the prime subfield of a field .
- If , then is isomorphic to .
- If , then is isomorphic to .
Each isomorphism sends to .
Facts & Assumptions
Given: A field and its prime subfield .
The prime subfield is the intersection of all subfields of and hence the smallest one (The prime subfield as the intersection of all subfields).
The characteristic of is zero or prime (The characteristic of a field is zero or a prime number).
For prime , the quotient is a field (For every prime , the two operations on make it a field).
The rational numbers form a field (The rationals form a field).
A field homomorphism preserves addition, multiplication and (Field homomorphism and embedding); it is therefore injective, its kernel being an ideal of a field that does not contain .
Proof
Suppose . The map given by is well defined, is a field homomorphism, and is injective; its image is a subfield contained in every subfield of .
Suppose . The map , , is injective. Sending a rational class with to is well defined and gives an injective field homomorphism .
By [L1], that image equals , proving the first classification.
Its image is a subfield and every subfield of contains all integer multiples of and their nonzero quotients. Hence the image is contained in every subfield and equals by [L1].
Steps 2.1 and 2.2 exhaust the alternatives in [L2].
The binomial theorem over an arbitrary commutative ring
Statement
Let be a commutative ring. For all and ,
The natural-number coefficients act by repeated addition. The formula includes .
Facts & Assumptions
Given: A commutative ring , elements , and a natural number .
Multiplication in a commutative ring is commutative and distributes over addition (Commutative ring).
The binomial coefficient counts the -element subsets of an -element set, with (The set of -element subsets and the binomial coefficient ).
Natural powers satisfy and (Powers : natural exponents in a monoid and integer exponents in a group, with ).
Pascal's identity is (Pascal's rule , and the hockey-stick identity ).
Proof
For , both sides are : the left by [L3], and the right is the sole term .
Assume the formula holds for .
Multiply the inductive formula by , distribute using [L1], and reindex to obtain the coefficient on for each interior .
By [L4] these interior coefficients are , and [L2] supplies the two endpoint coefficients . Thus the formula holds for .
Induction proves the identity for every natural .
A prime divides for
Statement
If is prime and , then
Facts & Assumptions
Given: A prime and a natural number with .
Binomial coefficients are natural numbers (The set of -element subsets and the binomial coefficient ).
The closed formula gives for ( for ; hence , the quotient is a natural number, and ).
A prime has no positive divisor strictly between and itself (Prime and composite integers: is prime when and its only positive divisors are and ).
If a prime divides a product of integers, it divides one of the factors (Euclid's lemma: if is prime and then or ).
Proof
Applying [L2] to and and cancelling the common nonzero factorial factors yields the integer identity .
Thus divides . Since , [L3] gives .
Euclid's lemma [L4] therefore forces . The excluded endpoints have coefficient and are not part of the claim.
Frobenius is an injective endomorphism in characteristic , and an automorphism for finite fields
Statement
Let be a field of characteristic . The Frobenius map
is an injective field endomorphism. If is finite, it is an automorphism. Its -fold iterate is .
Facts & Assumptions
Given: A field of positive characteristic .
The binomial theorem holds in every commutative ring (The binomial theorem over an arbitrary commutative ring).
For , the prime divides (A prime divides for ).
A positive field characteristic is prime (The characteristic of a field is zero or a prime number).
A field homomorphism preserves addition, multiplication, and (Field homomorphism and embedding).
An injection from a finite set to itself is a bijection (A subset of a finite set is finite, with , and equality holds if and only if ).
Proof
By [L1] and [L2], all intermediate terms in have coefficients divisible by and hence vanish in , so .
Commutativity gives , and , so Frobenius is an endomorphism by [L4].
If , then step 1.1 gives . A field has no nonzero nilpotents, so and the map is injective.
If is finite, [L5] turns this injection into a bijection, hence an automorphism.
Iterating and using gives , including as the identity.
Finite fields and their order
Definition
A finite field is a field whose underlying set is finite. Its order is its finite cardinality, written .
Once existence and uniqueness are proved, denotes a field of order up to isomorphism. The notation does not assert that the field is the quotient ring .
Every finite field has order for a unique prime characteristic and positive integer
Statement
If is a finite field, then there is a unique prime and a unique positive integer such that
Here and .
Facts & Assumptions
Given: A finite field .
The order of a finite field is the cardinality of its underlying finite set (Finite fields and their order).
The prime subfield in positive characteristic is isomorphic to (A field's prime subfield is isomorphic to in characteristic zero and to in characteristic ).
Extension degree is the size of a finite basis (The degree of a finite field extension).
Assuming the Axiom of Choice, if spans then there is a basis of with (Every spanning subset of a vector space contains a basis).
Coordinates with respect to a finite ordered basis are unique (A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis).
The set of functions from an -element set to a -element set has cardinality (The set of functions between finite sets is finite, with , Exponentiation of natural numbers, , and its agreement with the integer power in ).
If a prime divides a finite product of integers, it divides one of the factors (If a prime divides a finite product of integers then for some ; at the product is and the hypothesis cannot hold).
Proof
The characteristic cannot be zero, because the distinct integer multiples of would give infinitely many elements. Hence it is a unique prime , and [L2] identifies the prime subfield with .
The finite set spans itself over , so [L4] supplies a finite basis. Its size is positive because is not the zero vector space.
By [L5], taking coordinates is a bijection from to the functions from an -element basis index set to . Thus [L6] gives .
Steps 1.1 and 1.2 exhibit the pair with and . For uniqueness, suppose also with prime and . Then divides , so [L7] gives , and primality of forces . Now with forces , since would give and symmetrically for .
The multiplicative group of a finite field is cyclic
Statement
The multiplicative group of every finite field is cyclic.
Facts & Assumptions
Given: A finite field .
A finite field has a finite underlying set (Finite fields and their order).
Every field is an integral domain, and its nonzero elements are its units (Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring).
Every finite subgroup of the unit group of an integral domain is cyclic (Every finite subgroup of the unit group of an integral domain is cyclic).
Proof
By [L2], is the unit group of the integral domain . It is finite by [L1].
Apply [L3] to the finite subgroup of itself to conclude that it is cyclic.
In characteristic , the roots of form a subfield and are all simple
Statement
Let be a field of characteristic , let , and put . Then
is a subfield of . Every root of is simple.
Facts & Assumptions
Given: A field of characteristic , a positive integer , and .
The -fold Frobenius iterate is an injective field endomorphism (Frobenius is an injective endomorphism in characteristic , and an automorphism for finite fields).
A subset containing and closed under subtraction, multiplication, and inverses of nonzero elements is a subfield (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).
The formal derivative of is (The formal derivative of a polynomial).
A root is repeated if and only if the derivative also vanishes there (A root is repeated exactly when it is also a root of the formal derivative).
Proof
The elements and lie in . Since the map is a field endomorphism by [L1], if then and .
By [L3], the derivative of is , because is zero in characteristic . It vanishes nowhere.
If , then , so . Thus [L2] makes a subfield.
Hence [L4] says every root of is simple.
For every prime and , a field with elements exists
Statement
For every prime and every integer , there exists a field with exactly elements.
Facts & Assumptions
Given: A prime , a positive integer , and .
In characteristic , the roots of in a field form a subfield and are all simple (In characteristic , the roots of form a subfield and are all simple).
Every nonzero polynomial over a field has a splitting field (Every nonzero polynomial over a field has a splitting field).
The quotient is a field (For every prime , the two operations on make it a field).
A splitting field is generated over the base by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
A field with finite underlying set is a finite field and its order is its cardinality (Finite fields and their order).
Proof
Over the field from [L3], use [L2] to choose a splitting field of .
Let be the root set of in . By [L1], is a subfield of and all roots are simple. By [L4], the roots generate , while the subfield already contains them and the base; hence .
The degree- polynomial splits in and has no repeated roots, so it has exactly distinct roots. Thus .
By [L5], is the required finite field.
A field with elements is the splitting field of over its prime subfield
Statement
If is a field with elements, then every satisfies , and is the splitting field of over its prime subfield.
Facts & Assumptions
Given: A finite field of order .
The group is cyclic (The multiplicative group of a finite field is cyclic).
A splitting field is generated over the base by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
A nonzero degree- polynomial over a domain has at most distinct roots (A nonzero polynomial of degree over an integral domain has at most distinct roots).
Proof
The cyclic group has order , so every nonzero satisfies and hence . The equality also holds for .
Thus all elements of are roots of . By [L4] there are no other distinct roots in any extension, so the polynomial splits into its linear factors over .
The set of roots is all of , so it generates over its prime subfield. By [L3], is the splitting field.
Finite fields of the same order are isomorphic
Statement
Any two finite fields with the same order are isomorphic. More precisely, after identifying their prime subfields with , there is an isomorphism fixing pointwise. The isomorphism need not be unique.
Facts & Assumptions
Given: Finite fields and with .
Every finite field has prime-power order with base equal to its characteristic prime (Every finite field has order for a unique prime characteristic and positive integer ).
A field of order is a splitting field of over its prime subfield (A field with elements is the splitting field of over its prime subfield).
Two splitting fields of the same nonzero polynomial over a base field are isomorphic by an isomorphism fixing the base (Any two splitting fields of a polynomial are isomorphic over the base field).
The prime subfield of a characteristic- field is isomorphic to (A field's prime subfield is isomorphic to in characteristic zero and to in characteristic ).
Canonical prime factorisation makes the prime in a positive prime-power representation unique (For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list).
Proof
By [L1], each field has prime-power order with base equal to its characteristic prime. Since the orders are the same, [L5] makes these primes equal, say to . Use [L4] to identify both prime subfields with one copy of .
By [L2], and are splitting fields of the same polynomial over this base.
Apply [L3] to obtain a base-fixing field isomorphism . Splitting-field uniqueness asserts existence, not uniqueness, so no stronger claim follows.
The subfields of are the unique fields for positive divisors of
Statement
Let be a field of order . For each positive divisor of , has exactly one subfield of order , namely
These are all the subfields of .
Facts & Assumptions
Given: A finite field of order .
Finite degrees multiply in a tower (Tower law for finite extensions: ).
A finite field has prime-power order, and its exponent is its degree over the prime field (Every finite field has order for a unique prime characteristic and positive integer ).
The roots of form a subfield and are simple (In characteristic , the roots of form a subfield and are all simple).
A field of order is the full root set and splitting field of (A field with elements is the splitting field of over its prime subfield).
Proof
If is a subfield, [L2] gives and degrees , . The tower law [L1] gives .
Now let and write . In characteristic , put . The identity shows inductively that divides .
By [L4], splits in . Hence its degree- divisor from step 1.2 splits there too. By [L3], its roots are distinct and form the subfield , so .
If has order , every element of satisfies by [L4], so . Both sets have elements, hence .
Steps 1.1 and 2.1 give existence exactly for positive divisors of , and step 3.1 gives uniqueness and exhausts all subfields.
Over , is the product of all monic irreducibles whose degrees divide
Statement
Let be a finite field and let . In ,
where each monic irreducible occurs once.
Facts & Assumptions
Given: A finite field and a positive integer .
The order of a finite field is a prime power; write with (Every finite field has order for a unique prime characteristic and positive integer ).
For every prime and positive integer , a field of order exists (For every prime and , a field with elements exists).
A field of order is the full root set and a splitting field of (A field with elements is the splitting field of over its prime subfield).
The subfields of a field of order have orders with (The subfields of are the unique fields for positive divisors of ).
If an algebraic element has minimal polynomial of degree , its simple extension has degree and the corresponding power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Every nonzero nonunit polynomial over a field factors into irreducibles (Every nonzero nonunit polynomial over a field factors into irreducible polynomials).
A root is repeated exactly when the formal derivative also vanishes there (A root is repeated exactly when it is also a root of the formal derivative).
A polynomial of degree at least one over a field has a root in some field extension (Kronecker's one-root step: adjoining a root removes a linear factor and lowers the remaining degree).
For an algebraic element there is a unique monic irreducible with , and for every one has exactly when (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Proof
By [L1], write . Use [L2] to choose a field of order . By [L3], is the full root set and a splitting field of .
Let be monic irreducible of degree . By [L8] it has a root in some extension of ; since is monic irreducible and annihilates , the uniqueness in [L9] makes the minimal polynomial of . By [L5], has degree over and hence has elements.
The derivative of is , which vanishes nowhere. Every irreducible factor of has a root in the splitting field of step 1.1, and a repeated factor would make that root repeated; so [L7] shows that no irreducible factor repeats.
If , write . Applied to the field , [L3] gives ; iterating this identity times gives . So vanishes at , and since is its minimal polynomial by step 1.2, [L9] gives .
Conversely, if divides , choose its root in the splitting field from step 1.1. Then is a subfield of with order , so [L4] gives , and cancellation yields .
Factor the polynomial by [L6]. Steps 2.2 and 2.3 identify exactly the monic irreducible factors, and step 2.1 gives multiplicity one. Since both sides are monic, their unit factors agree, proving the formula.
For every finite field and every , a monic irreducible polynomial of degree exists
Statement
For every finite field and every integer , there exists a monic irreducible polynomial in of degree .
Facts & Assumptions
Given: A finite field and a positive integer .
The order of a finite field is a prime power; write (Every finite field has order for a unique prime characteristic and positive integer ).
A field of order exists (For every prime and , a field with elements exists).
The group is cyclic (The multiplicative group of a finite field is cyclic).
Since , a field of order has a unique subfield of order (The subfields of are the unique fields for positive divisors of ).
Finite fields of the same order are isomorphic (Finite fields of the same order are isomorphic).
An algebraic element's monic irreducible minimal polynomial has degree equal to the degree of its simple extension (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
An element is algebraic over a base field when some nonzero polynomial over that field vanishes at it (Algebraic and transcendental elements and algebraic extensions).
Proof
By [L1], write . Choose by [L2] a field of order , and by [L3] a generator of the cyclic group , whose order is .
By [L4] and [L5], identify the unique order- subfield of with the given . Since is finite, the powers cannot be pairwise distinct, so for some and is a root of the nonzero polynomial ; by [L7], is algebraic over . Let be its minimal polynomial over that subfield and put . Then has elements by [L6] and is a subfield of , so .
Suppose, for contradiction, that . Then is a proper subfield whose multiplicative group has only elements and cannot contain an element of order . This contradicts the choice of .
Therefore , and is the required monic irreducible polynomial.
Every finite extension of a finite field is simple
Statement
Every finite-degree extension of a finite field is simple: there exists with .
Facts & Assumptions
Given: A finite field and a finite extension of degree .
The multiplicative group of a finite field is cyclic (The multiplicative group of a finite field is cyclic).
Degree gives a finite basis of over (The degree of a finite field extension).
The functions from an -element set to a finite set form a finite set (The set of functions between finite sets is finite, with ).
The subfield is the smallest subfield containing and , and an extension equal to such a field is simple (Field extensions, generated subrings , generated subfields , and simple extensions).
Proof
Coordinates in a finite basis identify with a finite set of functions from an -element index set to , so is a finite field.
By [L1], choose a generator of the cyclic group .
The subfield contains , , and every power of , hence all of and therefore all of . Thus by [L4].
The chosen exhibits the extension as simple.
Algebraically constructible real numbers as the smallest real subfield closed under positive square roots
Definition
Let be the intersection of all subfields such that and
This family is nonempty because belongs to it, and the intersection is again a subfield with the same square-root closure. A real number is algebraically constructible when it belongs to .
This is an algebraic definition. It does not assert an equivalence with a physical straightedge-and-compass model.
A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions
Statement
A real number is algebraically constructible if and only if there is a tower
with and, for every , an element with such that
The tower may have length zero.
Facts & Assumptions
Given: The algebraically constructible field .
The field is the smallest real subfield containing and closed under positive square roots (Algebraically constructible real numbers as the smallest real subfield closed under positive square roots).
An element algebraic over a field generates a finite simple extension, with degree equal to its minimal-polynomial degree (An element is algebraic over if and only if its simple extension is finite).
Every positive real element has a unique positive square root (Square roots exist: a unique with ; the positives are ).
The minimal polynomial of an algebraic element divides every polynomial over the base field vanishing at it (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Proof
Let be the union of all terminal fields of finite towers obtained from by adjoining positive square roots, omitting any adjunction whose square root is already present. The empty tower puts in .
Conversely, induction along any such tower shows : the base lies in , and square-root closure puts each generator and hence its generated field in . Thus .
If , append the generators of their two towers to one another. Any redundant adjunction is omitted; every remaining step has degree , because its generator is a root of over the base, so by [L4] its minimal polynomial divides and has degree at most , while degree would put in the base, which the omission of redundant adjunctions excludes; [L2] then gives . Thus , , and for lie in a common terminal field, so is a subfield.
If , append to a tower containing , or do nothing if it is already present. Hence is closed under positive square roots. By minimality in [L1], .
Therefore . Membership in is exactly the existence of a displayed finite quadratic tower, including the zero-length case.
An algebraically constructible real algebraic number has degree over equal to a power of two
Statement
If a real algebraic number is algebraically constructible, then
for some .
Facts & Assumptions
Given: A real algebraic, algebraically constructible number .
The element lies in a finite tower of quadratic extensions beginning at (A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions).
Degrees multiply in finite towers (Tower law for finite extensions: ).
The degree of an intermediate field divides the total finite degree (The degree of an intermediate field divides the degree of a finite extension).
Prime factorization is unique, so a positive divisor of a power of is itself a power of (For and any injective list of primes containing every prime divisor of , one has ; the exponents are determined by , and for every prime outside the list).
Proof
Choose from [L1] a tower with and every step degree .
Repeated application of [L2] gives .
The simple field is intermediate between and , so [L3] says its degree divides .
By [L4], that positive divisor is for some .
The real cube root of two is algebraic but not algebraically constructible
Statement refuted
Every real algebraic number is algebraically constructible.
Facts & Assumptions
Given: The unique positive real number .
A constructible real algebraic number has degree over equal to a power of (An algebraically constructible real algebraic number has degree over equal to a power of two).
Eisenstein's criterion proves a primitive integer polynomial irreducible when one prime divides every nonleading coefficient, its square does not divide the constant coefficient, and it does not divide the leading coefficient (Eisenstein criterion over the integers).
The degree of a simple algebraic extension equals the degree of the element's minimal polynomial (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Every nonnegative real has a unique nonnegative -th root for (Existence and uniqueness of -th roots: a unique with ).
Counterexample
By [L4], the real number exists and satisfies , so it is algebraic over .
The polynomial is Eisenstein at , so [L2] makes it irreducible over . Hence [L3] gives .
Suppose, for contradiction, that is algebraically constructible. Then [L1] makes its degree a power of , contrary to step 2.1 because is odd and greater than .
Therefore is algebraic but not algebraically constructible, refuting the universal statement.
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.
- A. W. Knapp, Basic Algebra, 2nd ed., Chapter IX, Section 1
- A. W. Knapp, Basic Algebra, 2nd ed., Chapter IX, Section 3
- K. Conrad, Finite Fields, Sections 1-2
- J. S. Milne, Fields and Galois Theory, Propositions 4.19-4.24
- K. Conrad, Finite Fields, Section 1
- K. Conrad, Finite Fields, Theorem 1.6
- K. Conrad, Finite Fields, Section 2
- K. Conrad, Finite Fields, Theorem 2.5
- K. Conrad, Finite Fields, Theorem 2.8
- K. Conrad, Finite Fields, Appendix A
- A. W. Knapp, Basic Algebra, 2nd ed., Chapter IX, Section 5
- J. S. Milne, Fields and Galois Theory, Theorem 1.37 through consequence 1.41
- J. S. Milne, Fields and Galois Theory, consequence 1.41