Alphabeta Math
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.

✓ 19 results · all verified · 13 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Finite Fields and Cyclotomic Extensions: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Gal⁡(F8/F2) is cyclic of order three with no proper intermediate field

Example

Let K:=F2[t]/(t3+t+1) and let α be the class of t. Then K is a field of order 8, the squaring map σ(x)=x2 generates

Gal⁡(K/F2)={id,σ,σ2},

cyclic of order three, its two orbits on K∖F2 are

{α, α2, α2+α}and{α+1, α2+1, α2+α+1},

and K/F2 has no intermediate field other than F2 and K.

Facts & Assumptions

Given: The polynomial π:=t3+t+1∈F2[t], the ring K=F2[t]/(π) and the class α of t, so that α3=α+1 because α3+α+1=0 and −1=1 in characteristic two.

[L1]

A polynomial of degree 2 or 3 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).

[L2]

For a field F and nonconstant p∈F[x], p is irreducible if and only if F[x]/(p) is a field (For a nonconstant p in F[x], the ideal (p) is maximal and F[x]/(p) is a field exactly when p is irreducible).

[L3]

If a is algebraic over F with minimal polynomial ma of degree n, then F(a) has power basis 1,a,…,an−1 and [F(a):F]=n (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n, The degree [K:F]=dim⁡FK of a finite field extension); a monic irreducible vanishing at a is that minimal polynomial (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[L4]

An extension E/Fq of finite fields of degree n is Galois with Gal⁡(E/Fq)=⟨σq⟩ cyclic of order n, where σq(x)=xq, and ∣E∣=qn (A finite extension of a finite field of order q is Galois with cyclic Galois group generated by x↦xq, The relative Frobenius x↦xq of an extension of finite fields, For a degree-n extension of a field of order q, the q-power map has order exactly n, Finite fields and their order).

[L5]

The intermediate fields of Fqn/Fq are the Fqd for the positive divisors d of n, one for each divisor (The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n, Divisibility in Z: d∣a when a=dq for some integer q).

Verification

technique · direct
1.1L1L2given

π has no root in F2: π(0)=1 and π(1)=1+1+1=1. By [L1] it is irreducible, so K is a field by [L2].

2.1step 1.1L3L4

π is monic irreducible with π(α)=0, so it is the minimal polynomial of α over F2 and [K:F2]=3 with power basis 1,α,α2 by [L3]; hence ∣K∣=23=8 by [L4].

3.1step 2.1L4

By [L4] the extension K/F2 is Galois with Galois group generated by σ(x)=x2 and of order three.

4.1step 2.1step 3.1given

The orbit of α: α2 is α2; α4=α⋅α3=α(α+1)=α2+α; and (α2+α)2=α4+α2=(α2+α)+α2=α, using that squaring is additive in characteristic two. So {α,α2,α2+α} is one orbit of size three.

5.1step 2.1step 3.1step 4.1given

The orbit of α+1: (α+1)2=α2+1, (α2+1)2=α4+1=α2+α+1, and (α2+α+1)2=α4+α2+1=α+1. So {α+1,α2+1,α2+α+1} is the other orbit of size three, and together with {0} and {1} these account for all eight elements.

6.1step 2.1step 3.1L5∎

The positive divisors of three are 1 and 3, so by [L5] the intermediate fields are exactly two: F2 and K itself. There is no field strictly between them.

Remarks

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The intermediate fields of F212/F2 match the divisors of twelve

Example

Let E be a field with F2 as a subfield and [E:F2]=12, so that ∣E∣=212. Its intermediate fields over F2 are exactly

F2,F22,F23,F24,F26,F212=E,

one for each of the six positive divisors 1,2,3,4,6,12 of twelve, with F2d⊆F2e exactly when d divides e. Neither of F24 and F26 contains the other, and

F24∩F26=F22,F24 F26=F212.

Facts & Assumptions

[L2]

The intermediate fields of Fqn/Fq are exactly the Fqd={x:xqd=x} for the positive divisors d of n, one for each divisor, with [Fqd:Fq]=d and Fqd⊆Fqe if and only if d∣e (The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n).

[L3]

A field of order pm has, for each positive divisor e of m, exactly one subfield of order pe, namely {a:ape=a}, and these are all of its subfields (The subfields of Fpn are the unique fields Fpd for positive divisors d of n).

Verification

technique · direct
1.1givenalgebra

The positive divisors of twelve are 1,2,3,4,6,12, six in all, since a positive divisor d of 12 satisfies d≤12 and direct inspection of 1,…,12 leaves exactly these.

2.1step 1.1L1L2

By [L1] and [L2] the intermediate fields of E/F2 are the F2d for those six d, one for each, with F2d⊆F2e exactly when d∣e.

3.1step 2.1given

Neither 4∣6 nor 6∣4, so by step 2.1 neither of F24 and F26 contains the other.

4.1step 2.1step 3.1L4

Their intersection is an intermediate field of E/F2, being a subfield of E containing F2, so it is F2c for a unique divisor c of 12 by step 2.1; from F2c⊆F24 and F2c⊆F26 one gets c∣4 and c∣6, so [L4] gives c∣gcd⁡(4,6)=2; and 2∣4 and 2∣6 put F22 inside both, so 2∣c. Hence c=2 and the intersection is F22.

5.1step 2.1step 4.1L4

Their compositum is likewise an intermediate field F2c′, and it contains both, so 4∣c′ and 6∣c′ by step 2.1. Thus [L4] gives lcm⁡(4,6)=12∣c′; since c′∣12, c′=12 and the compositum is E=F212.

6.1step 2.1step 5.1L2L3∎

The same six fields are what [L3] produces for E, whose order is 212: its subfields are the {a:a2e=a} for the divisors e of 12, and these are the sets named in [L2]. So the Galois indexing and the elementary one agree here.

Remarks

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The divisor-sum identity at q=2, n=3 finds exactly two monic irreducible cubics

Example

Over F2 the divisor-sum identity (∑d∣nd Nq(d)=qn for the counts Nq(d) of monic irreducibles of degree d over Fq) at n=3 reads

N2(1)+3 N2(3)=23=8,

and N2(1)=2, so N2(3)=2. The two monic irreducible cubics in F2[t] are

t3+t+1andt3+t2+1.

Facts & Assumptions

Given: The field F2 with two elements and the counts N2(d) of monic irreducible polynomials of degree d in F2[t] (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).

[L2]

A polynomial of degree 2 or 3 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).

