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.

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

The Fundamental Theorem of Algebra: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These examples make the theorem visible in the two directions that matter most on this page. The factorisation examples compare what changes when one passes from R to C, while the odd-degree witness isolates one of the page's analytic inputs. The quintic example makes the other visible by using derivatives, monotonicity, and the intermediate value theorem, and its paired false statement does a different job: it stops the reader from confusing "the roots lie in C" with "the polynomial is solvable by radicals."

The closing remark orients this page against the later minimum-modulus proof. The theorem is proved twice in the library on purpose, and the two proofs spend different mathematics.

3 · Logical flowchart

4 · Definitions, theorems and proofs

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

The Artin and minimum-modulus proofs of the fundamental theorem of algebra use different machinery

This page proves the fundamental theorem of algebra by the Artin route: one use of the intermediate value theorem for odd-degree real polynomials, followed by a Galois-theoretic argument using Sylow theory and quadratic extensions. A later item, thm-fundamental-theorem-of-algebra-minimum-modulus-proof, proves the same root-existence statement by a different route, using the minimum-modulus method from complex analysis. Neither proof cites the other.

Milne's honesty note applies here as well: this is not purely a theorem of algebra. The present proof keeps the analytic input small: it uses the intermediate value theorem for the odd-degree root argument and the real square-root existence behind the published complex square-root theorem, while the later minimum-modulus proof spends much more analytic machinery.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

x32 over R and over C

Example

Let r be the real cube root of 2. Then

x32=(xr)(x2+rx+r2)

over R, and

x32=(xr)(x1+i32r)(x1i32r)

over C.

Facts & Assumptions

Given: The polynomial f(x)=x32.

[L1]

Every odd-degree real polynomial has a real root (Every odd-degree real polynomial has a real root).

[L3]

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

Verification

technique · direct
1.1

By [L1], the polynomial f has a real root r. Since r3=2>0, [L3] gives r>0. The identity x3r3=(xr)(x2+rx+r2) therefore yields x32=(xr)(x2+rx+r2) over R.

L1L3algebra
2.1

If x2+rx+r2=0, then (2x+r)2=4x2+4rx+r2=3r2, which is impossible in R because the left-hand side is nonnegative while the right-hand side is negative. So the quadratic factor is irreducible over R.

step 1.1L3algebra
2.2

By [L2], let 3>0 be the real square root of 3. Solving the quadratic factor from step 1.1 gives the two nonreal roots r±i3r2. Substituting them back into the factorization from step 1.1 gives the displayed complete factorization over C.

L2step 1.1algebra
3.1

Thus x32 has one real linear factor and one irreducible quadratic factor over R, but it splits completely into three linear factors over C.

step 2.1step 2.2
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

x4+1 factors over R into two irreducible quadratics

Example

Over R one has

x4+1=(x2+2x+1)(x22x+1),

and each quadratic factor is irreducible.

Facts & Assumptions

Given: The polynomial f(x)=x4+1.

[L1]

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

[L2]

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

Verification

technique · direct
1.1

Using (2)2=2 from [L1], direct expansion gives (x2+2x+1)(x22x+1)=x4+1.

L1algebra
2.1

The quadratic x2+2x+1 has discriminant 24=2<0, so it has no real root; the same is true of x22x+1. Therefore both quadratic factors are irreducible over R.

L2step 1.1algebra
2.2

Their roots in C are 2±i22and2±i22, the four fourth roots of 1. Pairing each nonreal root with its conjugate recovers the two real quadratic factors from step 1.1.

L1step 1.1algebra
3.1

Hence x4+1 is a concrete polynomial that is irreducible over neither R nor C, but over R it factors exactly into two irreducible quadratics.

step 2.1step 2.2
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

x2+1 is irreducible over R and split over C

Example

The polynomial x2+1 is irreducible in R[x], while over C it factors as

x2+1=(xi)(x+i).

Facts & Assumptions

Given: The polynomial f(x)=x2+1.

[L1]

The polynomial x2+1 is irreducible in R[x] (x2+1 is irreducible over R).

[L2]

Every nonconstant polynomial in C[x] splits into linear factors (Every nonconstant polynomial in C[x] splits into linear factors).

Verification

technique · direct
1.1

Fact [L1] gives the real-side claim immediately: x2+1 is irreducible over R.

