Topper Copies

Suppose $f$ and $g$ are entire functions, and $|f(z)| \leq |g(z)|$ for all $z \in \mathbb{C}$. Prove that $f(z) = cg(z)$.

Akshit Bhardwaj, AIR 12, 2025

since $f$ & $g$ are entire, Principle part of their Laurent's expansion will have no terms

$\Rightarrow f(z) = \sum_{n=0}^{\infty} a_n z^n$

$g(z) = \sum_{n=0}^{\infty} b_n z^n$

Case 1 - $g(z)$ is bounded

Then by Liouville Theorem $g(z)$ is constant

Also since $|f(z)| \leq |g(z)|$

$f(z)$ is also bounded

Then by Liouville's Theorem $f(z)$ is also constant

$\Rightarrow g(z) = c_1$

$f(z) = c_2$

$\Rightarrow f(z_1) = \frac{c_2}{c_1} g(z)$

$\Rightarrow f(z) = c\, g(z)$

Case 2 - $g(z)$ is unbounded

Let us first take $|g(z)| = b_0 + b_1 z$ & $f(z) = a_0 + a_1 z$

Now $g(z) = \sum b_n z^n$ & $f(z) = \sum a_n z^n$

Now at roots of $g(z)$

$|g(z)| = 0$

$\Rightarrow |f(z)| \le |g(z)| \le 0$

$\Rightarrow |f(z)| = 0$

$\Rightarrow f(z)$ also has a zero where $g(z)$ has a zero

So if $g(z) = b_n (z-z_0)(z-z_1) \cdots (z-z_n) \cdots$

Then $f(z) = a_n (z-z_0)(z-z_1) \cdots (z-z_n)$.

$\Rightarrow f(z) = \frac{a_n}{b_n} g(z) = c\, g(z)$

Hence Proved