{"id":65369,"date":"2026-08-07T15:50:40","date_gmt":"2026-08-07T14:50:40","guid":{"rendered":"https:\/\/blog-admin.thethinkacademy.com\/?p=65369"},"modified":"2026-08-07T15:50:42","modified_gmt":"2026-08-07T14:50:42","slug":"fundamental-theorem-of-algebra-guide","status":"publish","type":"post","link":"https:\/\/blog-admin.thethinkacademy.com\/blog\/2026\/08\/07\/fundamental-theorem-of-algebra-guide\/","title":{"rendered":"Fundamental Theorem of Algebra Explained"},"content":{"rendered":"\n

Every polynomial equation has a solution. Not every solution looks the way you might expect \u2014 but it exists. This seemingly simple guarantee is what the fundamental theorem of algebra states, and proving it rigorously requires some of the deepest ideas in mathematics.<\/p>\n\n\n\n

The fundamental theorem of algebra<\/strong> states:<\/p>\n\n\n\n

Every non-constant polynomial with complex coefficients has at least one complex root.<\/p>\n\n\n\n

Equivalently: every polynomial of degree n \u2265 1 (with complex coefficients) has exactly n roots in the complex numbers, counted with multiplicity.<\/p>\n\n\n\n

That second formulation \u2014 n roots for a degree-n polynomial \u2014 is the one most students encounter in MCR3U and MHF4U. The first formulation is how mathematicians typically state it, and understanding why the two are equivalent is itself illuminating.<\/p>\n\n\n\n

\n\n\n\n

What the Fundamental Theorem of Algebra Actually Says<\/h2>\n\n\n\n

Let’s unpack the statement carefully, because each word carries meaning.<\/p>\n\n\n\n

“Every non-constant polynomial…”<\/strong><\/p>\n\n\n\n

A constant polynomial \u2014 f(x) = 5, f(x) = \u22123 \u2014 has no roots (no value of x makes it zero, since it is always 5 or always \u22123). The theorem excludes these, sensibly. For any polynomial of degree 1 or higher, the theorem applies.<\/p>\n\n\n\n

“…with complex coefficients…”<\/strong><\/p>\n\n\n\n

The theorem applies to polynomials whose coefficients may be complex numbers \u2014 things like f(x) = x\u00b2 + (2 + 3i)x \u2212 i. In practice, most polynomials students encounter have real (or even integer) coefficients, which are a special case of complex. The theorem applies to all of them.<\/p>\n\n\n\n

“…has at least one complex root.”<\/strong><\/p>\n\n\n\n

A root of f(x) is a value c such that f(c) = 0. The theorem guarantees such a c exists in the complex numbers \u2102. It does not guarantee a real root \u2014 and this matters, because many polynomials have no real roots.<\/p>\n\n\n\n

Why “at least one” leads to “exactly n”:<\/strong><\/p>\n\n\n\n

If f(x) is a degree-n polynomial and c\u2081 is a root (which the theorem guarantees), then f(x) = (x \u2212 c\u2081) \u00b7 g(x) where g(x) is a polynomial of degree n \u2212 1 (by the Factor Theorem). Apply the theorem again to g(x) \u2014 it has a root c\u2082. Continue until the polynomial is fully factored into n linear factors. The result: every degree-n polynomial factors as:f<\/mi>(<\/mo>x<\/mi>)<\/mo>=<\/mo>a<\/mi>n<\/mi><\/msub>(<\/mo>x<\/mi>\u2212<\/mo>c<\/mi>1<\/mn><\/msub>)<\/mo>(<\/mo>x<\/mi>\u2212<\/mo>c<\/mi>2<\/mn><\/msub>)<\/mo>\u22ef<\/mo>(<\/mo>x<\/mi>\u2212<\/mo>c<\/mi>n<\/mi><\/msub>)<\/mo><\/mrow>f(x) = a_n(x – c_1)(x – c_2)\\cdots(x – c_n)<\/annotation><\/semantics><\/math>f(x)=an\u200b(x\u2212c1\u200b)(x\u2212c2\u200b)\u22ef(x\u2212cn\u200b)<\/p>\n\n\n\n

where c\u2081, c\u2082, …, c\u2099 are the n complex roots (not necessarily distinct) and a\u2099 is the leading coefficient.<\/p>\n\n\n\n

Counting with multiplicity:<\/strong><\/p>\n\n\n\n

If (x \u2212 c)\u00b2 appears in the factorisation, c is a root of multiplicity 2<\/strong> \u2014 it is “counted twice.” This is what “with multiplicity” means. The polynomial x\u00b2 \u2212 2x + 1 = (x \u2212 1)\u00b2 has one distinct root (x = 1) but two roots counted with multiplicity.<\/p>\n\n\n\n

\"\"<\/a><\/figure>\n\n\n\n
\n\n\n\n

Why This Is Not Obvious<\/h2>\n\n\n\n

The fundamental theorem of algebra sounds almost too simple to be worth stating \u2014 of course polynomials have roots, you might think. But the theorem is anything but obvious, and it took centuries of mathematical development to prove rigorously.<\/p>\n\n\n\n

The problem of existence:<\/strong><\/p>\n\n\n\n

Consider f(x) = x\u00b2 + 1. Over the real numbers, this has no root \u2014 there is no real number x with x\u00b2 = \u22121. If we insisted on only real numbers, many polynomials would have “no roots” in a legitimate sense. The theorem works precisely because it allows complex numbers.<\/p>\n\n\n\n

The question is: how do we know that every polynomial has a complex root? Why can’t there be some polynomial that has no root in \u2102 \u2014 or, worse, that requires some further extension of the number system beyond \u2102?<\/p>\n\n\n\n

The theorem says: no further extension is needed. The complex numbers are algebraically closed<\/em> \u2014 every polynomial with complex coefficients already has all its roots in \u2102. This is a non-trivial fact.<\/p>\n\n\n\n

The proofs require analysis:<\/strong><\/p>\n\n\n\n

The first rigorous proof of the fundamental theorem of algebra was given by Carl Friedrich Gauss in his doctoral dissertation in 1799. (In fact, Gauss gave four different proofs over his lifetime \u2014 a sign of how important he considered the result.) Every known proof of the fundamental theorem of algebra requires tools from analysis \u2014 specifically, some version of the intermediate value theorem, or complex analysis, or topology. There is no purely algebraic proof.<\/p>\n\n\n\n

This is a subtle and important point: a theorem about algebra<\/em> cannot be proved by algebra alone<\/em>. It requires analysis \u2014 the mathematics of limits, continuity, and the structure of the real and complex number systems. This is why the theorem is remarkable.<\/p>\n\n\n\n

\n\n\n\n

The Fundamental Theorem of Algebra and Real Polynomials<\/h2>\n\n\n\n

For polynomials with real coefficients, the fundamental theorem has an important consequence:<\/p>\n\n\n\n

Complex roots come in conjugate pairs.<\/strong><\/p>\n\n\n\n

If f(x) has real coefficients and c = a + bi (with b \u2260 0) is a complex root, then its conjugate c\u0304 = a \u2212 bi is also a root.<\/p>\n\n\n\n

Proof:<\/strong> If f(c) = 0 and f has real coefficients, then f(c\u0304) = f(c)\u203e = 0\u0304 = 0. \u25a1<\/p>\n\n\n\n

This means every polynomial with real coefficients factors over the reals into:<\/p>\n\n\n\n