L1
1.2

In C[x] one has (xi)(x+i)=x2+1, so f has the two complex roots i and i. This agrees with the general splitting statement [L2].

L2algebra
2.1

Thus x2+1 is the standard smallest-degree polynomial that is irreducible over R but becomes reducible over C.

step 1.1step 1.2
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

x5x1 has a real root

Example

The polynomial

f(x)=x5x1

has a real root.

Facts & Assumptions

Given: The polynomial f(x)=x5x1.

[L1]

Every odd-degree real polynomial has a real root (Every odd-degree real polynomial has a real root).

Verification

technique · direct
1.1

Direct evaluation gives f(1)=111=1andf(2)=3221=29.

givenalgebra
2.1

The sign change in step 1.1 is exactly the kind of endpoint behaviour used in the proof of [L1]. Since f has odd degree, [L1] gives a real root.

step 1.1L1
3.1

Thus x5x1 is a concrete odd-degree polynomial with a real zero.

step 2.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-27Open item page →

x56x+3 over Q is not solvable by radicals

Example

The irreducible quintic

f(x)=x56x+3Q[x]

is not solvable by radicals.

Facts & Assumptions

Given: The polynomial f(x)=x56x+3.

[L1]

Eisenstein's criterion over Z (Eisenstein criterion over the integers).

[L2]
[L4]

Every field of characteristic zero is perfect, and over a perfect field every nonconstant irreducible polynomial is separable (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect, Perfect fields: every irreducible polynomial is separable).

[L6]

The field C is algebraically closed (The complex numbers are algebraically closed).

[L7]

A positive-degree separable polynomial is irreducible exactly when its Galois group acts transitively on its roots (A positive-degree separable polynomial is irreducible exactly when its Galois group is transitive on the roots).

[L8]

For prime p, a transitive subgroup of Sp containing a transposition is all of Sp (For prime p, a transitive subgroup of Sp containing a transposition is all of Sp).

[L9]

The group S5 is not solvable (A5 and Sn for n5 are not solvable).

[L10]

In characteristic 0, a polynomial solvable by radicals has solvable Galois group (In characteristic 0, a polynomial solvable by radicals has a solvable Galois group).

[L11]

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

Verification

technique · direct
1.1

The prime 3 divides the coefficients 6 and 3, does not divide the leading coefficient 1, and 32=9 does not divide the constant term 3. So [L1] makes f irreducible over Q.

L1algebra
1.2

Let a:=(6/5)1/4>1, which exists by [L2]. For real numbers x<y one has f(y)f(x)=(yx)(y4+y3x+y2x2+yx3+x46). If ax<y or x<ya, then each of the five degree-four monomials in parentheses is at least a4=6/5, and at least one is strictly larger than 6/5; hence the parenthesis is >5a46=0, so f(y)>f(x). If ax<ya, then each of those monomials is at most a4=6/5, and they cannot all equal 6/5 when x<y: equality in the x4 and y4 terms would force x=y=a, while x<y would then give (x,y)=(a,a) and hence y3x=a4. So the parenthesis is <5a46=0, and therefore f(y)<f(x). Thus f is increasing on (,a], decreasing on [a,a], and increasing on [a,).

L2algebra
2.1

Because a4=6/5<16=24 and a>0, one has a<2. Also f(a)=24a5+3>0andf(a)=324a5<0. Together with f(2)=17<0 and f(2)=23>0, the continuity from [L3] and the intermediate value theorem [L5] give a root in each of the three intervals (2,a),(a,a),(a,2). Step 1.2 shows that f is monotone on each of the three corresponding regions, so there is at most one root in each. Therefore f has exactly three real roots.

L3L5step 1.2algebra
3.1

By [L6], choose all five roots of f in C and let EC be the subfield they generate over Q. Fact [L11] makes E a splitting field of f over Q. Step 2.1 shows that exactly three of those roots are real, so the remaining two roots are nonreal. Complex conjugation on C fixes Q and preserves the root set, hence it restricts to a Q-automorphism of E that fixes the three real roots and swaps the two nonreal roots. Thus Gal(E/Q) contains a transposition.

L6L11step 2.1algebra
4.1

