Research ContributionArnold Mathematical Journal

Received: 5 December 2015 / Revised: 15 August 2016 / Accepted: 6 September 2016

# On Postsingularly Finite Exponential Maps

Walter Bergweile Mathematisches Seminar Christian-Albrechts-Universität zu Kiel
Ludewig-Meyn-Straße 4 24098 Kiel Germany
bergweiler@math.uni-kiel.de

### Abstract

We consider parameters $\lambda$ for which 0 is preperiodic under the map $z\mapsto\lambda e^{z}$. Given $k$ and $l$, let $n(r)$ be the number of $\lambda$ satisfying $0<|\lambda|\leq r$ such that 0 is mapped after $k$ iterations to a periodic point of period $l$. We determine the asymptotic behavior of $n(r)$ as $r$ tends to $\infty$.

###### Keywords
Entire function, Singular value, Exponential function,Periodic point, Preperiodic point, Postcritically finiteMisiurewicz map, Nevanlinna characteristic

## 1 Introduction and Main Result

Let $E_{\lambda}(z)=\lambda e^{z}$ where $\lambda\in\mathbb{C}\backslash\{0\}$. We are interested in parameters $\lambda$ for which 0 is preperiodic. Note that 0 is the only singularity of the inverse function of $E_{\lambda}$. Functions for which all singularities of the inverse are preperiodic are called postsingularly finite. The term Misiurewicz map is also used for such functions. We do not discuss their role in complex dynamics here, but refer to [Benini2011], [Devaney and Jarque1997], [Devaney et al.2005], [Hubbard et al.2009], [Jarque2011], [Laubner et al.2008] and [Schleicher and Zimmer2003] as a sample of papers dealing with postsingularly finite exponential maps.

For $k,l\in\mathbb{N}$ we thus consider parameters $\lambda$ such that

 $E_{\lambda}^{k}(0)=E_{\lambda}^{k+l}(0)$ (1.1)

while

 $E_{\lambda}^{i}(0)\neq E_{\lambda}^{j}(0)\quad\text{for }\ 0 We denote by$n(r)$the number of all$\lambda$contained in$\{z\colon 0<|z|\leq r\}$which satisfy (1.1) and (1.2). If$k=l=1$, then the set of all$\lambda\neq 0$satisfying (1.1) and (1.2) is equal to$\{2\pi im\colon m\in\mathbb{Z}\backslash\{0\}\}$. Thus$n(r)\sim r/\pi$as$r\to\infty$. For$m\in\mathbb{N}$we put$f_{m}(z)=E_{z}^{m}(0)$. Thus$f_{1}(z)=z$and$f_{m+1}(z)=ze^{f_{m}(z)}$. ###### Theorem. Let$k,l$and$n(r)$be as above. If$k+l\geq 3$, then $n(r)\sim\frac{1}{\sqrt{2\pi^{3}}}f_{k+l-1}(r)\sqrt{f_{k+l-2}(r)}\quad\text{as }\ r\to\infty.$The theorem will be proved using Nevanlinna theory. We refer to [Goldberg and Ostrovskii2008] and [Hayman1964] for the terminology and basic results of this theory. In particular,$T(r,f)$denotes the Nevanlinna characteristic of a meromorphic function$f$. Nevanlinna theory makes it natural to consider $N(r)=\int_{0}^{r}\frac{n(t)}{t}dt$besides$n(r)$. The theorem will be a consequence of the following two propositions. ###### Proposition 1. Let$k,l$and$N(r)$be as above. Then there exists a subset$E$of$(0,\infty)$which has finite measure such that $N(r)\sim T(r,f_{k+l})\quad\text{as }\ r\to\infty,\ r\notin E.$(1.3) We note that this proposition suffices to show that$n(r)\to\infty$as$r\to\infty$. This means that given$k,l\in\mathbb{N}$there exists infinitely parameters$\lambda$such that (1.1) and (1.2) hold. ###### Proposition 2. Let$m\geq 3$. Then $T(r,f_{m})\sim\frac{1}{\sqrt{2\pi^{3}}}\frac{f_{m-1}(r)}{\sqrt{f_{m-2}(r)} \prod_{j=1}^{m-3}f_{j}(r)}.$(1.4) These propositions will be proved in Sects. 2 and 3, before we show in Sect. 4 how the above theorem follows from them. We will see there that (1.3) actually holds without the exceptional set$E$. In fact, the exceptional set in Nevanlinna’s second fundamental theorem and thus in Proposition 1 does not occur when the Nevanlinna characteristic grows sufficiently regularly, and the required regularity is provided by Proposition 2. ## 2 Proof of Proposition 1 For a meromorphic function$f$and$a\in\mathbb{C}$or—more generally—a meromorphic function$a$satisfying$T(r,a)=o(T(r,f))$, a so-called small function, we denote by$\overline{n}(r,a,f)$the number zeros of$f-a$in the disk$\{z\colon|z|\leq r\}$. Here we ignore multiplicities; that is, multiple zeros are counted only once. (The notation$n(r,a,f)$is used in Nevanlinna theory when multiplicities are counted.) One may also take$a=\infty$, in which case we count the poles of$f$. As usual in Nevanlinna theory, we put $\overline{N}(r,a,f)=\int_{0}^{r}\frac{\overline{n}(t,a,f)-\overline{n}(0,a,f)} {t}dt+\overline{n}(0,a,f)\log r$and we denote by$S(r,f)$any quantity that satisfies$S(r,f)=o(T(r,f))$as$r\to\infty$, possibly outside some exceptional set of finite measure. The following result [see Hayman ([Hayman1964], Theorem 2.5)] is a simple consequence of Nevanlinna’s second fundamental theorem. ###### Lemma 1. Let$f$be a meromorphic function and let$a_{1},a_{2},a_{3}$be distinct small functions (or constants in$\mathbb{C}\cup\{\infty\})$. Then $T(r,f)\leq\sum_{j=1}^{3}\overline{N}(r,a_{j},f)+S(r,f).$We remark that [Yamanoi2004] proved that if$\varepsilon>0$,$q\geq 3$and$a_{1},\dots,a_{q}$are small functions, then $(q-2-\varepsilon)T(r,f)\leq\sum_{j=1}^{3}\overline{N}(r,a_{j},f)$outside some exceptional set, but this result lies much deeper. We shall need that if$j<k$, then$f_{j}$is a small function with respect to$f_{k}$; that is, $T(r,f_{j})=o(T(r,f_{k}))\quad\text{as }\ r\to\infty\ \text{if }\ j

