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.

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

Algebraic Extensions, Extension Degree, and Finite Fields — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Q(2)/Q has degree two

Example

The extension Q(2)/Q has degree 2 and basis (1,2). Its coordinate arithmetic includes

(a+b2)(c+d2)=(ac+2bd)+(ad+bc)2.

Facts & Assumptions

Given: The positive real number s=2.

[L1]

If an algebraic element has irreducible minimal polynomial of degree n, its simple extension has power basis 1,a,…,an−1 and degree n (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n).

[L2]

Eisenstein's criterion proves suitable primitive integer polynomials irreducible over Q (Eisenstein criterion over the integers).

Verification

technique · direct
1.1givenL2L3

By [L3], s2=2. The polynomial t2−2 is Eisenstein at 2, so [L2] makes it irreducible over Q.

2.1step 1.1L1

Apply [L1] to obtain the basis (1,s) and degree 2.

3.1step 1.1algebra∎

Multiplying (a+bs)(c+ds) and reducing s2 to 2 gives the displayed coordinate formula.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Q(23)/Q has degree three

Example

If a=23, then Q(a)/Q has degree 3 and basis (1,a,a2).

Facts & Assumptions

Given: The positive real cube root a of 2.

[L1]

A simple algebraic extension has degree equal to the degree of the element's minimal polynomial and has the corresponding power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n).

[L2]

Eisenstein's criterion proves suitable primitive integer polynomials irreducible over Q (Eisenstein criterion over the integers).

[L3]

The positive real n-th root exists uniquely for every positive input and n≥1 (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a).

Verification

technique · direct
1.1givenL2L3

By [L3], a3=2. The polynomial t3−2 is Eisenstein at 2, so it is irreducible by [L2].

2.1step 1.1L1∎

Its minimal polynomial therefore has degree 3, and [L1] gives degree 3 and basis (1,a,a2).

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Q(2,3) has degree four and equals Q(2+3)

Example

The biquadratic field satisfies

[Q(2,3):Q]=4,

has basis (1,2,3,6), and is simple:

Q(2,3)=Q(2+3).

Facts & Assumptions

Given: The positive roots u=2, v=3, and a=u+v.

[L2]

Products of bases form a basis in a tower (Products of bases form a basis in a tower of finite extensions).

[L3]

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

Verification

technique · direct
1.1givenL4algebra

The polynomial t2−2 is irreducible over Q. Also v∉Q(u): if v=r+su with rationals r,s, squaring and using uniqueness of the coordinates (1,u) gives 2rs=0 and r2+2s2=3; either case would make 3 or 3/2 a rational square, contradicted by comparing the parity of prime exponents in numerator and denominator.

1.2givenalgebra

Since (u+v)(v−u)=v2−u2=1, one has a−1=v−u. Therefore v=(a+a−1)/2 and u=(a−a−1)/2 both lie in Q(a).

2.1step 1.1L1L2

Hence both steps in Q⊂Q(u)⊂Q(u,v) have degree 2. By [L1] the total degree is 4, and [L2] gives the product basis (1,u,v,uv).

3.1step 1.2L3∎

Thus Q(u,v)⊆Q(a), while the reverse inclusion follows from a=u+v and [L3]. The fields are equal.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-16Open item page →

The relative algebraic closure of R in C is all of C

Example

The relative algebraic closure of R in C is C itself.

Facts & Assumptions

Given: A complex number z=a+bi with a,b∈R.

[L1]

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

Verification

technique · direct
1.1givenL2algebra

The nonzero real polynomial (t−a)2+b2 vanishes at z, because (z−a)2+b2=(bi)2+b2=0.

2.1step 1.1L1∎

Thus every z∈C is algebraic over R, so [L1] identifies the relative algebraic closure with all of C.

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

F4=F2[t]/(t2+t+1) with complete addition and multiplication tables

Example

Let a be the residue class of t in F2[t]/(t2+t+1). Then a2=a+1, and the field has elements 0,1,a,a+1 with tables

+01aa+1
001aa+1
110a+1a
aaa+101
a+1a+1a10
⋅01aa+1
00000
101aa+1
a0aa+11
a+10a+11a

Facts & Assumptions

Given: The quotient A=F2[t]/(t2+t+1) and the residue class a of t.

[L1]

For a field F, the quotient F[t]/(p) is a field exactly when the nonconstant polynomial 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).

[L3]

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

Verification

technique · direct
1.1givenL1L2

The polynomial t2+t+1 has value 1 at both 0 and 1, so it has no root in F2 and is irreducible. By [L1] and [L2], A is a field.

2.1step 1.1algebra

