1.06 Fundamental theorem of algebra: reprise

Below the video you will find accompanying notes and some pre-class questions.

Notes

Fundamental theorem of algebra

(0.00) We've now developed enough technology to come back and prove the fundamental theorem of algebra rigorously. The only fact we'll need to assume from later in the module is that π1(C{0},x)Z,

and that the loop δn(t):=ei2πnt satisfies [δn]=nZ.

(0.33) A nonconstant complex polynomial p(z)=zn+an1zn1++a0 has a complex root, i.e. p(z)=0 for some zC.
(1.20) Define the loop γR(t)=p(Rei2πt). If p has no complex root then γR is a loop in C{0}. We will prove that the degree n of p is equal to zero.

(2.40) As R varies, this gives a free homotopy. The loop γ0 is the constant loop at p(0).

(3.20) Since π1(C{0},x is abelian, free and based homotopy agree, so we get [γ0]=[γR]π1(C{0},x)=Z. Since γ0 is constant, [γ0]=0.

(4.50) We will show that, for large R, [γR]=nZ=π1(C{0}). This will imply n=0.

The loop δn(t):=Rnei2πnt satisfies [δn]=nZ, so we need to show γRδn for large R.

(6.24) To achieve this, write p(z)=zn+q(z) (q(z)=an1zn1++a0) and try the homotopy H(s,t)=Rnei2πnt+sq(Rei2πt), which connects δn at s=0 to γR at s=1. We need this to be a homotopy in C{0}, so we need to show that |H(s,t)|>0 for all s,t when R0.

(9.00) We estimate: |H(s,t)|||Rnei2πnt|s|q(Rei2πt)|||RnRn1n1maxk=0|ak||,

(10.30) using |q(Rei2πt)|=|an1Rn1e2πi(n1)t++a0||an1|Rn1++|a0|nRn1n1maxk=0(|ak|).
(12.08) so |H(s,t)|Rn1(Rn1maxk=0|ak|),
which is strictly positive whenever R is strictly greater than maxn1k=0(|ak|).

(13.00) This implies that H(s,t) is a homotopy in C{0} between γ0 (with [γ0]=0) and γR (with [γR]=n), so n=0 and p is constant, which completes the proof.

Pre-class questions

  1. If you're anything like me, that sequence of inequalities sounded something like ``blah blah blah blah blah blah blah''. Go back and look at them, and see if you can justify each step. If there's a step you can't justify, make a note of it and we can check it in class.

Navigation

Comments, corrections and contributions are very welcome; please drop me an email at j.d.evans at lancaster.ac.uk if you have something to share.

CC-BY-SA 4.0 Jonny Evans.