It was recently brought up how to show that the roots of a real or complex polynomial depend continuously on the polynomial’s coefficients. Although I have used this proposition numerous times, implicitly and explicitly, I realized that I never saw a proof of it.

Perhaps the most obvious approach would try to apply the Implicit Function Theorem but, as you may know or can easily check, such an attempt would only work for roots that are simple. Indeed, the very failure of the Implicit Function Theorem in case of non-simple roots is one of the subjects studied in local bifurcation theory. For an example, see this discussion of the Bogdanov-Takens bifurcation.

Returning to the original proposition, here is an elementary proof using only the Fundamental Theorem of Algebra and some simple estimates.

#### Preliminaries

Let be the set of all polynomials of degree at most with complex coefficients. For any let be the coordinate vector of with respect to the standard basis . If is the maximum norm on then

turns into a normed space. For with and their pointwise difference satisfies

(1)

for all , where . Define as the open subset of complex polynomials of degree precisely and let be the collection of non-empty, compact subsets of . When endowed with the Hausdorff metric this collection becomes a metric space. Define to be the map that assigns to its (non-empty and finite) set of roots. In these terms we have

(2)

where and are the usual point-set distances in the complex plane from to and to , respectively.

#### Estimating the first term in (2)

We show that is continuous at any point . Let be given. The two terms appearing inside the braces in (2) will be estimated separately. By the Fundamental Theorem of Algebra every with leading coefficient decomposes as

where are the roots of , repeated according to multiplicity. So, when it follows that

(3)

where the inequality is due to (1). Now,

so and therefore (3) implies that

(4)

Hence there exists such that implies that the left-hand side of (4) does not exceed and thus for at least one . Consequently,

whenever . We set . This takes care of the first term inside the braces in (2).

#### Bounding the roots by the coefficients

Suppose is a root of with coordinate vector . Since it is immediate that

provided that we assume . This yields the bound

(5)

of the roots of a polynomial in terms of its coefficients.

#### Estimating the second term in (2)

Applying the Fundamental Theorem of Algebra once more, we write

where this time are the roots of . Let and let . Then

(6)

By (5) the coefficient is bounded on every sufficiently small ball in centered at . Hence there exists such that implies that the left-hand side of (6) does not exceed and therefore for at least one . It follows that

provided .

We finish by puting . Then (2) shows that whenever .

Update (October 2016): I thank S.A. van Gils for pointing out to me that the coefficient that first appears in (1) was missing a multiplicative factor . Similarly, the second term in the right-hand side of (5) was missing a factor . Both mistakes have been corrected. The argument remains otherwise unchanged.