Papers
Topics
Authors
Recent
Search
2000 character limit reached

Escaping Set in Transcendental Dynamics

Updated 6 July 2026
  • Escaping set is the collection of complex points whose iterates tend to infinity, serving as a fundamental structure in transcendental dynamics.
  • Its topology is notably intricate, being non-σ-compact and featuring complex structures such as spider’s webs and Cantor bouquets.
  • Methodologies like annular itineraries and Eremenko-point constructions reveal key dynamics that link escaping sets with Julia and Fatou sets.

In iteration theory, an escaping set records points whose forward orbit tends to infinity or, more generally, leaves every compact region of phase space. For a transcendental entire function ff, with fnf^n denoting the nn-th iterate, the escaping set is

I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.

This set is fundamental in transcendental dynamics: Eremenko proved that I(f)I(f)\neq\varnothing and that J(f)=I(f)J(f)=\partial I(f), where J(f)J(f) is the Julia set. More recent work shows that its topology is substantially more intricate than a countable compact exhaustion would suggest: for every transcendental entire function, I(f)I(f) is not σ\sigma-compact, equivalently not FσF_\sigma in fnf^n0 (Bergweiler et al., 15 Jul 2025, Rempe, 2020).

1. Classical formulation and foundational results

For an entire function fnf^n1, iteration means repeated composition: fnf^n2 and fnf^n3 denotes the fnf^n4-th iterate evaluated at fnf^n5. The Fatou set fnf^n6 is the set where fnf^n7 is a normal family, and the Julia set is fnf^n8. In transcendental entire dynamics, the escaping set

fnf^n9

is a basic dynamical object because its elementary definition already yields global information about nn0 (Bergweiler et al., 15 Jul 2025).

Two standard auxiliary growth functions are the maximum modulus

nn1

and its radial iterates nn2. Choosing nn3 so that nn4 for nn5, one obtains nn6. This growth scale organizes finer escaping subsets, above all the fast escaping set.

In the Eremenko–Lyubich class

nn7

a stronger inclusion holds: nn8. Outside nn9, escaping Fatou components may occur, including Baker domains and wandering domains, so the relation between I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.0, I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.1, and I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.2 becomes more delicate (Bergweiler et al., 15 Jul 2025).

2. Topological complexity and non-I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.3-compactness

A set I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.4 is I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.5-compact if it can be written as a countable union of compact sets,

I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.6

with each I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.7 compact. For transcendental entire I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.8, the decisive theorem is that I(f)={zC:fn(z) as n}.I(f)=\{z\in\mathbb C: f^n(z)\to\infty \text{ as } n\to\infty\}.9 is not I(f)I(f)\neq\varnothing0-compact. In I(f)I(f)\neq\varnothing1, this is equivalent to saying that I(f)I(f)\neq\varnothing2 is not an I(f)I(f)\neq\varnothing3 set (Rempe, 2020).

The result is stronger than the bare non-I(f)I(f)\neq\varnothing4-compactness of I(f)I(f)\neq\varnothing5. Let

I(f)I(f)\neq\varnothing6

be the set of points with unbounded orbit, and let

I(f)I(f)\neq\varnothing7

be the bungee set. Then every I(f)I(f)\neq\varnothing8-compact subset of I(f)I(f)\neq\varnothing9 omits some points of J(f)=I(f)J(f)=\partial I(f)0 and of J(f)=I(f)J(f)=\partial I(f)1. In particular, J(f)=I(f)J(f)=\partial I(f)2, J(f)=I(f)J(f)=\partial I(f)3, J(f)=I(f)J(f)=\partial I(f)4, and their intersections with J(f)=I(f)J(f)=\partial I(f)5 are all not J(f)=I(f)J(f)=\partial I(f)6-compact. Moreover, J(f)=I(f)J(f)=\partial I(f)7, J(f)=I(f)J(f)=\partial I(f)8, and J(f)=I(f)J(f)=\partial I(f)9 are nowhere J(f)J(f)0-compact: any J(f)J(f)1-compact subset has empty interior relative to these sets (Rempe, 2020).

The proof combines two mechanisms. The first is a slow-escape theorem built from annular itineraries. Fix J(f)J(f)2 so that J(f)J(f)3 for J(f)J(f)4. Rippon–Stallard’s annular itinerary machinery allows orbits to linger for long blocks at a given modulus scale before rising. Consequently, for any sequence J(f)J(f)5 with J(f)J(f)6 and J(f)J(f)7, there exist points J(f)J(f)8 and J(f)J(f)9 with

I(f)I(f)0

