Geometrically Finite Polynomial

• Geometrically finite polynomials are complex polynomials where every critical point in the Julia set has a finite forward orbit.
• Their combinatorial classification uses pointed Hubbard trees and Blaschke-product models to capture external ray landing patterns and degeneration behaviors.
• Degeneration analysis via quasi-PCF sequences reveals critical dynamics and topological nuances, such as self-bump phenomena in higher-degree cases.

A geometrically finite polynomial is a complex polynomial whose critical points in the Julia set have finite forward orbit. This notion encompasses all hyperbolic polynomials and more generally those for which each critical point in the Julia set maps to either an attracting or parabolic cycle, or is contained in a Fatou component with eventually periodic external ray landing pattern. The combinatorial structure and degeneration theory for geometrically finite polynomials on the boundaries of the main hyperbolic components have been analyzed via iterated-simplicial pointed Hubbard trees, Blaschke-product models, and quasi-post-critically finite (quasi-PCF) degenerating sequences (Luo, 2021).

1. Definitions and Basic Properties

Let $P: \widehat{\mathbb{C}} \to \widehat{\mathbb{C}}$ be a degree-$d$ rational map. $P$ is hyperbolic if every critical point converges to an attracting cycle. $P$ is defined to be geometrically finite if every critical point in its Julia set $J(P)$ has finite forward orbit. For a polynomial $P(z) = a_d z^d + \cdots + a_0$ with connected Julia set, this is equivalent to requiring each critical point to eventually lie in an attracting or parabolic cycle or within a Fatou component whose boundary exhibits eventually periodic ray landings. The postcritical set $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$ in $J(P)$ is then finite.

2. Combinatorial Classification via Pointed Hubbard Trees

The combinatorial classification of geometrically finite polynomials on the boundary $\partial\mathcal{H}_d$ of the principal hyperbolic component $\mathcal{H}_d$ proceeds in terms of pointed Hubbard trees and their iterated-simplicial structures. A pointed Hubbard tree is a finite tree $d$0 with a distinguished root $d$1, equipped with a simplicial self-map $d$2, local degrees $d$3, and angle assignments $d$4 encoding external ray landing data.

A boundary polynomial $d$5 is geometrically finite if and only if its pointed Hubbard tree $d$6 is iterated-simplicial, i.e., it can be constructed from a trivial tree via alternating the operations of pointed simplicial tuning (gluing in angled Hubbard trees of PCF polynomials at certain vertices, matching external accesses, and relabeling critical orbits) and collapsing invariant subtrees to maintain minimality. Each combinatorial class of such trees corresponds to a unique geometrically finite boundary polynomial.

The combinatorial objects involved and their parameterizations include:

• Pointed Hubbard trees $d$7 with simplicial self-maps, local degrees, and angle data.
• Rational laminations on $d$8 encoding ray-equivalence, i.e., the identifications of external angles occurring through finite chains of dual rays.
• Rotation numbers in $d$9 arising from the cyclic permutations of edges at fixed Fatou-vertices of degree 1; in degree 2, this yields the bijection $P$0.

3. Degeneration Mechanism: Blaschke Products and Quasi-PCF Sequences

To study degenerations from hyperbolic polynomials within $P$1 to boundary elements, the Blaschke-product model is employed. The Blaschke space $P$2 comprises normalized degree-$P$3 maps

$P$4

with $P$5, an attracting fixed point at 0, and Julia set $P$6. Given $P$7, $P$8 is glued on $P$9 to $P$0 on the exterior via a marking $P$1, producing a monic-centered polynomial $P$2.

A sequence $P$3 is $P$4–quasi-PCF if for each of its $P$5 critical points $P$6 there exist preperiods $P$7 and periods $P$8 such that $P$9, with $J(P)$0 the hyperbolic metric. From such sequences, pointed finite trees $J(P)$1 are extracted that degenerate in the hyperbolic metric and yield simplicial tree models and local rescaling limits, reconstructing the combinatorics of the limiting boundary polynomial.

