Chapter 3 — Polynomials and Rational Functions
3.4 — Complex Roots and the Fundamental Theorem of Algebra
What denied to , grants to every polynomial, without exception.
§3.3 resolved one case: has roots in . A much more ambitious question remains open, the one that truly motivates building instead of settling for patching case by case: does every nonconstant polynomial have at least one complex root? The answer is affirmative, and it is one of the deepest results in all of algebra.
§1. The Fundamental Theorem of Algebra
Section titled “§1. The Fundamental Theorem of Algebra”Theorem (Fundamental Theorem of Algebra). Every nonconstant polynomial with coefficients in has at least one root in .
This text does not prove the Fundamental Theorem of Algebra. Not for lack of rigor, but out of honesty about which tools are available: every known proof, whether Gauss’s, the one that uses Liouville’s theorem from complex analysis, or the one that argues by a minimum of the modulus of over , requires notions of continuity, compactness or analysis that exceed the algebra developed so far. The situation is not new: §1.1 §9 already postulated the Supremum Axiom without deriving it from the field laws, precisely because it was not an algebraic consequence but an additional structural property of . The Fundamental Theorem of Algebra is adopted here in the same spirit: as a structural fact about , given, on which to build everything that follows.
What the theorem does not say is, however, as important as what it says. It offers no method for finding that root, unlike the Rational Root Theorem of §3.2, which at least bounded the search to a finite one; it guarantees only its existence. And it says nothing, yet, about how many roots a polynomial has in total: that is the question of the next section.
Note — the geometric intuition of the theorem. Although this text offers no proof, it is worth sketching why the result is plausible. If is evaluated on a circle of very large radius in the complex plane, the term dominates the others by a wide margin, the same phenomenon of dominance of the leading term already proved in §3.1 §2 for over ; as that circle is traversed once, the image traces a closed curve that winds, approximately, times around the origin. If is continuously shrunk down to , that curve deforms without breaking, by the continuity of , until it collapses to the single point . A curve that winds times around the origin cannot contract to a point outside it without, at some intermediate moment, passing exactly through the origin: that crossing is a root with . The argument is convincing, but it is not a proof: making precise what “without breaking” and “winding times” mean, with the necessary rigor, is exactly the task that belongs to complex analysis.
§2. Complete factorization over ℂ
Section titled “§2. Complete factorization over ℂ”§3.2 proved that a polynomial of degree has at most real roots, without guaranteeing that any exist. Over , the Fundamental Theorem of Algebra turns that upper bound into an exact equality.
Theorem (complete factorization). Every polynomial of degree with coefficients in factors as
for certain , not necessarily distinct.
Proof. By induction on . If , , of the desired form with . Suppose the result holds for every degree less than , and let . By the Fundamental Theorem of Algebra, has a root ; by the Factor Theorem, proved in §3.2 without restriction to the field over which we work, since its proof used only the division algorithm, which is valid in exactly as in , with and leading coefficient . By the inductive hypothesis, , and substituting gives the complete factorization of .
This factorization is, in particular, what formalizes the notion of multiplicity already introduced in §3.1 for real roots, now extended without conceptual change to complex roots: if a value is repeated times among , we say that is a root of multiplicity , and the sum of all the multiplicities is exactly . Where §3.2 could only bound the number of real roots, this theorem counts the number of complex roots precisely: there are always , neither one more nor one fewer, counted with multiplicity. does not merely resolve the case of ; it completely exhausts the question that §3.2 left open.
§3. The Conjugate Root Theorem
Section titled “§3. The Conjugate Root Theorem”The factorization of §2 holds over in general, without distinguishing whether the coefficients of are real or genuinely complex. When they are real, the case that dominates the rest of this book, the complex roots do not appear in just any way: they appear in pairs.
Lemma. For , and . Moreover, for every .
Proof. Let , . On one hand, ; on the other, : they coincide. For the product, , while by the definition of the product given in §3.3 §1: both expressions coincide. The third claim remains: if , its identification in is , and .
Theorem (Conjugate Root Theorem). Let be a polynomial with all . If is a root of , then is also a root, with the same multiplicity.
Proof. Suppose . Applying conjugation to both sides and using the lemma repeatedly to distribute conjugation over the sum and the powers,
where each because it is real, according to the lemma. Since , we conclude : is a root of . For the equality of multiplicities, observe that if is real, and the claim is trivial; if is not real, the previous argument applied to , the quotient after extracting, by means of the Factor Theorem, all the copies of the factor up to the exact multiplicity of , shows, by the same computation, that is still a root of that quotient, so that also divides at least times; the equality, and not only the inequality, is obtained by repeating the argument in the opposite direction, interchanging and .
The immediate consequence is that the nonreal roots of a polynomial with real coefficients never appear alone: with always brings along , with equal multiplicity. This is, precisely, the phenomenon that the general formula of §1.3 already hinted at without being able to name it: when , the two roots of a real quadratic trinomial are , a conjugate pair, long before formally existed to justify why they had to come in twos.
§4. Real factorization: linear factors and irreducible quadratic factors
Section titled “§4. Real factorization: linear factors and irreducible quadratic factors”The three previous results combine to answer, at last and completely, the question that §1.3 left pending about irreducibility over .
Theorem. Every polynomial of degree with real coefficients factors as a product of real linear factors and irreducible real quadratic factors, that is, quadratics with negative discriminant.
Proof. By §2, over . Group the real , which already give real linear factors . For each nonreal , §3 guarantees that also appears among the roots, with equal multiplicity; group them in pairs . Each of those products is
using that and , both real, according to §3.3 §4: a quadratic polynomial with real coefficients. Its discriminant is , since because is not real: it is, exactly, the irreducible case of §1.3.
The circle that opened §1.3, “the expression is, therefore, irreducible in ; it will appear again, already factorizable, when the number system is extended beyond the reals”, closes here exactly as that observation anticipated: , a product of two conjugate complex factors, invisible from but perfectly real as an algebraic phenomenon once is available to name it.
With the real factorization completely described, the chapter now has everything needed to treat the quotient of two polynomials. The next section studies rational functions, and in them, the irreducible quadratic factors just obtained are not a theoretical ornament: they are, as we will see, precisely what guarantees that certain asymptotes never appear where a linear factor would produce them.
Copyright © 2026 Carlos Dagorret — Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)