Let $f$ and $g$ be entire functions with $\lvert f\rvert\leq\lvert g\rvert$. Show that then $$ f=cg $$ for a constant $c\in\mathbb{C}$.
Can I just do it like this:
$\lvert f(z)\rvert\leq\sup\limits_{z\in\mathbb{C}}\lvert g(z)\rvert$, so f is limited and therefore constant (Liouville), i.e. $f(z)=c~\forall~z\in\mathbb{C}$.
$c=0$: Then $0=f(z)=0\cdot g(z)$
$c\neq 0$: Then $g(z)\neq 0$ and therefore $\frac{f(z)}{g(z)}$ is defined. This is an entire function because $f$ and $g$ are entire function and it is $$ \left\lvert\frac{f(z)}{g(z)}\right\rvert=\frac{\lvert f(z)\rvert}{\lvert g(z)\rvert}\leq 1, $$ so $\frac{f(z)}{g(z)}$ is a bounded entire function and therefore constant, lets say for a $d\in\mathbb{C}$ $$ \frac{f(z)}{g(z)}=d~\forall~z\in\mathbb{C}\Leftrightarrow f(z)=d\cdot g(z). $$
This is my proof. Is it okay or does one need a special sentence for this proof?
http://math.stackexchange.com/questions/52121/property-of-entire-functions
– ziang chen Jul 15 '13 at 17:19