Conversely, every admissible angled tree map (with critically star-shaped core and all other fixed branch points Fatou/parabolic) is realized by a quasi-PCF sequence in $J(P)$2; gluing yields convergent sequences in $J(P)$3 with combinatorics matching the original tree (Luo, 2021).

4. Rigidity, Realization, and Key Propositions

Key results underpinning this classification and realization framework include:

• The existence of quasi-invariant trees: Given a quasi-PCF sequence in $J(P)$4, the hyperbolic convex hull of all critical orbits yields $J(P)$5 with nearly invariant vertices and edges as $J(P)$6.
• Schwarz-lemma expansion: For degree-$J(P)$7 maps $J(P)$8, $J(P)$9 behaves almost isometrically on geodesics away from the critical set.
• Algebraic compactness: Any $P(z) = a_d z^d + \cdots + a_0$0 sequence with bounded displacement of 0 has a convergent subsequence to a nonconstant limit.
• Carathéodory-limit lemma: Uniform hyperbolic distance bounds between $P(z) = a_d z^d + \cdots + a_0$1 and $P(z) = a_d z^d + \cdots + a_0$2 ensure convergence of $P(z) = a_d z^d + \cdots + a_0$3 to a fixed point or convergence of domains in Carathéodory topology to a genuine Fatou component.
• For degree 2, explicit realization describes the 1-postcritical tuning via $P(z) = a_d z^d + \cdots + a_0$4.
• A full induction argument constructs higher-degree realizations by peeling critical preimages, applying the induction hypothesis, and reinserting zeros.
• M-uni-critical compactness: The family of degree-$P(z) = a_d z^d + \cdots + a_0$5 doubly-parabolic Blaschke products with critical set in a fixed hyperbolic ball is compact.

These results together give a complete correspondence between quasi-PCF degenerations of Blaschke products and geometrically finite boundary polynomials (Luo, 2021).

5. Topological Features: Self-Bumps and Higher Degree Pathologies

For $P(z) = a_d z^d + \cdots + a_0$6, the topological structure of $P(z) = a_d z^d + \cdots + a_0$7 exhibits singularities not present for low degrees. Specifically, in the combinatorial classification, splitting at the final parabolic branch point in a pointed Hubbard tree of local degree $P(z) = a_d z^d + \cdots + a_0$8 is nonunique. Two distinct admissible angled trees, $P(z) = a_d z^d + \cdots + a_0$9 and $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$0, can be constructed that both collapse to the same Hubbard tree. These yield different quasi-PCF sequences, each gluing to $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$1 externally, yet converging to the same boundary polynomial $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$2.

The consequence is that small neighborhoods $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$3 of $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$4 in $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$5 intersect $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$6 in a disconnected manner. This phenomenon is termed a self-bump. The two accesses are distinguished by the signs of the imaginary parts of the multipliers of certain repelling fixed points, as identified via residue calculus. Therefore, for $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$7, $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$8 fails to be a topological manifold with boundary. This is formalized in the Self-bump Theorem (Thm 1.9), which gives a precise obstruction to manifold structure in higher dimensions (Luo, 2021).

6. Relations to Earlier Work and Broader Context

The combinatorial and degeneration machinery developed generalizes constructions of Poirier (angled Hubbard trees) and McMullen (ribbon $$\mathrm{Crit}(P) \cup P(\mathrm{Crit}(P)) \cup \cdots$$9-trees), establishing a full dictionary between quasi-PCF Blaschke degenerations and boundaries of main hyperbolic components for polynomials. The results illuminate the higher-dimensional topologies of hyperbolic-component boundaries and clarify the role of combinatorics in the structure of moduli spaces of polynomials. The interrelation between the dynamical, combinatorial, and topological data—tied together through the Blaschke-product degeneration model—provides a unified approach for understanding geometrically finite polynomials and their boundary behavior (Luo, 2021).