[L3]

For a commutative ring R, a∈R and f∈R[x]: f(a)=0 if and only if x−a divides f (Factor theorem over a commutative ring, Evaluation and roots of a polynomial in a commutative target ring).

Verification

technique · direct
1.1givenalgebra

The monic polynomials of degree one in F2[t] are t and t+1, and each is irreducible, having degree one; so N2(1)=2.

1.2givenalgebra

A monic cubic over F2 is f=t3+at2+bt+c with a,b,c∈F2, so there are eight of them. Such an f has no root in F2 exactly when f(0)=c≠0 and f(1)=1+a+b+c≠0, that is exactly when c=1 and a+b=1.

2.1step 1.1L1algebra

The positive divisors of 3 are 1 and 3, so [L1] at q=2 and n=3 reads N2(1)+3N2(3)=8; with step 1.1 this gives 3N2(3)=6 and N2(3)=2.

3.1step 2.1step 1.2L2L3algebra∎

The pairs (a,b) with a+b=1 in F2 are (0,1) and (1,0), so exactly two monic cubics have no root in F2, namely t3+t+1 and t3+t2+1; 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 N2(3)=2 of step 2.1.

Remarks

  • The identity is a recursion, not a formula. It determines N2(3) only because N2(1) is already known; at n=4 it would read N2(1)+2N2(2)+4N2(4)=16 and would need N2(2) first.
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

The four roots of t4+t+1 over F2 are the Frobenius powers of any one of them

Example

Let K:=F2[t]/(t4+t+1) and let α be the class of t, so α4=α+1. Then K is a field of order 16, and the four conjugates of α over F2,

α,α2,α4=α+1,α8=α2+1,

are pairwise distinct, are exactly the roots of t4+t+1 in K, and satisfy α16=α, so the Frobenius orbit closes at length four.

Facts & Assumptions

Given: The polynomial π:=t4+t+1∈F2[t], the ring K=F2[t]/(π), and the class α of t, so α4=α+1 since −1=1 in characteristic two; squaring is additive there.

[L1]

A polynomial of degree 2 or 3 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).

[L2]

f(a)=0 if and only if x−a divides f (Factor theorem over a commutative ring); and over an integral domain deg⁡(fg)=deg⁡f+deg⁡g for nonzero f,g (Over an integral domain, degrees add under multiplication of nonzero polynomials, Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).

[L3]

For a field F and nonconstant p∈F[x], p is irreducible if and only if F[x]/(p) is a field (For a nonconstant p in F[x], the ideal (p) is maximal and F[x]/(p) is a field exactly when p is irreducible).

[L6]

A monic irreducible π of degree d over Fq with a root α has the d distinct roots α,αq,…,αqd−1 and π=∏i<d(t−αqi) (A monic irreducible of degree d over Fq has the d distinct roots α,αq,…,αqd−1).

Verification

technique · direct
1.1L2given

π has no root in F2, since π(0)=1 and π(1)=1+1+1=1; so by [L2] it has no factor of degree one.

1.2L1L2given

The only monic irreducible quadratic in F2[t] is t2+t+1: the four monic quadratics are t2, t2+1, t2+t and t2+t+1, and the first three have the root 0, 1 and 0 respectively, so [L1] leaves only the last.

2.1step 1.1step 1.2L2given

π is irreducible. A factorisation of π into two nonconstant factors has degrees summing to four by [L2], so it is either 1+3, excluded by step 1.1, or 2+2; and every monic quadratic factor would have to be irreducible, hence equal to t2+t+1 by step 1.2, giving π=(t2+t+1)2=t4+t2+1, which is not π.

3.1step 2.1L3L4L5

By [L3] the ring K is a field; π is monic irreducible with π(α)=0, so [K:F2]=4 with power basis 1,α,α2,α3 by [L4], and ∣K∣=24=16 by [L5].

4.1step 3.1given

Compute the conjugates in that basis: α4=α+1 by hypothesis, and α8=(α4)2=(α+1)2=α2+1. So the four elements α,α2,α4,α8 have coordinate lists (0,1,0,0), (0,0,1,0), (1,1,0,0) and (1,0,1,0), which are pairwise different, so the four elements are pairwise distinct.

5.1step 4.1given

α16=(α8)2=(α2+1)2=α4+1=(α+1)+1=α, so the orbit closes after four steps.

6.1step 2.1step 4.1step 5.1L6∎

By [L6] applied to π, of degree four, the elements α,α2,α4,α8 are exactly the roots of π and π=(t−α)(t−α2)(t−α4)(t−α8) in K[t]; steps 4.1 and 5.1 verify the distinctness and the closing of the orbit directly.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

A normal basis of F8 over F2

Example

Let K:=F2[t]/(t3+t+1), a field of order 8, let α be the class of t, and let σ(x)=x2 generate Gal⁡(K/F2). Put

β:=α+1.

Then the conjugate list

(β, β2, β4)=(α+1, α2+1, α2+α+1)

is a normal basis of K over F2 (Normal bases of a finite Galois extension).