Of course, this follows directly from Proposition 2, but it is also an immediate consequence of the result [see Hayman ([Hayman1964], Lemma 2.6)] that if $f$ and $g$ are transcendental entire functions, then

 $T(r,f)=o(T(r,f\circ g))\quad\text{as }\ r\to\infty.$

Alternatively, we could use that

 $T(r,g)=o(T(r,f\circ g))\quad\text{as }\ r\to\infty.$

The latter result is an exercise in Hayman’s book ([Hayman1964], p. 54). For a thorough discussion of these and related result we also refer to a paper by [Clunie1970].

###### Proof of Proposition 1.

We denote by $\overline{n}_{A}(r)$ the number of parameters $\lambda$ in $\{z\colon 0<|z|\leq r\}$ which satisfy (1.1) and by $\overline{n}_{B}(r)$ the number of those $\lambda$ in $\{z\colon 0<|z|\leq r\}$ for which there exist $i,j\in\mathbb{N}$ satisfying $0<i<j<k+l$ and $E_{\lambda}^{i}(0)=E_{\lambda}^{j}(0)$; that is, $f_{i}(\lambda)=f_{j}(\lambda)$. We also put

 $\overline{N}_{A}(r)=\int_{0}^{r}\frac{\overline{n}_{A}(t)}{t}dt\quad\text{and} \quad\overline{N}_{B}(r)=\int_{0}^{r}\frac{\overline{n}_{B}(t)}{t}dt.$

Then $n(r)=\overline{n}_{A}(r)-\overline{n}_{B}(r)$ and

 $N(r)=\overline{N}_{A}(r)-\overline{N}_{B}(r).$ (2.2)

We apply Lemma 1 with $f=f_{k+l}$, $a_{1}=0$, $a_{2}=f_{k}$ and $a_{3}=\infty$. Note that the choice $a_{2}=f_{k}$ is admissible by (2.1). We have $\overline{N}(r,0,f_{k+l})=\log r$ and $\overline{N}(r,\infty,f_{k+l})=0$. Noting that $\overline{N}(r,f_{k},f_{k+l})$ and $\overline{N}_{A}(r)$ count the same points, except that 0 is counted in $\overline{N}(r,f_{k},f_{k+l})$ but not in $\overline{N}_{A}(r)$, we see that $\overline{N}(r,f_{k},f_{k+l})=\overline{N}_{A}(r)+\log r$. We thus deduce from Lemma 1 that

 $T(r,f_{k+l})\leq\overline{N}_{A}(r)+S(r,f_{k+l}).$

On the other hand, the first fundamental theorem of Nevanlinna theory and (2.1) imply that

 $\displaystyle\overline{N}_{A}(r)$ $\displaystyle=$ $\displaystyle\overline{N}(r,f_{k},f_{k+l})-\log r\leq T(r,f_{k+l}-f_{k})+O(1)$ $\displaystyle\leq$ $\displaystyle T(r,f_{k+l})+T(r,f_{k})+O(1)=(1+o(1))T(r,f_{k+l}).$

Combining the last two equations we find that

 $\overline{N}_{A}(r)=T(r,f_{k+l})+S(r,f_{k+l}).$ (2.3)