for all I(f)I(f)1. The second mechanism is an exit-time obstruction for compact exhaustions: if I(f)I(f)2 is I(f)I(f)3-compact, upper semicontinuity of exit times from discs I(f)I(f)4 yields a growth bound I(f)I(f)5 that every I(f)I(f)6 must violate, while the slow-escape theorem produces escaping points respecting that bound. Hence some escaping points avoid every I(f)I(f)7 (Rempe, 2020).

This topological complexity is visible already at the descriptive-set-theoretic level: I(f)I(f)8 so I(f)I(f)9 is an σ\sigma0 set. The same work also shows that σ\sigma1 is never a σ\sigma2 set (Rempe, 2020).

3. Fast escape, spider’s webs, and Eremenko points

The fast escaping set is defined by

σ\sigma3

for sufficiently large σ\sigma4. Its closed core levels are

σ\sigma5

One has σ\sigma6. In striking contrast with σ\sigma7, σ\sigma8 is σ\sigma9, hence FσF_\sigma0-compact in FσF_\sigma1 (Rempe, 2020).

A connected set FσF_\sigma2 is a spider’s web if there exists a sequence of bounded simply connected domains FσF_\sigma3 such that

FσF_\sigma4

When FσF_\sigma5 is a spider’s web, the consequences are strong: FσF_\sigma6 and FσF_\sigma7 are also spider’s webs, Eremenko’s conjecture holds for that FσF_\sigma8, and all Fatou components are bounded (Sixsmith, 2013). If FσF_\sigma9 has a multiply connected Fatou component, then fnf^n00 is a spider’s web; in this situation the geometry of fnf^n01 is organized by fundamental holes fnf^n02 and fundamental loops fnf^n03, and the rate-of-escape function

fnf^n04

links these loops to harmonic level sets inside multiply connected Fatou components (Sixsmith, 2013).

Rippon–Stallard’s refined Eremenko-point construction sharpens the component picture. If fnf^n05 is disconnected, then for any open disc fnf^n06 meeting fnf^n07, the set fnf^n08 has uncountably many unbounded components. For the core fnf^n09, there is a stronger dichotomy: for some fnf^n10, either fnf^n11 is connected and has the structure of an infinite spider’s web, or it has uncountably many components, each of which is unbounded (Rippon et al., 2017). These results are obtained by combining Wiman–Valiron-based constructions of Eremenko points with separation arguments in the plane.

4. Geometric models: hairs, bouquets, wandering domains, dimension, and measure

In many classes of entire functions, escaping dynamics is organized by curves to infinity. For exponential maps fnf^n12, trigonometric maps, and more generally finite-order functions in class fnf^n13 and finite compositions thereof, every escaping point lies on a hair along which fnf^n14 uniformly. The resulting topology is often a Cantor bouquet: uncountably many disjoint curves to infinity together with their endpoints (Bergweiler et al., 15 Jul 2025).

This bouquet geometry can coexist with spider’s-web geometry. For the family

fnf^n15

each of fnf^n16, fnf^n17, fnf^n18, fnf^n19, and fnf^n20 is a spider’s web, and fnf^n21 contains a Cantor bouquet; the curves minus the endpoints lie in fnf^n22 (Dourekas, 2019). This places dynamic-ray structure inside a globally connected web.

Multiply connected wandering domains provide a different source of escaping geometry. Every multiply connected Fatou component fnf^n23 is wandering, bounded, and lies in fnf^n24; in fact fnf^n25. Their forward images contain absorbing annuli, and the global consequences include spider’s-web structure for fnf^n26, fnf^n27, and fnf^n28 (Bergweiler et al., 15 Jul 2025). The fine topology can nevertheless be complicated: multiply connected wandering domains can have complementary components with no interior, indeed uncountably many (Rippon et al., 2017).

Quantitative size varies widely. For transcendental entire functions, fnf^n29, and every fnf^n30 occurs. For finite-order functions in class fnf^n31, fnf^n32. At the level of Hausdorff measure, slow escaping sets

fnf^n33

can have infinite fnf^n34-measure for gauge functions with

fnf^n35

while definitive-speed escaping sets can have fnf^n36-measure fnf^n37 for suitable fnf^n38 when

fnf^n39

(Bergweiler et al., 2012). In transcendental meromorphic dynamics, the range of escaping-set dimensions is even broader: within the Speiser class with at most four singular values,

fnf^n40

(Aspenberg et al., 2020).

5. Extensions beyond transcendental entire maps

For transcendental self-maps of the punctured plane fnf^n41, where both fnf^n42 and fnf^n43 are essential singularities, the escaping set is defined by

fnf^n44

Escape is refined by an essential itinerary fnf^n45, with