Not every element works. The generator α itself does not: its conjugate list is (α,α2,α2+α), whose three members sum to 0, so they are linearly dependent over F2 and are not a basis.

Facts & Assumptions

Given: The field K=F2[t]/(t3+t+1) with α the class of t, so α3=α+1 and α4=α2+α; squaring is additive in characteristic two.

[L4]

For a linear map T:V→W with V finite-dimensional, dim⁡V=dim⁡ker⁡T+dim⁡im⁡T (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[L5]

Every finite Galois extension with cyclic Galois group has a normal basis (Every finite cyclic extension has a normal basis).

Verification

technique · direct
1.1L1L2

By [L1] and [L2] the space K is a three-dimensional F2-vector space with basis 1,α,α2, and Gal⁡(K/F2)={id,σ,σ2} acts by x↦x, x2, x4.

2.1step 1.1L3given

The conjugate list of α is (α,α2,α4) with α4=α⋅α3=α(α+1)=α2+α; hence α+α2+α4=α+α2+α2+α=0. A vanishing combination with all coefficients 1 is nontrivial, so this list is linearly dependent over F2 and is not a basis.

3.1step 1.1step 2.1given

The conjugates of β=α+1 are β, β2=(α+1)2=α2+1 and β4=(β2)2=(α2+1)2=α4+1=α2+α+1.

4.1step 1.1step 3.1given

The seven nonzero F2-combinations of β,β2,β4 are nonzero: the three single terms are α+1, α2+1 and α2+α+1; the three pairwise sums are β+β2=α2+α, β+β4=α2 and β2+β4=α; and the total sum is β+β2+β4=1. None of these seven is 0, as each has a nonzero coordinate list in the basis 1,α,α2.

5.1step 1.1step 4.1L3L4

So the F2-linear map T ⁣:F23→K sending (c1,c2,c3) to c1β+c2β2+c3β4 has trivial kernel by step 4.1; both spaces have dimension three by step 1.1, so [L4] makes T surjective as well, hence bijective, and [L3] makes (β,β2,β4) an ordered basis of K over F2.

6.1step 3.1step 5.1L2L5∎

That list is the family of conjugates of β under Gal⁡(K/F2) 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 (α,α2,α4) 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).
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

{1+i, 1−i} is a normal basis of C/R while {1,i} is not

Example

The extension C/R (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i) is finite Galois of degree two with Gal⁡(C/R)={id, z↦z‾} (Real and imaginary parts, complex conjugation, and modulus). For it:

  1. the conjugate list (1+i, 1−i) is a normal basis (Normal bases of a finite Galois extension);
  2. (1,i) is an R-basis of C that is not a conjugate list of any element;
  3. (i,−i) is the conjugate list of i 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 i2=−1 and conjugation a+bi‾=a−bi for a,b∈R (Real and imaginary parts, complex conjugation, and modulus); in R one has 2≠0.

[L1]

C=R(i) is a simple algebraic extension with power basis 1,i and [C:R]=2 (C/R has power basis 1,i and degree 2, The degree [K:F]=dim⁡FK of a finite field extension).

[L2]

Every field automorphism of C fixing R pointwise is either the identity or complex conjugation, and these two are distinct (The only real-field automorphisms of C are the identity and complex conjugation, Relative field automorphisms and Aut⁡(K/F)).

[L4]

A finite extension K/F with G=Aut⁡(K/F) is Galois exactly when ∣G∣=[K:F] (Equivalent characterizations of a finite Galois extension, Finite Galois extensions and Gal⁡(K/F)).

[L6]

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

technique · direct
1.1L1L2L3L4

By [L2] and [L3] the group Aut⁡(C/R) has exactly the two elements id and conjugation, so its order is 2=[C:R] by [L1]; hence C/R is finite Galois with that Galois group by [L4].

2.1step 1.1L1given

The conjugate list of 1+i is (1+i, 1−i), whose members have coordinate lists (1,1) and (1,−1) in the ordered basis (1,i) of [L1]. For a,b∈R, a(1+i)+b(1−i)=(a+b)+(a−b)i vanishes exactly when a+b=0 and a−b=0, hence when 2a=0, that is a=0 and then b=0.

2.2step 1.1L1given

(1,i) is a basis by [L1], but no z∈C has conjugate list (z,z‾) with underlying set {1,i}: such a z would lie in {1,i}, and the set for z=1 is {1} while for z=i it is {i,−i}, neither of which is {1,i}.

3.1step 1.1step 2.1L1L5L6

So the linear map R2→C sending (a,b) to a(1+i)+b(1−i) has trivial kernel; both spaces have dimension two by [L1], so [L5] makes it bijective and (1+i,1−i) an ordered R-basis of C. Being the conjugate list of 1+i, it is a normal basis, in agreement with [L6].

4.1step 1.1step 3.1step 2.2L5given∎

(i,−i) is the conjugate list of i, since i‾=−i, and its two members are distinct; but 1⋅i+1⋅(−i)=0 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 statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: every basis of a finite field over a subfield is a normal basis

Statement

False claim. For every extension E/Fq of finite fields, every Fq-basis of E is a normal basis (Normal bases of a finite Galois extension).

Facts & Assumptions

Given: The ring L:=F2[t]/(t2+t+1) with α the class of t, so that α2=α+1 because α2+α+1=0 and −1=1 in characteristic two.

[L1]

A polynomial of degree 2 or 3 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 F[x]/(p) is a field exactly when p is irreducible (For a nonconstant p in F[x], the ideal (p) is maximal and F[x]/(p) is a field exactly when p is irreducible).

[L4]

A normal basis of K/F is an ordered F-basis of the form (σ1γ,…,σnγ) for a single γ∈K, indexed by Gal⁡(K/F) (Normal bases of a finite Galois extension).