The first fundamental theorem also yields that

 $\displaystyle\overline{N}_{B}(r)$ $\displaystyle\leq\sum_{0 so that $\overline{N}_{B}(r)=o(T(r,f_{k+l}))$(2.4) by (2.1). The conclusion now follows from (2.2)–(2.4).$\square$###### Remark. The ideas used in the above proof are similar to those employed by Baker [see [Baker1960] or Hayman ([Hayman1964], Section 2.8)] in his proof that a transcendental entire function has periodic points of period$p$for all$p\in\mathbb{N}$, with at most one exception. His conjecture that$p=1$is the only possible exception was proved in [Bergweiler1991]. ## 3 Proof of Proposition 2 An exercise in Hayman’s book ([Hayman1964], p. 7) is to show that $T\!\left(r,e^{e^{z}}\right)\sim\frac{e^{r}}{\sqrt{2\pi^{3}r}}.$The computations here are similar, but somewhat more involved. The proof of Proposition 2 we give below is self-contained, but we note that using results of [Hayman1956] the proof can be shorted. More specifically, Lemmas 3 and 4 below can be replaced by a reference to results of this paper; see the remark at the end of this section. We define $a_{k}(r)=\frac{d\log f_{k}(r)}{d\log r}=\frac{rf^{\prime}_{k}(r)}{f_{k}(r)} \quad\text{and}\quad b_{k}(r)=\frac{d\;a_{k}(r)}{d\log r}=ra^{\prime}_{k}(r).$We also put $F_{k}(z)=\prod_{j=1}^{k}f_{j}(z),$(3.1) with$F_{0}(z)=1$. ###### Lemma 2. Let$k\geq 2$. Then $a_{k}(r)\sim F_{k-1}(r)\quad\text{and}\quad b_{k}(r)\sim F_{k-1}(r)F_{k-2}(r)= f_{k-1}(r)F_{k-2}(r)^{2}.$###### Proof. Since$zf_{k}^{\prime}(z)=f_{k}(z)+f_{k}(z)zf_{k-1}^{\prime}(z)$we see by induction that $zf_{k}^{\prime}(z)=\sum_{m=0}^{k-1}\prod_{l=0}^{m}f_{k-l}(z)=F_{k}(z)\sum_{j=0 }^{k-1}\frac{1}{F_{j}(z)}.$Hence $a_{k}(r)=F_{k-1}(r)\sum_{j=0}^{k-1}\frac{1}{F_{j}(r)}\sim F_{k-1}(r)$as claimed. The asymptotics for$b_{k}(r)$follow from this by a straightforward calculation.$\square$By$\log f_{k}$we denote the branch of the logarithm which is real on the positive real axis. ###### Lemma 3. Let$k\geq 2$and$r\geq 1$. Then $\log f_{k}(re^{\tau})=\log f_{k}(r)+a_{k}(r)\tau+\frac{1}{2}b_{k}(r)\tau^{2}+R (\tau)$(3.2) where $|R(\tau)|\leq 6\cdot 3^{3(k-1)}F_{k-1}(r)F_{k-2}(r)^{2}|\tau|^{3}\quad\text{ for }\ |\tau|\leq\frac{1}{2\cdot 3^{k-1}F_{k-2}(r)}.$(3.3) ###### Proof. We first show by induction that if$j\in\mathbb{N}$and$r\geq 1$, then $f_{j}(re^{t})\leq(1+3^{j}F_{j-1}(r)t)f_{j}(r)\leq 2f_{j}(r)\quad\text{for }\ t \leq\frac{1}{3^{j}F_{j-1}(r)}.$(3.4) This is clear for$j=1$in which case this just says that $re^{t}\leq(1+3t)r\leq 2r\quad\text{for }\ t\leq\frac{1}{3}.$Assuming that (3.4) holds, we find that if$t\leq 1/(3^{j+1}F_{j}(r))$and$r\geq 1$, then also$t\leq 1/(3^{j}F_{j-1}(r))$and thus $\displaystyle f_{j+1}(re^{t})\displaystyle=\displaystyle re^{t}\exp f_{j}(re^{t})\leq re^{t}\exp\!\left((1+3^{j}F_{j-1}(r )t)f_{j}(r)\right)\displaystyle=\displaystyle re^{t}\exp\!\left(f_{j}(r)+3^{j}F_{j}(r)t\right)=f_{j+1}(r)\exp \!\left((1+3^{j}F_{j}(r))t\right)\displaystyle\leq\displaystyle f_{j+1}(r)\exp\!\left(2\cdot 3^{j}F_{j}(r)t\right)\leq f_{j+1}(r )\left(1+3^{j+1}F_{j}(r)t\right).$This proves (3.4). We put $h(\tau)=\log f_{k}(re^{\tau})=\log r+\tau+f_{k-1}(re^{\tau}).$Noting that (3.2) is nothing else than the Taylor expansion of$h$with remainder$R(\tau)$we deduce that (see, e.g., Ahlfors [Ahlfors1966], p. 126) $R(\tau)=\frac{\tau^{3}}{2\pi i}\int_{|w|=s}\frac{h(w)}{w^{3}(w-\tau)}dw$if$s>|\tau|$. With$s=1/(3^{k-1}F_{k-2}(r))$we find that if$|\tau|\leq s/2$, then $\displaystyle|R(\tau)|\displaystyle\leq\displaystyle\frac{2|\tau|^{3}}{s^{3}}\max_{|w|=s}|h(w)|\leq\frac{2|\tau|^{3}} {s^{3}}(\log r+s+f_{k-1}(re^{s}))\displaystyle\leq\displaystyle\frac{2|\tau|^{3}}{s^{3}}(\log r+s+2f_{k-1}(r))\leq\frac{6|\tau|^ {3}}{s^{3}}f_{k-1}(r)\displaystyle=\displaystyle 6\cdot 3^{3(k-1)}F_{k-1}(r)F_{k-2}(r)^{2}|\tau|^{3}.$This is (3.3).$\square$We have restricted to$k\geq 2$in Lemma 3, but we note that (3.2) trivially holds for$k=1$with$a_{1}(r)=1$,$b_{1}(r)=0$and$R(\tau)=0$. We will actually use Lemma 3 not for the computation of$T(r,f_{k})$, but for that of $T(r,f_{k+1})=\frac{1}{2\pi}\int_{-\pi}^{\pi}\log^{+}|f_{k+1}(re^{i\theta})|d\theta.$(3.5) Here$\log^{+}x=\max\{\log x,0\}$. The notation$h^{+}(x)=\max\{h(x),0\}$will also be used for other functions$h$in the sequel. We will split the integral in (3.5) into two parts by considering the ranges$|\theta|\leq\delta(r)$and$\delta(r)\leq|\theta|\leq\pi$separately, for a suitably chosen function$\delta(r)$. It will be convenient to choose $\delta(r)=\frac{1}{F_{k-1}(r)^{2/5}}.$Then Lemma 3 can be applied for$|\theta|\leq\delta(r)$, with an error term$R(i\theta)$satisfying$R(i\theta)=o(1)$. To deal with the range$\delta(r)\leq|\theta|\leq\pi$we will use the following lemma. ###### Lemma 4. If$k\geq 2$,$\delta(r)\leq|\theta|\leq\pi$and$r$is sufficiently large, then $\log|f_{k+1}(re^{i\theta})|\leq\frac{f_{k}(r)}{f_{k-1}(r)}.$###### Proof. Put$g_{1}(\theta)=r\cos\theta$and$g_{j}(\theta)=r\exp{g_{j-1}(\theta)}$for$j\geq 2$. Noting that$g_{2}(\theta)=re^{r\cos\theta}=|f_{2}(re^{i\theta})|$and $|f_{j}(re^{i\theta})|=r\exp\operatorname{Re}(f_{j-1}(re^{i\theta}))\leq r\exp| f_{j-1}(re^{i\theta})|$for$j\geq 3$we see by induction that $|f_{j}(re^{i\theta})|\leq g_{j}(\theta)$(3.6) for all$j\geq 2$. Since$\cos\theta\leq 1-\theta^{2}/4$for$|\theta|\leq 1$we have $\displaystyle g_{2}(\theta)\displaystyle=\displaystyle re^{r\cos\theta}\leq re^{r}\exp\!\left(-r\frac{\theta^{2}}{4}\right)$(3.7)$\displaystyle=\displaystyle f_{2}(r)\exp\!\left(-\frac{F_{1}(r)}{4}\theta^{2}\right)\quad \text{for }\ |\theta|\leq 1.$We shall show by induction that if$j\geq 2$and$r\geq 1$, then $g_{j}(\theta)\leq f_{j}(r)\exp\!\left(-\frac{F_{j-1}(r)}{2^{j}}\theta^{2} \right)\quad\text{for }\ |\theta|\leq\frac{1}{\sqrt{F_{j-2}(r)}}.$(3.8) Note that (3.7) says that this holds for$j=2$. Suppose now that$j\geq 2$and that (3.8) holds. Let$|\theta|\leq 1/\sqrt{F_{j-1}(r)}$. Then$|\theta|\leq 1/\sqrt{F_{j-2}(r)}$since$r\geq 1$. Noting that$e^{-x}\leq 1-x/2$for$0\leq x\leq 1$we obtain $\displaystyle g_{j+1}(\theta)\displaystyle=\displaystyle r\exp g_{j}(\theta)\leq r\exp\!\left(f_{j}(r)\exp\!\left(-\frac{ F_{j-1}(r)}{2^{j}}\theta^{2}\right)\right)\displaystyle\leq\displaystyle r\exp\!\left(f_{j}(r)\left(1-\frac{F_{j-1}(r)}{2^{j+1}}\theta^{2 }\right)\right)=f_{j+1}(r)\exp\!\left(-\frac{F_{j}(r)}{2^{j+1}}\theta^{2} \right).$Hence (3.8) holds for all$j\geq 2$. Suppose now that$\delta(r)\leq|\theta|\leq\pi$. Then $\log|f_{k+1}(re^{i\theta})|\leq\log g_{k+1}(\theta)\leq\log g_{k+1}(\delta(r)) =g_{k}(\delta(r))+\log r$by (3.6). Since$\delta(r)=1/F_{k-1}(r)^{2/5}\leq 1/\sqrt{F_{k-2}(r)}$for large$r$we deduce from the last inequality and (3.8) that $\begin{array}[]{ll}\displaystyle\log|f_{k+1}(re^{i\theta})|&\leq f_{k}(r)\exp \!\left(-\dfrac{F_{k-1}(r)}{2^{k}}\delta(r)^{2}\right)+\log r\\ &\displaystyle=f_{k}(r)\exp\!\left(-\frac{F_{k-1}(r)^{1/5}}{2^{k}}\right)+\log r \leq\frac{f_{k}(r)}{f_{k-1}(r)},\end{array}$if$r$is sufficiently large.$\square$###### Lemma 5. $\lim_{t\to\infty}\int_{-\infty}^{\infty}e^{-x^{2}}\cos^{+}(tx)dx=\frac{1}{ \sqrt{\pi}}.$###### Proof. Integration by parts yields $\int_{-\infty}^{\infty}e^{-x^{2}}\cos^{+}(tx)dx=\int_{-\infty}^{\infty}e^{-x^{ 2}}2x\int_{0}^{x}\cos^{+}(ty)dy\;dx.$Since $\int_{0}^{x}\cos^{+}(ty)dy\sim\frac{x}{\pi}\quad\text{as }\ t\to\infty,$locally uniformly in$\R\backslash\{0\}$, we obtain $\lim_{t\to\infty}\int_{-\infty}^{\infty}e^{-x^{2}}\cos^{+}(tx)dx=\frac{2}{\pi} \int_{-\infty}^{\infty}e^{-x^{2}}x^{2}dx=\frac{1}{\sqrt{\pi}}$as claimed.$\square$###### Proof of Proposition 2. It follows from Lemma 3 that $f_{k}(re^{i\theta})=f_{k}(r)\exp\!\left(ia_{k}(r)\theta-\tfrac{1}{2}b_{k}(r) \theta^{2}\right)(1+S(\theta))\quad\text{for }\ |\theta|\leq\delta(r),$(3.9) where $\displaystyle|S(\theta)|\displaystyle=\displaystyle\left|e^{R(i\theta)}-1\right|\leq 2|R(i\theta)|\displaystyle\leq\displaystyle 12\cdot 3^{3(k-1)}F_{k-1}(r)F_{k-2}(r)^{2}\delta(r)^{3}=12\cdot 3 ^{3(k-1)}\frac{F_{k-2}(r)^{2}}{F_{k-1}(r)^{1/5}}$for large$r$and hence$S(\theta)=o(1)$as$r\to\infty$. This implies that $\begin{array}[]{ll}\operatorname{Re}\!\left(f_{k}(re^{i\theta})\right)=f_{k}(r )\exp\!\left(-\tfrac{1}{2}b_{k}(r)\theta^{2}\right)\cos(a_{k}(r)\theta)+o\! \left(f_{k}(r)\exp\!\left(-\tfrac{1}{2}b_{k}(r)\theta^{2}\right)\right)\end{array}$and thus $\operatorname{Re}^{+}\!\left(f_{k}(re^{i\theta})\right)=f_{k}(r)\exp\!\left(- \tfrac{1}{2}b_{k}(r)\theta^{2}\right)\left(\cos^{+}(a_{k}(r)\theta)+o(1)\right )\quad\text{for }\ |\theta|\leq\delta(r),$where the term$o(1)$is uniform in$\theta$. We conclude that $\displaystyle\int_{-\delta(r)}^{\delta(r)}\log^{+}|f_{k+1}(re^{i\theta})|d\theta\displaystyle\quad=f_{k}(r)\int_{-\delta(r)}^{\delta(r)}\exp\!\left(-\tfrac{1} {2}b_{k}(r)\theta^{2}\right)\left(\cos^{+}(a_{k}(r)\theta)+o(1)\right)d\theta\displaystyle\quad=\frac{\sqrt{2}f_{k}(r)}{\sqrt{b_{k}(r)}}\int_{-c(r)}^{c(r)} \exp\!\left(-u^{2}\right)\left(\cos^{+}\!\left(\frac{\sqrt{2}a_{k}(r)}{\sqrt{b _{k}(r)}}u\right)+o(1)\right)\!du$with $c(r)=\frac{\sqrt{b_{k}(r)}\delta(r)}{\sqrt{2}}=(1+o(1))\frac{F_{k-1}(r)^{1/10} \sqrt{F_{k-2}(r)}}{\sqrt{2}}\to\infty$(3.10) by Lemma 2. The same lemma yields that $\frac{a_{k}(r)}{\sqrt{b_{k}(r)}}=(1+o(1))\frac{\sqrt{F_{k-1}(r)}}{\sqrt{F_{k-2 }(r)}}=(1+o(1))\sqrt{f_{k-1}(r)}\to\infty.$Lemma 5 now implies that $\int_{-\delta(r)}^{\delta(r)}\log^{+}|f_{k+1}(re^{i\theta})|d\theta\sim\frac{ \sqrt{2}f_{k}(r)}{\sqrt{\pi b_{k}(r)}}.$(3.11) Since $\log^{+}|f_{k+1}(re^{i\theta})|\leq\frac{f_{k}(r)}{f_{k-1}(r)}=o\!\left(\frac{ f_{k}(r)}{\sqrt{b_{k}(r)}}\right)\quad\text{for }\ \delta(r)\leq|\theta|\leq\pi$by Lemmas 4 and 2 we conclude that $\int_{-\pi}^{\pi}\log^{+}|f_{k+1}(re^{i\theta})|d\theta\sim\frac{\sqrt{2}f_{k} (r)}{\sqrt{\pi b_{k}(r)}}.$Thus $\displaystyle T(r,f_{k+1})\displaystyle=\displaystyle\frac{1}{2\pi}\int_{-\pi}^{\pi}\log^{+}|f_{k+1}(re^{i\theta})|d\theta\displaystyle\sim\displaystyle\frac{f_{k}(r)}{\sqrt{2\pi^{3}b_{k}(r)}}\sim\frac{f_{k}(r)}{\sqrt {2\pi^{3}}\sqrt{f_{k-1}(r)}F_{k-2}(r)}$by Lemma 2. The conclusion follows with$k=m-1$.$\square$###### Remark. An entire function$f$is called admissible in the sense of [Hayman1956] if$f(r)=M(r,f)$for large$r$and if with $a(r)=\frac{d\log M(r,f)}{d\log r}=\frac{rf^{\prime}(r)}{f(r)}\quad\text{and} \quad b(r)=\frac{d\;a(r)}{d\log r}=ra^{\prime}(r)$(3.12) there exists$\delta(r)\in(0,\pi]$such that, as$r\to\infty$, $f(re^{i\theta})\sim f(r)\exp\!\left(ia(r)\theta-\tfrac{1}{2}b(r)\theta^{2} \right)\quad\text{for }\ |\theta|\leq\delta(r)$(3.13) and $f(re^{i\theta})=\frac{o(f(r))}{\sqrt{b(r)}}\quad\text{for }\ \delta(r)\leq| \theta|\leq\pi.$(3.14) Moreover, it is assumed that$b(r)\to\infty$as$r\to\infty$. Hayman ([Hayman1956], Theorems VI and VIII) showed that if$f$is admissible, then so are$e^{f}$and$fP$for any real polynomial$P$with positive leading coefficient. This implies that$f_{k}$is admissible for$k\geq 2$. The admissibility of$f_{k}$immediately yields slightly weaker versions of Lemmas 3 and 4, but these versions are strong enough to prove Proposition 2. In fact, the arguments used in the above proof yield the following Proposition 3. Since its proof is largely analogous to that of Proposition 2, replacing Lemmas 3 and 4 by a reference to (3.13) and (3.14), we will only sketch the proof. ###### Proposition 3. Let$f$be an admissible entire function and let$b(r)$be defined by (3.12). Then $T(r,e^{f})\sim\frac{1}{\sqrt{2\pi^{3}}}\frac{f(r)}{\sqrt{b(r)}}$###### Sketch of proof. First we note that (3.13) means that (3.9) holds with$f_{k}$replaced by$f$and$S(\theta)=o(1)$for$|\theta|\leq\delta(r)$. We proceed as in the proof of Proposition 2. To see that$c(r)=\delta(r)\sqrt{b(r)/2}\to\infty$as in (3.10) we note that we may choose$\theta=\delta(r)$in both (3.13) and (3.14). This yields $f(r)\exp\!\left(-\tfrac{1}{2}b(r)\delta(r)^{2}\right)=o\!\left(\frac{f(r)}{ \sqrt{b(r)}}\right)$and hence$\exp\!\left(-\tfrac{1}{2}b(r)\delta(r)^{2}\right)=o(1)$, from which we deduce that$c(r)\to\infty$. We conclude that (3.11) holds with$f_{k}$replaced by$f$and$f_{k+1}$replaced by$e^{f}$; that is, $\int_{-\delta(r)}^{\delta(r)}\log^{+}|e^{f(re^{i\theta})}|d\theta\sim\frac{ \sqrt{2}f(r)}{\sqrt{\pi b(r)}}.$Moreover, $\log^{+}|e^{f(re^{i\theta})}|\leq|f(re^{i\theta})|=o\!\left(\frac{f(r)}{\sqrt{ b(r)}}\right)\quad\text{for }\ \delta(r)\leq|\theta|\leq\pi$by (3.14). The conclusion follows directly from the last two equations.$\square$We note that Proposition 2 is an immediate consequence of Proposition 3. ## 4 Proof of the Theorem A classical growth lemma of Borel [see Goldberg ([Goldberg and Ostrovskii2008], p. 90) or Hayman ([Hayman1964], Lemma 2.4)] says that if$\phi\colon[r_{0},\infty)\to(0,\infty)$is a continuous, increasing function, then there exists a subset$E$of$[r_{0},\infty)$of finite measure such that $\phi\!\left(1+\frac{1}{\phi(r)}\right)\leq 2\phi(r)\quad\text{for }\ r\notin E.$The exceptional set in Nevanlinna’s second fundamental theorem and thus the exceptional set$E$in Proposition 1 arise from the application of this lemma to the Nevanlinna characteristic. If the function$\phi$is sufficiently “regular”, then the inequality in Borel’s lemma holds for all large$r$. In fact, boundedness of the exceptional set$E$in Borel’s lemma is sometimes taken as a regularity condition; see, e.g., Edrei and Fuchs ([Edrei and Fuchs1964], p. 245). The following lemma gives a simple condition implying that the exceptional set in this lemma is bounded. While I believe that this or similar results are well-known to the experts, I have not found this lemma in the literature. ###### Lemma 6. Let$\phi\colon[r_{0},\infty)\to(0,\infty)$be a non-decreasing, differentiable function satisfying$\phi^{\prime}(r)\leq\phi(r)^{3/2}$for all$r$. Then $\phi\!\left(1+\frac{1}{\phi(r)}\right)\sim\phi(r)\quad\text{as }\ r\to\infty.$###### Proof. The result is trivial if$\lim_{r\to\infty}\phi(r)<\infty$. We may thus assume that$\lim_{r\to\infty}\phi(r)=\infty$. For$r\geq r_{0}$we have $\frac{1}{\sqrt{\phi(r)}}-\frac{1}{\sqrt{\phi(r+1/\phi(r))}}=\frac{1}{2}\int_{r }^{r+1/\phi(r)}\frac{\phi^{\prime}(t)}{\phi(t)^{3/2}}dt\leq\frac{1}{2\phi(r)}$and thus $\sqrt{\frac{\phi(r)}{\phi(r+1/\phi(r))}}\geq 1-\frac{1}{2\sqrt{\phi(r)}},$from which the conclusion follows.$\square$A straightforward calculation shows that the right hand side of (1.4) satisfies the hypothesis—and thus the conclusion—of Lemma 6. From this it is not difficult to deduce that the exceptional set in Nevanlinna’s second fundamental theorem and in Lemma 1 is bounded for$f=f_{m}$. This implies that no exceptional set$E$is required in Proposition 1. Combining this with Proposition 2 we find that under the hypotheses of Proposition 1 we have $N(r)\sim T(r,f_{k+l})\sim\frac{1}{\sqrt{2\pi^{3}}}\frac{f_{k+l-1}(r)}{\sqrt{f_ {k+l-2}(r)}F_{k+l-3}(r)}\quad\text{as }\ r\to\infty,$(4.1) with$F_{k+l-3}(r)$defined by (3.1). To obtain a result for$n(r)$we use the following result of London ([London1975/1976], p. 502). ###### Lemma 7. Let$\phi,\psi\colon[x_{0},\infty)\to(0,\infty)$be functions satisfying $\phi(x)\sim\psi(x)\quad\text{as }\ x\to\infty.$(4.2) Suppose that$\psi$is convex and that$\phi$is twice continuously differentiable, with$\phi^{\prime}$and$\phi^{\prime\prime}$positive and$\phi^{\prime}$unbounded. Suppose also that there exists a constant$\beta$such that $\frac{\phi^{\prime\prime}(x)\phi(x)}{\phi^{\prime}(x)^{2}}\leq\beta$(4.3) for all$x\geq x_{0}$. Then $\phi^{\prime}(x)\sim\psi^{\prime}(x)\quad\text{as }\ x\to\infty.$(4.4) Here$\psi^{\prime}$denotes either the left or the right derivative of$\psi$on the countable set for which these may be different. Note that l’Hospital’s rule says that (4.4) implies (4.2). Lemma 7 may be considered as a reversal of l’Hospital’s rule. For this an additional hypothesis such as (4.3) is essential. Proof of the theorem We denote the right hand side of (4.1) by$g(r)$. Since$N(r)$is convex in$\log r$we see that$\psi(x)=N(e^{x})$is convex in$x$. It is easy to see that$\phi(x)=g(e^{x})$satisfies the hypothesis of Lemma 7. In fact, it is not difficult to see that$\phi^{\prime\prime}(x)\phi(x)/\phi^{\prime}(x)^{2}\to 1$as$x\to\infty$. We thus deduce from Lemma 7 that$\phi^{\prime}(x)\sim\psi^{\prime}(x)$and hence that$n(r)\sim rg^{\prime}(r)$. From this the conclusion follows easily using Lemma 2.$\square$###### Acknowledgements The results of this paper (except for Proposition 3) were presented in two talks in John H. Hubbard’s seminar at Cornell University in the fall of 1988. They were inspired by a talk by Ben Bielefeld in this seminar about the computation of Misiurewicz parameters using the spider algorithm ([Bielefeld et al.1992]; [Hubbard and Schleicher1994]). The proof of Proposition 2 given below is a simplified version of the one presented in the seminar. John Hubbard’s seminar was my first encounter with complex dynamics. (The purpose of my stay at Cornell University was to visit Wolfgang H. J. Fuchs, a leading figure in Nevanlinna theory; see [Anderson et al.1998] for Fuchs’ life and work.) I would like to take this opportunity—albeit very belatedly—to thank John Hubbard and the participants of his seminar for igniting my interest in complex dynamics and for helpful discussions. I thank Dierk Schleicher for encouraging me to make the results of my talks in this seminar available—and I also thank him, Saikat Batabyal and the referee for useful comments on this manuscript. Finally, I remain grateful to the Alexander von Humboldt Foundation for making my stay at Cornell University possible by granting me a Feodor Lynen research fellowship. ## References • [Ahlfors1966] Ahlfors, L.V.: Complex Analysis: An Introduction of the Theory of Analytic Functions of One Complex Variable, 2nd edn. McGraw-Hill, New York, Toronto, London (1966) • [Anderson et al.1998] Anderson, J.M., Drasin, D., Sons, L.R.: Wolfgang Heinrich Johannes Fuchs (1915-1997). Not. Am. Math. Soc. 45(11), 1472–1478 (1998) • [Baker1960] Baker, I.N.: The existence of fixpoints of entire functions. Math. Z. 73, 280–284 (1960) • [Benini2011] Benini, A.M.: Triviality of fibers for Misiurewicz parameters in the exponential family. Conform. Geom. Dyn. 15, 133–151 (2011) • [Bergweiler1991] Bergweiler, W.: Periodic points of entire functions: proof of a conjecture of Baker. Complex Var. Theory Appl. 17(1–2), 57–72 (1991) • [Bielefeld et al.1992] Bielefeld, B., Fisher, Y., Hubbard, J.: The classification of critically preperiodic polynomials as dynamical systems. J. Am. Math. Soc. 5, 721–762 (1992) • [Clunie1970] Clunie, J.: The composition of entire and meromorphic functions. In: Shankar, H. (ed.) Mathematical Essays Dedicated to A. J. Macintyre, pp. 75–92. Ohio University Press, Athens (1970) • [Devaney and Jarque1997] Devaney, R.L., Jarque, X.: Misiurewicz points for complex exponentials. Int. J. Bifur. Chaos Appl. Sci. Eng. 7(7), 1599–1615 (1997) • [Devaney et al.2005] Devaney, R.L., Jarque, X., Rocha, M.M.: Indecomposable continua and Misiurewicz points in exponential dynamics. Int. J. Bifur. Chaos Appl. Sci. Eng. 15(10), 3281–3293 (2005) • [Edrei and Fuchs1964] Edrei, A., Fuchs, W.H.J.: On the zeros of$f(g(z))$where$f$and$g\$ are entire functions. J. Anal. Math. 12, 243–255 (1964)
• [Goldberg and Ostrovskii2008] Goldberg, A.A., Ostrovskii, I.V.: Distribution of Values of Meromorphic Functions. Translations of Mathematical Monographs, vol. 236. American Mathematical Society, Providence (2008)
• [Hayman1956] Hayman, W.K.: A generalisation of Stirling’s formula. J. Reine Angew. Math. 196, 67–95 (1956)
• [Hayman1964] Hayman, W.K.: Meromorphic Functions. Clarendon Press, Oxford (1964)
• [Hubbard and Schleicher1994] Hubbard, J.H., Schleicher, D.: The spider algorithm. In: Complex Dynamical Systems (Cincinnati, OH, 1994). Proceedings of Symposia in Applied Mathematics, vol. 49, pp. 155–180. American Mathematical Society, Providence (1994)
• [Hubbard et al.2009] Hubbard, J., Schleicher, D., Shishikura, M.: Exponential Thurston maps and limits of quadratic differentials. J. Am. Math. Soc. 22(1), 77–117 (2009)
• [Jarque2011] Jarque, X.: On the connectivity of the escaping set for complex exponential Misiurewicz parameters. Proc. Am. Math. Soc. 139(6), 2057–2065 (2011)
• [Laubner et al.2008] Laubner, B., Schleicher, D., Vicol, V.: A combinatorial classification of postsingularly finite complex exponential maps. Discrete Contin. Dyn. Syst. 22(3), 663–682 (2008)
• [London1975/1976] London, R.R.: The behaviour of certain entire functions near points of maximum modulus. J. Lond. Math. Soc. (2) 12(4), 485–504 (1975/1976)
• [Schleicher and Zimmer2003] Schleicher, D., Zimmer, J.: Periodic points and dynamic rays of exponential maps. Ann. Acad. Sci. Fenn. Math. 28, 327–354 (2003)
• [Yamanoi2004] Yamanoi, K.: The second main theorem for small functions and related problems. Acta Math. 192(2), 225–294 (2004)