The key point about the hypotheses in Theorem 1.3 is that the singular value a can be connected to \(\infty \) by a curve \(\gamma \) that either belongs to the Fatou set (if \(a\in F(f_a)\)) or is a piece of a “dynamic ray” in the escaping set (see below). The preimage of \(\gamma \), which contains no endpoints, then cuts the complex plane into countably many strips, and we can study symbolic dynamics by considering the “itineraries” of different points with respect to this partition.
Definition 6.1
(Itineraries) Let \(f:\mathbb {C}\rightarrow \mathbb {C}\) be a continuous function, and let \(\Gamma \subset \mathbb {C}\) be a closed set. We say that \(z\in \mathbb {C}\)
has an itinerary with respect to \(\Gamma \) if \(f^n(z)\notin \Gamma \) for all \(n\ge 0\). In this case, the itinerary of z is defined to be the sequence of connected components of \(\mathbb {C}{\setminus }\Gamma \) visited by \(f^n(z)\), for \(n\ge 0\).
In particular, two such points z and w have the same itinerary if \(f^n(z)\) and \(f^n(w)\) belong to a common connected component of \(\mathbb {C}{\setminus }\Gamma \) for all n; otherwise, they have different itineraries.
When two points have different itineraries, they can clearly be separated within the set of endpoints:
Observation 6.2
(Separation from itineraries) Let \(f:\mathbb {C}\rightarrow \mathbb {C}\) be a continuous function, and let \(\Gamma \subset \mathbb {C}\) be a closed set. Suppose that \(z,w\in \mathbb {C}\) have different itineraries with respect to \(\Gamma \). Then z and w are separated in \({\mathbb {C}{\setminus } \bigcup _{n\ge 0}f^{-n}(\Gamma )}\).
Proof
Let \(n_0\ge 0\) be such that \(f^{n_0}(z)\) and \(f^{n_0}(w)\) belong to different connected components of \(\mathbb {C}{\setminus }\Gamma \). Since \(\Gamma \) is closed, the two points are also separated in \(\mathbb {C}{\setminus } \Gamma \). Then z and w are separated in \(\mathbb {C}{\setminus } f^{-n_0}(\Gamma )\) by Observation 2.2.\(\square \)
Dynamic rays of exponential maps. A full description of the escaping set of an arbitrary exponential map in terms of dynamic rays was first given in [42]. We shall now review their definition and basic properties.
Definition 6.3
(Dynamic rays) Let \(f_a\) be an exponential map. A dynamic ray of \(f_a\) is a maximal injective continuous curve \(g:(0,\infty )\rightarrow I(f_a)\) such that
-
(a)
\(\lim _{t\rightarrow \infty } {\text {Re}}f_a^n(g(t)) = \infty \) uniformly in n, and
-
(b)
for all \(t_0>0\), \(\lim _{n\rightarrow \infty } {\text {Re}}f_a^n(g(t)) = \infty \) uniformly for \(t\ge t_0\).
If additionally \(z_0 := \lim _{t\rightarrow 0}g(t)\) is defined, then we say that g
lands at \(z_0\).
We shall use the following basic properties of dynamic rays.
Theorem 6.4
(Properties of dynamic rays) Let \(f_a\) be an exponential map, and let \(\mathfrak {g}\) be the map from Theorem 4.1.
-
(a)
For every exponentially bounded external address \(\underline{s}\in \mathbb {Z}^{\mathbb {N}_0},\) there is a unique (up to reparameterisation) dynamic ray \(g_{\underline{s}}\) such that \({\text {addr}}(\mathfrak {g}^{-1}(g_{\underline{s}}(t)))=\underline{s}\) for all sufficiently large t. Conversely, if g is a dynamic ray of \(f_a,\) then \(g=g_{\underline{s}}\) for some \(\underline{s}\) (again up to reparameterisation).
-
(b)
The vertical order of dynamic rays (for \(t\rightarrow \infty )\) coincides with the lexicographical ordering of their external addresses.
-
(c)
If \(z\in I(f)\) is on a hair, then either z is on a unique dynamic ray, or there is \(n_0\ge 1\) such that \(f^n(z)\) is on a unique dynamic ray containing the singular value a.
-
(d)
If z is an endpoint of \(f_a,\) then either z is the landing point of a dynamic ray (which is unique if additionally \(z\in I(f)),\) or there is \(n_0\ge 1\) such that \(f^{n_0}(z)\) is the landing point of the unique dynamic ray containing the singular value a.
Proof
These are well-known properties of dynamic rays (compare [42] or [30]), and follow easily from Theorem 4.1 and Corollary 4.5.\(\square \)
Curves at the singular value. We now study exponential functions satisfying the assumptions of Theorem 1.3. For every such map \(f_a\), we can find a natural curve connecting the singular value to \(\infty \). The preimages of this curve give rise to a natural dynamical partition of the Julia set. The study of these partitions, and of the resulting itineraries, is well developed. Here we shall present the basic facts we require and refer e.g. to [31, 35, 43] for further background.
Let us first consider the case where \(a\notin F(f_a)\). Then Theorem 6.4 immediately implies the following.
Corollary 6.5
(Rays landing at singular values) Suppose that \(f_a\) is an exponential map for which a is either an endpoint or on a hair. Then there is an exponentially bounded address \(\underline{s}\) such that either \(g_{\underline{s}}\) lands at a, or \(a\in g_{\underline{s}}\).
Now consider the case where the singular value belongs to the Fatou set. The following is well known, and follows from the fact that a is the unique singular value of \(f_a\), and that exponential maps have no wandering domains.
Observation 6.6
(Singular values in the Fatou set) Let \(f_a\) be an exponential map. Then \(a\in F(f_a)\) if and only if \(f_a\) has an attracting or parabolic cycle. In this case, there is a unique cycle of periodic components of the Fatou set, and a belongs to one of the components of this cycle.
If the component U of \(F(f_a)\) containing the singular value has period n, we can connect a and \(f_a^n(a)\) by an arc \(\gamma _0\) in U. Let \(\gamma \) be the component of \(f_a^{-n}(\gamma _0)\) containing a; then \(\gamma \) is a curve connecting a to \(\infty \) in U. To associate symbolic dynamics to the curve \(\gamma \), we should “fill in the gaps” within \(\mathbb {Z}^{\mathbb {N}_0}\) with finite sequences called “intermediate external addresses”; compare [39, §3] or [35, §2].
Definition 6.7
(Intermediate external addresses) An intermediate external address (of length \(n\ge 1\)) is a finite sequence
$$\begin{aligned} \underline{s}= s_0 s_1 s_2 \ldots s_{n-2} \infty , \end{aligned}$$
where \(s_j\in \mathbb {Z}\) for \(j<n-2\) and \(s_{n-2}\in \mathbb {Z}+1/2\). The union of \(\mathbb {Z}^{\mathbb {N}_0}\) (the space of infinite external addresses) and the set of all intermediate external addresses is denoted \(\overline{\mathbb {S}}\); we also write \(\mathbb {S}:= \overline{\mathbb {S}}{\setminus } \{\infty \}\).
Let \(f_a\) be an exponential map and let \(\gamma \subset \mathbb {C}{\setminus } I(f_a)\) be a curve connecting some finite endpoint to infinity. Then we say that \({\text {addr}}(\gamma )=\underline{s}\in \overline{\mathbb {S}}\) if, for any exponentially bounded addresses \(\underline{r}^1\), \(\underline{r}^2\), the three curves \(g_{\underline{r}^1}\bigl ([1,\infty )\bigr )\), \(\gamma \) and \(g_{\underline{r}^2}\bigl ([1,\infty )\bigr )\) are ordered in positive orientation with respect to cyclic order at infinity whenever \(\underline{r}^1< \underline{s}< \underline{r}^2\) with respect to the cyclic order on \(\overline{\mathbb {S}}\).
Remark 1
At first, the notion of a curve having address \(\underline{s}\) may seem to depend on the parameterisation of dynamic rays. However, this is not the case, since using different “tails” of the same ray will result in the same cyclic order; the interval \([1,\infty )\) is used merely for convenient notation.
Remark 2
Since the cyclic order on \(\overline{\mathbb {S}}\) is order-complete (in fact, the space is isomorphic to the circle), \({\text {addr}}(\gamma )\) is defined for every curve \(\gamma \) as in Definition 6.7. Observe that, if \({\text {addr}}(\gamma )\ne \infty \), then \({\text {Re}}z\rightarrow +\infty \) along \(\gamma \). In particular, \(f(\gamma )\) is then also a curve to infinity, and \({\text {addr}}(f_a(\gamma )) = \sigma ({\text {addr}}(\gamma ))\).
Now let us return to our case of an exponential map \(f_a\) having an attracting or parabolic orbit, and the curve \(\gamma \) defined above. Clearly we have \({\text {addr}}(f_a^{n-1}(\gamma )) = \infty \), and hence \({\text {addr}}(\gamma )\) is an intermediate external address of length n.
Itineraries and escaping endpoints. For the remainder of the section, we fix an exponential map \(f_a\) satisfying the hypotheses of Theorem 1.3, the curve \(\gamma \) connecting a to \(\infty \) constructed above, and the associated address \(\underline{s}\in \mathbb {S}\); that is, if a is an endpoint or on a hair, then \(\gamma \) is the piece of \(g_{\underline{s}}\) beginning at a, where \(g_{\underline{s}}\) is the ray from Corollary 6.5. If \(a\in F(f_a)\), then \(\gamma \) and \(\underline{s}={\text {addr}}(\gamma )\) are as defined above. In either case, \(\gamma \) contains no endpoints, except possibly a itself, and \(\underline{s}\) is either intermediate or exponentially bounded.
Remark
In the case where a belongs to an invariant component of the Fatou set, the construction above leads to a curve \(\gamma \) having real parts tending to \(-\infty \), and hence having address \(\underline{s}=\infty \). This choice, while correct, would require us to introduce some tedious notation for special cases below. Instead, we simply note that we can always replace \(\gamma \) by a piece of its preimage, extended to connect to the singular value; this curve will then have an address in \(\mathbb {S}\). (We remark that the case where \(\underline{s}=\infty \) is trivial, anyway, since here no two rays can share the same itinerary, and \(E(f_a)\) is thus totally separated. In fact, it is well known that the Julia set is then a Cantor bouquet.) In the following, we will hence always suppose that \(\underline{s}\ne \infty \).
Now \(f_a^{-1}(\gamma )\) consists of countably many curves from \(-\infty \) to \(+\infty \), which cut the plane into countably many strips, and we can study itineraries with respect to \(\Gamma = f^{-1}(\gamma )\) (in the sense of Definition 6.1) in purely combinatorial terms.
Definition 6.8
(Combinatorial itinerary) Let \(\underline{s}\in \mathbb {S}\), and let \(\underline{r}\in \mathbb {Z}^{\mathbb {N}_0}\) be an address with \(\sigma ^n(\underline{r})\ne \underline{s}\) for all \(n\ge 1\). Define \(\underline{m}\in \mathbb {Z}^{\mathbb {N}_0}\) by
$$\begin{aligned} m_j\underline{s}< \sigma ^j(\underline{r}) < (m_j+1)\underline{s}\end{aligned}$$
(6.1)
for \(j\ge 0\). We call \(\underline{m}\) the (combinatorial) itinerary of \(\underline{r}\) and write itin\(_{\underline{s}}(\underline{r}):= \underline{m}\).
We also define the kneading sequence
\(\mathbb {K}(\underline{s}) := {\text {itin}}_{\underline{s}}(\underline{s})\). Observe that, in the case where \(\underline{s}\) is an intermediate external address of length n, or periodic of period n, only the first \(n-1\) entries \(u_0,\ldots ,u_{n-2}\) of the kneading sequence can be defined according to (6.1); in this case we set \(\mathbb {K}(\underline{s}) := u_0 \ldots u_{n-2} *\).
Remark
Compare [35, §3] for a further discussion of combinatorial itineraries and kneading sequences. There, itineraries are also defined for intermediate external addresses, and iterated preimages of the address \(\underline{s}\). In particular, for simplicity, our definition of the kneading sequence for periodic \(\underline{s}\) is slightly different from—and less accurate than—that given in [35]; in particular, for our purposes periodic addresses do not have periodic kneading sequences.
By Observation 6.2, if two exponentially bounded addresses as above have different combinatorial itineraries, then the corresponding two rays and their landing points are separated by \(\bigcup _{n\ge 1}f_a^{-n}(\gamma )\subset I(f_a){\setminus } E(f_a)\). Hence we can prove results about the separation of endpoints by studying the properties of sets of addresses sharing the same itinerary. The following simple observation shows that the itineraries of such addresses must satisfy certain restrictions in terms of the kneading sequence.
Lemma 6.9
(Addresses sharing an itinerary [31, Lem. 2.3]) Let \(\underline{s}\in \mathbb {S}\), and suppose that \(\underline{r}^1\ne \underline{r}^2\) are two addresses, neither an iterated preimage of \(\underline{s},\) with \(\underline{m}:= {\text {itin}}_{\underline{s}}(\underline{r}^1) = {\text {itin}}_{\underline{s}}(\underline{r}^2)\). Then \(\sigma ^k(\underline{r}^1)\ne \sigma ^k(\underline{r}^2)\) for all \(k\ge 0\).
Furthermore, let \(j\ge 1\) with \(r_{j-1}^1 \ne r_{j-1}^2\). Then, for all \(k\ge 0,\)
\(m_{j+k} = u_{\ell }\) for some \(\ell \le k,\) where \(\underline{u}:= \mathbb {K}(\underline{s})\).
Remark
In the case where \(\underline{s}\) is intermediate or periodic, the final statement implies, in particular, that \(m_{j+k}\) agrees with one of the finitely many integer entries of \(\underline{u}\).
The following will allow us to complete the proof of Theorem 1.3.
Proposition 6.10
(Addresses sharing an itinerary are slow) Let \(\underline{s}\in \mathbb {S}\) be either intermediate or exponentially bounded. If \(\underline{r}^1\ne \underline{r}^2\) are such that the itineraries \({\text {itin}}_{\underline{s}}(\underline{r}^1)\) and \({\text {itin}}_{\underline{s}}(\underline{r}^2)\) are defined and coincide, then \(\underline{r}^1\) and \(\underline{r}^2\) are slow.
Proof
By the first part of Lemma 6.9, the addresses \(\underline{r}^1\) and \(\underline{r}^2\) differ at infinitely many indices. Furthermore, if \(\underline{s}\) is exponentially bounded, we have \(t := t_{\underline{s}}< \infty \); by Lemma 3.8, \(2\pi |s_n|\le F^n(t_{\underline{s}}^*) \le F^n(t_{\underline{s}})\) for all \(n\ge 0\). On the other hand, if \(\underline{s}\) is intermediate of length K, then it contains only finitely many entries, and we can choose t such that \(2\pi |s_n| \le F^n(t)\) for \(n\le K-2\).
Let \(N\ge 1\) be such that \(r_{N-1}^1 \ne r_{N-1}^2\). Then, by Lemma 6.9, we have
$$\begin{aligned} 2\pi |r^{j}_n| \le 2\pi ( \max _{k\le n-N} (|s_k|+ 1 ) \le F^{n-N}(t+2\pi ) \end{aligned}$$
for all \(n \ge N\) and \(j=1,2\). Hence \(t^*_{\sigma ^{N}(\underline{r}^{j})} \le t+2\pi \). Since N can be chosen arbitrarily large, we see that \(\underline{r}^1\) and \(\underline{r}^2\) are slow, as claimed. \(\square \)
Proof of Theorem 1.3
By Theorem 1.4, it remains to show that \(\tilde{E}(f_a)\) is totally separated for all \(a\in \mathbb {C}\) satisfying the hypotheses of the theorem.
So let \(z,w\in \tilde{E}(f_a)\) with \(z\ne w\). By Observation 6.2, it is enough to show that \(z_n:= f_a^n(z)\) and \(w_n:= f_a^n(w)\) are separated by \(f_a^{-1}(\gamma )\) for some \(n\ge 0\). (Here \(\gamma \) is the curve connecting the singular value to \(\infty \), as above.)
If \(z_{n+1}=w_{n+1}\) for some (minimal) \(n\ge 0\), then \(z_n\) and \(w_n\) differ by a non-zero integer multiple of \(2\pi i\), and are hence separated by \(f^{-1}(\gamma )\), as desired.
So suppose that \(z_n\ne w_n\) for all n. By Theorem 6.4(d), there is \(n\ge 0\) such that \(z_n\) and \(w_n\) are landing points of two dynamic rays \(g_{\underline{r}^z}\) and \(g_{\underline{r}^w}\), at fast external addresses. If n is large enough, then neither \(\underline{r}^z\) nor \(\underline{r}^w\) is mapped to the address \(\underline{s}\) of \(\gamma \) under iteration of the shift map.
By Proposition 6.10, we have \({\text {itin}}_{\underline{s}}(\underline{r}^z)\ne {\text {itin}}_{\underline{s}}({\underline{r}^w})\). If j is the first index at which the two itineraries differ, then \(g_{\sigma ^j(\underline{r}^z)}\) and \(g_{\sigma ^j(\underline{r}^w)}\), and hence \(z_{n+j}\) and \(w_{n+j}\), are separated by \(f^{-1}(\gamma )\), and the proof is complete. \(\square \)
Itineraries and arbitrary endpoints. To also prove Theorem 1.7 in the case where \(a\notin F(f_a)\), we shall use the following combinatorial statement, which concerns addresses sharing an itinerary in general.
Proposition 6.11
(Number of addresses sharing a common itinerary) Let \(\underline{s}\in \mathbb {S}\) and let \(\underline{m}\in \mathbb {Z}^{\mathbb {N}_0}\). Let \(\mathcal {R}\) denote the set of external addresses whose itinerary with respect to \(\underline{s}\) is defined and agrees with \(\underline{m}\).
If \(\underline{m}\) is periodic or preperiodic, and \(\sigma ^j(\underline{m})\ne \mathbb {K}(\underline{s})\) for all sufficiently large \(j\ge 0,\) then \(\mathcal {R}\) is a finite set of periodic or preperiodic addresses (all having the same period and pre-period). If \(\underline{m}\) is not eventually periodic, then \(\# \mathcal {R} \le 2\).
Remark 1
The hypothesis of the proposition is necessary. Indeed, suppose that \(\mathbb {K}(\underline{s})\) is periodic; recall that for us this implies that \(\underline{s}\) itself is not a periodic address. If \(\sigma ^j(\underline{m}) = \mathbb {K}(\underline{s})\) for some \(j\ge 0\), then the set \(\mathcal {R}\) consists of uncountably many addresses. (The reader may think, by way of illustration, of the case of an exponential map with a Siegel disc. Although it is not known whether there are such maps for which the singular value is the landing point of a ray, this is conjectured to be true at least for certain rotation numbers; compare [31]. In this case, we may think of \(\mathcal {R}\) as representing the addresses of those dynamic rays that accumulate on the boundary of the Siegel disc.)
Remark 2
In the periodic case, more can be said than is stated in the proposition. For example, the addresses in \(\mathcal {R}\) belong to at most two periodic cycles; if \(\# \mathcal {R}>2\), then they belong to a single cycle; see [39, Lem. 5.2].
Proof
First suppose that \(\underline{m}\) is eventually periodic. We may assume that \(\underline{m}\) is periodic; otherwise, we apply the proposition to a periodic iterate of \(\underline{m}\) under the shift, and obtain the result for \(\underline{m}\) by pulling back corresponding to the finitely many initial entries of \(\underline{m}\).
In the periodic case, the claim follows directly from [35, Lem. 3.8], with one exception. This exception concerns the case where \(\underline{s}\) is periodic, say of period n, with kneading sequence \(\mathbb {K}(\underline{s}) = u_0 u_1 \ldots u_{n-2} *\), and where \(\sigma ^j(\underline{m}) = (u_0 u_1 \ldots u_{n-2} m_{n+j-1})^{\infty }\) for some \(j\ge 0\), where \(m_{n+j-1} \in \{ s_{n-1} , s_{n-1} -1\}\). In these circumstances, the hypotheses of our proposition are satisfied, but [35, Lem. 3.8] does not apply.
We claim that, under the above assumptions, \(\mathcal {R}\) consists of periodic or preperiodic addresses, of period n. (However, it may be that \(\mathcal {R}=\emptyset \), which is impossible in the case covered by [35, Lem. 3.8].) Indeed, assume without loss of generality that \(j=0\), and let p be the period of the itinerary \(\underline{m}\). Then p divides n; say \(n=p\cdot q\). We consider the set \(\mathcal {R}'\) obtained by adding to \(\mathcal {R}\) the orbit of \(\underline{s}\) under \(\sigma ^p\). \(\square \)
Claim
The set \(\mathcal {R}'\) is mapped bijectively to itself under \(\sigma ^p\), and \(\sigma ^p\) preserves the cyclic ordering of addresses in \(\mathcal {R}'\).
Proof
We first prove that the claims hold for \(\mathcal {R}\). Recall that all addresses in \(\mathcal {R}\) have itinerary \(\underline{m}\), which is an infinite sequence of integers (in particular, no address in \(\mathcal {R}\) is on the backward orbit of \(\underline{s}\)). For every \(j\ge 0\), all addresses of \(\sigma ^j(\mathcal {R})\) belong to the interval \((m_j\underline{s}, (m_j+1)\underline{s})\), and the shift map is injective on each such interval and preserves the cyclic ordering. Furthermore, if \(\underline{r}\in \mathcal {R}\), then there is a unique preimage of \(\underline{r}\) under \(\sigma ^p\) whose itinerary begins with \(m_0 m_1 \ldots m_{p-1}\), and which hence also belongs to \(\mathcal {R}\). (Here we use the fact that \(\underline{s}\) is periodic, so that \(\underline{r}\)—whose itinerary is an infinite sequence of integers by assumption—is not on the orbit of \(\underline{s}\) under the shift map.)
Now \(\sigma ^n\) is clearly also bijective on \(\mathcal {R}'\). The reasoning that it preserves the circular ordering is the same as above—here \(\sigma ^{p-1}(\mathcal {R}')\) also includes exactly one of the two boundary addresses of \((m_j\underline{s},(m_j+1)\underline{s})\), but this does not affect the argument. \(\square \)
Let \(\tilde{n}\) be the minimal period of a periodic address \(\underline{r}\) in \(\mathcal {R}'\) (so \(\tilde{n}\) is a multiple of p and divides n). Then \(\sigma ^{\tilde{n}}\) maps \(\mathcal {R}'\) to itself, preserving the cyclic ordering and fixing \(\underline{r}\). Let \(\underline{t}\in \mathcal {R}'\); then, in the cyclic order, either
$$\begin{aligned} \underline{r}\le & {} \underline{t}\le \sigma ^{\tilde{n}}(\underline{t}) \le \sigma ^{2\tilde{n}}(\underline{t}) \le \sigma ^{3\tilde{n}}(\underline{t}) \le \ldots \le \underline{r}, \qquad \text {or} \\ \underline{r}\ge & {} \underline{t}\ge \sigma ^{\tilde{n}}(\underline{t}) \ge \sigma ^{2\tilde{n}}(\underline{t}) \ge \sigma ^{3\tilde{n}}(\underline{t}) \ge \ldots \ge \underline{r}. \end{aligned}$$
So \(\sigma ^{j\tilde{n}}(\underline{t})\) is an eventually monotone, and hence convergent, sequence in \(\mathbb {Z}^{\mathbb {N}_0}\). But this is possible only if \(\underline{t}\) is itself periodic of period at most \(\tilde{n}\). Hence, all addresses in \(\mathcal {R}\) are periodic of period \(\tilde{n}=n\), as claimed. Furthermore, the set of sequences of period n in \(\mathcal {R}\) is clearly finite: for any \(\underline{t}\in \mathcal {R}\), we have \(t_j \in \{m_j,m_j-1\}\) for all j, so there are at most \(2^{n}\) such addresses. (In fact, as alluded to in Remark 2 above, there are far fewer: either \(\# \mathcal {R}= 0\) or \(\#\mathcal {R}=1\); we do not require this fact).
The case where \(\underline{m}\) is not eventually periodic is Thurston’s no wandering triangles theorem, adapted to our context. See, e.g. [41, Thm. 3.3] for a proof in the case of unicritical polynomials. We are not aware of a published proof for exponential maps, and hence provide the argument in Theorem 6.13 below.\(\square \)
No wandering triangles. Let us begin by introducing some notation.
Definition 6.12
(Wandering gaps) Two sets \(A,B\subset \overline{\mathbb {S}}\) are called unlinked if A is completely contained in one of the intervals of \(\overline{\mathbb {S}}{\setminus } B\) (and vice versa). Let \(A\subset \mathbb {S}\), and consider the set obtained by shifting the initial entries of all addresses in A by the same integer \(m\in \mathbb {Z}\). This set is called a translate of A, and denoted \(A+m\).
A set \(A\subset \mathbb {Z}^{\mathbb {N}_0}\) is called a wandering gap (for the one-sided shift \(\sigma \) on \(\mathbb {Z}^{\mathbb {N}_0}\)) if \(\#\sigma ^n(A) \ge 3\) for all \(n\ge 0\) and the sets \(\sigma ^{n_1}(A)\) and \(\sigma ^{n_2}(A)\) are disjoint and unlinked for all non-negative \(n_1\ne n_2\). If \(\#A=3\), then A is also called a wandering triangle.
A wandering gap is of exponential combinatorial type if the sets \(\sigma ^{n_1}(A)+m_1\) and \(\sigma ^{n_2}(A)+m_2\) are disjoint and unlinked whenever \((n_1,m_1)\ne (n_2,m_2)\) (where \(n_1,n_2\ge 0\) and \(m_1,m_2\in \mathbb {Z}\)).
The condition of “exponential combinatorial type” is motivated precisely by the dynamics and combinatorics of exponential maps as discussed above; see also Observation 6.14. Assuming this condition, we can now prove the absence of wandering gaps. (In general, wandering gaps do exist for the shift map on any number \(n\ge 3\) of symbols [6], and by the same reasoning they exist also for the shift on infinitely many symbols.)
Theorem 6.13
(No wandering triangles) There are no wandering gaps of exponential combinatorial type.
Proof
Since every wandering gap contains a wandering triangle, it is enough to prove the absence of wandering triangles of exponential combinatorial type; hence the name of the theorem. So suppose, by contradiction, that there is such a wandering triangle T, and define \(T_n := \sigma ^n(T)\) for \(n\ge 0\). Let \(\mathcal {T}\) denote the set of all \(T_n\) and their translates; recall that, by assumption, the elements of \(\mathcal {T}\) are pairwise disjoint and pairwise unlinked. For ease of notation, we also write \(\underline{r}+m\) for the translate of an address \(\underline{r}\) by m; that is,
$$\begin{aligned} \underline{r}+m = (r_0+m) r_1 r_2 r_3 \ldots . \end{aligned}$$
Observation 1
If \(T\in \mathcal {T}\) and \(\underline{r}^1,\underline{r}^2 \in T\), then \(\underline{r}^2 < \underline{r}^1+1\).
In particular, \(\sigma |_{T}\) preserves the cyclic ordering of addresses, and any two addresses in T differ by at most 1 from each other in every entry.
Proof
The first claim is immediate from the fact that T is unlinked with its translates, and implies the second claim (since \(\sigma \) preserves cyclical order when restricted to the interval between an address and its translate by 1). The final statement follows from the first, applied to \(\sigma ^n(T)\) for all \(n\ge 0\). \(\triangle \)
For two addresses \(\underline{r}^1,\underline{r}^2\), let us write \(N(\underline{r}^1,\underline{r}^2)\) for the index of the first entry in which these two addresses differ. For any triangle \(T\in \mathcal {T}\), also write N(T) for the largest value of \(N(\underline{r}^1,\underline{r}^2)\) for two different \(\underline{r}^1,\underline{r}^2\in T\).
Observation 2
If \(T\in \mathcal {T}\) is a triangle, then there is \(\underline{t}\in T\) such that \(N(\underline{t},\underline{r}) < N(T)\) for the other addresses \(\underline{r}\in T{\setminus }\{\underline{t}\}\).
Proof
Let \(T = \{\underline{r}^1,\underline{r}^2,\underline{t}\}\), where \(N(\underline{r}^1,\underline{r}^2)=N:= N(T)\). By Observation 1, at position N, there are only two possible choices for the entry of each address in T. In particular, \(\underline{t}\) does not differ from one of the two other addresses, say \(\underline{r}^1\), at position N. By definition of N(T), we must have \(N(\underline{t},\underline{r}^1) < N\). Since \(\underline{r}^1\) and \(\underline{r}^2\) agree up to entry \(N-1\), we also have \(N(\underline{t},\underline{r}^1) = N(\underline{t},\underline{r}^2)\). \(\triangle \)
Observation 3
There are \(n_2> n_1 > 0\) such that \(N_1:= N(T_{n_1}) \ge N(T_{n_1-1})\) and \(N_2:= N(T_{n_2}) \ge N(T_{n_1})\).
Proof
This is trivial if \(N(T_n)\) is unbounded as \(n\rightarrow \infty \). Otherwise, there are infinitely many n for which
$$\begin{aligned} N_1 := N(T_n) = \limsup _{k\rightarrow \infty } N(T_k), \end{aligned}$$
and we choose two of these that are sufficiently large to ensure that \(N(T_n) \le N_1\) for all \(n\ge n_1-1\). (Note that, in this case, \(N_1=N_2\).) \(\triangle \)
Let \(n_1\) and \(n_2\) be as in Observation 3; we may assume furthermore that \(n_2>n_1\) is chosen to be minimal. Let \(\tilde{T}_1\) and \(\tilde{T}_2\) be translates of \(T_{n_1-1}\) and \(T_{n_2-1}\), chosen to contain an address having initial entry 0, but no address with initial entry \(-1\). (This is possible by Observation 1.) In particular, \(\sigma (\tilde{T}_j) = T_{n_j}\) for \(j=1,2\), and
$$\begin{aligned} N(\tilde{T}_2) = N(T_{n_2-1}) \le N_1 \end{aligned}$$
(6.2)
by minimality of \(n_2\).
Observation 4
For \(j=1,2\), the triangle \(\tilde{T}_j\) contains two addresses \(\underline{r}^{j,0}\) and \(\underline{r}^{j,1}\) such that \(r^{j,\ell }_0 = \ell \) for \(\ell =0,1\), and such that \(N(\underline{r}^{j,1} , \underline{r}^{j,0}+1) = N(\underline{r}^{j,0}, \underline{r}^{j,1}-1) = N_j+1\).
Furthermore, the third address \(\underline{t}\in \tilde{T}_j\) differs from one of these two addresses at position 0, and from the other in an entry at a position \(\le N_j\).
Proof
If two addresses \(\underline{t}^0\ne \underline{t}^1\) differ first in the Nth entry, and have \(t^0_0 = t^1_0\), then their images under the shift map clearly differ first in the \((N-1)\)th entry, and thus
$$\begin{aligned} N(\sigma (\underline{t}^0),\sigma (\underline{t}^1)) = N(\underline{t}^0,\underline{t}^1) - 1. \end{aligned}$$
Now let \(\underline{t}^1 < \underline{t}^0\) be the two addresses in \(T_{n_j}\) with \(N(\underline{t}^1,\underline{t}^0)= N(T_{n_j})\), and let \(\underline{r}^{j,1}\) and \(\underline{r}^{j,0}\) be their preimages in \(\tilde{T}_j\). Then
$$\begin{aligned} N(\underline{r}^{j,1} , \underline{r}^{j,0}) \le N(\tilde{T}_j) \le N(T_{n_j}) = N(\underline{t}^1 , \underline{t}^0), \end{aligned}$$
and hence \(\underline{r}^{j,1}\) and \(\underline{r}^{j,0}\) differ in their initial entry.
It follows that \(\underline{r}^{j,\ell }\) begins with the entry \(\ell \) for \(\ell =0,1\), and that the two addresses agree in the next \(N_j\) entries, proving the first claim.
The second claim follows from Observation 2 in a similar manner. \(\triangle \)
We can now reach the desired contradiction. Indeed, by Observation 1, the two triangles \(\tilde{T}_1\) and \(\tilde{T}_2\) are unlinked. Since \(N_2 \ge N_1\), it follows from Observation 4 that \(\tilde{T}_2\) cannot belong to one of the bounded intervals of \(\mathbb {Z}^{\mathbb {N}_0} {\setminus } \tilde{T}_1\), and thus \(\tilde{T}_{2}\) is contained in the union of the two intervals \((\underline{r}^{1,1}-1, \underline{r}^{1,0})\) and \((\underline{r}^{1,1},\underline{r}^{1,0}+1)\). In particular, there must be two addresses in \(\tilde{T}_{2}\) that belong to the same of these two intervals, and hence agree in the first \(N_1+1\) entries. So \(N(\tilde{T}_{2}) > N_1\), which contradicts (6.2).\(\square \)
Remark
The above proof follows similar ideas as the usual proof of the wandering triangles theorem in the polynomial case, with one notable exception. The first step in the latter proof is usually to observe that the smallest side in the iterates of a wandering triangle must become arbitrarily small (in our terminology, this would mean that \(N(T_n)\rightarrow \infty \) as \(n\rightarrow \infty \)). In the polynomial case, this follows from an area argument [41, Lem. 2.11] which completely breaks down in the infinite-symbol case. This forces us to argue more carefully, observing that Observation 3 holds and is sufficient to conclude the proof, even if \(N(T_n)\) remained bounded. It is not clear whether this consideration is an artefact of the proof or a genuinely new phenomenon in the transcendental case; that is, for families of transcendental entire functions where wandering triangles do exist, do we always have \(N(T_n)\rightarrow \infty \)?
The following observation links the notions of gaps, and Theorem 6.13, with itineraries of exponential maps.
Observation 6.14
(Sets with different itineraries are unlinked) Let \(\underline{s}\in \mathbb {S}\), and let \(A,B\subset \mathbb {S}\) be such that all addresses in A share the same itinerary \(\underline{u}^A\), and all addresses in B share the same itinerary \(\underline{u}^B\) (with respect to \(\underline{s}),\) but \(\underline{u}^A\ne \underline{u}^B\). Then A and B are unlinked.
In particular, if \(\#A\ge 3,\) then \(\underline{u}^A\) is periodic.
Remark
The final statement completes the proof of Proposition 6.11.
Proof
The first claim is trivial when the initial entries of the two itineraries differ (by definition of itineraries). Furthermore, the shift map, when restricted to any of the intervals used in the definition of itineraries, preserves the circular order of external addresses. The fact that the two sets are unlinked hence follows by induction.
The second claim follows from the first, together with the No Wandering Triangles theorem. Indeed, by the definition of itineraries, \(\sigma ^n(A)\) is disjoint from its translates for all \(n\ge 0\). If \(\underline{u}^A\) was aperiodic but \(\#A \ge 3\), then A would be a wandering gap, contradicting Theorem 6.13. \(\square \)
Proof of Theorem 1.8
Suppose, by contradiction, that \(z_0\) is as in Theorem 1.8, but that \(z_0\) is not eventually periodic. By Theorem 6.4 (and since \(f_a^n\) is locally injective near \(z_0\)), there is \(n\ge 0\) such that \(f^n(z_0)\) is the landing point of at least three dynamic rays, at addresses \(\underline{r}^1,\underline{r}^2,\underline{r}^3\). These three addresses form a wandering triangle T. Since the three rays associated to any translate of any iterate of T also land together (due to the periodicity of the exponential map), the triangle is of exponential combinatorial type. This contradicts Theorem 6.13. \(\square \)
Attracting and parabolic examples. Recall that Theorem 1.7 claims that if \(f_a\) is an exponential map such that \(a\in F(f_a)\), then \(E(f_a)\) is totally separated. This is a consequence of the following result.
Proposition 6.15
(Attracting and periodic parameters) Suppose that \(f_a\) is an exponential map with an attracting or parabolic periodic orbit. Then there exists a curve \(\gamma \subset F(f_a)\) in the Fatou set such that no two endpoints of \(f_a\) have the same itinerary with respect to \(f^{-1}(\gamma )\).
Proof
This follows from the fact that, under the given hypotheses, all dynamic rays of \(f_a\) land, and two dynamic rays land at the same point if and only if they have the same itinerary with respect to \(f^{-1}(\gamma )\), where \(\gamma \) is certain curve connecting the singular value to \(\infty \), constructed precisely as described above. (Note that, in the case where \(f_a\) has an invariant Fatou component, we must now use a curve \(\gamma \) tending to \(-\infty \) and having \({\text {addr}}(\gamma )=\infty \). It is then clear that any two dynamic rays at different addresses have different itineraries with respect to \(f^{-1}(\gamma )\), and hence the claim is trivial in this case, as mentioned above.)
In the case where \(f_a\) has an attracting periodic orbit, the above claims are proved in [30, Prop. 9.2] as a consequence of the stronger Theorem 9.1 in the same paper. It is also remarked at the end of [30, Sect. 9] that these results remain true for parabolic parameters, although the details are not given.
We note that the proof of our proposition in the parabolic (and also in the attracting) case can be achieved with considerably less effort than the results of [30, Sect. 9]. Indeed, by Lemma 6.9, the claim is trivial for endpoints of rays at unbounded external addresses. Furthermore, for eventually periodic addresses (and hence for periodic itineraries, by Proposition 6.11), the claim is proved in [43, Prop. 4.5].
So let \(g_{\underline{r}^1}\) and \(g_{\underline{r}^2}\) be two rays at bounded addresses, sharing the same (bounded) itinerary \(\underline{m}\) which is not eventually periodic. (Note that, in particular, \(\sigma ^j(\underline{m})\) is distinct from the itinerary of the parabolic orbit of \(f_a\), for all \(j\ge 0\).) We must show that, if both rays land, they land at the same point in \(\mathbb {C}\).
It follows from a simple hyperbolic contraction argument (similar to that in the proof of [30, Prop. 9.2]) that, for any bounded itinerary which does not eventually agree with that of the parabolic orbit, there is a unique point \(z_0\) with a bounded orbit which has this itinerary. Furthermore, any other point with the same itinerary must tend to infinity under iteration. Because the landing points of \(g_{\underline{r}^1}\) and \(g_{\underline{r}^2}\) cannot be escaping (only rays at fast addresses land at escaping points), it follows that both rays land at \(z_0\). This completes the proof. \(\square \)
Proof of Theorem 1.7
If \(f_a\) is an exponential map with \(a\in F(f_a)\), then (as mentioned above), \(f_a\) has an attracting or parabolic periodic orbit. It follows from Proposition 6.15, together with Observation 6.2, that \(E(f_a)\) is totally separated.
On the other hand, suppose that \(f_a\) is an exponential map such that the singular value a is an endpoint or on a hair, and let \(\gamma \subset g_{\underline{s}}\) be the curve connecting a to \(\infty \), as above. Assume furthermore (as in the hypothesis of the theorem) that the kneading sequence \(\mathbb {K}(\underline{s})\) is not periodic; we must show that \(E(f_a)\) is totally disconnected.
So let X be a connected component of \(E(f_a)\). Then all points of X share the same itinerary \(\underline{m}\) with respect to \(f_a^{-1}(\gamma )\). By passing to a forward iterate, we may assume that \(\sigma ^j(\underline{m})\ne \mathbb {K}(\underline{s})\) for all \(j\ge 0\). In particular, each \(z\in X\) is the landing point of some dynamic ray \(g_{\underline{r}}\), where \({\text {itin}}_{\underline{s}}(\underline{r})=\underline{m}\). By Proposition 6.11, the set of possible such addresses is finite, and hence X is finite. Since X is connected, it follows that it consists of a single point, as desired. \(\square \)