## You are here

Homeproof of the fundamental theorem of algebra (Liouville's theorem)

## Primary tabs

# proof of the fundamental theorem of algebra (Liouville’s theorem)

Let $f\colon\mathbb{C}\rightarrow\mathbb{C}$ be a polynomial, and suppose $f$ has no root in $\mathbb{C}$. We will show $f$ is constant.

Let $g=\frac{1}{f}$. Since $f$ is never zero, $g$ is defined and holomorphic on $\mathbb{C}$ (ie. it is entire). Moreover, since $f$ is a polynomial, $|f(z)|\rightarrow\infty$ as $|z|\rightarrow\infty$, and so $|g(z)|\rightarrow 0$ as $|z|\rightarrow\infty$. Then there is some $M>0$ such that $|g(z)|<1$ whenever $|z|>M$, and $g$ is continuous and so bounded on the compact set $\{z\in\mathbb{C}:|z|\leq M\}$.

So $g$ is bounded and entire, and therefore by Liouville’s theorem $g$ is constant. So $f$ is constant as required.$\square$

Major Section:

Reference

Type of Math Object:

Proof

Parent:

## Mathematics Subject Classification

12D99*no label found*30A99

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella