Encyclopedia > Fundamental theorem of algebra

  Article Content

Fundamental theorem of algebra

The fundamental theorem of algebra (now considered something of a misnomer by many mathematicians) states that every complex polynomial of degree n has exactly n zeroes, counted with multiplicity. More formally, if

<math>p(z)=z^n+a_{n-1}z^{n-1}+\cdots+a_0</math>
(where the coefficients a0, ..., an-1 can be real or complex numbers), then there exist (not necessarily distinct) complex numbers z1, ..., zn such that
<math>p(z)=(z-z_1)(z-z_2)\cdots(z-z_n).</math>

This shows that the field of complex numbers, unlike the field of real numbers, is algebraically closed. An easy consequence is that the product of all the roots equals (-1)n a0 and the sum of all the roots equals -an-1.

The theorem had been conjectured in the 17th century but could not be proved since the complex numbers had not yet been firmly grounded. The first rigorous proof was given by Carl Friedrich Gauss in the early 19th century. (An almost complete proof had been given earlier by d'Alembert.) Gauss produced several different proofs throughout his lifetime. It is possible to prove the theorem by using only algebraic methods, but nowadays the proof based on complex analysis seems most natural. The difficult step in the proof is to show that every non-constant polynomial has at least one zero. This can be done by employing Liouville's theorem which states that a bounded function which is holomorphic in the entire complex plane must be constant. By starting with a polynomial p without any zeros, one can pass to the holomorphic function 1/p and Liouville's theorem then yields that 1/p and therefore also p are constant.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
UU

...     Contents UU Unitarian Universalism the Unseen University University of Utah Union University[?] This is a disambiguation page; that is, ...

 
 
 
This page was created in 33.7 ms