Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Shopping at the store helps maintain the site. Thank you.
Learning Math Online
Sites for teachers
Sites for parents
Terms of use
Awards
Interactive Activities

CTK Exchange
CTK Wiki Math
CTK Insights - a blog
Math Help

III Millennium Olympiad

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Stories for Young
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Games to relax

Sites for teachers
Sites for parents

Education & Parenting

Manifesto  |  Bookstore  |  Contents  |  Amazon store  |  Term index  |  What changed?  |  Contact  |  Recommend
RSS Feed: Recent changes at CTK

Am Math Monthly 107 (2000), 842-843

Fundamental Theorem of Algebra
Yet Another Proof


Anindya Sen

Theorem. The Fundamental Theorem of Algebra. Let

  P(z) = a0zn + a1zn-1 + ... + akzn - k + ... + an

be a polynomial of degree n ≥ 1 with complex numbers ai as coefficients. Then P has a root, i.e., there is a φ belongs C such that P(φ) = 0.

We prove the theorem by showing that Image(P) = C.

We assume the standard result that a complex polynomial P: CC is a proper map, i.e., P-1(A) is compact whenever A subset of C is compact. (P is continuous, and |P(x)| → ∞ as |x| → ∞. Hence, if A subset of C is closed and bounded, so is P-1(A). Hence, P is proper.)

Let f: UR2 be a differentiable map of an open set U subset of R2 to R2. A point x belongs U is said to be a regular point of f if Df(x): R2R2 is invertible. Otherwise, x is said to be a critical point of f. A point y belongs R2 is said to be a critical value of f if it is the image of a critical point.

With this notation in mind, we first prove

Lemma 1. Let K be the set of critical values of P. Then K and P-1(K) are both finite subsets of C.

Proof: The critical points of P are the points at which P’(z) = 0. Since P’ is a polynomial of degree n — 1, there are at most n — 1 critical points. Since each critical value is the image of a critical point, K has at most n — 1 points. Now each critical value has at most n inverse images, hence, P’(K) has at most n(n — 1) points. (We use the fact that a complex polynomial of degree k has at most k roots. The proof of this result does not use the fundamental theorem of algebra.)

Lemma 2. Let X = C \ P-1(K) and Y = C \ K. Then P(X) = Y.

Proof. Lemma 1 ensures that both X and Y are open connected subsets of C. Also, observe that all points in X are regular points of P, i.e., DP(x) is invertible for all x belongs X.

Since P: CC is proper and C is locally compact, it follows that Image(P) is closed in C. P(X) = Y ∩ Image(P). Hence, P(X) is closed in Y.

Let y belongs P(X). Then, y = P(x) for some x belongs X. Since x is a regular point, the inverse function theorem tells us that there are open neighbourhoods U, V of x, y respectively, such that P: U → V is bijective. Hence every point y belongs P(X) has an open neighbourhood also contained in P(X). Hence, P(X) is open in Y. Since Y is connected it follows that P(X) = Y.

Now, by definition, K subset of Image(P) and Lemma 2 tells us that C \ K subset of Image(P). Hence, Image(P) = C The proof of the theorem is complete.

The crucial idea in this proof is that the plane remains connected after removing finitely many points. All the other results used hold for polynomials from R to R as well.

Our approach to the fundamental theorem of algebra is similar to arguments used in [1] to investigate proper, smooth maps with non-negative Jacobian between connected, orientable manifolds.

REFERENCE

  1. A. Nijenhuis and R. W. Richardson, Jr., A theorem on maps with non-negative jacobians, Michigan Math. J. 9 (1962) 173—176.

Copyright © 1996-2009 Alexander Bogomolny

34219715Page copy protected against web site content infringement by Copyscape


Search:
Keywords:

Google
Web CTK