Gauss’ First Proof
In 1799, as his doctoral dissertation, Gauss gave this proof of the Fundamental Theorem of Algebra (FTA).
To work through this proof, we will need DeMoivre’s Theorem, which says that
First, Gauss writes his general polynomial (with real coefficients) as
He is trying to show that \(X\) has either a real factor \(x-r\) or a complex factor \(x^2 - 2xr\cos (\phi ) + r^2\).
Now, Gauss plugs \(x=r(\cos (\phi ) + i\sin (\phi ))\) in to \(X\) and separates his result into its real part and its imaginary part, getting
and
Gauss then proves directly that if \(T=U=0\), then either \(X\) is divisible by \(x-r\) or \(X\) is divisible by \(x^2-2xr\cos (\phi ) + r^2\). We won’t prove that here, but keep in mind that means we are trying to prove that the graphs of \(T=0\) and \(U=0\) have an intersection.
Plot \(T=0\), \(U=0\) and a very large circle of radius \(R\) on the polar axes (i.e. \(r\) and \(\phi \)). As \(R\to \infty \), the curves \(T=0\) and \(U=0\) look more and more like \(\text {Re}(x^m)\) and \(\text {Im}(x^m)\).
The upshot of the last point is: if we draw a circle with large enough radius \(R\), and look at the pieces (more technically “branches”) of \(T=0\) and \(U=0\) behave inside our circle, we find that the intersections of the branches with the circle itself must alternate.
On the circle below, sketch the horizontal axis and label it \(T=0\). Since each branch must both enter and leave the circle, label an even number of \(U\)-intersections, alternating with an even number of \(T\)-intersections. Be sure to label which is which!
That’s it!
d’Alembert’s Proof
Here is a theorem now known as d’Alembert’s Lemma:
We’ll also need the Extreme Value Theorem from calculus (sometimes called the Weierstrass Extreme Value Theorem).
On to the proof of the FTA. Step 1: We can find some radius \(R\) so that for all \(\vert z \vert \geq R\), \(\vert p(z) \vert \) is an increasing function.
Step 2: We know that \(\vert p(z) \vert \) has to have an absolute minimum inside the circle.
Step 3: Suppose the minimum is strictly greater than zero.
2025-01-06 16:00:53