Every residue has the unique form c+da with c,d∈F2, and the relation is a2+a+1=0, hence a2=a+1.

3.1step 2.1L3algebra∎

Applying characteristic-two addition and the reduction in step 2.1 gives every entry in the two displayed tables. In particular a(a+1)=1 and (a+1)2=a, so the three nonzero elements form the cyclic group 1,a,a+1 predicted by [L3].

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

F8=F2[t]/(t3+t+1) and its power table

Example

Let a be the residue class of t in F2[t]/(t3+t+1). Then

a3=a+1,a4=a2+a,a5=a2+a+1,a6=a2+1,a7=1.

Together with 0 and the low powers a0=1, a1=a, a2, these are all eight elements.

Facts & Assumptions

Given: The quotient A=F2[t]/(t3+t+1) and the class a of t.

[L1]

A polynomial quotient over a field is a field exactly when its modulus 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).

[L2]

An irreducible cubic simple extension has power basis (1,a,a2) and degree 3 (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,…,an−1 and degree n).

Verification

technique · direct
1.1givenL1L3

A reducible cubic over a field has a linear factor. The polynomial t3+t+1 has value 1 at both elements of F2, so it is irreducible; [L1] and [L3] make A a field.

2.1step 1.1L2algebra

By [L2], the eight coefficient triples in the basis (1,a,a2) are the eight elements of A, and a3=a+1.

3.1step 2.1algebra∎

Successive multiplication by a and reduction by a3=a+1 gives the displayed powers. Together with a0=1, a1=a and a2, the powers a0,…,a6 are the seven distinct nonzero basis combinations, and the next product returns a7=1.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

F9=F3[t]/(t2+1) and a generator of its multiplicative group

Example

In F9=F3[t]/(t2+1), write a for the class of t. Then a2=2 and a has order 4, while 1+a has order 8 and generates F9×.

Facts & Assumptions

Given: The quotient A=F3[t]/(t2+1) and the class a of t.

[L1]

A polynomial quotient over a field is a field exactly when its modulus 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).

[L3]

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

Verification

technique · direct
1.1givenL1L2

The squares in F3 are 0 and 1, so t2+1 has no root and is irreducible. Thus [L1] and [L2] make A a field with the nine elements r+sa, where r,s∈F3, and a2=2.

2.1step 1.1algebra

One has a2=2 and a4=1, with a2≠1, so a has order 4. Put b=1+a. Then b2=2a, b4=2, and b8=1.

3.1step 2.1L3∎

Since b2≠1 and b4≠1, its order is 8. Hence it exhausts the eight nonzero elements and is a generator, as [L3] guarantees some element must be.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Frobenius on F4 swaps the two non-prime-field elements

Example

In F4=F2[t]/(t2+t+1), with a the class of t, Frobenius fixes 0,1, sends a to a+1, and sends a+1 to a. Its square is the identity.

Facts & Assumptions

Given: The quotient description of F4 and the class a.

[L1]

In characteristic 2, Frobenius x↦x2 is an injective field endomorphism, and it is an automorphism when the field is finite; its second iterate is x↦x4 (Frobenius x↦xp is an injective endomorphism in characteristic p, and an automorphism for finite fields).

Verification

technique · direct
1.1givenL2L3

The modulus has no root in F2, so [L2] and [L3] give the field with relation a2=a+1.

2.1step 1.1L1algebra

Squaring gives 02=0, 12=1, a2=a+1, and (a+1)2=a2+1=a.

3.1step 2.1L1∎

Thus Frobenius swaps the two non-prime-field elements and fixes the prime field. Applying the swap twice is the identity, agreeing with x4=x from [L1].

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

The subfields of F64 have orders 2,4,8,64

Example

The subfields of F64=F26 have orders 2,4,8,64. For d=1,2,3,6, the unique subfield of order 2d is

{a∈F64:a2d=a}.

Facts & Assumptions

Given: A field F of order 64=26.

[L1]

The subfields of Fpn are the unique fields of order pd for positive divisors d of n, and each is the root set of tpd−t (The subfields of Fpn are the unique fields Fpd for positive divisors d of n).

Verification

technique · direct
1.1givenalgebra

The positive divisors of 6 are 1,2,3,6.

2.1step 1.1L1algebra∎

Apply [L1] with p=2 and these four divisors to obtain the orders 21,22,23,26, namely 2,4,8,64, and the displayed root-set descriptions.

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

The residue class of t generates F8×

Example

In F8=F2[t]/(t3+t+1), the residue class a of t has order 7 and generates F8×.

Facts & Assumptions

Given: The quotient A=F2[t]/(t3+t+1) and the class a.