The field Q has characteristic 0, so [L4] makes it perfect. Step 1.1 shows that f is irreducible over Q, and therefore f is separable by the defining property of a perfect field in [L4]. Fact [L7] now makes Gal(E/Q) transitive on the five roots. With step 3.1, fact [L8] gives Gal(E/Q)=S5.

L4L7L8step 1.1step 3.1
5.1

By [L9], the group S5 is not solvable. If f were solvable by radicals, [L10] would force Gal(E/Q) to be solvable, contradicting step 4.1. Hence f is not solvable by radicals.

L9L10step 4.1discharge-contradiction
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

FALSE: every polynomial with real coefficients has a real root

Statement

False claim: every polynomial with real coefficients has a real root.

Facts & Assumptions

Given: The polynomial f(x)=x2+1.

[L1]

The polynomial x2+1 is irreducible in R[x] (x2+1 is irreducible over R).

Refutation

technique · direct
1.1

Since f is irreducible and has degree 2, it has no real root.

L1algebra
2.1

Thus f is a real polynomial without any real zero.

step 1.1
3.1

This single counterexample refutes the claim that every real polynomial has a real root.

step 2.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

FALSE: the real numbers are algebraically closed

Statement

False claim: the field R is algebraically closed.

Facts & Assumptions

Given: The polynomial f(x)=x2+1R[x].

[L1]

A field is algebraically closed exactly when every nonconstant polynomial over it has a root in the field (An algebraically closed field: every nonconstant polynomial has a root in the field).

[L2]

The polynomial x2+1 is irreducible in R[x] (x2+1 is irreducible over R).

Refutation

technique · direct
1.1

By [L2], the polynomial x2+1 has no real root.

L2algebra
2.1

Therefore R fails the defining property in [L1] for algebraic closedness.

L1step 1.1
3.1

So the real numbers are not algebraically closed.

step 2.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

FALSE: every irreducible polynomial in R[x] has degree 1

Statement

False claim: every irreducible polynomial in R[x] has degree 1.

Facts & Assumptions

Given: The polynomial f(x)=x2+1.

[L1]

The polynomial x2+1 is irreducible in R[x] (x2+1 is irreducible over R).

[L2]

An irreducible polynomial in R[x] has degree 1 or 2 (An irreducible polynomial in R[x] has degree 1 or 2).

Refutation

technique · direct
1.1

By [L1], the polynomial x2+1 is irreducible over R.

L1
2.1

It has degree 2, and [L2] says that degree 2 is the exact non-linear possibility for irreducible real polynomials.

L2step 1.1
3.1

Therefore the degree-one claim is false.

step 2.1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27Open item page →

FALSE: every irreducible quintic over Q is insoluble by radicals

Statement

False claim: every irreducible quintic over Q is insoluble by radicals.

Facts & Assumptions

Given: The polynomial q(x)=x52.

[L1]

Eisenstein's criterion over Z (Eisenstein criterion over the integers).

[L2]

Every nonconstant polynomial has a root in some extension field (Every nonconstant polynomial over a field has a root in some field extension).

[L3]

A polynomial is solvable by radicals when its splitting field is contained in a radical extension of the base field (A polynomial is solvable by radicals when its splitting field lies in a radical extension).

Refutation

technique · direct
1.1

Eisenstein at the prime 2 shows that q(x)=x52 is irreducible over Q, so it is an irreducible quintic.

L1algebra
1.2

By [L2], choose s with s2=5, choose β over Q(s) with β2=5s2, and choose α with α5=2. Put u:=1+s2andζ:=u+β2. Then u2+u1=0, ζ2uζ+1=0, and therefore ζ+ζ1=u. Using u2+u1=0, this implies ζ4+ζ3+ζ2+ζ+1=0. Since ζ1, we get ζ5=1, so ζ is a primitive fifth root of unity. Thus every root of q has the form αζk with 0k<5, and all of them lie in L:=Q(s,β,α).

L2constructalgebra
2.1

The field tower QQ(s)Q(s,β)Q(s,β,α)=L adjoins successively a square root of 5, a square root of (5s)/2, and a fifth root of 2. So L/Q is a radical extension. Step 1.2 shows that the splitting field of q is contained in L, and [L3] therefore makes q solvable by radicals.

L3step 1.2
3.1

Hence x52 is an irreducible quintic over Q that is solvable by radicals, so the universal claim is false.

step 1.1step 2.1

Sources