Dgdrxrt

Suppose that if $f(z)$ is an entire function such that $dfracf(z)z^n$ is bounded for $|z|ge R$ then $f(z)$ must be a polynomial of degree at most $n$

This same question has already been asked and solved on this website but the solution relies on power series and this question is asked in my text before power series has been introduced.

My book gives the hint that I should use Cauchy's estimates for $f^(m+1)(z)$ on a disk $|z-z_0|<R$ and then let $R to infty$ to obtain that $f^(m+1)(z_0)=0$

I proved the hint as follows. $f$ is analytic on $|z|<R$ and also $|f(z)|<k|z|^n$ when $|z|ge R$ so by Cauchy's estimate on $|z|<R$, $f^(m)(0)le dfracm!R^mk|z|^n=m!kR^n-mto0$ when $m>n$ and so $f^(m)(0)=0 ; forall ;m>n$.

Now let $z_0in mathbb C$ and choose $R'$ big enough such that $B_R(0) subset B_R'(z_0)$, hence $|z|>R$ when $z in partial B_R'(z_0).$ $f$ being entire is then analytic on $B_R'(z_0)$ and so again by Cauchy's estimates we see that $f^(m)(z_0)le dfracm!(R')^mk|hat z|^n$ for $hat zin partial B_R'(z_0)$ such that $|hat z| ge |z|$ for any $z in partial B_R'(z_0)$. Note that $|hat z|=|z_0|+R'$ since for any $z in partial B_R'(z_0)$ we have $|z|le |z-z_0|+|z_0|= R' +|z_0|$. So $|hat z| le R' + |z_0|$ but we see that $z_0 + R'dfracz_0$ is on $partial B_R'(z_0)$ and $|z_0 + R'dfracz_0|=|z_0|+R'$ and this means that $|hat z| = R' +|z_0|$. Using this we now see that $f^(m)(z_0)le dfracm!(R')^mk(|z_0|+R')^n$ and if we let $m>n$ then we see that $f^(m)(z_0) to 0$ and $R' to infty$.

Now we can say that $f^(m)(z)=0$ whenever $m>n$.

Now I do not know how to continue? Why does this mean that $f$ must be a polynomial? I see how it is true if we can use power series but thats not available to me now. Can I use induction as follows?

I want to show that if $f$ is entire and $f^(m)(z)=0$ for $m>n$ means that $f$ is a polynomial with degree at most $n$.

For the base case suppose $f^m(z)=0$ whenever $m>0$. Hence $f'(z)=0$ which means $f$ is a constant function, or in other words a polynomial with degree $0$. So the base case is true.

Now suppose that $f^m(z)=0$ whenever $m>k$ means that $f$ is a polynomial if at most degree $k$. Suppose that $f^m(z)=0$ whenever $m>k+1$. Let $g(z)=f'(z)$ which is also entire since $f$ is entire. Then we see that $g^m(z)=0$ whenever $m>k$ which implys that $g$ is a polynomial of degree at most $k$ and therfore $f'(z)$ is a polynomial of degree at most $k$ which means that $f(z)$ is a polynomial of degree at most $k+1$ which proves the result.

Is this all correct?

The statement that
$$
f^(n)(0) = 0 mbox for n geq m
$$
(which you already proved) means that $f$ is a polynomial in a neighborhood $D$ of the origin. Let us show that this polynomial cannot be the restriction of a non-polynomial entire function to $D$.

Since $f$ is entire, so are all of its derivatives. Therefore, a derivative $g_k(z) = f^(k)(z)$ of $f$ of order $k geq m$ ($m$ or higher) is also entire. And this function coincides in the whole interior of $D$ with the function $f^(k) equiv 0$. Regard $f^(k)$ as the restriction to $D$ of the entire function constantly equal to zero.

Since two holomoprhic functions defined in the same domain and equal on a set that has a limit point in that domain are identical (this is the key here; see Cartan), it follows that $g_k(z)$ is identically equal to the entire function that is constantly zero.