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.

8 results · all verified · 2 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.

Splitting Fields: Examples

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-13Open item page →

The base field is the splitting field of the empty family and of every nonzero constant polynomial

Example

For every field F, the splitting field over F of the empty family is F. The same is true for every nonzero constant polynomial cF[x].

Facts & Assumptions

Given: A field F.

[F1]

A nonzero degree-zero polynomial splits as its leading coefficient times an empty product, and a splitting field is generated by the roots of the polynomial or family (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

Verification

technique · direct
1.1

The empty family has no roots, and a nonzero constant also has no roots. In either case the subfield generated over F by the empty root set is F itself.

F1
2.1

The empty family is vacuously split over F, while c=cj=10(xαj) is the required empty linear factorisation. Thus both cases satisfy the splitting-field definition.

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

The splitting field of x22 over Q is Q(2), with roots ±2

Example

The splitting field of x22 over Q is Q(2), and its roots are 2 and 2. Moreover, 1,2 is a Q-basis.

Facts & Assumptions

Given: The polynomial x22Q[x] and the positive real square root 2.

[F1]

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

[F2]

The nonnegative real number 2 has a unique nonnegative square root 2 with (2)2=2 (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

[F3]

Eisenstein's criterion proves a primitive integer polynomial irreducible when a 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).

[F4]

A simple extension by an algebraic element whose minimal polynomial has degree n has power basis through degree n1 (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n).

[F5]

A splitting field is generated by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[F6]

The minimal polynomial of an algebraic element is the unique monic irreducible polynomial that vanishes at it (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Verification

technique · direct
1.1

By [F2], x22=(x2)(x+2) over R. Its two roots are ±2, and both lie in Q(2).

F1F2algebra
1.2

Eisenstein's criterion [F3] with the prime 2 makes x22 irreducible over Q. It is monic and vanishes at 2, so [F6] identifies it as the minimal polynomial; [F4] then gives the basis 1,2.

F2F3F4F6
2.1

The field generated by both roots is Q(2,2)=Q(2), so [F5] identifies it as the splitting field.

F5step 1.1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The splitting field of x32 over Q is Q(23,ω) with ω=(1+i3)/2

Example

Let α=23>0 and ω=(1+i3)/2C. The roots of x32 are α,αω,αω2, and its splitting field over Q is Q(α,ω). It is spanned over Q by at most 3!=6 root monomials.

Facts & Assumptions

Given: The polynomial x32Q[x], the positive real root α=23, and ω=(1+i3)/2.

[F3]

Once one nonzero root α of xna is fixed, all roots are ζα for the nth roots of unity ζ (After adjoining one nonzero root α of xna, all roots are ζα with ζn=1).

[F4]

A degree-n polynomial has a splitting field spanned by at most n! root monomials (A degree-n polynomial has a splitting field spanned over F by at most n! explicit root monomials).

[F5]

Eisenstein's criterion applies over Q to the stated integer divisibility hypotheses (Eisenstein criterion over the integers).

[F6]

Any two splitting fields of a nonzero polynomial are isomorphic by an isomorphism fixing the base field (Any two splitting fields of a polynomial are isomorphic over the base field).

Verification

technique · direct calculation
1.1

By [F1], α3=2 and 32=3. Using [F2], direct calculation gives ω2+ω+1=0, ω1, and x31=(x1)(xω)(xω2). Hence the cube roots of unity are exactly 1,ω,ω2.

F1F2algebra
2.1

By [F3], the roots of x32 are exactly α,αω,αω2. They generate Q(α,ω) because α is a root and ω=(αω)/α, with α0. Hence this field is the splitting field.

F3step 1.1
3.1

Eisenstein at 2 makes x32 irreducible over Q. Independently, [F4] gives a splitting field spanned by at most 3!=6 root monomials; an isomorphism from it to Q(α,ω) supplied by [F6] fixes Q and carries roots to roots by direct evaluation, so it transports that spanning family to one of the stated kind here.

F4F5F6step 2.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The splitting field of x4+2x28 over Q is Q(2,i)

Example

The polynomial x4+2x28 has roots ±2 and ±2i, so its splitting field over Q is Q(2,i).

Facts & Assumptions

Given: The polynomial x4+2x28Q[x].

[F3]

A splitting field is the field generated over the base by all roots of the polynomial (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

Verification

technique · direct factorisation
1.1

Over Q, direct multiplication gives x4+2x28=(x22)(x2+4). By [F1] and [F2], the first factor has roots ±2 and the second has roots ±2i.

F1F2algebra
2.1

All four roots lie in Q(2,i). Conversely, the field generated by them contains 2 and i=(2i)/2, so it is exactly Q(2,i). The claim follows from [F3].

F3step 1.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The splitting field of {x22,x23} over Q is Q(2,3)

Example

The splitting field over Q of the family {x22,x23} is Q(2,3).

Facts & Assumptions

Given: The family {x22,x23}Q[x].

[F1]

The nonnegative real numbers 2 and 3 have square roots with the defining square equations (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

[F2]

The splitting field of a product inside a common extension is the composite of the splitting fields of its two factors (Inside a common extension, the splitting field of fg is the composite of the splitting fields of f and g).

[F3]

A finite family has the same splitting field as the product of its nonzero members (Every finite family of nonzero polynomials has a splitting field, obtained from their product).

[F4]

A splitting field is the field generated over the base by all roots of a polynomial that splits there (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

Verification

technique · direct
1.1

By [F1], the roots of x22 are ±2, so [F4] makes its splitting field Q(2). Similarly the splitting field of x23 is Q(3).

F1F4algebra
2.1

Their composite is the smallest field containing both, namely Q(2,3). By [F2] it splits the product, and by [F3] it is the splitting field of the stated family.

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

Over F2, x4+x2+1=(x2+x+1)2 has two distinct roots, each repeated, in its four-element splitting field

Example

Over F2, x4+x2+1=(x2+x+1)2. The polynomial x2+x+1 is irreducible. If u is one of its roots, the four-element field F2(u)={0,1,u,u+1} is the splitting field, and the two distinct roots u and u+1 each occur with multiplicity two in x4+x2+1, meaning that their linear factors have exponent two in its factorisation.

Facts & Assumptions

Given: The polynomial x4+x2+1F2[x].

[F1]
[F2]

A quadratic over a field is irreducible exactly when it has no root in the field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).

[F3]

For monic irreducible p of degree 2, the quotient F[x]/(p) is a field whose elements have unique form a+bu, and u is a root of p (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

[F4]

A root a is repeated when (xa)2 divides the polynomial (Repeated roots in extension fields and separable polynomials).

[F5]

A splitting field is generated by the roots of a polynomial that splits there (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[F6]

For every field K, the polynomial ring K[x] is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

Verification

technique · direct calculation
1.1

In characteristic 2, (x2+x+1)2=x4+x2+1. The polynomial p=x2+x+1 takes the value 1 at both 0 and 1, so [F2] makes it irreducible.

F1F2algebra
1.2

By [F3], adjoining u=x+(p) gives a field with the four distinct elements 0,1,u,u+1 and relation u2+u+1=0. Substituting u+1 into p in characteristic 2 also gives zero, so p=(xu)(x(u+1)).

F1F3algebra
2.1

Squaring the factorisation yields x4+x2+1=(xu)2(x(u+1))2. The two roots are distinct by step 1.2, and any root of the displayed product equals one of them because a field has no zero divisors. Uniqueness of factorisation in [F6] makes both displayed exponents exactly two; in particular [F4] makes both roots repeated. Finally [F5] identifies F2(u) as their splitting field.

F4F5F6step 1.1step 1.2algebra
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Adjoining one root need not split the polynomial: Q(23) does not split x32

Statement refuted

If a field is obtained by adjoining one root of a polynomial, then the polynomial splits over that field.

Facts & Assumptions

Given: The real root α=23 of x32 and the field Q(α).

[F1]

For α=23 and ω=(1+i3)/2, the roots of x32 are α,αω,αω2 (The splitting field of x32 over Q is Q(23,ω) with ω=(1+i3)/2).

Counterexample

technique · direct
1.1

The positive real number α=23 is a root of x32, and every element of Q(α) is real because it is obtained from rational numbers and α by field operations inside R.

F2
1.2

In [F1], the imaginary part of ω is 3/2>0, while direct multiplication gives the imaginary part of ω2 as 3/2<0. Since α>0, the roots αω and αω2 are both nonreal and hence neither lies in Q(α).

F1F2algebra
2.1

Therefore Q(α) contains one root but not all roots of x32, so the polynomial does not split there.

F1step 1.1step 1.2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

FALSE: the isomorphism between two splitting fields that fixes the base field is unique

Statement

False statement. If E and E are splitting fields of the same polynomial over F, there is exactly one isomorphism EE that fixes F pointwise.

Facts & Assumptions

Given: The splitting field E=Q(2) of x22 over Q.

[F1]

Any two splitting fields of the same nonzero polynomial are isomorphic over the base field (Any two splitting fields of a polynomial are isomorphic over the base field).

[F2]

The splitting field of x22 over Q is E=Q(2), with roots 2 and 2 (The splitting field of x22 over Q is Q(2), with roots ±2).

[F3]

An isomorphism of base fields extends across simple adjunctions when a chosen root is sent to a corresponding root of the transported irreducible polynomial (A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial).

[F4]

Eisenstein's criterion proves a primitive integer polynomial irreducible under its prime-divisibility hypotheses (Eisenstein criterion over the integers).

Refutation

technique · counterexample
1.1

Take both splitting fields to be E=E=Q(2) for x22. The identity map is one Q-isomorphism EE.

F2
1.2

The polynomial x22 satisfies [F4] with the prime 2, so it is irreducible. Apply [F3] to the identity on Q and the corresponding roots 2 and 2. It gives a Q-automorphism τ:EE satisfying τ(2)=2.

F2F3F4
2.1

The roots are distinct: if 2=2, then 22=0, and multiplication by 1/2 would give 2=0, contradicting (2)2=2. Hence τ is not the identity. Thus there are at least two base-fixing isomorphisms, refuting uniqueness while leaving the existence result [F1] intact.

F1F2step 1.1step 1.2algebra

Sources