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.

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

Field Extensions and the Complex Numbers: Examples and Counterexamples

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

Q(2)Q[x]/(x22) with basis 1,2

Example

Over the rational field Q (The rationals form a field), let a=2, whose existence and positive choice are supplied by the completeness of R (The Cauchy-sequence reals have the least-upper-bound property) and Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}. Then Q(a)Q[x]/(x22), and every element is uniquely r+sa with r,sQ.

Facts & Assumptions

Given: The element a=2 over Q.

[F1]

Eisenstein's criterion makes a primitive integer polynomial irreducible over Q when some prime divides every nonleading coefficient, does not divide the leading coefficient, and its square does not divide the constant coefficient (Eisenstein criterion over the integers).

[F2]

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

[F4]

An element is algebraic when a nonzero polynomial vanishes at it (Algebraic and transcendental elements and algebraic extensions); for an algebraic element with minimal polynomial ma, f(a)=0 exactly when ma divides f (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Verification

technique · direct
1.1

The polynomial x22 satisfies [F1] at the prime 2, so it is monic and irreducible over Q; since it vanishes at a, [F4] makes it the minimal polynomial of a.

F1F3F4algebra
2.1

Apply [F2] to obtain the quotient isomorphism, the basis 1,a, and the unique form r+sa.

F2step 1.1
3.1

For instance, (1+a)1=a1, because (1+a)(a1)=a21=1.

step 2.1algebra
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedprecheck passaudited 2026-08-13Open item page →

The four-element field (Z/2)[x]/(x2+x+1)

Example

Let F=Z/2, with its quotient arithmetic (For every nN, the congruence-class ring Z/n is the quotient ring Z/nZ). This is a field (For every prime p, the two operations on Z/p make it a field). Then K=F[x]/(x2+x+1)={0,1,a,1+a},a=x+(x2+x+1), is a field of four elements.

Facts & Assumptions

Given: The field F=Z/2 and the polynomial x2+x+1.

[F1]

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

[F2]

The quotient by a monic irreducible degree-n polynomial is a field and has unique representatives of degree below n (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

Verification

technique · direct
1.1

The values of x2+x+1 at 0 and 1 are both 1 in F, so [F1] makes it irreducible.

F1algebra
2.1

By [F2], K is a field and its unique linear representatives are exactly 0,1,x,1+x, giving the displayed four classes.

F2step 1.1
3.1

The defining relation is a2+a+1=0, hence a2=a+1 in characteristic two. Consequently a(a+1)=1 and (a+1)2=a, which determines the products of the nonzero elements.

step 2.1algebra
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

Q[x]/(x21) is not a field: reducibility creates nonzero zero divisors

Statement refuted

The quotient by any nonconstant polynomial over a field is a field.

Counterexample

In the rational field Q (The rationals form a field), take R=Q[x]/(x21). The two classes x1+(x21) and x+1+(x21) are nonzero, but their product is zero.

Facts & Assumptions

Given: The quotient R=Q[x]/(x21).

[F1]

Division by a nonzero polynomial gives a unique remainder of smaller degree (Division algorithm for polynomials over a field).

[F2]

F[x]/(p) is a field if and only if 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).

Verification

technique · counterexample
1.1

Neither x1 nor x+1 lies in (x21): each already has degree below 2, so uniqueness of the remainder in [F1] would otherwise make it zero.

F1
2.1

Yet (x1)(x+1)=x21, so the product of their nonzero classes is zero.

step 1.1algebra
3.1

Thus R has nonzero zero divisors and is not a field, agreeing with [F2] because x21 is reducible.

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

The minimal polynomial of 2+3 over Q is x44x2+1

Example

Let a=2+3, with the nonnegative real square roots supplied by the completeness of R (The Cauchy-sequence reals have the least-upper-bound property) and Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}. Its minimal polynomial over Q is p(x)=x44x2+1, so [Q(a):Q]=4.

Facts & Assumptions

Given: The real number a=2+3.

[F1]

Eisenstein's criterion proves irreducibility over Q under its prime divisibility hypotheses (Eisenstein criterion over the integers).

