Alphabeta Math
Session-authored (Fable 5 assisted)
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.

29 results · all verified · 15 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 14 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Algebraic Extensions, Extension Degree, and Finite Fields

1 · Prerequisites

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 xpnx construct the unique field of each prime-power order. The page then proves the subfield lattice, the factorization of xqnx, 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The degree [K:F]=dimFK of a finite field extension

Definition

Let K/F be a field extension. Scalar multiplication by FK, together with addition in K, makes K an F-vector space. The extension is finite when this vector space is finite-dimensional. In that case its degree is

[K:F]:=dimFK.

No numerical degree is assigned here to an infinite-dimensional extension.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A finite extension has degree one if and only if the two fields are equal

Statement

For a finite field extension K/F,

[K:F]=1K=F.

Facts & Assumptions

Given: A finite extension K/F.

[L1]

The degree [K:F] is the dimension of K as an F-vector space (The degree [K:F]=dimFK of a finite field extension).

Proof

technique · direct
1.1

Suppose [K:F]=1 and choose a one-element basis (b). By [L2], write 1K=cb with cF. Since 1K0, one has c0, so b=c11K. Every xK is therefore of the form db=(dc1)1K with dF, and hence lies in the embedded copy of F.

givenL1L2choose
1.2

Conversely, if K=F, then (1F) is a basis of F over itself, so [L1] gives [F:F]=1.

L1
2.1

Step 1.1 gives KF, while the extension already has FK, so K=F.

step 1.1given
3.1

Steps 1.1, 1.2, and 2.1 prove both directions.

step 2.1step 1.2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Products of bases form a basis in a tower of finite extensions

Statement

Let FKL be fields. If (u1,,um) is an F-basis of K and (v1,,vn) is a K-basis of L, then

{uivj:1im, 1jn}

is an F-basis of L.

Proof

technique · direct
1.1

For xL, use the K-basis to write x=jbjvj with bjK, then use the F-basis to write bj=icijui. Thus x=i,jcijuivj, so the products span L over F.

givenL1L2
1.2

Suppose i,jcijuivj=0 with cijF. Grouping by vj gives j(icijui)vj=0. Independence of the vj makes every inner coefficient zero, and independence of the ui then makes every cij=0.

givenL1L2algebra
2.1

The products span and are independent, hence form an F-basis.

step 1.1step 1.2L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Tower law for finite extensions: [L:F]=[L:K][K:F]

Statement

Let FKL be fields. If K/F and L/K are finite, then L/F is finite and

[L:F]=[L:K][K:F].

Facts & Assumptions

Given: Finite extensions K/F and L/K.

[L1]

Products of an F-basis of K and a K-basis of L form an F-basis of L (Products of bases form a basis in a tower of finite extensions).

[L2]

Extension degree is the size of a finite basis (The degree [K:F]=dimFK of a finite field extension).

Proof

technique · direct
1.1

Choose bases of sizes m=[K:F] and n=[L:K].

givenL2choose
2.1

By [L1], their mn pairwise products form an F-basis of L.

step 1.1L1
3.1

Hence L/F is finite and [L2] gives [L:F]=mn=[L:K][K:F].

step 2.1L2algebra
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The degree of an intermediate field divides the degree of a finite extension

Statement

If FKL and L/F is finite, then K/F and L/K are finite and

[K:F][L:F].

Facts & Assumptions

Given: A tower FKL with L/F finite.

[L1]

For finite subextensions the tower law is [L:F]=[L:K][K:F] (Tower law for finite extensions: [L:F]=[L:K][K:F]).

[L2]

Assuming the Axiom of Choice, if SV spans V then there is a basis B of V with BS (Every spanning subset of a vector space contains a basis).

Proof

technique · direct
1.1

Apply [L2] to the spanning set K of the F-vector space K to obtain an F-basis BK. This set is independent in the F-space L, so [L3] makes B finite; hence K/F is finite.

givenL2L3
1.2

Any finite F-basis of L is also a finite K-spanning set of L. Applying [L2] over K gives a finite K-basis, so L/K is finite.

givenL2
2.1

The tower law [L1] now applies and writes [L:F] as [K:F] times the natural number [L:K], proving the divisibility.

step 1.1step 1.2L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Every finite field extension is algebraic

Statement

Every finite field extension K/F is algebraic: each aK is a root of a nonzero polynomial in F[t].

Facts & Assumptions

Given: A finite extension K/F of degree n and an element aK.

[L1]

Degree n means that K has an F-basis of size n (The degree [K:F]=dimFK of a finite field extension).

[L3]

