1

Given f an entire function, assume there exists an m>0 s.t. |f(z)|$\geq$ m $\forall$ z $\in$ $\mathbb{C}$. Show that f is constant. It seems awfully a lot like liouville's theorem but I am not sure on the bound.

DMj
  • 23
  • 4

2 Answers2

3

Consider $\frac{1}{f}$.

[30 characters minimum]

Klaus
  • 10,578
0

As in the proof of the fundamental theorem of algebra using Liouville's theorem, where you assume the polynomial is never zero, then get it bounded away from zero, then invert it... consider the reciprocal of $f$ (if $m\gt0$).