Generated by GPT-5-mini| Thurston's theorem | |
|---|---|
| Name | Thurston's theorem |
| Field | Low-dimensional topology, Complex dynamics |
| Discovered by | William P. Thurston |
| Year | 1982 |
| Statement | Existence and characterization of postcritically finite branched coverings of the sphere isotopic to rational maps |
Thurston's theorem
Thurston's theorem gives a topological characterization of when a postcritically finite branched covering of the 2-sphere is equivalent to a rational map on the Riemann sphere. It links ideas from Thurston's work on 3-manifolds, iteration of rational maps, and mapping class theory exemplified by figures such as Dennis Sullivan and John McCarthy. The theorem provides both an existence criterion and an obstruction theory involving multicurves and linear operators, influencing research in Curtis T. McMullen, Mary Rees, and L. Leśniewski-style studies.
Let f be a branched covering f: S^2 → S^2 of degree at least two whose postcritical set P_f is finite. Thurston's theorem states that f is equivalent (via an orientation-preserving homeomorphism isotopic to the identity relative to P_f) to a rational map R on the Riemann sphere if and only if there is no multicurve Γ on S^2 \ P_f that is a Thurston obstruction: the associated linear operator σ_f on the vector space generated by isotopy classes of simple closed curves has spectral radius ≥ 1. When no obstruction exists, the rational map R is unique up to Möbius conjugation. This statement synthesizes contributions and clarifies connections to work by John H. Hubbard, Adam L. Epstein, and Curtis McMullen.
Key objects include postcritical finiteness, branched coverings, multicurves, and the Thurston pullback map. Postcritically finite maps were studied by Pierre Fatou and Gaston Julia in the classical iteration context. A branched covering f: S^2 → S^2 has a finite postcritical set P_f = ⋃_{n>0} f^n(C_f) where C_f is the critical set; this finiteness condition appears in the work of Adrien Douady and John Milnor. A multicurve Γ is a finite collection of disjoint, essential, non-peripheral simple closed curves in S^2 \ P_f; notions of essential and peripheral trace to investigations by William J. Harvey and Benson Farb. The Thurston linear operator σ_f acts on the free real vector space spanned by isotopy classes of curves by pulling back and counting preimages weighted by degree; spectral properties of σ_f determine obstructions, a perspective developed alongside the mapping class group studies of Joan S. Birman and Max Dehn.
Equivalence to a rational map means there exist homeomorphisms φ, ψ: S^2 → Ĉ isotopic rel P_f with φ ∘ f = R ∘ ψ where R is a rational function on the Riemann sphere Ĉ; uniqueness up to postcomposition by Möbius transformations connects to classical results of Henri Poincaré and Bernhard Riemann on uniformization.
Thurston's original proof introduces the Teichmüller space T(S^2, P_f) of marked complex structures on S^2 \ P_f, using tools from Teichmüller theory, Lars Ahlfors, and Lennart Carleson. The map f induces a pullback operator σ on T(S^2, P_f); fixed points of σ correspond to complex structures for which f is holomorphic, hence rational. Existence of a fixed point is shown via contraction properties of σ when no multicurve obstruction exists, building on hyperbolic geometry methods from Thurston and compactness arguments inspired by Lipman Bers and S. Nagata.
If a multicurve Γ yields spectral radius ≥ 1 for the associated linear operator, then lengths of curves under iterated pullback cannot be uniformly contracted, preventing convergence to a fixed point; this produces the obstruction direction. The converse uses an abstract fixed-point theorem in Teichmüller space and analytic deformation techniques related to the quasiconformal surgery traditions of Sullivan, Douady, and Epstein.
Thurston's theorem unifies classification problems in complex dynamics and low-dimensional topology, underpinning proofs about hyperbolicity of rational maps studied by M. Lyubich and Epstein. It informs the combinatorial classification of quadratic polynomials via external rays developed by Douady & Hubbard and contributes to rigidity theorems linked to Sullivan's theorem and McMullen techniques. The obstruction criterion yields algorithmic decidability results for recognizing rational maps, connecting with computational projects by Curtis McMullen and A. Poirier.
Standard examples include postcritically finite polynomials such as the basilica and rabbit polynomials analyzed by Douady & Hubbard; these satisfy the no-obstruction condition and correspond to explicit rational maps. A celebrated family of counterexamples arises from obstructed branched coverings constructed by Thurston and later by K. Pilgrim and Lei Tan demonstrating multicurve obstructions where no equivalent rational map exists. Other instructive instances are matings of polynomials where combinatorial incompatibilities produce obstructions, as explored by Mary Rees and Jeremy Kahn.
Generalizations extend to orbifold settings and to maps with infinite postcritical sets under restrictive hypotheses; related frameworks include the characterization of rational maps via orbifold Euler characteristic conditions reminiscent of criteria from Klein and Weyl. Connections to holomorphic correspondences, Thurston's pullback on moduli spaces, and the study of laminations link to work by Douady, Jan Kiwi, and J.-L. Lin. Modern developments relate Thurston obstructions to spectral radii in Perron–Frobenius theory studied by Oskar Perron and Frobenius, and to algorithmic classification programs influenced by Thurston's students and collaborators.
Category:Mathematical theorems