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.

12 results · all verified · 12 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; all 12 also cleared it.

Algebraic Closure, Embeddings, and Separability — 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 + claude-sonnet-5)audited 2026-08-17Open item page →

Assuming Choice, real algebraic numbers embed properly in an algebraic closure of Q

Example

Assume the Axiom of Choice. Let A={rR:r is algebraic over Q}. There is an algebraic closure Q containing a Q-isomorphic copy of A, and that copy is a proper subfield which is not algebraically closed.

Facts & Assumptions

Given: The Axiom of Choice, the rational subfield of the ordered field R, and the set A displayed above.

[L1]

Assuming Choice, every field has an algebraic closure (Assuming Choice, every field has an algebraic closure).

[L2]

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

[L3]

Assuming Choice, a base embedding extends across every algebraic extension into an algebraically closed field (Assuming Choice, a base-field embedding extends across every algebraic extension).

[L4]

The real numbers form an ordered field (The reals form a totally ordered field).

Verification

technique · direct
1.1

By [L2], A is a subfield of R containing Q, and A/Q is algebraic. Choose an algebraic closure Ω/Q by [L1].

L1L2choose
1.2

The polynomial x2+1 has no root in the ordered field AR, since every square is nonnegative and 1<0 by [L4].

L4algebra
2.1

The identity on Q extends by [L3] to an embedding AΩ; denote its image by A.

step 1.1L3
3.1

If A contained a root of x2+1, its preimage under the isomorphism AA would be a root in A, contrary to step 1.2. The algebraically closed field Ω does contain such a root, so A is proper in Ω and is not algebraically closed. No use of C is required.

step 2.1step 1.2algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Fp is the union of its finite subfields and is an infinite algebraic extension

Example

For a prime p, an algebraic closure Fp is the union of its finite subfields. It contains one subfield of order pn for every n1, the nested fields Fpn! for n1 exhaust it, and it is an infinite algebraic extension of Fp.

Facts & Assumptions

Given: A prime p and an algebraic closure Ω=Fp.

[L1]

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

[L2]

Frobenius and all its iterates respect field operations in characteristic p (Frobenius xxp is an injective endomorphism in characteristic p, and an automorphism for finite fields).

[L3]

A subset containing 0,1 and closed under subtraction, multiplication, and nonzero inverses 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]

Every field of order q is the splitting field of xqx over its prime field, and all of its elements are roots (A field with q elements is the splitting field of xqx over its prime subfield).

[L5]

Over every finite field there is an irreducible polynomial of each positive degree (For every finite field Fq and every n1, a monic irreducible polynomial of degree n exists).

[L6]

An algebraic closure is algebraic over its base and algebraically closed (An algebraic closure of a field).

[L7]

A nonzero polynomial is separable exactly when it is coprime to its derivative (A nonzero polynomial over a field is separable exactly when its gcd with its derivative is 1).

[L8]

The degree of a simple algebraic extension is the degree of the minimal polynomial of its generator (A simple algebraic extension is its minimal-polynomial quotient and has power basis 1,a,,an1 and degree n).

Verification

technique · direct
1.1

Every aΩ is algebraic over Fp by [L6], so [L1] makes Fp(a) a finite field. Hence Ω is the union of its finite subfields.

L1L6
1.2

For n1, let En be the roots in Ω of xpnx. This polynomial splits by [L6], and its derivative is 1, so [L7] gives exactly pn distinct roots. By [L2], the root set is closed under subtraction and multiplication, and it is closed under nonzero inverses; hence [L3] makes En a subfield of order pn. Any other subfield of that order consists entirely of roots by [L4], so it equals En.

L2L3L4L6L7algebra
2.1

If a lies in a finite subfield of order pd, choose nd. Every element b of that subfield satisfies bpd=b by [L4]. Since d divides n!, iterating Frobenius by [L2] gives bpn!=b, so the subfield lies in En!. The same argument shows En!E(n+1)!, and step 1.1 now shows that their nested union is all of Ω.

step 1.1step 1.2L2L4
3.1

The irreducibles supplied by [L5] have roots in Ω by [L6], and [L8] makes the generated simple subextensions have arbitrarily large finite degree. Therefore Ω cannot be finite, while it is algebraic by [L6].

L5L6L8
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Q(23) has three embeddings into Q but only one Q-automorphism

Example

