Spring 2021 - Problem 11

entire functions

For an entire function f(z)=f(0)(z)f\p{z} = f^{\p{0}}\p{z}, we define

f(n)(z)=f(f(n1)(z))for all n1.f^{\p{n}}\p{z} = f\p{f^{\p{n-1}}\p{z}} \quad\text{for all } n \geq 1.
  1. Show that if there exists an n1n \geq 1 such that f(n)f^{\p{n}} is a polynomial, then ff is a polynomial.
  2. Prove that for any n>1n > 1 we have f(n)(z)ezf^{\p{n}}\p{z} \neq e^z.
Solution.
  1. Suppose otherwise, and let nn be minimal, i.e., f(n)f^{\p{n}} is polynomial but f(n1)f^{\p{n-1}} is not. Then f(n1)f^{\p{n-1}} has an essential singularity at \infty, so by Casorati-Weierstrass, there exists a sequence {zk}k\set{z_k}_k such that zkz_k \to \infty and f(n1)(zk)z0Cf^{\p{n-1}}\p{z_k} \to z_0 \in \C. But by continuity,

    f(n)(zk)=f(f(n1)(zk))kf(z0),f^{\p{n}}\p{z_k} = f\p{f^{\p{n-1}}\p{z_k}} \xrightarrow{k\to\infty} f\p{z_0} \neq \infty,

    but this contradicts the fact that polynomials have a pole at \infty. Thus, no nn could have existed to begin with.

  2. Suppose otherwise, so that f(n)(z)=ezf^{\p{n}}\p{z} = e^z. Then

    f(ez)=f(f(n)(z))=f(n)(f(z))=ef(z).f\p{e^z} = f\p{f^{\p{n}}\p{z}} = f^{\p{n}}\p{f\p{z}} = e^{f\p{z}}.

    Thus, if g(z)=f(ez)=ef(z)g\p{z} = f\p{e^z} = e^{f\p{z}}, then we see that gg must omit 00, since ef(z)0e^{f\p{z}} \neq 0 for any zz. Similarly, since ez0e^z \neq 0, we also see that gg omits f(0)f\p{0}. Since ff is non-constant, little Picard implies that f(0)=0f\p{0} = 0. But this means

    1=e0=f(n)(0)=0,1 = e^0 = f^{\p{n}}\p{0} = 0,

    a contradiction. Thus, no nn could have existed to begin with.