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.
The Fundamental Theorem of Algebra: Examples and Counterexamples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Solvability by Radicals and Kummer Theory
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 to , 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 " 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
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
over and over
Example
Let be the real cube root of . Then
over , and
over .
Facts & Assumptions
Given: The polynomial .
Every odd-degree real polynomial has a real root (Every odd-degree real polynomial has a real root).
Every positive real has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
The real numbers form an ordered field (The reals form a totally ordered field).
Verification
By [L1], the polynomial has a real root . Since , [L3] gives . The identity therefore yields over .
If , then which is impossible in because the left-hand side is nonnegative while the right-hand side is negative. So the quadratic factor is irreducible over .
By [L2], let be the real square root of . Solving the quadratic factor from step 1.1 gives the two nonreal roots Substituting them back into the factorization from step 1.1 gives the displayed complete factorization over .
Thus has one real linear factor and one irreducible quadratic factor over , but it splits completely into three linear factors over .
factors over into two irreducible quadratics
Example
Over one has
and each quadratic factor is irreducible.
Facts & Assumptions
Given: The polynomial .
The positive real number has a unique positive square root (Square roots exist: a unique with ; the positives are ).
The real numbers form an ordered field (The reals form a totally ordered field).
Verification
Using from [L1], direct expansion gives
The quadratic has discriminant , so it has no real root; the same is true of . Therefore both quadratic factors are irreducible over .
Their roots in are the four fourth roots of . Pairing each nonreal root with its conjugate recovers the two real quadratic factors from step 1.1.
Hence is a concrete polynomial that is irreducible over neither nor , but over it factors exactly into two irreducible quadratics.
is irreducible over and split over
Example
The polynomial is irreducible in , while over it factors as
Facts & Assumptions
Given: The polynomial .
The polynomial is irreducible in ( is irreducible over ).
Every nonconstant polynomial in splits into linear factors (Every nonconstant polynomial in splits into linear factors).
Verification
Fact [L1] gives the real-side claim immediately: is irreducible over .
In one has so has the two complex roots and . This agrees with the general splitting statement [L2].
Thus is the standard smallest-degree polynomial that is irreducible over but becomes reducible over .
has a real root
Example
The polynomial
has a real root.
Facts & Assumptions
Given: The polynomial .
Every odd-degree real polynomial has a real root (Every odd-degree real polynomial has a real root).
Verification
Direct evaluation gives
The sign change in step 1.1 is exactly the kind of endpoint behaviour used in the proof of [L1]. Since has odd degree, [L1] gives a real root.
Thus is a concrete odd-degree polynomial with a real zero.
over is not solvable by radicals
Example
The irreducible quintic
is not solvable by radicals.
Facts & Assumptions
Given: The polynomial .
Eisenstein's criterion over (Eisenstein criterion over the integers).
Every positive real has a unique positive fourth root (Existence and uniqueness of -th roots: a unique with ).
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).
A continuous real function takes every intermediate value on a closed interval (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
The field is algebraically closed (The complex numbers are algebraically closed).
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).
For prime , a transitive subgroup of containing a transposition is all of (For prime , a transitive subgroup of containing a transposition is all of ).
The group is not solvable ( and for are not solvable).
In characteristic , a polynomial solvable by radicals has solvable Galois group (In characteristic , a polynomial solvable by radicals has a solvable Galois group).
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
The prime divides the coefficients and , does not divide the leading coefficient , and does not divide the constant term . So [L1] makes irreducible over .
Let , which exists by [L2]. For real numbers one has If or , then each of the five degree-four monomials in parentheses is at least , and at least one is strictly larger than ; hence the parenthesis is , so . If , then each of those monomials is at most , and they cannot all equal when : equality in the and terms would force , while would then give and hence . So the parenthesis is , and therefore . Thus is increasing on , decreasing on , and increasing on .
Because and , one has . Also Together with and , the continuity from [L3] and the intermediate value theorem [L5] give a root in each of the three intervals Step 1.2 shows that is monotone on each of the three corresponding regions, so there is at most one root in each. Therefore has exactly three real roots.
By [L6], choose all five roots of in and let be the subfield they generate over . Fact [L11] makes a splitting field of over . Step 2.1 shows that exactly three of those roots are real, so the remaining two roots are nonreal. Complex conjugation on fixes and preserves the root set, hence it restricts to a -automorphism of that fixes the three real roots and swaps the two nonreal roots. Thus contains a transposition.
The field has characteristic , so [L4] makes it perfect. Step 1.1 shows that is irreducible over , and therefore is separable by the defining property of a perfect field in [L4]. Fact [L7] now makes transitive on the five roots. With step 3.1, fact [L8] gives
By [L9], the group is not solvable. If were solvable by radicals, [L10] would force to be solvable, contradicting step 4.1. Hence is not solvable by radicals.
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 .
The polynomial is irreducible in ( is irreducible over ).
Refutation
Since is irreducible and has degree , it has no real root.
Thus is a real polynomial without any real zero.
This single counterexample refutes the claim that every real polynomial has a real root.
FALSE: the real numbers are algebraically closed
Statement
False claim: the field is algebraically closed.
Facts & Assumptions
Given: The polynomial .
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).
The polynomial is irreducible in ( is irreducible over ).
Refutation
By [L2], the polynomial has no real root.
Therefore fails the defining property in [L1] for algebraic closedness.
So the real numbers are not algebraically closed.
FALSE: every irreducible polynomial in has degree
Statement
False claim: every irreducible polynomial in has degree .
Facts & Assumptions
Given: The polynomial .
The polynomial is irreducible in ( is irreducible over ).
An irreducible polynomial in has degree or (An irreducible polynomial in has degree or ).
Refutation
By [L1], the polynomial is irreducible over .
It has degree , and [L2] says that degree is the exact non-linear possibility for irreducible real polynomials.
Therefore the degree-one claim is false.
FALSE: every irreducible quintic over is insoluble by radicals
Statement
False claim: every irreducible quintic over is insoluble by radicals.
Facts & Assumptions
Given: The polynomial .
Eisenstein's criterion over (Eisenstein criterion over the integers).
Every nonconstant polynomial has a root in some extension field (Every nonconstant polynomial over a field has a root in some field extension).
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
Eisenstein at the prime shows that is irreducible over , so it is an irreducible quintic.
By [L2], choose with , choose over with and choose with . Put Then , , and therefore Using , this implies Since , we get , so is a primitive fifth root of unity. Thus every root of has the form with , and all of them lie in
The field tower adjoins successively a square root of , a square root of , and a fifth root of . So is a radical extension. Step 1.2 shows that the splitting field of is contained in , and [L3] therefore makes solvable by radicals.
Hence is an irreducible quintic over that is solvable by radicals, so the universal claim is false.
Sources
- J. S. Milne, Fields and Galois Theory, v5.10, Chapter 5
- J. Lebl, Basic Analysis I, The Fundamental Theorem of Algebra
- Thomas W. Judson, Abstract Algebra: Theory and Applications, extension fields
- Thomas W. Judson, Abstract Algebra: Theory and Applications, polynomials and roots
- Keith Conrad, Applications of Galois Theory, Theorem 2.1
- J. S. Milne, Fields and Galois Theory, v5.10, Sections 5 and 7
- P. L. Clark, Field Theory, Chapters 3 to 5
- J. S. Milne, Fields and Galois Theory, v5.10, Section 7
- J. Ash, Basic Abstract Algebra, Section 6.8