[L5]

Every finite Galois extension has a normal basis (Every finite Galois extension has a normal basis).

Refutation

technique · direct
1.1L1L2given

t2+t+1 has no root in F2, its values at 0 and 1 both being 1, so it is irreducible and L is a field by [L1]; it is the minimal polynomial of α, so [L:F2]=2 with ordered basis (1,α) by [L2], and L has four elements 0,1,α,α+1.

2.1step 1.1L3

By [L3] the extension L/F2 is Galois with Gal⁡(L/F2)={id,σ}, where σ(x)=x2.

3.1step 1.1step 2.1given

The conjugate lists of the four elements are (0,0), (1,1), (α,α+1) and (α+1,α), using α2=α+1 and (α+1)2=α2+1=α. Their underlying sets are {0}, {1} and {α,α+1}.

4.1step 1.1step 3.1L4

The list (1,α) is an F2-basis of L by step 1.1, but its underlying set {1,α} 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 L/F2.

5.1step 3.1step 4.1L4L5∎

What is true is the existential statement: some element of L generates a normal basis, and α does, since (α,α+1) is a list of two distinct elements whose only vanishing F2-combinations are trivial, as α≠0, α+1≠0 and α+(α+1)=1≠0. 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 F8 over F2 shows over F8.
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

Φ1 through Φ12 computed from the divisor recursion

Example

Running the recursion of The cyclotomic polynomials Φn∈Z[t], defined by ∏d∣nΦd=tn−1 gives

Φ1=t−1,Φ2=t+1,Φ3=t2+t+1,Φ4=t2+1,Φ5=t4+t3+t2+t+1,Φ6=t2−t+1,Φ7=t6+t5+t4+t3+t2+t+1,Φ8=t4+1,Φ9=t6+t3+1,Φ10=t4−t3+t2−t+1,Φ11=∑k=010tk,Φ12=t4−t2+1,

each monic in Z[t], with degrees

1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 4

matching φ(1),…,φ(12) (The unit group (Z/n)× and Euler's totient φ(n)=∣(Z/n)×∣ for n≥1).

Facts & Assumptions

Given: The recursion Φ1=t−1 and Φn=(tn−1)/∏d∣n, d<nΦd (The cyclotomic polynomials Φn∈Z[t], defined by ∏d∣nΦd=tn−1, The sum ∑i∈Sai over a finite index set, and its product form, Divisibility in Z: d∣a when a=dq for some integer q); and the elementary identity (ta−1)(ta(b−1)+⋯+ta+1)=tab−1 for a,b≥1.

[L1]

For every n≥1, Φn is monic in Z[t] with ∏d∣nΦd=tn−1 and deg⁡Φn=φ(n) (The recursion defines a unique monic Φn∈Z[t], of degree φ(n), Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).

[L2]

For a prime p and r≥1, Φpr=∑k=0p−1tkpr−1 (Φpr(t)=∑k<ptkpr−1, and Φpr(t+1) is Eisenstein at p).

[L3]

Z[t] 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).

[L4]