fnf^n46

There are corresponding fast escaping sets fnf^n47, and for every itinerary fnf^n48,

fnf^n49

Moreover, every connected component of fnf^n50 is unbounded, and there is an uncountable collection of disjoint sets of fast escaping points each of which has the Julia set as its boundary (Martí-Pete, 2014). In the bounded-type class fnf^n51, escaping points lie in the Julia set, and for finite-order compositions every escaping point can be connected to fnf^n52 or fnf^n53 by a dynamic ray tail; for each essential itinerary fnf^n54, fnf^n55 contains a Cantor bouquet (Fagella et al., 2016).

Semigroup dynamics introduces several non-equivalent escaping-set notions. One definition is

fnf^n56

which yields fnf^n57 for all fnf^n58 and, for finitely generated bounded-type semigroups, fnf^n59 and fnf^n60. If the semigroup is abelian, bounded type, and each generator is hyperbolic, then all components of fnf^n61 are unbounded (Subedi et al., 2018). Another definition requires that every sequence in the semigroup admit a subsequence diverging to fnf^n62 at the given point; with this choice, fnf^n63 is forward invariant and satisfies fnf^n64 (Kumar et al., 2014). For non-abelian semigroups, a completely invariant escaping core fnf^n65 has been introduced to recover complete invariance (Subedi et al., 2018).

In higher-dimensional quasiregular dynamics, for a transcendental-type quasiregular map fnf^n66, the escaping set remains

fnf^n67

and the fast escaping set admits equivalent definitions analogous to the plane: fnf^n68 It is nonempty, every component of fnf^n69 is unbounded, and under explicit minimum-modulus control fnf^n70 is a spider’s web (Bergweiler et al., 2013).

Topological dynamics broadens the notion further. For a flow fnf^n71 on a Hausdorff, first countable space, an escaping point is one whose orbit eventually stays outside every compact set in forward time, or in backward time when the flow is invertible. In a proper metric space, this compact-escaping definition is equivalent to divergence to infinity; it is a topological conjugacy invariant and is characterized by emptiness of the fnf^n72-limit set (Lalwani, 2019). For continuous maps fnf^n73, the escaping set

fnf^n74

can be open, closed, or countable in dimensions fnf^n75, in marked contrast with the transcendental entire setting (Short et al., 2016).

In polynomial automorphisms of fnf^n76, especially generalized Hénon maps, the forward escaping set is

fnf^n77

and the non-escaping set is fnf^n78. Here the Green function

fnf^n79

satisfies fnf^n80 and fnf^n81. Recent rigidity results show that for polynomial automorphisms of positive entropy, every holomorphic automorphism of fnf^n82 preserving fnf^n83 has the form fnf^n84, where fnf^n85 belongs to a finite cyclic group of affine maps preserving the escaping set (Bera et al., 12 Jan 2026).

6. Conjectures, counterexamples, and current directions

The central historical question was Eremenko’s conjecture: every connected component of fnf^n86 is unbounded. Positive cases remain extensive. The conjecture holds for postsingularly bounded maps, including hyperbolic functions in class fnf^n87, and for finite-order maps in class fnf^n88, where dynamic-ray theory provides curves through escaping points (Bergweiler et al., 15 Jul 2025).

At the same time, the modern picture is more nuanced. The strong form of the conjecture—that every point of fnf^n89 lies on a curve to infinity—fails in general. More significantly, the conjecture itself fails in general: there exist transcendental entire functions with bounded components of fnf^n90, even singleton components, although the known counterexamples lie outside class fnf^n91 and have infinite order (Bergweiler et al., 15 Jul 2025). This places recent structural theorems, such as the non-fnf^n92-compactness of fnf^n93, in a setting where unboundedness of components can no longer be taken as universal (Rempe, 2020).

Several problems remain central. The survey literature isolates the status of Eremenko’s conjecture in class fnf^n94 or fnf^n95, the finite-order case outside fnf^n96, the possibility of Jordan spider’s webs for canonical examples, the regularity of hairs, and sharp growth criteria for dimension and area of escaping sets (Bergweiler et al., 15 Jul 2025). A plausible implication is that the modern theory now splits into two complementary programs: one studies rigidity and geometric organization inside structured classes such as fnf^n97, fnf^n98, quasiregular fast-escape settings, and Hénon-type dynamics; the other studies how slowly escaping or topologically pathological orbits obstruct classical compact, connected, or ray-based models.

The escaping set therefore remains both a definition and a research program: a set given by the elementary condition fnf^n99, but one whose topology, geometry, and quantitative size continue to organize large parts of transcendental and non-compact dynamical systems.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Escaping Set.