Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

It's commonly stated that the roots of a polynomial are a continuous function of the coefficients. How is this statement formalized? I would assume it's by restricting to polynomials of a fixed degree n (maybe monic? seems like that shouldn't matter), and considering the collection of roots as a a point in $F^n/\sim$ where F is the field and $\sim$ is permutation of coordinates, but is there something I'm missing? More to the point, where would I find a proof?

At least, I've seen this stated for C (and hence R); is this even true in general -- say, for an algebraically closed valued field (and hence complete non-Archimedean field because those extend uniquely)? I've seen it implied that it's not always true in the non-Archimedean case; is this correct? What's a counterexample? (If this is wrong and it is true in this generality, is it true in any greater generality?)

share|cite|improve this question
It's not actually true for $\mathbb R$: the roots of $x^2+a$ disappear in a dramatically discontinuous manner when $a$ passes through $0$ from below. (It should be true if you restrict attention to polynomials without multiple roots, though). – Henning Makholm Sep 9 '11 at 21:08
Well, I'm assuming that if the field isn't algebraically closed, but the algebraic closure has a natural value/topology extending it (as is the case with R or a complete non-Archimedean field), then we look at the roots there; of course then if it's true for the larger field, it's true for the smaller one! So in that sense I'm only asking about the algebraically closed case. – Harry Altman Sep 9 '11 at 21:22
Wilkinson's polynomial suggests that continuity may not prevent instability/ill-conditioning – Henry Sep 10 '11 at 17:23
A proof for $\mathbb{C}$ can be found here… – Jyotirmoy Bhattacharya Jan 11 '14 at 16:08

6 Answers 6

up vote 29 down vote accepted

Here is a version of continuity of the roots.
Consider the monic complex polynomial $f(z)=z^n+c_1z^{n-1}+...+c_n\in \mathbb C[z]$ and factor it as $$f(z)=(z-a_1)...(z-a_n) \quad (a_k\in \mathbb C)$$ where the roots $a_k$ are arranged in some order, and of course needn't be distinct.
Then for every $\epsilon \gt 0$, there exists $\delta \gt 0$ such that every polynomial $ g(z) =z^n+d_1z^{n-1}+...+d_n\in \mathbb C[z]$ satisfying $|d_k-c_k|\lt \delta \quad (k=1,...,n)$ can be written $$g(z)=(z-b_1)...(z-b_n) \quad (b_k\in \mathbb C)$$
with $|b_k-a_k|\lt \epsilon \quad (k=1,...,n)$.

A more geometric version is to consider the Viète map $v:\mathbb C^n \to \mathbb C^n $ sending, in the notation above, $(a_1,...,a_n)$ to $(c_1,...,c_n)$ (identified with $z^n+c_1z^{n-1}+...+c_n=(z-a_1)...(z-a_n)$ ).
It is a polynomial map (and so certainly continuous!) since $c_k=(-1)^{k} s_k( a_1,...,a_n)$, where $s_k$ is the $k$-th symmetric polynomial in $n$ variables.
There is an obvious action of the symmetric group $S_n$ on $\mathbb C^n$ and the theorem of continuity of the roots states that the Viète map descends to a homeomorphism $w: \mathbb C^n / S_n \to \mathbb C^n$. It is trivial (by the definition of quotient topology) that $w$ is a bijective continuous mapping, but continuity of the inverse is the difficult part.
The difficulty is concentrated at those points $(c_1,...,c_n)$ corresponding to polynomials $z^n+c_1z^{n-1}+...+c_n$ having multiple roots.

This, and much more, is proved in Whitney's Complex Analytic Varieties.

Algebraic geometry point of view Since you are interested in general algebraically closed fields $k$, here is an interpretation for that case.
The symmetric group $S_n$ acts on $\mathbb A_k^n$ and the problem is whether the quotient set $\mathbb A_k^n /S_n$ has a reasonable algebraic structure. The answer is yes and the Viète map again descends to an isomorphism of algebraic varieties $\mathbb A_k^n /S_n \stackrel {\sim }{\to} \mathbb A_k^n $.
This is the geometric interpretation of the fundamental theorem on symmetric polynomials.
The crucial point is that the symmetric polynomials are a finitely generated $k$-algebra.

Hilbert's 14th problem was whether more generally the invariants of a polynomial ring under the action of a linear group form a finitely generated algebra. Emmy Noether proved in 1926 that the answer is yes for a finite group (in any characteristic), as illustrated by $S_n$.
However Nagata anounced counterexamples (in all characteristics) to Hilbert's 14th problem at the International Congress of Mathematicians in 1958 and published them in 1959.

share|cite|improve this answer
A nice reference on this subject is Morris Marden's book The Geometry of the Zeros of a Polynomial in a Complex Variable. – Mariano Suárez-Alvarez Sep 9 '11 at 22:12
I didn't know that book: thanks for the reference, Mariano. – Georges Elencwajg Sep 9 '11 at 22:15
@Georges Elencwajg: you missing a $d_n$ – leo Sep 9 '11 at 23:36
@leo: thanks, corrected. – Georges Elencwajg Sep 10 '11 at 6:15
OK, upvoted, the proof the book gives is quite simple. But it assumes local compactness, which means (assuming algebraic closure) that it'll only work for C. (OK the general statement it gives will be true for other locally compact fields, but that statement only deals with polynomials that split over the given field.) I suppose I'll accept this, and if I really want to know about other cases I'll ask a new question... – Harry Altman Sep 14 '11 at 1:02

In the complex case, if we ignore or forbid multiple roots and fix the degree: We can assume without loss of generality that the leading coefficient is always 1 -- normalizing the coefficients is a continuous transformation of coefficient space.

Now, then, the coefficients are a continuous injective function of the roots -- we can find them by multiplying linear polynomials with the given roots together. On the other hand, with the leading coefficient fixed to 1, both the space of possible coefficients and $\mathbb C^n/\sim$ minus multiple-root points are locally just copies of $\mathbb C^n$, so the inverse mapping from coefficients back to roots also has to be continuous.

This argument ought to work in any algebraically closed topological field (or would it? I'm not actually sure how wild a topological field is allowed to be). I'm not quite sure about how well it generalizes to situations involving multiple roots, though. The best arguments for that I can imagine right away are somewhat specific to $\mathbb C$.

share|cite|improve this answer
I think you are first assuming the polynomial to have $n$ roots. Am I right? (The question does not explicitly say $F$ is algebraically closed.) – Srivatsan Sep 9 '11 at 21:50
Yes, you're right. I started to write the answer down for $\mathbb C$ and then generalized a bit too quickly. Will edit. – Henning Makholm Sep 9 '11 at 21:56
Well, as stated in the comments, I essentially am assuming F is algebraically closed, so that's not problematic. – Harry Altman Sep 9 '11 at 22:26
The coefficients of a monic polynomial are simply symmetric polynomials of the roots, and therefore, continuous. The function from the roots to the coefficients as a map $\mathbb{C}^n\mapsto\mathbb{C}^n$ is definitely injective since the roots are a function of the coefficients. (In other words, I agree with you, but this seems simpler to me.) – robjohn Sep 10 '11 at 1:34

I posed this as a problem in a course on local fields I taught a little while ago. One of my students, David Krumm, solved it and wrote it up here. The context of David's solution is that $K$ is an arbitrary normed field, with some chosen extension of the norm to the algebraic closure of $K$. (If $K$ is complete or even Henselian, the norm extends uniquely; in general it does not.) Then he shows that for every $\epsilon > 0$ there exists some $\delta > 0$ so that if you perturb each of the coefficients of your polynomial $f$ by at most $\delta$, every root of $f_{\delta}$ is wtihin $\epsilon$ of some root of $f$ and vice versa. (I didn't think of this until just now, but I guess this is equivalent to saying that the sets of roots are within $\epsilon$ of each other for the Hausdorff metric.) He also shows that if $f$ itself has distinct roots, then for sufficiently small $\delta$ so does $f_{\delta}$ and then you can match up the roots in a canonical way.

After he solved this problem I looked into the literature and found a dozen papers or more on various refinements of it, including some very recent ones. At the moment these papers seem to be hiding from me, but if/when I find them I'll give some references.

share|cite|improve this answer
On the Hausdorff metric: Huh, so it is. However it seems weaker than saying that some permutation of the roots of $f_\delta$ is within $\varepsilon$ of some permutation of the roots of f. This still may well be enough for what I originally needed, though. :) – Harry Altman Sep 12 '11 at 3:06