φ(1)=1 and φ(p)=p−1 for a prime p (φ(1)=1, and φ(p)=p−1 for every prime p); φ(pk)=pk−pk−1 (For a prime p and k≥1, φ(pk)=pk−pk−1); and for n≥1 with prime divisors p0,…,pr−1 and ki=vpi(n), φ(n)=∏i<r(piki−piki−1) (Euler's product formula φ(n)=n∏p∣n(1−1/p)=∏pk∥n(pk−pk−1) for n≥1, stated through a finite injective list of its prime divisors).

Verification

technique · direct
1.1L4given

Φ1=t−1 is the base clause of the recursion, of degree 1=φ(1) by [L4].

1.2L2

The prime powers among 2,…,12 are 2,3,4,5,7,8,9,11, and [L2] gives their cyclotomic polynomials directly: Φ2=1+t, Φ3=1+t+t2, Φ4=1+t2, Φ5=1+t+t2+t3+t4, Φ7=∑k=06tk, Φ8=1+t4, Φ9=1+t3+t6 and Φ11=∑k=010tk.

2.1step 1.2L1L3given

For n=6: the positive divisors of 6 are 1,2,3,6 and those of 3 are 1,3, so [L1] gives Φ1Φ2Φ3Φ6=t6−1 and Φ1Φ3=t3−1; dividing and using the given identity with a=3, b=2 yields Φ2Φ6=(t6−1)/(t3−1)=t3+1. Since (t+1)(t2−t+1)=t3+1 and Φ2=t+1 is nonzero, cancelling in Z[t] by [L3] gives Φ6=t2−t+1.

2.2step 1.2L1L3given

For n=10: the divisors of 10 are 1,2,5,10 and those of 5 are 1,5, so Φ2Φ10=(t10−1)/(t5−1)=t5+1 by [L1] and the given identity with a=5, b=2; and (t+1)(t4−t3+t2−t+1)=t5+1, so cancelling gives Φ10=t4−t3+t2−t+1.

3.1step 1.2step 2.1L1L3given

For n=12: the divisors of 12 are 1,2,3,4,6,12 and those of 6 are 1,2,3,6, so Φ4Φ12=(t12−1)/(t6−1)=t6+1 by [L1] and the given identity with a=6, b=2; and (t2+1)(t4−t2+1)=t6+1 with Φ4=t2+1, so cancelling gives Φ12=t4−t2+1.

4.1step 1.1step 1.2step 2.1step 2.2step 3.1L1L4∎

The degrees read off the displayed polynomials are 1,1,2,2,4,2,6,4,6,4,10,4. By [L4] these are φ(1)=1, φ(2)=1, φ(3)=2, φ(4)=22−2=2, φ(5)=4, φ(6)=(2−1)(3−1)=2, φ(7)=6, φ(8)=23−22=4, φ(9)=32−3=6, φ(10)=(2−1)(5−1)=4, φ(11)=10 and φ(12)=(22−2)(3−1)=4, so every degree matches [L1].

Remarks

ExampleConstruction: Literature-sourcedVerification: Literature-sourcedprecheck passaudited 2026-08-26Open item page →

Φ7(t+1) is Eisenstein at seven

Example

The translated seventh cyclotomic polynomial is

Φ7(t+1)=t6+7t5+21t4+35t3+35t2+21t+7.

Its leading coefficient is 1, every other coefficient is divisible by 7, and its constant term 7 is not divisible by 72. So it satisfies Eisenstein's criterion at the prime 7, and therefore Φ7 is irreducible over Q.

Facts & Assumptions

Given: The prime-power cyclotomic formula and the polynomial Φ7.

[L1]

For a prime p and r≥1, Φpr(t)=∑k=0p−1tkpr−1, and Φpr(t+1) is Eisenstein at p (Φpr(t)=∑k<ptkpr−1, and Φpr(t+1) is Eisenstein at p).

[L2]

Eisenstein's criterion: if a prime p divides every non-leading coefficient of a polynomial in Z[t], does not divide the leading coefficient, and p2 does not divide the constant term, then the polynomial is irreducible over Q (Eisenstein criterion over the integers).

Verification

technique · direct
1.1L1

Applying [L1] at p=7 and r=1 gives Φ7(t)=1+t+t2+t3+t4+t5+t6.

2.1step 1.1algebra

Therefore Φ7(t+1)=(t+1)7−1t=t6+7t5+21t4+35t3+35t2+21t+7, by the binomial theorem.

3.1step 2.1L2algebra

In the polynomial of step 2.1 the leading coefficient is 1, the remaining coefficients 7,21,35,35,21,7 are all divisible by 7, and the constant term 7 is not divisible by 49; so [L2] applies at the prime 7.

4.1step 3.1L1∎

Hence Φ7(t+1) is irreducible over Q, 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.
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Φ5 has four roots in F11

Example

Over F11 the fifth cyclotomic polynomial

Φ5(t)=t4+t3+t2+t+1

splits into four distinct linear factors:

Φ5(t)=(t−3)(t−4)(t−5)(t−9).

The four roots 3,4,5,9 are exactly the primitive fifth roots of unity in F11.

Facts & Assumptions

Given: The field F11 and the polynomial Φ5(t)=t4+t3+t2+t+1.

[L1]

If gcd⁡(n,q)=1, the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n (For gcd⁡(n,q)=1 the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n).

[L2]

For gcd⁡(n,q)=1, the image of Gal⁡(Fq(μn)/Fq) in (Z/n)× is generated by [q], so the extension degree is the order of [q] modulo n (For gcd⁡(n,q)=1 the image of Gal⁡(Fq(μn)/Fq) in (Z/n)× is generated by [q]).

Verification

technique · direct
1.1L1L2algebra

In (Z/5)× one has [11]=[1], so the order of [11] modulo 5 is 1. Hence [L1] and [L2] say every irreducible factor of Φ5 over F11 is linear, and the factors are distinct.

1.2givenalgebra

The powers of 3 in F11× are 32=9, 33=5, 34=4 and 35=1, so the four nontrivial fifth roots of unity in F11 are 3,9,5,4.

2.1step 1.2algebra

Each of 3,4,5,9 is therefore a root of t5−1 and is not 1, so each is a root of Φ5(t)=(t5−1)/(t−1). Since Φ5 is monic of degree 4, it follows that Φ5(t)=(t−3)(t−4)(t−5)(t−9).

3.1step 1.2algebra∎

The roots 3,4,5,9 all have multiplicative order 5 by step 1.2, so they are exactly the primitive fifth roots of unity in F11.

Remarks

  • This is the order-one case of the finite-field factorisation theorem. When [q] has order one modulo n, every irreducible factor has degree one and the whole cyclotomic polynomial splits over the base field.
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Φ7 factors over F2 into the two monic irreducible cubics

Example

Over F2 one has

Φ7(t)=t6+t5+t4+t3+t2+t+1=(t3+t+1)(t3+t2+1).

These are the two monic irreducible cubic factors, and over a splitting field the two factors correspond to the Frobenius orbits

{ζ,ζ2,ζ4}and{ζ3,ζ6,ζ5}

of a primitive seventh root of unity ζ.

Facts & Assumptions

Given: The field F2 and a primitive seventh root of unity ζ in a splitting field of Φ7.

[L1]

If gcd⁡(n,q)=1, the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n (For gcd⁡(n,q)=1 the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n).

[L2]

For gcd⁡(n,q)=1, the image of Gal⁡(Fq(μn)/Fq) in (Z/n)× is generated by [q] (For gcd⁡(n,q)=1 the image of Gal⁡(Fq(μn)/Fq) in (Z/n)× is generated by [q]).

[L3]

The roots of a monic irreducible polynomial of degree d over Fq are one Frobenius orbit α,αq,…,αqd−1 (A monic irreducible of degree d over Fq has the d distinct roots α,αq,…,αqd−1).

Verification

technique · direct
1.1L1L2algebra

In (Z/7)× the class [2] has order 3, since 23=8≡1(mod7) and 2≢1, 22=4≢1(mod7). So [L1] and [L2] say every irreducible factor of Φ7 over F2 is a distinct cubic.

2.1step 1.1algebra

The product of the two monic cubics is (t3+t+1)(t3+t2+1)=t6+t5+t4+t3+t2+t+1=Φ7(t) in F2[t]. Since both factors are monic of degree 3, step 1.1 makes them the two irreducible factors of Φ7.

3.1step 1.1step 2.1L3algebra∎

Frobenius acts by ζ↦ζ2, so the orbit of ζ is {ζ,ζ2,ζ4} because ζ8=ζ, and the orbit of ζ3 is {ζ3,ζ6,ζ5} because (ζ3)2=ζ6, (ζ6)2=ζ12=ζ5 and (ζ5)2=ζ10=ζ3. 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 [2] modulo 7.
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

Gal⁡(Q(ζ12)/Q)≅(Z/12)× and its three quadratic subfields

Example

Let ζ:=ζ12. Then

Gal⁡(Q(ζ)/Q)≅(Z/12)×={[1],[5],[7],[11]},

every nonidentity element has order two, and the three order-two subgroups have fixed fields

Q(i),Q(3),Q(−3).

So Q(ζ12) has exactly three quadratic intermediate fields.

Facts & Assumptions

Given: A primitive twelfth root of unity ζ=ζ12 and the automorphisms σa(ζ)=ζa for [a]∈(Z/12)×.

[L1]

[Q(ζ12):Q]=φ(12)=4 and Gal⁡(Q(ζ12)/Q)≅(Z/12)× ([Q(ζn):Q]=φ(n) and Gal⁡(Q(μn)/Q)≅(Z/n)×).

[L2]

For a finite Galois extension E/F, subgroups of Gal⁡(E/F) correspond bijectively to intermediate fields, and the fixed field of a subgroup H has degree [EH:F]=[Gal⁡(E/F):H] (The fundamental theorem of finite Galois theory).

Verification

technique · direct
1.1L1algebra

The units modulo 12 are [1],[5],[7],[11], since these are exactly the residue classes in {1,…,11} coprime to 12. Their squares are [25]=[1], [49]=[1] and [121]=[1], so every nonidentity element has order two.

2.1step 1.1L1L2

Therefore (Z/12)× is the Klein four-group, with three order-two subgroups: Hi={[1],[5]},H−3={[1],[7]},H3={[1],[11]}. By [L1] and [L2], each fixed field has degree 2 over Q.

3.1step 2.1algebra

The subgroup Hi fixes i=ζ3, because σ5(ζ3)=ζ15=ζ3. Since i∉Q and the fixed field has degree 2 by step 2.1, that fixed field is Q(i).

3.2step 2.1algebra

The subgroup H−3 fixes 2ζ2−1, because σ7(ζ2)=ζ14=ζ2; and (2ζ2−1)2=4ζ4−4ζ2+1=−3, since ζ2 is a root of t2−t+1. So the fixed field contains −3, and again step 2.1 makes it exactly Q(−3).

3.3step 2.1algebra

The subgroup H3 fixes ζ+ζ−1, because σ11 is complex conjugation. Moreover (ζ+ζ−1)2=ζ2+2+ζ−2=3, since ζ2+ζ−2=1. So the fixed field contains 3, and step 2.1 makes it exactly Q(3).

4.1step 2.1step 3.1step 3.2step 3.3L2∎

The three order-two subgroups of step 2.1 therefore yield the three quadratic intermediate fields Q(i), Q(−3) and Q(3), 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 Q(ζ8) also has Klein four Galois group and three quadratic subfields. The order-twelve calculation is useful because its three fields are the familiar Q(i), Q(3) and Q(−3).
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

In characteristic three, t3−1=(t−1)3 and μ6 coincides with μ2

Example

Let K be a field of characteristic 3. Then

t3−1=(t−1)3,μ3(K)={1},μ6(K)=μ2(K)={1,−1},

so t6−1 has only the two distinct roots 1 and −1 rather than six.

Facts & Assumptions

Given: A field K of characteristic 3.

[L1]

For a fixed integer k≥1, in characteristic p the only pk-th root of unity is 1, and tpk−1=(t−1)pk (In characteristic p the only pk-th root of unity is 1, and tpk−1=(t−1)pk).

Verification

technique · direct
1.1L1

Applying [L1] at p=3 and k=1 gives t3−1=(t−1)3 and μ3(K)={1}.

1.2L2algebra

Since (1)2=1 and (−1)2=1, one has {1,−1}⊆μ2(K). Conversely, if x∈μ2(K) then x2=1, so x2−1=(x−1)(x+1)=0 and therefore x=1 or x=−1 in the field K; hence μ2(K)={1,−1}.

2.1step 1.1step 1.2L2

If x∈μ6(K) then (x2)3=x6=1, so x2∈μ3(K) by [L2]; step 1.1 gives x2=1, hence x∈μ2(K) by [L2]. Thus μ6(K)⊆μ2(K).

2.2step 1.2L2algebra

Conversely, if x∈μ2(K) then x6=(x2)3=1, so x∈μ6(K). Therefore μ6(K)=μ2(K)={1,−1}.

3.1step 1.1step 2.2algebra∎

Using step 1.1, t6−1=(t3−1)(t3+1)=(t−1)3(t+1)3, so its only distinct roots are 1 and −1, exactly the two elements of step 2.2.

Remarks

  • This is why the characteristic hypothesis is load-bearing. The statement "∣μn∣=n" fails here for two different reasons at once: the polynomial t3−1 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.
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

F3(μ5)∩F3(μ7) is larger than F3 although five and seven are coprime

Statement refuted

That the rational intersection theorem Q(μm)∩Q(μn)=Q(μgcd⁡(m,n)) holds over every base field: that for every field K and all positive integers m,n with the characteristic of K dividing neither,

K(μm)∩K(μn)=K(μgcd⁡(m,n)).

The witness below takes K=F3, m=5 and n=7, and realizes both splitting fields inside one fixed field Ω of order 312. Since gcd⁡(5,7)=1, the right-hand side is K(μ1)=F3, while the intersection on the left is the common subfield F9⊆Ω.

Facts & Assumptions

Given: The base field K=F3 and a field Ω of order 312, which exists by For every prime p and n≥1, a field with pn elements exists. The two cyclotomic splitting fields will be identified with their base-field-isomorphic copies inside Ω.

[L1]

For gcd⁡(n,q)=1, the image of Gal⁡(Fq(μn)/Fq) in (Z/n)× is generated by [q], so the degree of Fq(μn)/Fq is the order of [q] modulo n (For gcd⁡(n,q)=1 the image of Gal⁡(Fq(μn)/Fq) in (Z/n)× is generated by [q]).

[L2]

The intermediate fields of FqN/Fq are exactly the Fqd for the positive divisors d of N, one for each divisor, with Fqd⊆Fqe exactly when d∣e (The intermediate fields of Fqn/Fq are the Fqd, one for each positive divisor d of n).

[L3]

Over Q one has Q(μm)∩Q(μn)=Q(μgcd⁡(m,n)) (Q(μm)∩Q(μn)=Q(μgcd⁡(m,n))).

[L4]

K(μr) is the splitting field of tr−1 over K (The cyclotomic extension K(μn) as a splitting field of tn−1).

[L5]

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

technique · direct
1.1L1L2L4L5algebra

In (Z/5)×, the class [3] has order 4, since 34=81≡1(mod5) and no smaller positive power of 3 is congruent to 1 modulo 5. So [L1] gives [F3(μ5):F3]=4, hence this splitting field has order 34 and [L5] lets us identify it over F3 with the unique subfield F34 of Ω.

1.2L1L2L4L5algebra

In (Z/7)×, the powers of [3] are [3],[2],[6],[4],[5],[1], so [3] has order 6. Thus [L1] gives [F3(μ7):F3]=6, hence this splitting field has order 36 and [L5] lets us identify it over F3 with the unique subfield F36 of Ω.

2.1step 1.1step 1.2L2

Under the fixed identifications of steps 1.1 and 1.2, both F34 and F36 are subfields of Ω=F312 by [L2], since 4∣12 and 6∣12. Their intersection is then an intermediate field of Ω/F3, so by [L2] it is F3d for some divisor d of 12. Because the intersection lies in both fields, [L2] gives d∣4 and d∣6, hence d∣2; and since F32 lies in both fields, [L2] gives 2∣d. Therefore d=2 and F3(μ5)∩F3(μ7)=F32=F9.

3.1step 2.1L4algebra

Since gcd⁡(5,7)=1, the right-hand side of the refuted identity is K(μ1), which is just K=F3 because t−1 already splits over K. So the claimed equality would read F9=F3, which is false.

4.1step 3.1L3∎

The refuted statement therefore fails over the base field F3, 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 statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

FALSE: every cyclotomic polynomial has all coefficients in {−1,0,1}

Statement

False claim. Every coefficient of every cyclotomic polynomial Φn∈Z[t] lies in {−1,0,1}.

The failure first appears at n=105: the coefficient of t7 in Φ105(t) is −2.

Facts & Assumptions

Given: The cyclotomic recursion ∏d∣nΦd(t)=tn−1 for n≥1 (The cyclotomic polynomials Φn∈Z[t], defined by ∏d∣nΦd=tn−1).

[L1]

For every n≥1, Φn is a monic polynomial in Z[t] and the displayed divisor recursion holds (The recursion defines a unique monic Φn∈Z[t], of degree φ(n)).

Refutation

technique · direct
1.1givenL1algebra

Running the divisor recursion for n=105=3⋅5⋅7 and truncating modulo t8 gives Φ105(t)≡(1−t3)(1−t5)(1−t7)1−t≡1+t+t2−t5−t6−2t7(modt8). The first congruence is the defining recursion with every factor of degree at least 15 dropped modulo t8, and the second comes from expanding (1−t)−1=1+t+t2+t3+t4+t5+t6+t7(modt8).

2.1step 1.1algebra∎

Step 1.1 shows that the coefficient of t7 in Φ105(t) is −2, and −2∉{−1,0,1}. So the false claim fails.

Remarks

  • Why this is a real pattern and not a silly claim. For many small values of n the coefficients do lie in {−1,0,1}, so the first counterexample is not visually obvious from the recursion alone.
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

FALSE: Φn is irreducible over every field

Statement

False claim. For every field K and every n≥1 with the characteristic of K not dividing n, the image of Φn in K[t] is irreducible.

What is true is different in two directions: over Q every Φn is irreducible, but over a finite field the factor degree is governed by the order of the Frobenius class modulo n.

Facts & Assumptions

Given: The rational irreducibility theorem and the finite-field factorisation theorem.

[L1]

For every n≥1, the cyclotomic polynomial Φn is irreducible in Q[t] (Φn is irreducible in Q[t] for every n≥1).

[L2]

If gcd⁡(n,q)=1, the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n (For gcd⁡(n,q)=1 the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n).

Refutation

technique · direct
1.1L2algebra

In (Z/5)× one has [11]=[1], so the order of [11] modulo 5 is 1. Therefore [L2] says that over F11 every irreducible factor of Φ5 has degree 1.

2.1step 1.1algebra

Hence the reduction of Φ5 in F11[t] is a product of distinct linear factors, so it is reducible there. This contradicts the false claim.

3.1step 2.1L1∎

The contradiction does not touch [L1]: irreducibility over Q is a theorem, but it does not persist over arbitrary base fields.

Remarks

  • The finite-field theorem is the correct replacement. The question over Fq is not "irreducible or not?" in the abstract, but "what is the order of [q] modulo n?"
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: μn(K) has n elements in every field K

Statement

False claim. For every field K and every n≥1, the group μn(K) of n-th roots of unity in K has exactly n elements.

The witness below shows two different failures: over Q there is no primitive cube root of unity in the field at all, while in characteristic 3 the equation x3=1 is inseparable and has only one root.

Facts & Assumptions

Given: The groups μn(K) of roots of unity.

[L1]

μn(K) is cyclic of order dividing n, and it has a primitive n-th root of unity exactly when its order is n (μn(K) is cyclic of order dividing n, and has a primitive n-th root of unity exactly when its order is n).

[L3]

Refutation

technique · direct
1.1L1L2

If μ3(Q) had three elements, then [L1] would give a primitive cube root of unity ζ3 in Q. But then Q(ζ3)=Q, contradicting [L2], which says this extension has degree 2. So μ3(Q) does not have three elements.

1.2L3

If K has characteristic 3, then [L3] gives μ3(K)={1}, so again μ3(K) does not have three elements.

2.1step 1.1step 1.2∎

The false claim fails already at n=3, both over Q and over every field of characteristic 3.

Remarks

  • The two failures have different causes. Over Q the polynomial t3−1 is separable but its nontrivial roots lie in a quadratic extension; in characteristic 3 the polynomial itself collapses to (t−1)3.
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26Open item page →

FALSE: every finite abelian group is Gal⁡(Q(μn)/Q) for some n

Statement

False claim. For every finite abelian group G there is an n≥1 with

Gal⁡(Q(μn)/Q)≅G.

The obstruction is visible already at the level of cardinality: the cyclic group C3 occurs as a Galois group over Q, but never as the Galois group of a cyclotomic field.

Facts & Assumptions

Given: Cyclotomic Galois groups and the theorem realising finite abelian groups over Q.

[L2]

Every finite abelian group is the Galois group of some finite Galois extension of Q (Every finite abelian group is the Galois group of some finite Galois extension of Q).

[L3]

In a finite group, the order of every subgroup divides the order of the group (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Refutation

technique · direct
1.1L1algebra

For n=1 and n=2, the group (Z/n)× is trivial, so φ(1)=φ(2)=1.

1.2L1L3algebra

If n≥3, then the unit class [−1] in (Z/n)× has order 2: one has [−1]2=[1], and [−1]≠[1] because otherwise n would divide 2, contrary to n≥3. Therefore [L3] makes the group order φ(n)=∣(Z/n)×∣ even.

2.1step 1.1step 1.2L1

Steps 1.1 and 1.2 show that φ(n) is never 3. So no cyclotomic field Q(μn) has Galois group of order 3, and in particular none has Galois group isomorphic to C3.

3.1step 2.1L2∎

By [L2], however, some finite Galois extension of Q does have Galois group C3. 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.
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-26Open item page →

A degree-three Galois extension of Q inside Q(ζ7)

Example

Let ζ:=ζ7. Then the fixed field of the unique order-two subgroup of Gal⁡(Q(ζ)/Q) is

Q(ζ+ζ−1),

a degree-three Galois extension of Q with cyclic Galois group, and the element ζ+ζ−1 has minimal polynomial

t3+t2−2t−1.

Facts & Assumptions

Given: A primitive seventh root of unity ζ=ζ7.

[L1]

Gal⁡(Q(ζ7)/Q)≅(Z/7)× and has order φ(7)=6 ([Q(ζn):Q]=φ(n) and Gal⁡(Q(μn)/Q)≅(Z/n)×).

[L2]

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).

[L3]

For a finite Galois extension, subgroups correspond to intermediate fields, and the fixed field of a subgroup H has degree equal to the subgroup index (The fundamental theorem of finite Galois theory).

[L4]

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).

