- The paper proves that every non-empty itinerary set Λ_c for fλ(z) of the exponential map e^z under the condition that “c” is exponentially bounded has a Hausdorff dimension of 1.
- The proof defines three unique regions with a common proof strategy and requires stratify the points in each by a complex estimation of escape time
- This key fact grows from enhanced techniques including derivative growth lemmas and adjustments for the excecution
The problem and its context
The paper studies the Hausdorff dimension of the sets Λc of points sharing a prescribed itinerary under the exponential map fλ(z)=λez. Partitioning the plane into horizontal strips Pk={z:(2k−1)π<Imz⩽(2k+1)π}, each point z is assigned an itinerary c=c0c1… recording the strip visited by each iterate. Devaney and Krych established that Λc=∅ if and only if c is exponentially bounded, and Schleicher and Zimmer later showed (with a parameter-independent definition of exponential boundedness) that for such itineraries Λc∞ contains an escaping curve — the tail of a hair — which Viana proved to be C∞-smooth.
The topological structure of Λc can be far more complicated than a single curve: Devaney and Jarque showed that for fλ(z)=λez0 and bounded block-form itineraries with sufficiently long zero blocks, fλ(z)=λez1 is an indecomposable continuum; related phenomena occur at Misiurewicz parameters such as fλ(z)=λez2, and bounded indecomposable continua disjoint from the hair itself are also known. Since every non-empty fλ(z)=λez3 contains a smooth curve, fλ(z)=λez4 always holds. Zdunik and Pawelec had previously shown that for bounded itineraries this lower bound is sharp: fλ(z)=λez5. The present work extends this to all exponentially bounded itineraries — including unbounded ones — showing that topological complexity never raises the Hausdorff dimension above one.
Main result
For fλ(z)=λez6 and any itinerary fλ(z)=λez7, the authors prove
fλ(z)=λez8
which, combined with the existence of an escaping curve in every non-empty fλ(z)=λez9, yields the corollary that Pk={z:(2k−1)π<Imz⩽(2k+1)π}0 whenever Pk={z:(2k−1)π<Imz⩽(2k+1)π}1 (equivalently, whenever Pk={z:(2k−1)π<Imz⩽(2k+1)π}2 is exponentially bounded). This is a strong rigidity statement: even when Pk={z:(2k−1)π<Imz⩽(2k+1)π}3 is an indecomposable continuum accumulating everywhere on itself, its Hausdorff dimension equals exactly one. The restriction to Pk={z:(2k−1)π<Imz⩽(2k+1)π}4 is a deliberate simplification; the authors state that the techniques appear to extend to all real Pk={z:(2k−1)π<Imz⩽(2k+1)π}5, but not to non-real parameters such as Pk={z:(2k−1)π<Imz⩽(2k+1)π}6.
Proof strategy
The set Pk={z:(2k−1)π<Imz⩽(2k+1)π}7 of points with bounded orbit consists of at most two points, so it suffices to cover the unbounded part. Fixing Pk={z:(2k−1)π<Imz⩽(2k+1)π}8, the authors construct coverings Pk={z:(2k−1)π<Imz⩽(2k+1)π}9 with mesh tending to zero and total z0-weight uniformly bounded by z1, giving z2; letting z3 concludes the argument. A key choice is to take the cutoff z4 on the forward orbit of the singular value z5, so that z6, ensuring z7.
The plane is split into three regions treated by distinct subfamilies:
- Right half-plane (z8): pull back rectangles from level zero via inverse branches; counting arguments give at most z9 pieces per rectangle c=c0c1…0 with diameter c=c0c1…1, yielding weight c=c0c1…2 per rectangle.
- Left half-plane (c=c0c1…3): orbits starting far left shadow the orbit of c=c0c1…4 until reaching roughly c=c0c1…5 (Lemma on escape from c=c0c1…6), so one iterates until the image has diameter at least c=c0c1…7 and pulls back elements of c=c0c1…8 using a branch of c=c0c1…9. Bounded distortion of Λc=∅0 follows from the Koebe Distortion Theorem, with distortion constant Λc=∅1 arbitrarily close to Λc=∅2 as Λc=∅3.
- Middle strip (Λc=∅4): this requires entirely new techniques relative to [PZ]. Points are stratified by escape time Λc=∅5 into sets Λc=∅6, further split by sign (Λc=∅7) according to whether some iterate crosses the negative real axis — possible only once per piece, and then along a line segment interior to the piece. A derivative-growth lemma shows that for each point there exists Λc=∅8 with Λc=∅9 (with c0), obtained by partitioning trajectories into sectors where the cumulative derivative grows geometrically, using explicit estimates near c1 and distortion control further out.
Each subfamily contributes at most c2 to the first-level sum, and an induction over levels transfers these bounds: the right-family estimate c3 per rectangle is preserved, while left and middle families inherit their weights from pulled-back right-families at shifted itineraries, with the geometric factor c4 controlling the middle sum. The authors emphasize careful tracking of constants throughout, noting the proof is more technical than the underlying idea warrants.
Limitations and open questions
The method is confined to real parameters: the authors explicitly note it does not work for c5, notably c6, where hairs accumulate on themselves through two distinct mechanisms. Although the authors expect the argument extends to all real c7, this is asserted rather than carried out, and the extension would require re-verifying the delicate constant-dependent estimates. The full catalogue of topological types realized by c8 across all parameters and itineraries also remains open, though the dimension result shows this classification cannot be detected by Hausdorff dimension.
Conclusion
The paper establishes that for the exponential map c9, every non-empty itinerary set Λc∞0 has Hausdorff dimension exactly one, regardless of whether it is a simple hair or an indecomposable continuum. The proof combines classical covering techniques for the outer half-planes with new escape-time stratification and derivative-growth estimates in the middle region, extending the earlier bounded-itinerary result of Zdunik and Pawelec to all exponentially bounded itineraries.