[L1]

A polynomial quotient over a field is a field exactly when its modulus 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]

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

Verification

technique · direct
1.1givenL1L2L3

The cubic has no root in F2, so [L1] and [L3] make the quotient a field, and [L2] gives its eight elements. The defining relation is a3=a+1.

2.1step 1.1algebra

Reduction gives a0=1, a, a2, a3=a+1, a4=a2+a, a5=a2+a+1, a6=a2+1, and a7=1.

3.1step 2.1L4∎

The first seven displayed powers are distinct and are all nonzero elements, so a has order 7 and generates A×, in agreement with [L4].

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

An algebraic extension need not be finite

Statement refuted

Every algebraic field extension is finite.

Facts & Assumptions

Given: For m≥0, let am=21/2m be the positive real root and Km=Q(am), and put K=⋃m≥0Km.

[L1]

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

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

[L5]

Eisenstein's criterion proves t2m−2 irreducible at 2 (Eisenstein criterion over the integers).

Counterexample

technique · contradiction
1.1givenL4

By [L4], the elements am exist, and am+12=am, so Km⊆Km+1 and the union K is a field.

1.2L5L6

By [L5] and [L6], [Km:Q]=2m for every m.

2.1step 1.1L1L5L6

Every element of K lies in some Km. By [L5] and [L6], the extension Km/Q has finite degree 2m, so [L1] makes each of its elements algebraic over Q. Thus K/Q is algebraic.

2.2step 1.2L3assume-contrachoose

Suppose, for contradiction, that K/Q has finite degree N. Then [L3] makes 2m=[Km:Q] divide N for every m. Choosing m with 2m>N is impossible.

3.1step 2.1step 2.2discharge-contradiction∎

Thus K/Q is algebraic by step 2.1 but not finite, refuting the statement.

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

There is no field with six elements

Statement refuted

There exists a field with six elements.

Facts & Assumptions

Given: A hypothetical field F with ∣F∣=6.

[L1]

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

[L3]

If a prime divides a product, it divides one of the factors (Euclid's lemma: if p is prime and p∣ab then p∣a or p∣b).

Counterexample

technique · contradiction
1.1givenL1assume-contra

Suppose, for contradiction, that F exists. By [L1], 6=pn for some prime p and n≥1.

2.1step 1.1L2L3algebra

The prime p divides 6=2⋅3, so [L3] gives p∣2 or p∣3, and [L2] forces p=2 or p=3. But no positive power of 2 is 6, and no positive power of 3 is 6: at exponent one the values are 2 and 3, while at exponent at least two they are divisible by 4 or 9.

3.1step 2.1discharge-contradiction∎

This contradiction proves that no six-element field exists.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

FALSE: Fpn is the ring Z/pnZ

Statement

For every prime p and positive integer n, the finite field Fpn is the quotient ring Z/pnZ.

Facts & Assumptions

Given: The case p=2, n=2.

[L2]

The congruence-class ring Z/4 is the quotient ring Z/4Z (For every n∈N, the congruence-class ring Z/n is the quotient ring Z/nZ).

[L3]

In a field every nonzero element has an inverse, so a nonzero nilpotent cannot exist (Field).

Refutation

technique · direct
1.1givenL1L2algebra

By [L1], F4 is a field. In Z/4Z, the class [2] is nonzero but [2]2=[4]=[0].

2.1step 1.1L3

Thus Z/4Z has a nonzero nilpotent and is not a field by [L3], so it cannot be isomorphic to F4.

3.1step 2.1∎

This single case refutes the universal identification. Equal cardinality does not determine a ring structure.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-16Open item page →

FALSE: degrees add in a tower of finite field extensions

Statement

For every finite tower F⊆K⊆L, one has

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

Facts & Assumptions

Given: A field L of order 64=26.

[L1]

The tower law is multiplicative: [L:F]=[L:K][K:F] (Tower law for finite extensions: [L:F]=[L:K][K:F]).

[L2]

The field F64 has a unique subfield K of order 4 and prime subfield F of order 2 (The subfields of Fpn are the unique fields Fpd for positive divisors d of n).

Refutation

technique · direct
1.1givenL2L3

Choose L=F64 using [L3], let F=F2, and let K=F4⊆L from [L2]. Then [K:F]=2 and [L:F]=6.

2.1step 1.1L1algebra

By the true tower law [L1], 6=[L:K]⋅2, so [L:K]=3.

3.1step 1.1step 2.1∎

The false additive formula would give [L:F]=3+2=5, contradicting the actual value 6. Thus degrees multiply, rather than add, in a tower.

Sources