Let r=23 be the positive real cube root of 2. The extension Q(r)/Q has three embeddings into an algebraic closure of Q, but its only Q-automorphism is the identity.

Facts & Assumptions

Given: The positive real cube root r of 2 and an algebraic closure Ω/Q.

[L1]

Eisenstein's criterion proves irreducibility over Q for a primitive integer polynomial satisfying its divisibility hypotheses (Eisenstein criterion over the integers).

[L2]

Embeddings of a simple algebraic extension correspond to the distinct roots of its minimal polynomial (F-embeddings of F(α) into an algebraically closed field correspond to the distinct roots of mα).

[L3]

Characteristic-zero fields are perfect, so their irreducible polynomials are separable (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect).

[L5]

The real numbers form an ordered field (The reals form a totally ordered field).

Verification

technique · direct
1.1

The polynomial x32 is Eisenstein at 2, so [L1] makes it the minimal polynomial of r. By [L3] its three roots in Ω are distinct, and [L2] gives three Q-embeddings of Q(r) into Ω.

L1L2L3
1.2

The field Q(r) lies in R. In an ordered field the map xx3 is strictly increasing, or directly u3v3=(uv)(u2+uv+v2) with the second factor positive for uv; hence [L4] and [L5] make r the only real root of x32.

L4L5algebra
2.1

A Q-automorphism of Q(r) must send r to another root lying inside the same real field. Step 1.2 forces that image to be r, so the automorphism fixes the generator and is the identity.

step 1.2L2
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Q(2,3) has four embeddings into Q

Example

The field E=Q(2,3) has degree four over Q and has four embeddings into an algebraic closure. They are the independent sign choices

(2,3)(±2,±3).

Facts & Assumptions

Given: Positive real square roots 2,3 and an algebraic closure Ω/Q.

[L1]

Eisenstein's criterion proves the irreducibility of the integer polynomials used below (Eisenstein criterion over the integers).

[L2]

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

[L3]

Ordinary degrees multiply in finite towers (Tower law for finite extensions: [L:F]=[L:K][K:F]).

[L4]

Embeddings of a simple extension correspond to distinct roots of its minimal polynomial (F-embeddings of F(α) into an algebraically closed field correspond to the distinct roots of mα).

[L5]

Restriction partitions embeddings in a finite tower into equal extension fibres (Restriction partitions embeddings in a finite tower into extension fibres).

[L6]

The notation F(α,β) denotes the subfield generated by the named elements (Field extensions, generated subrings F[S], generated subfields F(S), and simple extensions).

Verification

technique · direct
1.1

Eisenstein at 2, 3, and 2 makes x22, x23, and x26 irreducible over Q by [L1]. Thus none of 2,3,6 is rational, and [L2] gives the basis (1,2) of Q(2)/Q.

L1L2
2.1

If 3=a+b2 with a,bQ, squaring and using the basis gives 2ab=0. If b=0, then 3 is rational; if a=0, then 2b is a rational square root of 6. Both contradict step 1.1. Hence x23 has no root in Q(2) and is irreducible there.

step 1.1L2algebra
3.1

By [L2] the second tower step has degree two, and [L3] gives [E:Q]=4.

step 1.1step 2.1L2L3
4.1

The first square root has two distinct images by [L4]. Over each image of Q(2), the second square root has the two distinct images ±3; [L5] shows these fibres exhaust all extensions. Thus the four independent sign choices are exactly the four embeddings.

L4L5L6
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

xpt is irreducible and inseparable over Fp(t)

Example

Over the rational function field Fp(t), the polynomial xpt is irreducible and inseparable. In a field containing a pth root t1/p, it equals (xt1/p)p.

Facts & Assumptions

Given: A prime p and the rational function field Fp(t).

[L2]

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

[L3]

If a constant is not a pth power, then xpa is irreducible in characteristic p (If a is not a pth power in a characteristic-p field, then xpna is irreducible for every n1).

[L4]

A nonzero polynomial is separable exactly when it is coprime to its derivative (A nonzero polynomial over a field is separable exactly when its gcd with its derivative is 1).

Verification

technique · direct
1.1

Suppose t=(u/v)p with coprime nonzero u,vFp[t], using [L1]. Then up=tvp. In the UFD of [L2], the exponent of the irreducible factor t on the left is divisible by p, while on the right it is congruent to 1 modulo p, a contradiction. Thus t is not a pth power in Fp(t).

L1L2algebra
2.1

By [L3], xpt is irreducible.

