🧮 Brain Teaser
Complex Analysis
FTA via Liouville's Theorem
2026-03-26
✏︎

Fundamental Theorem of Algebra via Liouville

Problem

Prove that every non-constant polynomial p(z)C[z]p(z) \in \mathbb{C}[z] has at least one root in C\mathbb{C}.

You may use Liouville's Theorem: every bounded entire function is constant.


Field

Complex Analysis

Why It's Beautiful

The Fundamental Theorem of Algebra is a statement about polynomials — pure algebra. Yet the cleanest proof is analytic, using a theorem about entire functions. The proof is essentially three lines, and the key move is a clever inversion: consider 1/p(z)1/p(z) instead of p(z)p(z).

This is a canonical example of complex analysis reaching into algebra in a way that elementary methods cannot match.

Key Idea / Trick

Suppose p(z)p(z) has no root. Then 1/p(z)1/p(z) is entire. Since p(z)|p(z)| \to \infty as z|z| \to \infty, the function 1/p(z)1/p(z) is bounded. By Liouville, 1/p(z)1/p(z) is constant — contradicting that pp is non-constant.

Difficulty

2 / 5

Tags

Complex Analysis, Liouville's theorem, Entire functions, Fundamental theorem of algebra, Contradiction

LiouvilleEntire functionsFundamental theorem of algebra

Fundamental Theorem of Algebra via Liouville — Answer

Liouville's Theorem (given)

Every bounded entire function f:CCf: \mathbb{C} \to \mathbb{C} is constant.


Proof

Let p(z)p(z) be a non-constant polynomial. Suppose for contradiction that p(z)0p(z) \neq 0 for all zCz \in \mathbb{C}.

Step 1. Since pp has no roots, the function f(z)=1p(z)f(z) = \frac{1}{p(z)} is holomorphic on all of C\mathbb{C} (i.e., entire).

Step 2. Since pp is a non-constant polynomial, p(z)|p(z)| \to \infty as z|z| \to \infty.

Therefore f(z)=1/p(z)0|f(z)| = 1/|p(z)| \to 0 as z|z| \to \infty.

In particular, there exists R>0R > 0 such that f(z)1|f(z)| \leq 1 for all z>R|z| > R.

On the compact disk zR|z| \leq R, a continuous function attains its maximum, so f(z)M|f(z)| \leq M for some M<M < \infty.

Now C\mathbb{C} is covered by these two regions: C={zR}bounded by M{z>R}bounded by 1\mathbb{C} = \underbrace{\{|z| \leq R\}}_{\text{bounded by }M} \cup \underbrace{\{|z| > R\}}_{\text{bounded by }1}

Hence f(z)max(M,1)|f(z)| \leq \max(M, 1) for all zCz \in \mathbb{C}, so ff is bounded on all of C\mathbb{C}.

Step 3. By Liouville's Theorem, ff is constant. But then p=1/fp = 1/f is also constant — contradicting our assumption that pp is non-constant. \blacksquare


Why p(z)|p(z)| \to \infty?

For p(z)=anzn++a0p(z) = a_n z^n + \cdots + a_0 with an0a_n \neq 0: p(z)=znan+an1z++a0znz|p(z)| = |z|^n \left| a_n + \frac{a_{n-1}}{z} + \cdots + \frac{a_0}{z^n} \right| \xrightarrow{|z|\to\infty} \infty since the parenthesized expression an0\to a_n \neq 0.


Why This Proof is Surprising

Elementary proofs of FTA (e.g., topological, via winding numbers) require more machinery or case analysis. This proof reduces everything to one theorem and one observation:

A polynomial grows without bound. Its reciprocal is therefore bounded and entire. Liouville kills it.

The algebra–analysis bridge is the real surprise: a fact about roots of polynomials (algebra) follows from a fact about bounded holomorphic functions (analysis).


Bonus: Full FTA (all nn roots)

Liouville gives existence of one root z0z_0. Then p(z)=(zz0)q(z)p(z) = (z - z_0) q(z) for some degree-(n1)(n-1) polynomial qq (polynomial long division). Apply induction: a degree-nn polynomial has exactly nn roots (counted with multiplicity) in C\mathbb{C}.

Type: Complex AnalysisEdit on GitHub ↗