Proofs of the Fundamental Theorem of Algebra

published by Luca Wellmeier on Jan 26, 2025

This is just an example page that demonstrates the features of gh:lcwllmr/scimd - a tool for scientific writing with markdown.

Contents:

  1. Notation and statement
  2. Proofs
    1. Liouville via a global minimum of p|p|

Notation and statement

Denote by C[z]\C[z] the ring of univariate polynomials with complex coefficients. Let pC[z]p \in \C[z] be non-constant of degree n1n \geq 1 with coeficients

p(z)=anzn+an1zn1++a1z+a0 p(z) = a_n z^n + a_{n-1}z^{n-1} + \cdots + a_1 z + a_0

and an0a_n \neq 0. Then pp has a complex root.

Proofs

Liouville via a global minimum of p|p|

Write

p(z)=anzn(1+an1an1z++a0an1zn). p(z)=a_n z^n\left(1+\frac{a_{n-1}}{a_n}\frac{1}{z}+\cdots+\frac{a_0}{a_n}\frac{1}{z^n}\right).

The bracket tends to 11 as z|z|\to\infty, so there exists R>0R>0 and c>0c>0 such that for zR|z|\ge R,

p(z)czn. |p(z)|\ge c|z|^n \to \infty.

On the closed disk BR={z  |  zR}B_R=\set{z}{|z| \le R}, the continuous function zp(z)z\mapsto |p(z)| attains a minimum mm by compactness. For z>R|z|>R, p(z)>p(0)m|p(z)|>|p(0)|\ge m by taking RR large enough, hence this minimum on BRB_R is also the global minimum on C\C. Choose z0z_0 with p(z0)=m|p(z_0)|=m.

If m>0m>0, then p(z)0p(z)\neq 0 for all zz, hence

f(z)=1p(z) f(z)=\frac{1}{p(z)}

is entire. Also p(z)m|p(z)|\ge m for all zz, so f(z)1/m|f(z)|\le 1/m: ff is bounded. By Liouville’s theorem, a bounded entire function is constant, so ff is constant, hence pp is constant - contradiction. Therefore m=0m=0, i.e. p(z0)=0|p(z_0)|=0, so p(z0)=0p(z_0)=0. \square