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.
Finite Fields and Cyclotomic Extensions: Examples and Counterexamples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- 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
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inclusion–Exclusion, the Pigeonhole Principle and Double Counting
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- 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
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The ZFC Axioms and the Basic Set Constructions
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
is cyclic of order three with no proper intermediate field
Example
Let and let be the class of . Then is a field of order , the squaring map generates
cyclic of order three, its two orbits on are
and has no intermediate field other than and .
Facts & Assumptions
Given: The polynomial , the ring and the class of , so that because and in characteristic two.
A polynomial of degree or over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
For a field and nonconstant , is irreducible if and only if is a field (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
If is algebraic over with minimal polynomial of degree , then has power basis and (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree , The degree of a finite field extension); a monic irreducible vanishing at is that minimal polynomial (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
An extension of finite fields of degree is Galois with cyclic of order , where , and (A finite extension of a finite field of order is Galois with cyclic Galois group generated by , The relative Frobenius of an extension of finite fields, For a degree- extension of a field of order , the -power map has order exactly , Finite fields and their order).
The intermediate fields of are the for the positive divisors of , one for each divisor (The intermediate fields of are the , one for each positive divisor of , Divisibility in : when for some integer ).
Verification
has no root in : and . By [L1] it is irreducible, so is a field by [L2].
is monic irreducible with , so it is the minimal polynomial of over and with power basis by [L3]; hence by [L4].
By [L4] the extension is Galois with Galois group generated by and of order three.
The orbit of : is ; ; and , using that squaring is additive in characteristic two. So is one orbit of size three.
The orbit of : , , and . So is the other orbit of size three, and together with and these account for all eight elements.
The positive divisors of three are and , so by [L5] the intermediate fields are exactly two: and itself. There is no field strictly between them.
Remarks
- Why the two nontrivial orbits have the same size. Each is an orbit of a group of prime order acting without fixed points outside : a fixed point of is an element with , and those are exactly the two elements of (The elements of a finite extension fixed by the -power map are exactly the base field).
The intermediate fields of match the divisors of twelve
Example
Let be a field with as a subfield and , so that . Its intermediate fields over are exactly
one for each of the six positive divisors of twelve, with exactly when divides . Neither of and contains the other, and
Facts & Assumptions
Given: A field with subfield and (The degree of a finite field extension); divisibility as in Divisibility in : when for some integer , with and as in Common divisor, and the greatest common divisor , with the convention and Common multiple, and the least common multiple , taken to be when or .
is Galois with cyclic Galois group generated by (A finite extension of a finite field of order is Galois with cyclic Galois group generated by ), and (For a degree- extension of a field of order , the -power map has order exactly , Finite fields and their order).
The intermediate fields of are exactly the for the positive divisors of , one for each divisor, with and if and only if (The intermediate fields of are the , one for each positive divisor of ).
A field of order has, for each positive divisor of , exactly one subfield of order , namely , and these are all of its subfields (The subfields of are the unique fields for positive divisors of ).
Every common divisor of two integers divides their greatest common divisor, and their least common multiple divides every common multiple (Every common divisor of and divides ; consequently exactly when , , , and every common divisor of and divides — a characterisation that holds at as well, Every common multiple of and is a multiple of , and ).
Verification
The positive divisors of twelve are , six in all, since a positive divisor of satisfies and direct inspection of leaves exactly these.
By [L1] and [L2] the intermediate fields of are the for those six , one for each, with exactly when .
Neither nor , so by step 2.1 neither of and contains the other.
Their intersection is an intermediate field of , being a subfield of containing , so it is for a unique divisor of by step 2.1; from and one gets and , so [L4] gives ; and and put inside both, so . Hence and the intersection is .
Their compositum is likewise an intermediate field , and it contains both, so and by step 2.1. Thus [L4] gives ; since , and the compositum is .
The same six fields are what [L3] produces for , whose order is : its subfields are the for the divisors of , and these are the sets named in [L2]. So the Galois indexing and the elementary one agree here.
Remarks
- Where the two descriptions coincide. Because the base field is the prime field, the divisors of and the divisors of are the same list; over a larger base field the two indexings differ by the factor , and The Galois description of the subfields of a finite field and the elementary divisibility criterion agree records the translation.
The divisor-sum identity at , finds exactly two monic irreducible cubics
Example
Over the divisor-sum identity ( for the counts of monic irreducibles of degree over ) at reads
and , so . The two monic irreducible cubics in are
Facts & Assumptions
Given: The field with two elements and the counts of monic irreducible polynomials of degree in (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
for every , the sum over the positive divisors of ( for the counts of monic irreducibles of degree over , Divisibility in : when for some integer ).
A polynomial of degree or over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
For a commutative ring , and : if and only if divides (Factor theorem over a commutative ring, Evaluation and roots of a polynomial in a commutative target ring).
Verification
The monic polynomials of degree one in are and , and each is irreducible, having degree one; so .
A monic cubic over is with , so there are eight of them. Such an has no root in exactly when and , that is exactly when and .
The positive divisors of are and , so [L1] at and reads ; with step 1.1 this gives and .
The pairs with in are and , so exactly two monic cubics have no root in , namely and ; by [L2] these two are irreducible and by [L2] and [L3] the other six are not, each having a root and hence a linear factor. This agrees with the count of step 2.1.
Remarks
- The identity is a recursion, not a formula. It determines only because is already known; at it would read and would need first.
The four roots of over are the Frobenius powers of any one of them
Example
Let and let be the class of , so . Then is a field of order , and the four conjugates of over ,
are pairwise distinct, are exactly the roots of in , and satisfy , so the Frobenius orbit closes at length four.
Facts & Assumptions
Given: The polynomial , the ring , and the class of , so since in characteristic two; squaring is additive there.
A polynomial of degree or over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
if and only if divides (Factor theorem over a commutative ring); and over an integral domain for nonzero (Over an integral domain, degrees add under multiplication of nonzero polynomials, Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
For a field and nonconstant , is irreducible if and only if is a field (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
A monic irreducible vanishing at is the minimal polynomial of (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element), and then has power basis with its degree (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree , The degree of a finite field extension).
An extension of finite fields of degree over is Galois with cyclic Galois group generated by , and has elements (A finite extension of a finite field of order is Galois with cyclic Galois group generated by , The relative Frobenius of an extension of finite fields, For a degree- extension of a field of order , the -power map has order exactly ).
A monic irreducible of degree over with a root has the distinct roots and (A monic irreducible of degree over has the distinct roots ).
Verification
has no root in , since and ; so by [L2] it has no factor of degree one.
The only monic irreducible quadratic in is : the four monic quadratics are , , and , and the first three have the root , and respectively, so [L1] leaves only the last.
is irreducible. A factorisation of into two nonconstant factors has degrees summing to four by [L2], so it is either , excluded by step 1.1, or ; and every monic quadratic factor would have to be irreducible, hence equal to by step 1.2, giving , which is not .
By [L3] the ring is a field; is monic irreducible with , so with power basis by [L4], and by [L5].
Compute the conjugates in that basis: by hypothesis, and . So the four elements have coordinate lists , , and , which are pairwise different, so the four elements are pairwise distinct.
, so the orbit closes after four steps.
By [L6] applied to , of degree four, the elements are exactly the roots of and in ; steps 4.1 and 5.1 verify the distinctness and the closing of the orbit directly.
A normal basis of over
Example
Let , a field of order , let be the class of , and let generate . Put
Then the conjugate list
is a normal basis of over (Normal bases of a finite Galois extension).
Not every element works. The generator itself does not: its conjugate list is , whose three members sum to , so they are linearly dependent over and are not a basis.
Facts & Assumptions
Given: The field with the class of , so and ; squaring is additive in characteristic two.
has no root in , so it is irreducible (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field) and is a field (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible); it is the minimal polynomial of (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element), so with power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree , The degree of a finite field extension).
A list of length is an ordered basis of if and only if every has exactly one coordinate list with (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, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
For a linear map with finite-dimensional, (Rank-nullity: ).
Every finite Galois extension with cyclic Galois group has a normal basis (Every finite cyclic extension has a normal basis).
Verification
By [L1] and [L2] the space is a three-dimensional -vector space with basis , and acts by .
The conjugate list of is with ; hence . A vanishing combination with all coefficients is nontrivial, so this list is linearly dependent over and is not a basis.
The conjugates of are , and .
The seven nonzero -combinations of are nonzero: the three single terms are , and ; the three pairwise sums are , and ; and the total sum is . None of these seven is , as each has a nonzero coordinate list in the basis .
So the -linear map sending to has trivial kernel by step 4.1; both spaces have dimension three by step 1.1, so [L4] makes surjective as well, hence bijective, and [L3] makes an ordered basis of over .
That list is the family of conjugates of under by step 3.1, so it is a normal basis, as [L5] guarantees exists for this cyclic extension.
Remarks
- A conjugate family of the right size can still fail. The list has three distinct members and is a single Galois orbit, yet it is not a basis; what fails is independence, not the orbit condition. The normal basis theorem asserts that some element works, never that every element does (FALSE: every basis of a finite field over a subfield is a normal basis).
is a normal basis of while is not
Example
The extension (The complex numbers as , with the real embedding and imaginary unit ) is finite Galois of degree two with (Real and imaginary parts, complex conjugation, and modulus). For it:
- the conjugate list is a normal basis (Normal bases of a finite Galois extension);
- is an -basis of that is not a conjugate list of any element;
- is the conjugate list of but is not a basis.
The last two show that the two conditions in the definition of a normal basis are independent of each other.
Facts & Assumptions
Given: The complex field with and conjugation for (Real and imaginary parts, complex conjugation, and modulus); in one has .
is a simple algebraic extension with power basis and ( has power basis and degree , The degree of a finite field extension).
Every field automorphism of fixing pointwise is either the identity or complex conjugation, and these two are distinct (The only real-field automorphisms of are the identity and complex conjugation, Relative field automorphisms and ).
Complex conjugation is a real-field automorphism (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
A finite extension with is Galois exactly when (Equivalent characterizations of a finite Galois extension, Finite Galois extensions and ).
A list of length is an ordered basis of if and only if every has exactly one coordinate list with respect to it (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, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis); and for a linear on a finite-dimensional (Rank-nullity: ).
Every finite Galois extension of an infinite field has a normal basis (Every finite Galois extension of an infinite field has a normal basis).
Verification
By [L2] and [L3] the group has exactly the two elements and conjugation, so its order is by [L1]; hence is finite Galois with that Galois group by [L4].
The conjugate list of is , whose members have coordinate lists and in the ordered basis of [L1]. For , vanishes exactly when and , hence when , that is and then .
is a basis by [L1], but no has conjugate list with underlying set : such a would lie in , and the set for is while for it is , neither of which is .
So the linear map sending to has trivial kernel; both spaces have dimension two by [L1], so [L5] makes it bijective and an ordered -basis of . Being the conjugate list of , it is a normal basis, in agreement with [L6].
is the conjugate list of , since , and its two members are distinct; but is a vanishing combination with nonzero coefficients, so the list is not independent and by [L5] is not a basis. With steps 3.1 and 2.2 this establishes all three claims.
FALSE: every basis of a finite field over a subfield is a normal basis
Statement
False claim. For every extension of finite fields, every -basis of is a normal basis (Normal bases of a finite Galois extension).
Facts & Assumptions
Given: The ring with the class of , so that because and in characteristic two.
A polynomial of degree or over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field); and is a field exactly when is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
A monic irreducible vanishing at is the minimal polynomial of (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element), and then has power basis with (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree , The degree of a finite field extension, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
An extension of finite fields of degree over is Galois with cyclic Galois group generated by , of order (A finite extension of a finite field of order is Galois with cyclic Galois group generated by , The relative Frobenius of an extension of finite fields, For a degree- extension of a field of order , the -power map has order exactly ).
A normal basis of is an ordered -basis of the form for a single , indexed by (Normal bases of a finite Galois extension).
Every finite Galois extension has a normal basis (Every finite Galois extension has a normal basis).
Refutation
has no root in , its values at and both being , so it is irreducible and is a field by [L1]; it is the minimal polynomial of , so with ordered basis by [L2], and has four elements .
By [L3] the extension is Galois with , where .
The conjugate lists of the four elements are , , and , using and . Their underlying sets are , and .
The list is an -basis of by step 1.1, but its underlying set is none of the three sets in step 3.1, so it is not the conjugate list of any element and hence is not a normal basis by [L4]. The false claim therefore fails already for .
What is true is the existential statement: some element of generates a normal basis, and does, since is a list of two distinct elements whose only vanishing -combinations are trivial, as , and . That is the content of [L5], which asserts existence and never universality.
Remarks
- Where the false claim comes from. The normal basis theorem is an existence statement, and its proofs single out an element by a nonvanishing condition — a determinant in the infinite case, a cyclic vector in the finite case. Both conditions genuinely exclude some elements, as A normal basis of over shows over .
through computed from the divisor recursion
Example
Running the recursion of The cyclotomic polynomials , defined by gives
each monic in , with degrees
matching (The unit group and Euler's totient for ).
Facts & Assumptions
Given: The recursion and (The cyclotomic polynomials , defined by , The sum over a finite index set, and its product form, Divisibility in : when for some integer ); and the elementary identity for .
For every , is monic in with and (The recursion defines a unique monic , of degree , Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
For a prime and , (, and is Eisenstein at ).
is an integral domain (A polynomial ring over an integral domain is an integral domain), so a nonzero factor may be cancelled; and division by a monic polynomial has a unique quotient and remainder (Division by a monic polynomial over a commutative ring).
and for a prime (, and for every prime ); (For a prime and , ); and for with prime divisors and , (Euler's product formula for , stated through a finite injective list of its prime divisors).
Verification
is the base clause of the recursion, of degree by [L4].
The prime powers among are , and [L2] gives their cyclotomic polynomials directly: , , , , , , and .
For : the positive divisors of are and those of are , so [L1] gives and ; dividing and using the given identity with , yields . Since and is nonzero, cancelling in by [L3] gives .
For : the divisors of are and those of are , so by [L1] and the given identity with , ; and , so cancelling gives .
For : the divisors of are and those of are , so by [L1] and the given identity with , ; and with , so cancelling gives .
The degrees read off the displayed polynomials are . By [L4] these are , , , , , , , , , , and , so every degree matches [L1].
Remarks
- Every division in the recursion is exact and stays over . That is not visible from the table and is not a coincidence of small : it is The recursion defines a unique monic , of degree , and it is what makes the recursion a definition rather than a computation that might fail.
is Eisenstein at seven
Example
The translated seventh cyclotomic polynomial is
Its leading coefficient is , every other coefficient is divisible by , and its constant term is not divisible by . So it satisfies Eisenstein's criterion at the prime , and therefore is irreducible over .
Facts & Assumptions
Given: The prime-power cyclotomic formula and the polynomial .
For a prime and , and is Eisenstein at (, and is Eisenstein at ).
Eisenstein's criterion: if a prime divides every non-leading coefficient of a polynomial in , does not divide the leading coefficient, and does not divide the constant term, then the polynomial is irreducible over (Eisenstein criterion over the integers).
Verification
Applying [L1] at and gives .
Therefore by the binomial theorem.
In the polynomial of step 2.1 the leading coefficient is , the remaining coefficients are all divisible by , and the constant term is not divisible by ; so [L2] applies at the prime .
Hence is irreducible over , and this is exactly the degree-one prime-power case of [L1].
Remarks
- Why this example matters later. The explicit coefficients are what the counterexample page uses when it says the Eisenstein route already proves irreducibility for prime-power cyclotomic polynomials before the general Dedekind argument is built.
has four roots in
Example
Over the fifth cyclotomic polynomial
splits into four distinct linear factors:
The four roots are exactly the primitive fifth roots of unity in .
Facts & Assumptions
Given: The field and the polynomial .
If , the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo ).
For , the image of in is generated by , so the extension degree is the order of modulo (For the image of in is generated by ).
Verification
In one has , so the order of modulo is . Hence [L1] and [L2] say every irreducible factor of over is linear, and the factors are distinct.
The powers of in are , , and , so the four nontrivial fifth roots of unity in are .
Each of is therefore a root of and is not , so each is a root of . Since is monic of degree , it follows that
The roots all have multiplicative order by step 1.2, so they are exactly the primitive fifth roots of unity in .
Remarks
- This is the order-one case of the finite-field factorisation theorem. When has order one modulo , every irreducible factor has degree one and the whole cyclotomic polynomial splits over the base field.
factors over into the two monic irreducible cubics
Example
Over one has
These are the two monic irreducible cubic factors, and over a splitting field the two factors correspond to the Frobenius orbits
of a primitive seventh root of unity .
Facts & Assumptions
Given: The field and a primitive seventh root of unity in a splitting field of .
If , the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo ).
For , the image of in is generated by (For the image of in is generated by ).
The roots of a monic irreducible polynomial of degree over are one Frobenius orbit (A monic irreducible of degree over has the distinct roots ).
Verification
In the class has order , since and , . So [L1] and [L2] say every irreducible factor of over is a distinct cubic.
The product of the two monic cubics is in . Since both factors are monic of degree , step 1.1 makes them the two irreducible factors of .
Frobenius acts by , so the orbit of is because , and the orbit of is because , and . These are the two size-three Frobenius orbits of primitive seventh roots, and [L3] identifies them as the respective root sets of the two irreducible cubic factors from step 2.1.
Remarks
- This is the degree-three case of the theorem, not a coincidence of cubics. The orbit size and the factor degree are both the order of modulo .
and its three quadratic subfields
Example
Let . Then
every nonidentity element has order two, and the three order-two subgroups have fixed fields
So has exactly three quadratic intermediate fields.
Facts & Assumptions
Given: A primitive twelfth root of unity and the automorphisms for .
and ( and ).
For a finite Galois extension , subgroups of correspond bijectively to intermediate fields, and the fixed field of a subgroup has degree (The fundamental theorem of finite Galois theory).
Verification
The units modulo are , since these are exactly the residue classes in coprime to . Their squares are , and , so every nonidentity element has order two.
Therefore is the Klein four-group, with three order-two subgroups: By [L1] and [L2], each fixed field has degree over .
The subgroup fixes , because . Since and the fixed field has degree by step 2.1, that fixed field is .
The subgroup fixes , because ; and since is a root of . So the fixed field contains , and again step 2.1 makes it exactly .
The subgroup fixes , because is complex conjugation. Moreover since . So the fixed field contains , and step 2.1 makes it exactly .
The three order-two subgroups of step 2.1 therefore yield the three quadratic intermediate fields , and , and there are no others because [L2] gives a bijection between subgroups and intermediate fields.
Remarks
- The same phenomenon already occurs at order eight. The field also has Klein four Galois group and three quadratic subfields. The order-twelve calculation is useful because its three fields are the familiar , and .
In characteristic three, and coincides with
Example
Let be a field of characteristic . Then
so has only the two distinct roots and rather than six.
Facts & Assumptions
Given: A field of characteristic .
For a fixed integer , in characteristic the only -th root of unity is , and (In characteristic the only -th root of unity is , and ).
Verification
Applying [L1] at and gives and .
Since and , one has . Conversely, if then , so and therefore or in the field ; hence .
If then , so by [L2]; step 1.1 gives , hence by [L2]. Thus .
Conversely, if then , so . Therefore .
Using step 1.1, so its only distinct roots are and , exactly the two elements of step 2.2.
Remarks
- This is why the characteristic hypothesis is load-bearing. The statement "" fails here for two different reasons at once: the polynomial is inseparable, and the extra cube roots never appear even after passing to a splitting field because the splitting field is already the base field.
is larger than although five and seven are coprime
Statement refuted
That the rational intersection theorem holds over every base field: that for every field and all positive integers with the characteristic of dividing neither,
The witness below takes , and , and realizes both splitting fields inside one fixed field of order . Since , the right-hand side is , while the intersection on the left is the common subfield .
Facts & Assumptions
Given: The base field and a field of order , which exists by For every prime and , a field with elements exists. The two cyclotomic splitting fields will be identified with their base-field-isomorphic copies inside .
For , the image of in is generated by , so the degree of is the order of modulo (For the image of in is generated by ).
The intermediate fields of are exactly the for the positive divisors of , one for each divisor, with exactly when (The intermediate fields of are the , one for each positive divisor of ).
is the splitting field of over (The cyclotomic extension as a splitting field of ).
Finite fields of the same order are isomorphic by an isomorphism fixing their common prime field (Finite fields of the same order are isomorphic).
Counterexample
In , the class has order , since and no smaller positive power of is congruent to modulo . So [L1] gives , hence this splitting field has order and [L5] lets us identify it over with the unique subfield of .
In , the powers of are , so has order . Thus [L1] gives , hence this splitting field has order and [L5] lets us identify it over with the unique subfield of .
Under the fixed identifications of steps 1.1 and 1.2, both and are subfields of by [L2], since and . Their intersection is then an intermediate field of , so by [L2] it is for some divisor of . Because the intersection lies in both fields, [L2] gives and , hence ; and since lies in both fields, [L2] gives . Therefore and
Since , the right-hand side of the refuted identity is , which is just because already splits over . So the claimed equality would read , which is false.
The refuted statement therefore fails over the base field , even though the rational theorem [L3] is true.
Remarks
- Why the rational hypothesis matters. Over finite fields the intersection is controlled by the gcd of the extension degrees, not by the gcd of the orders of the roots of unity.
FALSE: every cyclotomic polynomial has all coefficients in
Statement
False claim. Every coefficient of every cyclotomic polynomial lies in .
The failure first appears at : the coefficient of in is .
Facts & Assumptions
Given: The cyclotomic recursion for (The cyclotomic polynomials , defined by ).
For every , is a monic polynomial in and the displayed divisor recursion holds (The recursion defines a unique monic , of degree ).
Refutation
Running the divisor recursion for and truncating modulo gives The first congruence is the defining recursion with every factor of degree at least dropped modulo , and the second comes from expanding .
Step 1.1 shows that the coefficient of in is , and . So the false claim fails.
Remarks
- Why this is a real pattern and not a silly claim. For many small values of the coefficients do lie in , so the first counterexample is not visually obvious from the recursion alone.
FALSE: is irreducible over every field
Statement
False claim. For every field and every with the characteristic of not dividing , the image of in is irreducible.
What is true is different in two directions: over every is irreducible, but over a finite field the factor degree is governed by the order of the Frobenius class modulo .
Facts & Assumptions
Given: The rational irreducibility theorem and the finite-field factorisation theorem.
For every , the cyclotomic polynomial is irreducible in ( is irreducible in for every ).
If , the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo ).
Refutation
In one has , so the order of modulo is . Therefore [L2] says that over every irreducible factor of has degree .
Hence the reduction of in is a product of distinct linear factors, so it is reducible there. This contradicts the false claim.
The contradiction does not touch [L1]: irreducibility over is a theorem, but it does not persist over arbitrary base fields.
Remarks
- The finite-field theorem is the correct replacement. The question over is not "irreducible or not?" in the abstract, but "what is the order of modulo ?"
FALSE: has elements in every field
Statement
False claim. For every field and every , the group of -th roots of unity in has exactly elements.
The witness below shows two different failures: over there is no primitive cube root of unity in the field at all, while in characteristic the equation is inseparable and has only one root.
Facts & Assumptions
Given: The groups of roots of unity.
is cyclic of order dividing , and it has a primitive -th root of unity exactly when its order is ( is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is ).
( and ).
In characteristic the only -th root of unity is (In characteristic the only -th root of unity is , and ).
Refutation
If had three elements, then [L1] would give a primitive cube root of unity in . But then , contradicting [L2], which says this extension has degree . So does not have three elements.
If has characteristic , then [L3] gives , so again does not have three elements.
The false claim fails already at , both over and over every field of characteristic .
Remarks
- The two failures have different causes. Over the polynomial is separable but its nontrivial roots lie in a quadratic extension; in characteristic the polynomial itself collapses to .
FALSE: every finite abelian group is for some
Statement
False claim. For every finite abelian group there is an with
The obstruction is visible already at the level of cardinality: the cyclic group occurs as a Galois group over , but never as the Galois group of a cyclotomic field.
Facts & Assumptions
Given: Cyclotomic Galois groups and the theorem realising finite abelian groups over .
, so its order is ( and , The unit group and Euler's totient for ).
Every finite abelian group is the Galois group of some finite Galois extension of (Every finite abelian group is the Galois group of some finite Galois extension of ).
In a finite group, the order of every subgroup divides the order of the group (Lagrange's theorem: for every subgroup of a finite group ).
Refutation
For and , the group is trivial, so .
If , then the unit class in has order : one has , and because otherwise would divide , contrary to . Therefore [L3] makes the group order even.
Steps 1.1 and 1.2 show that is never . So no cyclotomic field has Galois group of order , and in particular none has Galois group isomorphic to .
By [L2], however, some finite Galois extension of does have Galois group . Hence the false claim fails.
Remarks
- What the true theorem says instead. The proved result is that every finite abelian group is the Galois group of a subfield of a cyclotomic field, not of the cyclotomic field itself.
A degree-three Galois extension of inside
Example
Let . Then the fixed field of the unique order-two subgroup of is
a degree-three Galois extension of with cyclic Galois group, and the element has minimal polynomial
Facts & Assumptions
Given: A primitive seventh root of unity .
and has order ( and ).
A finite cyclic group has exactly one subgroup of each order dividing its own (A finite cyclic group has exactly one subgroup of each order dividing its own).
For a finite Galois extension, subgroups correspond to intermediate fields, and the fixed field of a subgroup has degree equal to the subgroup index (The fundamental theorem of finite Galois theory).
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).
Under the finite Galois correspondence, a normal subgroup has a Galois fixed field and restriction gives (Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence).
Every finite group of prime order is cyclic (A finite group of prime order is cyclic and every nonidentity element generates it).
Verification
By [L1] the Galois group of is isomorphic to the finite subgroup of the unit group of the field , so [L4] makes it cyclic; its order is . Thus [L2] gives a unique subgroup of order , and [L3] makes its fixed field have degree .
The subgroup is generated by the class , so it acts by complex conjugation. Therefore is fixed by and lies in .
Put . Then Since , dividing by gives Substituting the expressions above yields
The element is not rational: if it were, then would satisfy the quadratic polynomial , which would force , contradicting [L1]. Since , the prime degree from step 1.1 leaves only the subfields and , so . Therefore the minimal polynomial of has degree , and the cubic from step 3.1 is that minimal polynomial.
The ambient Galois group is cyclic and hence abelian, so is normal. By [L5], the fixed field is Galois and is isomorphic to the quotient by , which has order . The group is cyclic by [L6], so is a cyclic cubic Galois extension.
Remarks
- This is the smallest nontrivial case of the subfield theorem. The subgroup lattice of has one index-two subgroup, and the fixed field is already visible through the real element .
Sources
- K. Conrad, Finite Fields (expository blurb), Examples 4.3-4.5
- J. S. Milne, Fields and Galois Theory, v5.10, Chapter 4, Finite fields
- K. Conrad, Finite Fields (expository blurb), Example 2.9
- J. S. Milne, Fields and Galois Theory, v5.10, Corollary 4.21
- K. Conrad, Roots and Irreducibles (expository blurb), Example 6.2
- K. Conrad, Finite Fields (expository blurb), Section 6
- K. Conrad, Finite Fields (expository blurb), Example 2.10
- K. Conrad, Roots and Irreducibles (expository blurb), Theorem 5.4
- K. Conrad, Linear Independence of Characters (expository blurb), Section 3
- J. S. Milne, Fields and Galois Theory, v5.10, the normal basis theorem
- K. Conrad, Linear Independence of Characters (expository blurb), Examples 3.1-3.3
- K. Conrad, Linear Independence of Characters (expository blurb), Example 3.1
- J. S. Milne, Fields and Galois Theory, v5.10, Definition 5.17 and the normal basis theorem
- K. Conrad, Cyclotomic Extensions (expository blurb), Example 5.1
- P. L. Clark, Field Theory (course notes/monograph), Section 9.1.2
- K. Conrad, Cyclotomic Extensions (expository blurb), Example 2.2
- J. S. Milne, Fields and Galois Theory, v5.10, Lemma 1.42
- K. Conrad, Cyclotomic Extensions (expository blurb), Example 5.5
- K. Conrad, Cyclotomic Extensions (expository blurb), Example 5.6
- K. Conrad, Cyclotomic Extensions (expository blurb), Sections 2-3
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 5.8 and the fundamental theorem
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 1
- P. L. Clark, Field Theory (course notes/monograph), Section 9.1.1
- K. Conrad, Cyclotomic Extensions (expository blurb), Example 3.3
- J. S. Milne, Fields and Galois Theory, v5.10, Proposition 4.23
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 5
- K. Conrad, Cyclotomic Extensions (expository blurb), Theorem 5.4 and Corollary 5.7
- P. L. Clark, Field Theory (course notes/monograph), Theorem 9.8
- P. L. Clark, Field Theory (course notes/monograph), Proposition 9.4
- P. L. Clark, Field Theory (course notes/monograph), Corollary 9.12
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 2
- K. Conrad, Linear Independence of Characters (expository blurb), Example 3.2