step 1.1L3
3.1

Its derivative is zero, so [L4] makes it inseparable. In an extension containing t1/p, the characteristic-p binomial identity gives xpt=(xt1/p)p.

L4algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Fp(t)/Fp(tp) is purely inseparable of degree p and separable degree one

Example

For a prime p, the extension Fp(t)/Fp(tp) is purely inseparable, has ordinary degree p, and has separable degree one.

Facts & Assumptions

Given: A prime p, the field K=Fp(t), and its subfield F=Fp(tp).

[L2]

A polynomial ring over a field is a unique factorization domain (For every field F, F[x] is a unique factorisation domain).

[L3]
[L5]

A finite purely inseparable extension has separable degree one (Pure inseparability and its conjugate, embedding, and separable-degree criteria).

Verification

technique · direct
1.1

Put u=tp, so F=Fp(u). If u=(r(u)/s(u))p for nonzero coprime r,sFp[u], then unique factorization gives 1+pvu(s)=pvu(r), which is impossible modulo p. Thus u is not a pth power in F.

L1L2algebra
2.1

The element t is a root of xpu, which is irreducible by [L3]. Hence [L4] gives K=F(t) and [K:F]=p.

step 1.1L3L4
3.1

For every z=r(t)/s(t)K, characteristic p gives zp=r(t)p/s(t)pFp(tp)=F. Thus K/F is purely inseparable, and [L5] gives [K:F]s=1.

L5algebra
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Fp(s,t)/Fp(sp,tp) has degree p2, infinitely many intermediate fields, and no primitive element

Statement refuted

Every finite purely inseparable extension is simple.

Facts & Assumptions

Given: A prime p, the field F=Fp(sp,tp), and E=Fp(s,t).

[L1]

For every field k, the rational function field k(u) is the fraction field of k[u] (For a field F, F(t)=Frac(F[t]) is its rational function field; in particular R(t)=Frac(R[t])).

[L2]

A polynomial ring over a field is a unique factorization domain (For every field F, F[x] is a unique factorisation domain).

[L3]

In an exponent-one purely inseparable extension, a minimal generating family of length r gives degree pr and the restricted-monomial basis (A minimal generating family in a finite exponent-one purely inseparable extension is a p-basis and gives degree pr).

[L4]

A finite extension is simple exactly when it has finitely many intermediate fields (A finite field extension is simple if and only if it has finitely many intermediate fields).

Counterexample

technique · direct
1.1

Write u=sp and v=tp. In the rational function field Fp(v)(u), the u-adic valuation of a pth power is divisible by p, so u is not a pth power and sF. Likewise, in F(s)=Fp(s)(v), the v-adic valuation shows that v is not a pth power and tF(s). These valuation statements follow from reduced fractions in the UFDs of [L1] and [L2]. Every element of E has its pth power in F, so (s,t) is a minimal generating family for an exponent-one purely inseparable extension. By [L3], [E:F]=p2 and {sitj:0i,j<p} is an F-basis.

L1L2L3algebra
2.1

The base field F is infinite because it contains the rational function field Fp(sp) from [L1]. For each cF, put uc=s+ct. Then ucp=sp+cptpF, while the basis in step 1.1 shows ucF, so [L3] gives [F(uc):F]=p.

step 1.1L1L3algebra
3.1

If cd and F(uc)=F(ud), that common field contains (ucud)/(cd)=t and then s=ucct, so it equals E. This contradicts its degree p against [E:F]=p2. Hence the fields F(uc) are pairwise distinct.

step 1.1step 2.1algebra
4.1

There are therefore infinitely many intermediate fields, and [L4] says that the finite extension E/F is not simple. This refutes the stated universal claim.

step 2.1step 3.1L4
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

n0Fp(t1/pn) is an infinite perfect field of characteristic p

Example

Inside an algebraic closure of Fp(t), let tn be the unique root of xpnt and put Fn=Fp(tn). Then

P:=n0Fn

is an infinite perfect field of characteristic p containing Fp(t).

Facts & Assumptions

Given: A prime p and an algebraic closure Ω of Fp(t).

[L1]

In characteristic p, a field is perfect exactly when Frobenius is surjective (A field is perfect exactly when it has characteristic zero or its Frobenius map is surjective).

[L2]

Frobenius is injective and respects field operations in characteristic p (Frobenius xxp is an injective endomorphism in characteristic p, and an automorphism for finite fields).

