The Fundamental Theorem of Algebra via Complex Function Theory

Applications of Holomorphic Functions

Motivation: Theorems on "Global" Behavior

Real differentiability is a “local” property. Holomorphicity, on the contrary, imposes extremely strict global constraints: knowing the function on a small segment, one can recover it everywhere; a bounded entire function must be constant. These theorems explain why complex numbers are algebraically “closed,” and provide powerful tools in number theory and algebra.

Liouville's Theorem

Theorem (Liouville, 1847): Any holomorphic and bounded function on all of $\mathbb{C}$ is constant.

Proof via Cauchy’s inequality: $f'(z) = \frac{1}{2\pi i} \oint_{|\zeta - z| = R} \frac{f(\zeta)}{(\zeta - z)^2} d\zeta$. Estimate: $|f'(z)| \leq M/R \to 0$ as $R \to \infty$ ($M = \sup|f|$). Thus $f' \equiv 0$, hence $f = \mathrm{const}$.

This is a fundamental result: the functions $e^{\sin(z)}$ on $\mathbb{C}$ are unbounded because they “want” to be nontrivial.

The Fundamental Theorem of Algebra

Theorem: Every nontrivial polynomial $P(z)$ of degree $n \geq 1$ has at least one complex root.

Proof via Liouville: If $P(z) \neq 0$ for all $z \in \mathbb{C}$, then $f(z) = 1/P(z)$ is holomorphic on all $\mathbb{C}$. As $|z| \to \infty$: $|P(z)| \to \infty$ (degree $n \geq 1$), so $|f(z)| \to 0$. In particular, $f$ is bounded. By Liouville’s theorem, $f = \mathrm{const}$, hence $P = \mathrm{const}$, which contradicts the assumption that $n \geq 1$.

Corollary: $P(z) = c(z - z_1)^{m_1} \cdots (z - z_k)^{m_k}$ — factorization into linear factors over $\mathbb{C}$. $m_1 + \cdots + m_k = n$.

Maximum Modulus Principle

Theorem: If $f$ is holomorphic and nonconstant in a domain $D$, then $|f(z)|$ does not attain its maximum inside $D$.

Corollary: The maximum of $|f|$ on a closed bounded domain is attained on the boundary. Applications: proofs of uniqueness for boundary value problems, estimates of solutions.

Argument Principle

For a meromorphic $f$ in a domain $D$ bounded by a contour $\gamma$:

$ \frac{1}{2\pi i} \oint_\gamma \frac{f'(z)}{f(z)} dz = N - P, $

where $N$ is the total number of zeros, $P$ the number of poles (counted with multiplicities). The left side = the index of the curve $f(\gamma)$ with respect to $0$ = the number of turns around zero.

Rouche’s Theorem: If $|g(z)| < |f(z)|$ on the contour $\gamma$, then $f$ and $f + g$ have the same number of zeros inside.

Picard's Theorem

Little Picard Theorem: An entire nonconstant function takes all complex values, with at most one exception.

Example: $e^z$ takes all values $w \in \mathbb{C} \setminus {0}$: $e^z = w \iff z = \ln w$ (infinitely many solutions for $w \neq 0$).

Great Picard Theorem: Near an essential singularity, a function takes any complex value (except possibly one) infinitely many times.

Numerical Example

Problem: Find the number of zeros of $P(z) = z^5 + 3z + 1$ in the annulus $1 < |z| < 2$.

Step 1. Zeros in $|z| < 2$. Apply Rouche’s theorem with $f(z) = z^5$, $g(z) = 3z + 1$. On $|z| = 2$: $|f(z)| = 32$, $|g(z)| \leq |3 \cdot 2| + 1 = 7 < 32$. By Rouche: $P$ has as many zeros in $|z| < 2$ as $z^5$, that is, 5 zeros.

Step 2. Zeros in $|z| < 1$. Apply with $f(z) = 3z$, $g(z) = z^5 + 1$. On $|z| = 1$: $|f(z)| = 3$, $|g(z)| \leq 1 + 1 = 2 < 3$. By Rouche: $P$ has as many zeros in $|z| < 1$ as $3z$, that is, 1 zero (for $3z$, a simple zero at the origin).

Step 3. Zeros in the annulus $1 < |z| < 2$: $5 - 1 = \textbf{4 zeros}$.

Step 4. Check whether there are zeros on $|z| = 1$: $P(e^{i\theta}) = e^{5i\theta} + 3e^{i\theta} + 1$. By the argument principle (numerically), there are no zeros on the unit circle.

Conclusion: $P(z) = z^5 + 3z + 1$ has exactly 1 zero in the unit disk and exactly 4 zeros in the annulus $1 < |z| < 2$.

Real-World Application

Control theory: Rouche’s theorem is used to check system stability — all poles of the transfer function must be in the left half-plane. The argument principle (Nyquist criterion) allows visually determining stability from the frequency response plot.

Connection with Other Areas of Mathematics

The theory of holomorphic functions is closely intertwined with differential equations: analytic solutions to linear ODEs are described through fundamental systems of holomorphic functions. A classical example is the use of the $\Gamma$-function and special functions (Bessel, Hypergeometric), whose analytic properties — continuation, monodromy, distribution of zeros — control the behavior of solutions. Results like the Cauchy–Kovalevskaya theorem guarantee the existence of an analytic solution for analytic data, relying on the structure of power series.

On the other hand, complex analysis became a model for modern topology. The argument principle and Cauchy integral formula in fact realize the mapping index and the principle of homotopic invariance, which are later abstracted in the works of Brouwer and Lefschetz. The topological degree of a mapping in the plane is a reinterpreted version of the winding number of the image of a contour about a point. In higher dimensions, this is linked to the theory of several complex variables and the concept of an analytic set, studied using tools from topology and algebraic geometry.

Algebraic connections manifest through the fundamental theorem of algebra, formally topological (Brouwer) and analytic (Liouville, Weierstrass), and through Weierstrass’s factorization theorem for entire functions, giving an analogue of polynomial factorization. It became a prototype for factorization theorems in Banach algebras (Gelfand, 1941). In probability theory, holomorphic functions appear in the method of characteristic functions (Levy) and in the theory of random analytic functions, where Picard’s and Montel’s theorems are applied to study zeros. In numerical methods, Rouche’s theorem and the argument principle underlie polynomial root location algorithms (Deligne–Rué method, complex root-separation), as well as the assessment of stability for iterative computational schemes.

Historical Note and Development of the Idea

The simplest elements of complex analysis can be traced to Euler and Bernoulli in the 18th century, but the systematic language of holomorphic functions took shape in the works of Cauchy in the 1820s–1830s (memoirs in Comptes Rendus and Exercices d’Analyse, 1823–1826). Liouville’s theorem on bounded entire functions was published in the Journal de Mathématiques Pures et Appliquées in 1847 and immediately became the key to a new proof of the fundamental theorem of algebra. In the second half of the 19th century, Riemann and Weierstrass developed the idea of analyticity in different directions: Riemann — through geometric surfaces and harmonic functions, Weierstrass — through series expansions and factorization. Weierstrass’s theorem on products (1876) shaped the perspective on entire functions as “polynomials of infinite degree.”