Spring 2016 - Problem 9

entire functions

Let f ⁣:CC\func{f}{\C}{\C} be entire and assume that f(z)=1\abs{f\p{z}} = 1 when z=1\abs{z} = 1. Show that f(z)=Czmf\p{z} = Cz^m, for some integer m0m \geq 0 and CCC \in \C with C=1\abs{C} = 1.

Solution.

Since ff is non-zero on D\partial\D, in particular ff is not identically zero. Hence, we may enumerate its zeroes {an}n\set{a_n}_n. Let

B(z)=an<1zan1anz,B\p{z} = \prod_{\abs{a_n} < 1} \frac{z - a_n}{1 - \conj{a_n}z},

which is a finite product, since ff can only have finitely many zeroes on the compact set D\cl{\D}. Since B(z)=1\abs{B\p{z}} = 1 when z=1\abs{z} = 1, we see that both f/B=1\abs{f/B} = 1 and B/f=1\abs{B/f} = 1 on D\partial\D. By the maximum principle, we see that f(z)=CB(z)f\p{z} = CB\p{z} for some constant CCC \in \C in D\D. On the unit circle, we have

f(z)=CB(z)    C=1.\abs{f\p{z}} = \abs{C} \abs{B\p{z}} \implies \abs{C} = 1.

By uniqueness, we see that f(z)=CB(z)f\p{z} = CB\p{z} on all of C\C. If any of the ana_n are non-zero, however, we see that ff would have a pole at 1an\frac{1}{\conj{a_n}}, which is impossible as ff is entire. Thus, the only zeroes of ff are at the origin, so f(z)=Czmf\p{z} = Cz^m for some integer m0m \geq 0.