Misplaced Pages

In mathematics, and particularly complex dynamics, the escaping set of an entire function ƒ consists of all points that tend to infinity under the repeated application of ƒ. That is, a complex number ${\displaystyle z_{0}\in \mathbb {C} }$ belongs to the escaping set if and only if the sequence defined by ${\displaystyle z_{n+1}:=f(z_{n})}$ converges to infinity as ${\displaystyle n}$ gets large. The escaping set of ${\displaystyle f}$ is denoted by ${\displaystyle I(f)}$.

For example, for ${\displaystyle f(z)=e^{z}}$, the origin belongs to the escaping set, since the sequence

${\displaystyle 0,1,e,e^{e},e^{e^{e}},\dots }$

tends to infinity.

History

The iteration of transcendental entire functions was first studied by Pierre Fatou in 1926 The escaping set occurs implicitly in his study of the explicit entire functions ${\displaystyle f(z)=z+1+\exp(-z)}$ and ${\displaystyle f(z)=c\sin(z)}$.

The first study of the escaping set for a general transcendental entire function is due to Alexandre Eremenko who used Wiman-Valiron theory. He conjectured that every connected component of the escaping set of a transcendental entire function is unbounded. This has become known as Eremenko's conjecture. There are many partial results on this problem but as of 2013 the conjecture is still open.

Eremenko also asked whether every escaping point can be connected to infinity by a curve in the escaping set; it was later shown that this is not the case. Indeed, there exist entire functions whose escaping sets do not contain any curves at all.

Properties

The following properties are known to hold for the escaping set of any non-constant and non-linear entire function. (Here nonlinear means that the function is not of the form ${\displaystyle f(z)=az+b}$.)

• The escaping set contains at least one point.
• The boundary of the escaping set is exactly the Julia set. In particular, the escaping set is never closed.
• For a transcendental entire function, the escaping set always intersects the Julia set. In particular, the escaping set is open if and only if ${\displaystyle f}$ is a polynomial.
• Every connected component of the closure of the escaping set is unbounded.
• The escaping set always has at least one unbounded connected component.
• The escaping set is connected or has infinitely many components.
• The set ${\displaystyle I(f)\cup \{\infty \}}$ is connected.

Note that the final statement does not imply Eremenko's Conjecture. (Indeed, there exist connected spaces in which the removal of a single dispersion point leaves the remaining space totally disconnected.)

Examples

Polynomials

A polynomial of degree 2 extends to an analytic self-map of the Riemann sphere, having a super-attracting fixed point at infinity. The escaping set is precisely the basin of attraction of this fixed point, and hence usually referred to as the **basin of infinity**. In this case, ${\displaystyle I(f)}$ is an open and connected subset of the complex plane, and the Julia set is the boundary of this basin.

For instance the escaping set of the complex quadratic polynomial ${\displaystyle f(z)=z^{2}}$ consists precisely of the complement of the closed unit disc:

${\displaystyle I(f)=\{z\in \mathbb {C} \colon |z|>1\}.}$

Transcendental entire functions

For transcendental entire functions, the escaping set is much more complicated than for polynomials: in the simplest cases like the one illustrated in the picture it consists of uncountably many curves, called hairs or rays. In other examples the structure of the escaping set can be very different (a spider's web). As mentioned above, there are examples of transcendental entire functions whose escaping set contains no curves.

By definition, the escaping set is an ${\displaystyle F_{\sigma \delta }{\text{ set}}}$. It is neither ${\displaystyle G_{\delta }}$ nor ${\displaystyle F_{\sigma }}$. For functions in the exponential class ${\displaystyle \exp(z)+a}$, the escaping set is not ${\displaystyle G_{\delta \sigma }}$.

See also

• Plotting algorithms for the Mandelbrot set § Escape time algorithm
• target set

Notes

1. Theorem 1 of (Eremenko, 1989)
2. See (Eremenko, 1989), formula (1) on p. 339 and l.2 of p. 340
3. Theorem 2 of (Eremenko, 1989)
4. Theorem 3 of (Eremenko, 1989)

References

1. ^ Rippon, P. J.; Stallard, G (2005). "On questions of Fatou and Eremenko". Proc. Amer. Math. Soc. 133 (4): 1119–1126. doi:10.1090/s0002-9939-04-07805-0.
2. Fatou, P. (1926). "Sur l'itération des fonctions transcendantes Entières". Acta Math. 47 (4): 337–370. doi:10.1007/bf02559517.
3. ^ Eremenko, A (1989). "On the iteration of entire functions" (PDF). Banach Center Publications, Warsawa, PWN. 23: 339–345.
4. ^ Rottenfußer, G; Rückert, J; Rempe, L; Schleicher, D (2011). "Dynamic rays of bounded-type entire functions". Ann. of Math. 173: 77–125. arXiv:0704.3213. doi:10.4007/annals.2010.173.1.3.
5. ^ Rippon, P. J.; Stallard, G (2011). "Boundaries of escaping Fatou components". Proc. Amer. Math. Soc. 139 (8): 2807–2820. arXiv:1009.4450. doi:10.1090/s0002-9939-2011-10842-6.
6. Sixsmith, D.J. (2012). "Entire functions for which the escaping set is a spider's web". Mathematical Proceedings of the Cambridge Philosophical Society. 151 (3): 551–571. arXiv:1012.1303. Bibcode:2011MPCPS.151..551S. doi:10.1017/S0305004111000582.
7. Rempe, Lasse (2020). "Escaping sets are not sigma-compact". arXiv:2006.16946 .
8. Lipham, D.S. (2022). "Exponential iteration and Borel sets". arXiv:2010.13876.

External links

• Lasse Rempe. "A poem on Eremenko conjecture".

• Complex analysis