Proof of Degree <= 1 for Entire Function f

Silviu
Messages
612
Reaction score
11

Homework Statement


Suppose f is entire and there exist constants a and b such that ##|f(z)| \le a|z|+b## for all ##z \in C##. Prove that f is a polynomial of degree at most 1.

Homework Equations

The Attempt at a Solution


We have that for any ##z \neq 0##, ##\frac{|f(z)|}{a|z|} \le b##. So if we take the limit as ##z \to \infty## it is obvious that if f is polynomial, it can't have a degree greater than 1. However I am not sure why it must be polynomial.
 
Physics news on Phys.org
Silviu said:

Homework Statement


Suppose f is entire and there exist constants a and b such that ##|f(z)| \le a|z|+b## for all ##z \in C##. Prove that f is a polynomial of degree at most 1.

Homework Equations

The Attempt at a Solution


We have that for any ##z \neq 0##, ##\frac{|f(z)|}{a|z|} \le b##. So if we take the limit as ##z \to \infty## it is obvious that if f is polynomial, it can't have a degree greater than 1. However I am not sure why it must be polynomial.

I'm not sure what you are supposed to be able to use in your proof. One fact about entire functions is the Cauchy estimate formula, which says:
  • Take a circle in the complex plane of radius R centered on z=0.
  • Let M_R be the largest value of |f(z)| on the circle.
  • Then |f^{(n)}(0)| \leq \frac{n! M_R}{R^n} (where f^{(n)} means the n^{th} derivative).
See if you can use this to prove f^{(n)} = 0 for n &gt; 1.
 
Silviu said:
We have that for any ##z \neq 0##, ##\frac{|f(z)|}{a|z|} \le b##.
This doesn't follow from ##|f(z) | \le a|z| + b##
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top