Polynomially many surfaces of fixed Euler characteristic in a hyperbolic 3-manifold

Marc Lackenby, Anastasiia TsvietkovaarXiv 2026 · DOI · arXiv

TL;DR

This paper establishes a universal, polynomial upper bound for the number of distinct ways a surface of a specific complexity (Euler characteristic) can be embedded within a hyperbolic 3-manifold. By combining the geometric properties of minimal surfaces with the combinatorial power of normal surface theory, the authors show that this count grows polynomially with the manifold's volume, providing a much-needed "universal" ruler for 3-manifold topology.

What Problem Does This Paper Address?

In the study of 3-manifolds (three-dimensional spaces), "essential surfaces" act as the structural bones of the manifold. A long-standing question in low-dimensional topology is: How many such surfaces can a single manifold hold?

For hyperbolic 3-manifolds—spaces with a specific, uniform "saddle-like" geometry—we know this number is finite. However, previous attempts to count them often resulted in bounds that were either specific to a single manifold or grew at staggering, super-exponential rates. The "gap" addressed here is the lack of a universal polynomial bound. Topologists wanted a formula where you could plug in the volume of any hyperbolic 3-manifold and the complexity of the surface ($\chi$) and get a reasonable upper limit that applies to all such manifolds simultaneously.

Methods

The authors bridge the gap between continuous geometry and discrete combinatorics using several sophisticated tools:

  1. Minimal Surface Theory: They utilize the fact that any "essential" surface can be deformed into a "minimal surface"—a state where it occupies the least possible area. Thanks to the Gauss-Bonnet Theorem, the area of such a surface in a hyperbolic manifold is directly bounded by its Euler characteristic ($\text{Area} \leq -2\pi\chi$).
  2. Normal Surface Theory: This is a combinatorial method for describing surfaces by how they intersect a "triangulation" (a way of breaking the 3-manifold into tetrahedra).
  3. "Thick" Triangulations: A major challenge is that standard triangulations can have very "skinny" tetrahedra, making it hard to relate area to the number of pieces. The authors employ "thick" triangulations (based on work by Breslin), where every tetrahedron has a guaranteed "chunkiness" (dihedral angles and edge lengths are bounded away from zero).
  4. Perturbation and Transversality: To ensure the minimal surface behaves nicely with the triangulation, the authors perform a "barycentric subdivision" and carefully perturb the vertices. This ensures the surface intersects the tetrahedra in standard "normal discs" (triangles and squares), allowing them to count the surfaces using combinatorial "stars and bars" techniques.

Datasets

Not discussed in the paper. As a work of pure mathematics, this paper relies on logical proofs and geometric constructions rather than empirical datasets or benchmarks.

Key Insights and Ideas

  • Area as a Counting Tool: The "aha moment" is realizing that if every "piece" of a surface (a normal disc) in a "thick" tetrahedron has a minimum area, then the total area bound from Gauss-Bonnet automatically limits the total number of pieces.
  • Universal vs. Manifold-Specific: Previous bounds often depended on the specific "shape" of a manifold. By using the Margulis Lemma (which describes the "thick-thin" decomposition of hyperbolic spaces), the authors found a way to make their constants ($c_1, c_2$) universal for all hyperbolic 3-manifolds of finite volume.
  • Linearity of Degree: The degree of the polynomial bound depends linearly on the absolute value of the Euler characteristic ($|\chi|$). This means as the surface gets more complex (higher genus), the number of possible ways to embed it grows, but it stays within a predictable polynomial envelope relative to the manifold's volume.

Key Results

  • The Main Bound (Theorem 1.1): For an orientable hyperbolic 3-manifold $M$ with volume $\text{vol}(M)$, the number of properly embedded essential surfaces with Euler characteristic at least $\chi$ is at most: $$(c_1 \text{vol}(M))^{c_2|\chi|}$$ where $c_1$ and $c_2$ are universal constants.

  • Link Complements (Corollary 1.2): For a link $K$ in a 3-sphere with crossing number $c(K)$, the number of such surfaces is at most $(c'_1 c(K))^{c_2|\chi|}$. This provides a direct link between the complexity of a knot's diagram and the internal topology of its surrounding space.

  • Non-orientable Extension: The result was successfully extended to non-orientable surfaces that are $\pi_1$-injective and boundary-$\pi_1$-injective.

Limitations and Future Work

  • Size of Constants: While the constants $c_1$ and $c_2$ are "universal" and "explicit," the methods used to derive them (involving thick triangulations and minimal surface curvature bounds) likely result in very large numbers, meaning the bound is theoretically important but perhaps not "tight" for small manifolds.
  • Non-Hyperbolic Manifolds: The proof relies heavily on hyperbolic geometry (specifically the Gauss-Bonnet area bound and the Margulis Lemma). Extending these polynomial bounds to other types of 3-manifolds remains an open challenge.
  • Algorithmic Applications: The authors suggest that the tools developed for "thick" triangulations and minimal-to-normal surface transitions could have broader applications in algorithmic 3-manifold topology.

Summary updated

Abstract

We give an upper bound for the number of compact essential orientable non-isotopic surfaces, with Euler characteristic at least some constant $χ$, properly embedded in a finite-volume hyperbolic 3-manifold $M$, closed or cusped. This bound is a polynomial function of the volume of $M$, with degree that depends linearly on $|χ|$.
BibTeX
@misc{lackenby2026polynomially,
  author = {Marc Lackenby and Anastasiia Tsvietkova},
  title = {{Polynomially many surfaces of fixed Euler characteristic in a hyperbolic 3-manifold}},
  year = {2026},
  eprint = {2603.03716},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2603.03716},
}
Figure