Verification

technique · direct
1.1

The given algebraic closure contains a root tn of every xpnt, and [L2] makes that root unique. Take t0=t. Uniqueness gives tn+1p=tn, so FnFn+1.

L2construct
2.1

A nested union of fields is a field, so P is a field of characteristic p containing F0=Fp(t). The distinct powers of the indeterminate t show that this fraction field, and hence P, is infinite.

step 1.1L3algebra
2.2

If z=r(tn)/s(tn)Fn, replace tn by tn+1 in the same rational expression. Since coefficients in Fp are fixed by Frobenius, [L2] shows that the resulting element of Fn+1 has pth power z. Thus Frobenius on P is surjective.

step 1.1L2algebra
3.1

By [L1], P is perfect.

step 2.2L1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: every irreducible polynomial over a field is separable

Statement

Every irreducible polynomial over every field is separable.

Facts & Assumptions

Given: The universal claim in the Statement.

[L1]

Over Fp(t), the polynomial xpt is irreducible, has zero derivative, and is inseparable (xpt is irreducible and inseparable over Fp(t)).

Refutation

technique · direct
1.1

The polynomial in [L1] is an irreducible polynomial over a field which is not separable.

L1
2.1

It is a counterexample to the universal claim, so the Statement is false.

step 1.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: every finite extension satisfies [K:F]s=[K:F]

Statement

Every finite extension K/F satisfies [K:F]s=[K:F].

Facts & Assumptions

Given: The universal equality in the Statement.

[L1]

The finite extension Fp(t)/Fp(tp) has ordinary degree p and separable degree 1 (Fp(t)/Fp(tp) is purely inseparable of degree p and separable degree one).

Refutation

technique · direct
1.1

Since every prime p is greater than 1, the two degrees in [L1] are unequal.

L1algebra
2.1

This finite extension refutes the universal equality.

step 1.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: every algebraic extension is simple

Statement

Every algebraic field extension is simple.

Facts & Assumptions

Given: The universal claim in the Statement and a prime p.

[L1]

The algebraic closure Fp/Fp is algebraic and infinite (Fp is the union of its finite subfields and is an infinite algebraic extension).

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

Refutation

technique · direct
1.1

If Fp=Fp(α) for one element α, then α is algebraic and [L2] would make the extension finite.

L2
2.1

This contradicts the infinitude in [L1]. Hence the algebraic extension Fp/Fp is not simple, refuting the Statement.

step 1.1L1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: an algebraic closure is unique up to a unique base-field isomorphism

Statement

For any two algebraic closures of a field F, there is exactly one F-isomorphism between them.

Facts & Assumptions

Given: The axiom of Choice and the field Q.

[L1]

Assuming Choice, every field has an algebraic closure (Assuming Choice, every field has an algebraic closure).

[L2]

Embeddings of a simple extension correspond to the distinct roots of its minimal polynomial (F-embeddings of F(α) into an algebraically closed field correspond to the distinct roots of mα).

[L3]

Assuming Choice, a base embedding extends across an algebraic extension into an algebraically closed field (Assuming Choice, a base-field embedding extends across every algebraic extension).

[L4]

Assuming Choice, any two algebraic closures of the same field are isomorphic over that field (Assuming Choice, any two algebraic closures are base-isomorphic).

[L5]

An algebraic closure is algebraic over its base and algebraically closed (An algebraic closure of a field).

[L6]

Every algebraic element has a monic irreducible minimal polynomial over the base (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Refutation

technique · direct
1.1

Choose Ω by [L1]. The polynomial x2+1 is irreducible over Q and has a root aΩ by [L5]. Its roots a and a are distinct because Q has characteristic zero. By [L2], the assignment aa gives a nonidentity Q-embedding of Q(a) into Ω.

L1L2L5algebra
2.1

Extend that embedding across the algebraic extension Ω/Q(a) using [L3]. Its image E is algebraically closed because it is isomorphic to Ω. Every bΩ is algebraic over QE by [L5], so [L6] gives a minimal polynomial over E; it has a root in E and is therefore linear. Thus the resulting embedding τ:ΩΩ is surjective, hence is a nonidentity Q-automorphism with τ(a)=a.

step 1.1L3L5L6
3.1

The identity and τ are distinct Q-isomorphisms from the same algebraic closure to itself. Therefore uniqueness of the base-field isomorphism is false, although existence is true by [L4].

step 2.1L4

Sources