Non-realizability and ending laminations: Proof of the density conjecture
Bibliographic record
Abstract
We give a complete proof of the Bers–Sullivan–Thurston density conjecture. In the light of the ending lamination theorem, it suffices to prove that any collection of possible ending invariants is realized by some algebraic limit of geometrically finite hyperbolic manifolds. The ending invariants are either Riemann surfaces or filling laminations supporting Masur domain measured laminations and satisfying some mild additional conditions. With any set of ending invariants we associate a sequence of geometrically finite hyperbolic manifolds and prove that this sequence has a convergent subsequence. We derive the necessary compactness theorem combining the Rips machine with non-existence results for certain small actions on real trees of free products of surface groups and free groups. We prove then that the obtained algebraic limit has the desired conformal boundaries and the property that none of the filling laminations is realized by a pleated surface. In order to be able to apply the ending lamination theorem, we have to prove that this algebraic limit has the desired topological type and that these non-realized laminations are ending laminations. That this is the case is the main novel technical result of this paper. Loosely speaking, we show that a filling Masur domain lamination which is not realized is an ending lamination.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".