3
$\begingroup$

The question is, how many times does $f(C_r)$ go around $0$ for $C_r = \{x \in \mathbb{C}: |x|=r\}$ and a polynomial with complex coefficients $f$.

The answer is clear to me when $f(x) = ax^n + b$ but I don't see how exactly middle terms affect the result. How to see this without a graph? Can this be found for any $r$?

Many thanks

  • 2
    Should you decide to investigate such images deeper, see [this paper](http://www.ams.org/journals/proc/1973-039-01/S0002-9939-1973-0313485-X/) and [another one by the same author](http://www.ams.org/journals/proc/1973-039-01/S0002-9939-1973-0313485-X/).2012-08-13

1 Answers 1

1

Look at the Argument Principle (eg, Conway's, "Functions of one complex variable", V.3.4).

You wish to compute $n(f \circ \gamma, 0)$, where $\gamma(t) = r e^{i t}$, and $n$ is the winding number. The Argument Principle gives: $n(f \circ \gamma, 0) = \sum n(\gamma, z_i) - \sum n(\gamma, p_j),$ where $z_i$ are the zeros of $f$ and $p_j$ are the poles. Since $f$ is a polynomial, there are no poles, so you have $n(f \circ \gamma, 0) = \sum n(\gamma, z_i)$, ie, the number of zeros of $f$ inside $C_r$, counted according to multiplicity.

(The above assumes that $f$ has no zeros on the circle $C_r$.)