I think there might be a proof of your statement using the following complex analysis trick (I don't know if a similar idea could work in $\mathbb{C}_p)$: if $U$ is an open subset with smooth boundary $\partial U$ consider,

$$N_{U}(p) = \frac{1}{2i \pi} \oint_{\partial U} \frac{p'(z)}{p(z)}dz$$

When it's defined, $N_U(p)$ is the number of zeros of $p$ in $U$ counted with multiplicity. Then fix a polynomial $p_0$ of degree $n$, and pick $U$ a neighborhood of its zeros. Then the map $p \mapsto N_U(p)$ is well defined and continuous in a neighborhood of $p_0$, but since it can only take integer values, it's constant and equal to $n$. So if $p$ in that neighborhood has degree $n$, all its roots are in $U$.

share|cite|improve this answer
+1: Nice and quick! – Giuseppe Negro Sep 10 '11 at 8:44

Suppose $P_a(z)=\sum\limits_{k=0}^na_kz^k$. Taking the partial of $P_a(z)=0$ with respect to $a_k$, we get $$ 0=P_a^{\;\prime}(z)\frac{\partial z}{\partial a_k} + z^k $$ Thus, we get that $$ \frac{\partial z}{\partial a_k}=-\frac{z^k}{P_a^{\;\prime}(z)} $$ Thus, as long as $P_a^{\;\prime}(z)\ne0$ when $P_a(z)=0$, $\frac{\partial z}{\partial a_k}$ will exist and be finite. Therefore, if $P_a$ has no repeated roots, $\frac{\partial z}{\partial a_k}$ is finite.

This shows that unless $P_a$ has repeated roots, each root is a smooth function of the coefficients.

share|cite|improve this answer
Are you making the assumption that $z$ is a function of the coefficients ? – Joel Cohen Sep 9 '11 at 23:45
I am making the assumption that $z$ is a root of $P_a$, i.e. $P_a(z)=0$. As the vector of coefficients, $a$, varies, the root $z$ is also going to vary. So in that sense, yes, $z$ is a function of the coefficients. – robjohn Sep 10 '11 at 0:11
I think you proved the following: if $\frac{\partial z}{\partial a_k}$ does exist then it is equal to ... – vesszabo Sep 25 '12 at 20:11
@vesszabo: since $P_a^\prime(z)$ exists and $z^k$ exists, if $P_a^\prime(z)\not=0$, the first equation guarantees the existence of $\frac{\partial z}{\partial a_k}$. So I qualify my conclusion by saying the $P_a$ has no repeated roots, which guarantees that if $P_a(z)=0$, then $P_a^\prime(z)\not=0$. – robjohn Sep 25 '12 at 21:00
Maybe I misunderstand something. I give an example where the situation is similar. Let $f:(a,b)\to\mathbf{R}$ be invertible differentiable function, its inverse is $f^{(-1)}$. Then $f\circ f^{(-1)}=id$. Taking the differentiation and applying the chain rule we obtain that $f'\circ f^{(-1)}\cdot \left(f^{(-1)}\right)'=1$ from it we have $\left(f^{(-1)}\right)'=...$. However this proof is wrong, because we don't know $\left(f^{(-1)}\right)'$ does exist at all. So my problem is not the repeated roots. – vesszabo Sep 26 '12 at 10:05

Here is a link to a short note establishing that the roots of a polynomial are $C^\infty$ functions of the coefficients using the implicit function theorem.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.