[L5]

Under the finite Galois correspondence, a normal subgroup H has a Galois fixed field and restriction gives Gal⁡(F/Q)≅G/H (Normal subgroups, conjugate fields, and quotient groups in the Galois correspondence).

Verification

technique · direct
1.1L1L2L3L4

By [L1] the Galois group of Q(ζ)/Q is isomorphic to the finite subgroup (Z/7)× of the unit group of the field Z/7, so [L4] makes it cyclic; its order is 6. Thus [L2] gives a unique subgroup H of order 2, and [L3] makes its fixed field F have degree [F:Q]=6/2=3.

2.1step 1.1algebra

The subgroup H is generated by the class [−1], so it acts by complex conjugation. Therefore ζ+ζ−1 is fixed by H and lies in F.

3.1step 2.1algebra

Put x:=ζ+ζ−1. Then ζ2+ζ−2=x2−2,ζ3+ζ−3=x3−3x. Since 1+ζ+ζ2+ζ3+ζ4+ζ5+ζ6=0, dividing by ζ3 gives 1+(ζ+ζ−1)+(ζ2+ζ−2)+(ζ3+ζ−3)=0. Substituting the expressions above yields x3+x2−2x−1=0.

4.1step 1.1step 3.1L1

The element x is not rational: if it were, then ζ would satisfy the quadratic polynomial t2−xt+1∈Q[t], which would force [Q(ζ):Q]≤2, contradicting [L1]. Since x∈F, the prime degree [F:Q]=3 from step 1.1 leaves only the subfields Q and F, so Q(x)=F. Therefore the minimal polynomial of x has degree 3, and the cubic from step 3.1 is that minimal polynomial.

5.1step 1.1L5L6algebra∎

The ambient Galois group is cyclic and hence abelian, so H is normal. By [L5], the fixed field F/Q is Galois and Gal⁡(F/Q) is isomorphic to the quotient by H, which has order 3. The group is cyclic by [L6], so F/Q is a cyclic cubic Galois extension.

Remarks

  • This is the smallest nontrivial case of the subfield theorem. The subgroup lattice of (Z/7)× has one index-two subgroup, and the fixed field is already visible through the real element ζ+ζ−1.

Sources