[F2]

The polynomial-ring universal property gives substitution homomorphisms such as f(x)f(x+1) (Universal property of R[x]: a coefficient homomorphism and the image of x determine a unique ring homomorphism).

[F3]

A root of a nonzero polynomial is algebraic (Algebraic and transcendental elements and algebraic extensions), and the minimal polynomial of an algebraic element is the monic irreducible polynomial generating its evaluation kernel (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F5]

The real numbers are a complete ordered field, so the displayed nonnegative square roots exist and square to their radicands (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

Verification

technique · direct
1.1

From a2=2+3 one obtains (a22)2=3, hence p(a)=a44a2+1=0.

F5algebra
1.2

Substitution from [F2] gives p(x+1)=x4+4x3+2x24x2, which satisfies [F1] at 2 and is therefore irreducible.

F1F2algebra
2.1

Substitution by x1 is inverse to substitution by x+1, so a factorization of p would produce one of p(x+1). Thus p is irreducible.

F2step 1.2algebra
3.1

Since p is monic, irreducible, and annihilates a, [F3] identifies it as the minimal polynomial; [F4] gives degree 4.

F3F4step 1.1step 2.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

The square roots of i are ±(1+i)/2

Example

The two square roots of i are 1+i2and1+i2.

Facts & Assumptions

Given: The imaginary unit iC.

[F2]

The real numbers are a complete ordered field, so the nonnegative real square root satisfies (2)2=2 (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

Verification

technique · direct
1.1

By [F1] and [F2], ((1+i)/2)2=i; its negative has the same square.

F1F2algebra
1.2

Conversely, if (a+bi)2=i, [F1] gives a2=b2 and 2ab=1. Consequently a,b0, they have the same sign, and a=b.

F1algebra
2.1

Then 2a2=1, so [F2] gives a=b=1/2 or a=b=1/2. These are exactly the two values in step 1.1.

F2step 1.2algebra
3.1

Thus the existence guaranteed abstractly by [F3] is realized by exactly the two displayed roots.

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

FALSE: the complex field admits an order making it an ordered field

Statement refuted

There is a total order on C compatible with its field operations.

Facts & Assumptions

Given: The proposed ordered-field structure on C.

[F1]

In an ordered field every nonzero square is positive (Squares of nonzero elements are positive).

Refutation

technique · contradiction
1.1

Suppose such an ordered-field structure existed. Since i0, [F1] and [F2] would give 1=i2>0.

assume-contraF1F2
2.1

Also 1=12>0 by [F1], so compatibility with addition gives 0=1+(1)>0, impossible in a strict order.

F1step 1.1algebra
3.1

Therefore no order compatible with the complex field operations exists.

step 2.1discharge-contradiction
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-13Open item page →

An annihilating polynomial need not be minimal: 2 is a root of both x22 and x44

Statement refuted

Every nonzero polynomial that vanishes at an algebraic element is that element's minimal polynomial.

Counterexample

Let a=2, whose nonnegative real value satisfies a2=2 because R is complete (The Cauchy-sequence reals have the least-upper-bound property, Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}). Then both x22 and x44 vanish at a, but only the first is minimal.

Facts & Assumptions

Given: The algebraic number a=2 over Q.

[F1]

Eisenstein's criterion proves irreducibility over Q under its prime divisibility hypotheses (Eisenstein criterion over the integers).

[F2]

The minimal polynomial is the unique monic irreducible generator of the evaluation kernel, and it divides every annihilating polynomial (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

Verification

technique · counterexample
1.1

Evaluation gives a22=0 and a44=0.

F3algebra
2.1

The polynomial x22 satisfies [F1] at 2, so [F2] identifies it as the minimal polynomial of a over Q.

F1F2step 1.1
3.1

The other annihilator factors as x44=(x22)(x2+2) and has larger degree, so it is a proper multiple of the minimal polynomial.

step 2.1algebra
4.1

Thus a polynomial may annihilate an algebraic element without being its minimal polynomial.

step 1.1step 3.1

Sources