Polynomial proof that nth degree poly has n roots

where can I please find the proof of the fundamental result of algebra that says that a polynomial of degree n has n real/complex roots? is that covered in most algebra texts?

I have read some of the solution methods that use factorization, inspection to find roots of say n=3, 4 polynomials, also partial differentiation, are there others?

Re: Polynomial proof that nth degree poly has n roots

There are tons and tons of proofs of this fact. Probably the quickest I know is that the non-constant polynomial is a holomorphic map and by setting induces a holomorphic map between the Riemann sphere and itself . But, it is a common fact that a holomorphic map between Riemann surfaces where the domain is compact, must be surjective, and so is surjective. But, since we see that there must exist some such that . Thus, you have that has one zero, and the fact that it has comes from basic algebra.

Re: Polynomial proof that nth degree poly has n roots

Thanks very much for your beautiful and elegant proof with the wonderful Gaussian Sphere!!! So Galois theory is one of the approaches to this problem...

(So sorry for the delay in replying)

Re: Polynomial proof that nth degree poly has n roots

Quote:

Originally Posted by

**mathlover10** Thanks very much for your beautiful and elegant proof with the wonderful Gaussian Sphere!!! So Galois theory is one of the approaches to this problem...

(So sorry for the delay in replying)

Yes, Galois Theory is one approach to show this. It basically comes down to using the fact that every polynomial of odd degree is irreducible over [\tex]\mathbb{R}[/tex], and a bit of Sylow theory.

For a vast generalization, I suggest you take a look at the Artin-Schreier Theorem.

Best,

Alex

Re: Polynomial proof that nth degree poly has n roots

Thanks very much!!!!!!!!!!!!!!!!!!!!!!!!!!!!! it's interesting I came across an article where a result in harmonic extensions of the fundamental theorem of algebra solved a conjecture from gravitational lensing research http://www.ams.org/notices/200806/tx080600666p.pdf