An element is algebraic over F when a nonzero polynomial in F[t] vanishes at it (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

The n+1 vectors 1,a,,an lie in the n-dimensional F-space K, so [L2] gives coefficients c0,,cnF, not all zero, with i=0nciai=0.

givenL1L2
2.1

The polynomial p(t)=i=0nciti is nonzero and satisfies p(a)=0, so a is algebraic by [L3].

step 1.1L3
3.1

Since a was arbitrary, the extension is algebraic. The case n=0 cannot occur for a field extension because 1K0.

step 2.1L1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

An element is algebraic over F if and only if its simple extension F(a)/F is finite

Statement

For an element a of an extension K/F,

a is algebraic over FF(a)/F is finite.

If a is algebraic with minimal polynomial of degree n, then [F(a):F]=n.

Facts & Assumptions

Given: A field extension K/F and an element aK.

[L1]

If a is algebraic with minimal polynomial of degree n, then 1,a,,an1 is a basis of F(a)/F and its degree is n (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n).

[L2]

Every element of a finite extension is algebraic over the base (Every finite field extension is algebraic).

Proof

technique · direct
1.1

If a is algebraic, [L1] gives a finite power basis of F(a) and the stated degree.

givenL1
1.2

Conversely, if F(a)/F is finite, [L2] says every element of F(a), in particular a, is algebraic over F.

givenL2
2.1

These are the two implications of the equivalence.

step 1.1step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Finitely generated field extensions F(a1,,ar)

Definition

Let K/F be a field extension and let a1,,arK. The notation

F(a1,,ar)

means the smallest subfield of K containing F and all the ai. An extension K/F is finitely generated when K=F(a1,,ar) for some finite list. For the empty list, F()=F.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

An extension generated by finitely many algebraic elements is finite

Statement

If a1,,ar are algebraic over F, then F(a1,,ar)/F is finite.

Facts & Assumptions

Given: A field extension containing elements a1,,ar algebraic over F.

[L1]

The field F(a1,,ar) is obtained by adjoining the finite list of generators (Finitely generated field extensions F(a1,,ar)).

[L2]

An algebraic element generates a finite simple extension (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[L4]

An element algebraic over F satisfies a nonzero polynomial in F[t] (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

Put F0=F and Fi=F(a1,,ai) for 1ir. By [L4], the nonzero polynomial over F satisfied by ai also belongs to Fi1[t], so ai is algebraic over Fi1. Thus [L2] makes Fi/Fi1 finite.

givenL1L2L4
2.1

Repeated application of [L3] makes Fr/F finite, with degree equal to the product of the simple-step degrees.

step 1.1L3
3.1

By [L1], Fr=F(a1,,ar). If r=0, this is F/F of degree one, so the boundary case also holds.

step 2.1L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The elements of an extension algebraic over the base field form a subfield

Statement

For a field extension K/F, the set

A={aK:a is algebraic over F}

is a subfield of K containing F.

Facts & Assumptions

Given: A field extension K/F and algebraic elements a,bK.

[L1]

A field generated by finitely many algebraic elements is finite over the base (An extension generated by finitely many algebraic elements is finite).

[L2]

Every element of a finite extension is algebraic over the base (Every finite field extension is algebraic).

[L3]

A subset containing 1 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).

[L4]

Algebraic means annihilated by a nonzero polynomial over the base field (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

Every cF is algebraic over F, since it is a root of tc, so FA and in particular 0,1A.

L4
1.2

By [L1], F(a,b)/F is finite. Thus [L2] makes all of its elements algebraic over F, including ab and ab.

givenL1L2
1.3

If a0, then a1F(a)F(a,b) and is algebraic by the same argument.

givenL1L2
2.1

Therefore A satisfies the subfield criterion [L3] and is a subfield containing F.

step 1.1step 1.2step 1.3L3
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The relative algebraic closure of F in an extension K

Definition

For a field extension K/F, the relative algebraic closure of F in K is

aclK(F):={aK:a is algebraic over F}.

By The elements of an extension algebraic over the base field form a subfield, this set is a subfield of K containing F.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Algebraicity is transitive in towers of field extensions

Statement

If FKL, the extension K/F is algebraic, and L/K is algebraic, then L/F is algebraic.

Facts & Assumptions

Given: A tower FKL with K/F and L/K algebraic, and an element aL.

[L1]

Finitely many algebraic generators produce a finite extension (An extension generated by finitely many algebraic elements is finite).

[L2]

An algebraic element generates a finite simple extension (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[L4]

Every finite extension is algebraic (Every finite field extension is algebraic).

[L5]

Algebraicity means satisfying a nonzero polynomial over the base (Algebraic and transcendental elements and algebraic extensions).

Proof

technique · direct
1.1

Since a is algebraic over K, choose a nonzero polynomial c0+c1t++cdtdK[t] with value zero at a.

givenL5choose
2.1

Every coefficient ci is algebraic over F. Hence M=F(c0,,cd) is finite over F by [L1].

givenstep 1.1L1
3.1

The same polynomial lies in M[t], so a is algebraic over M and [L2] makes M(a)/M finite. The tower law [L3] makes M(a)/F finite.

step 1.1step 2.1L2L3
4.1

By [L4], a is algebraic over F. Since a was arbitrary, L/F is algebraic.

step 3.1L4
PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The relative algebraic closure of F in K has no further algebraic elements inside K

Statement

Let A=aclK(F). If bK is algebraic over A, then bA. Equivalently, A is relatively algebraically closed in K.

Facts & Assumptions

Given: A field extension K/F, its relative algebraic closure A, and an element bK algebraic over A.

[L1]

The field A consists exactly of the elements of K algebraic over F (The relative algebraic closure of F in an extension K).

[L2]

Algebraicity is transitive in towers of field extensions (Algebraicity is transitive in towers of field extensions).

[L3]

An algebraic element generates a finite simple extension (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[L4]

Every finite extension is algebraic (Every finite field extension is algebraic).

Proof

technique · direct
1.1

By [L1], every element of A is algebraic over F, so A/F is algebraic.

L1
2.1

The element b is algebraic over A by hypothesis, so [L3] makes A(b)/A finite and [L4] makes it algebraic. Applying [L2] to FAA(b) shows that b is algebraic over F.

givenstep 1.1L2L3L4
3.1

By [L1], an element of K algebraic over F belongs to A, hence bA.

step 2.1L1
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

For finite subextensions in a common field, [EE:F][E:F][E:F]

Statement

Let E/F and E/F be finite subextensions of a common field. Then their compositum is finite and

[EE:F][E:F][E:F].

Facts & Assumptions

Given: Finite subextensions E/F and E/F inside a field Ω.

[L1]

The compositum EE is the smallest subfield of Ω containing EE (The composite of two subfields is the subfield generated by their union).

[L2]

Extension degree is the size of a finite basis (The degree [K:F]=dimFK of a finite field extension).

[L3]

Assuming the Axiom of Choice, if SV spans V then there is a basis B of V with BS (Every spanning subset of a vector space contains a basis).

[L4]

Every finite extension is algebraic (Every finite field extension is algebraic).

[L5]

A field generated by finitely many algebraic elements is finite over the base (An extension generated by finitely many algebraic elements is finite).

Proof

technique · direct
1.1

Choose F-bases (u1,,um) of E and (v1,,vn) of E. The F-span A of the mn products uivj contains E and E and is closed under addition and multiplication, because products are reduced separately in the two bases.

givenL2algebra
2.1

By [L4], every ui and vj is algebraic over F, so [L5] makes EE=F(u1,,um,v1,,vn) finite over F. Every rAEE is therefore algebraic over F.

step 1.1L1L4L5
3.1

If 0rA, take a nonzero annihilating polynomial, factor out its largest power of t, and cancel the corresponding nonzero power of r in the ambient field. This gives c0+c1r++cdrd=0 with c00. Then r1=c01(c1+c2r++cdrd1)A, so A is a field.

step 2.1algebra
4.1

Since A is a field containing EE, [L1] gives EEA; the reverse inclusion is clear from the product span, so A=EE.

step 1.1step 3.1L1
5.1

The mn products span EE. By [L3] they contain a basis of at most mn elements, so [L2] yields [EE:F]mn=[E:F][E:F].

step 4.1L2L3
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The prime subfield as the intersection of all subfields

Definition

Let F be a field. Its prime subfield is

F0:={E:E is a subfield of F}.

The family is nonempty because it contains F. Its intersection is a subfield: every member contains 0 and 1 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 F.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The characteristic of a field is zero or a prime number

Statement

The characteristic of a field is either 0 or a prime number.

Facts & Assumptions

Given: A field F.

[L1]

If the set of positive n with n1F=0 is nonempty, the characteristic is its least element; otherwise it is 0 (The characteristic of a ring: the least n1 with n1R=0 when one exists, and 0 otherwise).

[L2]

A natural number greater than 1 is prime exactly when it has no factorization into two natural numbers strictly between 1 and itself (Prime and composite integers: p is prime when p>1 and its only positive divisors are 1 and p).

[L3]

A field is an integral domain, so a product of two nonzero elements cannot be zero (Every field is a commutative ring with 10; it is an integral domain, and it is a commutative division ring).

Proof

technique · contradiction
1.1

If no positive multiple of 1F is zero, [L1] gives characteristic 0. Otherwise write n=charF. Since 1F0, one has n>1.

givenL1
2.1

Suppose, for contradiction, that this positive n is not prime. By [L2], write n=ab with 1<a<n and 1<b<n.

step 1.1L2assume-contra
3.1

Minimality of n gives a1F0 and b1F0, while their product is (ab)1F=n1F=0. This contradicts [L3].

step 1.1step 2.1L1L3algebra
4.1

Therefore the positive characteristic is prime, completing both cases.

step 3.1discharge-contradiction
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A field's prime subfield is isomorphic to Q in characteristic zero and to Fp in characteristic p

Statement

Let F0 be the prime subfield of a field F.

  1. If charF=p>0, then F0 is isomorphic to Fp=Z/p.
  2. If charF=0, then F0 is isomorphic to Q.

Each isomorphism sends 1 to 1F.

Facts & Assumptions

Given: A field F and its prime subfield F0.

[L1]

The prime subfield is the intersection of all subfields of F and hence the smallest one (The prime subfield as the intersection of all subfields).

[L2]

The characteristic of F is zero or prime (The characteristic of a field is zero or a prime number).

[L3]

For prime p, the quotient Z/p is a field (For every prime p, the two operations on Z/p make it a field).

[L4]

The rational numbers form a field (The rationals form a field).

[L5]

A field homomorphism preserves addition, multiplication and 1 (Field homomorphism and embedding); it is therefore injective, its kernel being an ideal of a field that does not contain 1.

Proof

technique · direct
1.1

Suppose charF=p>0. The map Z/pF given by [n]n1F is well defined, is a field homomorphism, and is injective; its image is a subfield contained in every subfield of F.

givenL2L3L5algebra
1.2

Suppose charF=0. The map ZF, nn1F, is injective. Sending a rational class a/b with b0 to (a1F)(b1F)1 is well defined and gives an injective field homomorphism QF.

givenL2L4L5algebra
2.1

By [L1], that image equals F0, proving the first classification.

step 1.1L1
2.2

Its image is a subfield and every subfield of F contains all integer multiples of 1F and their nonzero quotients. Hence the image is contained in every subfield and equals F0 by [L1].

step 1.2L1
3.1

Steps 2.1 and 2.2 exhaust the alternatives in [L2].

step 2.1step 2.2L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The binomial theorem over an arbitrary commutative ring

Statement

Let R be a commutative ring. For all x,yR and nN,

(x+y)n=k=0n(nk)xkynk.

The natural-number coefficients act by repeated addition. The formula includes n=0.

Facts & Assumptions

Given: A commutative ring R, elements x,yR, and a natural number n.

[L1]

Multiplication in a commutative ring is commutative and distributes over addition (Commutative ring).

[L2]

The binomial coefficient (nk) counts the k-element subsets of an n-element set, with (n0)=(nn)=1 (The set [A]k of k-element subsets and the binomial coefficient (nk):=[n]k).

[L3]

Proof

technique · induction
1.1

For n=0, both sides are 1: the left by [L3], and the right is the sole term (00)x0y0=1.

baseL2L3
1.2

Assume the formula holds for n.

ih
2.1

Multiply the inductive formula by x+y, distribute using [L1], and reindex to obtain the coefficient (nk1)+(nk) on xkyn+1k for each interior k.

step 1.2L1L3algebra
3.1

By [L4] these interior coefficients are (n+1k), and [L2] supplies the two endpoint coefficients 1. Thus the formula holds for n+1.

step 2.1L2L4algebra
4.1

Induction proves the identity for every natural n.

step 1.1step 3.1discharge-induction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

A prime p divides (pk) for 0<k<p

Statement

If p is prime and 0<k<p, then

p(pk).

Facts & Assumptions

Given: A prime p and a natural number k with 0<k<p.

[L3]

A prime has no positive divisor strictly between 1 and itself (Prime and composite integers: p is prime when p>1 and its only positive divisors are 1 and p).

[L4]

If a prime divides a product of integers, it divides one of the factors (Euclid's lemma: if p is prime and pab then pa or pb).

Proof

technique · direct
1.1

Applying [L2] to (p,k) and (p1,k1) and cancelling the common nonzero factorial factors yields the integer identity k(pk)=p(p1k1).

givenL1L2algebra
2.1

Thus p divides k(pk). Since 0<k<p, [L3] gives pk.

step 1.1L3
3.1

Euclid's lemma [L4] therefore forces p(pk). The excluded endpoints have coefficient 1 and are not part of the claim.

step 2.1L4
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Frobenius xxp is an injective endomorphism in characteristic p, and an automorphism for finite fields

Statement

Let F be a field of characteristic p>0. The Frobenius map

FrF:FF,xxp,

is an injective field endomorphism. If F is finite, it is an automorphism. Its n-fold iterate is xxpn.

Facts & Assumptions

Given: A field F of positive characteristic p.

[L1]

The binomial theorem holds in every commutative ring (The binomial theorem over an arbitrary commutative ring).

[L2]

For 0<k<p, the prime p divides (pk) (A prime p divides (pk) for 0<k<p).

[L3]

A positive field characteristic is prime (The characteristic of a field is zero or a prime number).

[L4]

A field homomorphism preserves addition, multiplication, and 1 (Field homomorphism and embedding).

Proof

technique · direct
1.1

By [L1] and [L2], all intermediate terms in (x+y)p have coefficients divisible by p and hence vanish in F, so (x+y)p=xp+yp.

givenL1L2L3algebra
1.2

Commutativity gives (xy)p=xpyp, and 1p=1, so Frobenius is an endomorphism by [L4].

givenL4algebra
2.1

If xp=yp, then step 1.1 gives (xy)p=0. A field has no nonzero nilpotents, so xy=0 and the map is injective.

step 1.1algebra
3.1

If F is finite, [L5] turns this injection into a bijection, hence an automorphism.

step 1.2step 2.1L5
4.1

Iterating and using (xpr)p=xpr+1 gives FrFn(x)=xpn, including n=0 as the identity.

step 1.2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Finite fields and their order

Definition

A finite field is a field whose underlying set is finite. Its order is its finite cardinality, written F.

Once existence and uniqueness are proved, Fq denotes a field of order q up to isomorphism. The notation does not assert that the field is the quotient ring Z/qZ.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Every finite field has order pn for a unique prime characteristic p and positive integer n

Statement

If F is a finite field, then there is a unique prime p and a unique positive integer n such that

F=pn.

Here p=charF and n=[F:Fp].

Facts & Assumptions

Given: A finite field F.

[L1]

The order of a finite field is the cardinality of its underlying finite set (Finite fields and their order).

[L2]

The prime subfield in positive characteristic p is isomorphic to Fp (A field's prime subfield is isomorphic to Q in characteristic zero and to Fp in characteristic p).

[L3]

Extension degree is the size of a finite basis (The degree [K:F]=dimFK of a finite field extension).

[L4]

Assuming the Axiom of Choice, if SV spans V then there is a basis B of V with BS (Every spanning subset of a vector space contains a basis).

Proof

technique · direct
1.1

The characteristic cannot be zero, because the distinct integer multiples of 1F would give infinitely many elements. Hence it is a unique prime p, and [L2] identifies the prime subfield with Fp.

givenL2
1.2

The finite set F spans itself over Fp, so [L4] supplies a finite basis. Its size n is positive because F is not the zero vector space.

givenL3L4
2.1

By [L5], taking coordinates is a bijection from F to the functions from an n-element basis index set to Fp. Thus [L6] gives F=pn.

step 1.2L1L5L6
3.1

Steps 1.1 and 1.2 exhibit the pair (p,n) with p=charF and n=[F:Fp]. For uniqueness, suppose also F=m with prime and m1. Then p divides m, so [L7] gives p, and primality of forces p=. Now pn=pm with p2 forces n=m, since n<m would give 1=pmnp2 and symmetrically for m<n.

step 1.1step 1.2L3L7algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The multiplicative group Fq× of a finite field is cyclic

Statement

The multiplicative group F×=F{0} of every finite field F is cyclic.

Facts & Assumptions

Given: A finite field F.

[L1]

A finite field has a finite underlying set (Finite fields and their order).

[L2]

Every field is an integral domain, and its nonzero elements are its units (Every field is a commutative ring with 10; it is an integral domain, and it is a commutative division ring).

[L3]

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

technique · direct
1.1

By [L2], F× is the unit group of the integral domain F. It is finite by [L1].

givenL1L2
2.1

Apply [L3] to the finite subgroup F× of itself to conclude that it is cyclic.

step 1.1L3
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

In characteristic p, the roots of xpnx form a subfield and are all simple

Statement

Let E be a field of characteristic p>0, let n1, and put q=pn. Then

Rq:={aE:aq=a}

is a subfield of E. Every root of tqt is simple.

Facts & Assumptions

Given: A field E of characteristic p, a positive integer n, and q=pn.

[L1]

The n-fold Frobenius iterate aapn is an injective field endomorphism (Frobenius xxp is an injective endomorphism in characteristic p, and an automorphism for finite fields).

[L2]

A subset containing 1 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).

[L3]

The formal derivative of aiti is iaiti1 (The formal derivative of a polynomial).

[L4]

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

technique · direct
1.1

The elements 0 and 1 lie in Rq. Since the map aaq is a field endomorphism by [L1], if a,bRq then (ab)q=aqbq=ab and (ab)q=aqbq=ab.

givenL1
1.2

By [L3], the derivative of tqt is qtq11=1, because q=pn is zero in characteristic p. It vanishes nowhere.

givenL3algebra
2.1

If 0aRq, then (a1)q=(aq)1=a1, so a1Rq. Thus [L2] makes Rq a subfield.

step 1.1L1L2
3.1

Hence [L4] says every root of tqt is simple.

step 1.2L4
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

For every prime p and n1, a field with pn elements exists

Statement

For every prime p and every integer n1, there exists a field with exactly pn elements.

Facts & Assumptions

Given: A prime p, a positive integer n, and q=pn.

[L1]

In characteristic p, the roots of tqt in a field form a subfield and are all simple (In characteristic p, the roots of xpnx form a subfield and are all simple).

[L2]

Every nonzero polynomial over a field has a splitting field (Every nonzero polynomial over a field has a splitting field).

[L4]

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

[L5]

A field with finite underlying set is a finite field and its order is its cardinality (Finite fields and their order).

Proof

technique · constructive
1.1

Over the field Fp from [L3], use [L2] to choose a splitting field E of h(t)=tqt.

givenL2L3chooseconstruct
2.1

Let R be the root set of h in E. By [L1], R is a subfield of E and all roots are simple. By [L4], the roots generate E, while the subfield R already contains them and the base; hence E=R.

step 1.1L1L4
3.1

The degree-q polynomial h splits in E and has no repeated roots, so it has exactly q distinct roots. Thus E=R=q=pn.

step 2.1L1algebra
4.1

By [L5], E is the required finite field.

step 3.1L5discharge-construct
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

A field with q elements is the splitting field of xqx over its prime subfield

Statement

If F is a field with q elements, then every aF satisfies aq=a, and F is the splitting field of tqt over its prime subfield.

Facts & Assumptions

Given: A finite field F of order q.

[L3]

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

[L4]

A nonzero degree-q polynomial over a domain has at most q distinct roots (A nonzero polynomial of degree n over an integral domain has at most n distinct roots).

Proof

technique · direct
1.1

The cyclic group F× has order q1, so every nonzero aF satisfies aq1=1 and hence aq=a. The equality also holds for a=0.

givenL1algebra
2.1

Thus all q elements of F are roots of tqt. By [L4] there are no other distinct roots in any extension, so the polynomial splits into its linear factors over F.

step 1.1L4
3.1

The set of roots is all of F, so it generates F over its prime subfield. By [L3], F is the splitting field.

step 2.1L3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Finite fields of the same order are isomorphic

Statement

Any two finite fields with the same order q are isomorphic. More precisely, after identifying their prime subfields with Fp, there is an isomorphism fixing Fp pointwise. The isomorphism need not be unique.

Facts & Assumptions

Given: Finite fields E and E with E=E=q.

[L1]

Every finite field has prime-power order with base equal to its characteristic prime (Every finite field has order pn for a unique prime characteristic p and positive integer n).

[L2]

A field of order q is a splitting field of tqt over its prime subfield (A field with q elements is the splitting field of xqx over its prime subfield).

[L3]

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

[L4]

The prime subfield of a characteristic-p field is isomorphic to Fp (A field's prime subfield is isomorphic to Q in characteristic zero and to Fp in characteristic p).

Proof

technique · direct
1.1

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 p. Use [L4] to identify both prime subfields with one copy of Fp.

givenL1L4L5
2.1

By [L2], E and E are splitting fields of the same polynomial tqt over this base.

step 1.1L2
3.1

Apply [L3] to obtain a base-fixing field isomorphism EE. Splitting-field uniqueness asserts existence, not uniqueness, so no stronger claim follows.

step 2.1L3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The subfields of Fpn are the unique fields Fpd for positive divisors d of n

Statement

Let F be a field of order pn. For each positive divisor d of n, F has exactly one subfield of order pd, namely

Fd={aF:apd=a}.

These are all the subfields of F.

Facts & Assumptions

Given: A finite field F of order pn.

[L2]

A finite field has prime-power order, and its exponent is its degree over the prime field (Every finite field has order pn for a unique prime characteristic p and positive integer n).

[L3]

The roots of tpdt form a subfield and are simple (In characteristic p, the roots of xpnx form a subfield and are all simple).

[L4]

A field of order pr is the full root set and splitting field of tprt (A field with q elements is the splitting field of xqx over its prime subfield).

Proof

technique · direct
1.1

If KF is a subfield, [L2] gives K=pd and degrees [K:Fp]=d, [F:Fp]=n. The tower law [L1] gives dn.

givenL1L2
1.2

Now let dn and write n=ed. In characteristic p, put Pr(t)=tprdt. The identity Pr+1=Prpd+(tpdt) shows inductively that tpdt divides tpnt.

givenalgebra
2.1

By [L4], tpnt splits in F. Hence its degree-pd divisor from step 1.2 splits there too. By [L3], its roots are distinct and form the subfield Fd, so Fd=pd.

step 1.2L3L4
3.1

If KF has order pd, every element of K satisfies apd=a by [L4], so KFd. Both sets have pd elements, hence K=Fd.

step 2.1L4
4.1

Steps 1.1 and 2.1 give existence exactly for positive divisors d of n, and step 3.1 gives uniqueness and exhausts all subfields.

step 1.1step 2.1step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Over Fq, xqnx is the product of all monic irreducibles whose degrees divide n

Statement

Let Fq be a finite field and let n1. In Fq[t],

tqnt=P monic irreducible degPnP(t),

where each monic irreducible occurs once.

Facts & Assumptions

Given: A finite field Fq and a positive integer n.

[L1]

The order of a finite field is a prime power; write q=pr with r1 (Every finite field has order pn for a unique prime characteristic p and positive integer n).

[L2]

For every prime p and positive integer s, a field of order ps exists (For every prime p and n1, a field with pn elements exists).

[L3]

A field of order Q is the full root set and a splitting field of tQt (A field with q elements is the splitting field of xqx over its prime subfield).

[L4]

The subfields of a field of order ps have orders pu with us (The subfields of Fpn are the unique fields Fpd for positive divisors d of n).

[L5]

If an algebraic element has minimal polynomial of degree d, its simple extension has degree d and the corresponding power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n).

[L6]

Every nonzero nonunit polynomial over a field factors into irreducibles (Every nonzero nonunit polynomial over a field factors into irreducible polynomials).

[L7]

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

[L8]

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

[L9]

For an algebraic element α there is a unique monic irreducible mα with mα(α)=0, and for every f one has f(α)=0 exactly when mαf (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Proof

technique · direct
1.1

By [L1], write q=pr. Use [L2] to choose a field E of order prn=qn. By [L3], E is the full root set and a splitting field of tqnt.

givenL1L2L3choose
1.2

Let P be monic irreducible of degree d1. By [L8] it has a root α in some extension of Fq; since P is monic irreducible and annihilates α, the uniqueness in [L9] makes P the minimal polynomial of α. By [L5], Fq(α) has degree d over Fq and hence has qd=prd elements.

givenL1L5L8L9
2.1

The derivative of tqnt is 1, which vanishes nowhere. Every irreducible factor of tqnt has a root in the splitting field E of step 1.1, and a repeated factor would make that root repeated; so [L7] shows that no irreducible factor repeats.

step 1.1givenL7algebra
2.2

If dn, write n=ed. Applied to the field Fq(α), [L3] gives αqd=α; iterating this identity e times gives αqn=α. So tqnt vanishes at α, and since P is its minimal polynomial by step 1.2, [L9] gives Ptqnt.

step 1.2L3L9algebra
2.3

Conversely, if P divides tqnt, choose its root α in the splitting field E from step 1.1. Then Fq(α) is a subfield of E with order prd, so [L4] gives rdrn, and cancellation yields dn.

step 1.1step 1.2L4choose
3.1

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.

step 2.2step 2.3step 2.1L6
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

For every finite field Fq and every n1, a monic irreducible polynomial of degree n exists

Statement

For every finite field Fq and every integer n1, there exists a monic irreducible polynomial in Fq[t] of degree n.

Facts & Assumptions

Given: A finite field Fq and a positive integer n.

[L1]

The order of a finite field is a prime power; write q=pr (Every finite field has order pn for a unique prime characteristic p and positive integer n).

[L4]

Since rrn, a field of order prn has a unique subfield of order pr=q (The subfields of Fpn are the unique fields Fpd for positive divisors d of n).

[L5]

Finite fields of the same order are isomorphic (Finite fields of the same order are isomorphic).

[L6]

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 1,a,,an1 and degree n).

[L7]

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

technique · contradiction
1.1

By [L1], write q=pr. Choose by [L2] a field E of order prn=qn, and by [L3] a generator a of the cyclic group E×, whose order is qn1.

givenL1L2L3choose
2.1

By [L4] and [L5], identify the unique order-q subfield of E with the given Fq. Since E is finite, the powers a0,a1,,aE cannot be pairwise distinct, so ai=aj for some i<j and a is a root of the nonzero polynomial tjtiFq[t]; by [L7], a is algebraic over Fq. Let ma be its minimal polynomial over that subfield and put d=degma. Then Fq(a) has qd elements by [L6] and is a subfield of E, so dn.

step 1.1L4L5L6L7algebra
3.1

Suppose, for contradiction, that d<n. Then Fq(a) is a proper subfield whose multiplicative group has only qd1<qn1 elements and cannot contain an element of order qn1. This contradicts the choice of a.

step 1.1step 2.1assume-contraalgebra
4.1

Therefore d=n, and ma is the required monic irreducible polynomial.

step 3.1L6discharge-contradiction
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Every finite extension of a finite field is simple

Statement

Every finite-degree extension K/F of a finite field is simple: there exists aK with K=F(a).

Facts & Assumptions

Given: A finite field F and a finite extension K/F of degree n.

[L1]

The multiplicative group of a finite field is cyclic (The multiplicative group Fq× of a finite field is cyclic).

[L2]

Degree n gives a finite basis of K over F (The degree [K:F]=dimFK of a finite field extension).

[L4]

The subfield F(a) is the smallest subfield containing F and a, and an extension equal to such a field is simple (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions).

Proof

technique · constructive
1.1

Coordinates in a finite basis identify K with a finite set of functions from an n-element index set to F, so K is a finite field.

givenL2L3
2.1

By [L1], choose a generator a of the cyclic group K×.

step 1.1L1chooseconstruct
3.1

The subfield F(a) contains 0, 1, and every power of a, hence all of K× and therefore all of K. Thus K=F(a) by [L4].

step 2.1L4
4.1

The chosen a exhibits the extension as simple.

step 3.1discharge-construct
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-16Open item page →

Algebraically constructible real numbers as the smallest real subfield closed under positive square roots

Definition

Let C be the intersection of all subfields ER such that QE and

aE, a>0aE.

This family is nonempty because R 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 C.

This is an algebraic definition. It does not assert an equivalence with a physical straightedge-and-compass model.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions

Statement

A real number x is algebraically constructible if and only if there is a tower

Q=K0K1KrR

with xKr and, for every i, an element aiKi1 with ai>0 such that

Ki=Ki1(ai)and[Ki:Ki1]=2.

The tower may have length zero.

Facts & Assumptions

Given: The algebraically constructible field CR.

[L1]

The field C is the smallest real subfield containing Q and closed under positive square roots (Algebraically constructible real numbers as the smallest real subfield closed under positive square roots).

[L2]

An element algebraic over a field generates a finite simple extension, with degree equal to its minimal-polynomial degree (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[L4]

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

technique · direct
1.1

Let T be the union of all terminal fields of finite towers obtained from Q by adjoining positive square roots, omitting any adjunction whose square root is already present. The empty tower puts Q in T.

givenL3
1.2

Conversely, induction along any such tower shows KiC: the base Q lies in C, and square-root closure puts each generator and hence its generated field in C. Thus TC.

L1
2.1

If x,yT, append the generators of their two towers to one another. Any redundant adjunction is omitted; every remaining step has degree 2, because its generator a is a root of t2a over the base, so by [L4] its minimal polynomial divides t2a and has degree at most 2, while degree 1 would put a in the base, which the omission of redundant adjunctions excludes; [L2] then gives [Ki1(a):Ki1]=2. Thus xy, xy, and x1 for x0 lie in a common terminal field, so T is a subfield.

step 1.1L2L4
3.1

If 0<aT, append a to a tower containing a, or do nothing if it is already present. Hence T is closed under positive square roots. By minimality in [L1], CT.

step 1.1step 2.1L1L3
4.1

Therefore T=C. Membership in T is exactly the existence of a displayed finite quadratic tower, including the zero-length case.

step 3.1step 1.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

An algebraically constructible real algebraic number has degree over Q equal to a power of two

Statement

If a real algebraic number x is algebraically constructible, then

[Q(x):Q]=2s

for some sN.

Facts & Assumptions

Given: A real algebraic, algebraically constructible number x.

[L1]

The element x lies in a finite tower of quadratic extensions beginning at Q (A real number is algebraically constructible exactly when it lies in a finite tower of real quadratic adjunctions).

[L3]

The degree of an intermediate field divides the total finite degree (The degree of an intermediate field divides the degree of a finite extension).

Proof

technique · direct
1.1

Choose from [L1] a tower Q=K0Kr with xKr and every step degree 2.

givenL1choose
2.1

Repeated application of [L2] gives [Kr:Q]=2r.

step 1.1L2algebra
3.1

The simple field Q(x) is intermediate between Q and Kr, so [L3] says its degree divides 2r.

step 1.1step 2.1L3
4.1

By [L4], that positive divisor is 2s for some sr.

step 3.1L4
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

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=23.

[L1]

A constructible real algebraic number has degree over Q equal to a power of 2 (An algebraically constructible real algebraic number has degree over Q equal to a power of two).

[L2]

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

[L3]

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 1,a,,an1 and degree n).

[L4]

Every nonnegative real has a unique nonnegative n-th root for n1 (Existence and uniqueness of n-th roots: a unique a1/n0 with (a1/n)n=a).

Counterexample

technique · contradiction
1.1

By [L4], the real number a exists and satisfies a3=2, so it is algebraic over Q.

givenL4
2.1

The polynomial t32 is Eisenstein at 2, so [L2] makes it irreducible over Q. Hence [L3] gives [Q(a):Q]=3.

step 1.1L2L3
3.1

Suppose, for contradiction, that a is algebraically constructible. Then [L1] makes its degree a power of 2, contrary to step 2.1 because 3 is odd and greater than 1.

step 2.1L1assume-contra
4.1

Therefore a is algebraic but not algebraically constructible, refuting the universal statement.

step 3.1discharge-contradiction

5 · Examples, counterexamples and false statements

None yet.

Sources