Field theory and polynomials Algebraic closure Theorem
Fundamental theorem of algebra
Builds on Complex numbersLiouville's theorem
Statement
Let be an integer and let be complex numbers with . Let . Then there is a complex number with .
Remarks
Proof with Liouville's theorem: if has no zero, then is entire. Since as , is bounded, so it is constant, which is false for . By induction on , it follows that for some . So has exactly roots, counted with multiplicity. The theorem holds for polynomials with real coefficients too, but the roots can be non-real: has the roots and .
Reading path
To understand this page from the ground up, read these 26 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Complex numbers object
- Real numbers object
- Set bounded above definition
- Complex exponential definition
- Contour integral definition
- Power series in the complex plane definition
- Real and imaginary parts definition
- Supremum definition
- Circle integral definition
- Disc of convergence definition
- Completeness axiom statement
- Estimation lemma statement
- Existence of square roots of nonnegative reals statement
- Square root definition
- Modulus of a complex number definition
- Complex differentiability definition
- Holomorphic function definition
- Cauchy's integral formula statement
- Entire function definition
- Power series are holomorphic in the disc of convergence statement
- Holomorphic functions are analytic statement
- Holomorphic functions are infinitely differentiable statement
- Cauchy's integral formula for derivatives statement
- Cauchy's estimates statement
- Liouville's theorem statement
- Fundamental theorem of algebra statement
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Fundamental_theorem_of_algebra, lead section
- Web https://en.wikipedia.org/wiki/Fundamental_theorem_of_algebra, Complex-analytic proofs
About this page
| Tag | 0JP0W07Y9A |
|---|---|
| URI | m2://0JP0W07Y9A |
| Aliases | dalembert-gauss-theorem, dalemberts-theorem |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 12D10 |
| Status | This copy of the site has no build data. Run m2 status 0JP0W07Y9A. |
| Uses | Complex numbers, Liouville's theorem |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.