--- title: Projection Complexes in Hyperbolic Geometry url: https://www.emergentmind.com/topics/projection-complexes type: topic --- # Projection Complexes in Hyperbolic Geometry Projection complexes are graph-theoretic and metric constructions built from a family of spaces or domains equipped with coarse projection data. In the Bestvina–Bromberg–Fujiwara framework, and in later formulations by Bestvina–Bromberg–Fujiwara–Sisto and subsequent authors, the guiding idea is that large projection to a third domain records a “between-ness” relation, and a graph obtained by excluding such large intermediaries becomes a quasi-tree. This converts projection data into a hyperbolic large-scale model that supports geometric, dynamical, and algebraic applications, including actions of mapping class groups, \(\mathrm{Out}(F_n)\), hierarchically hyperbolic groups, and, in a finiteness-free variant, \(\Homeo_0(S_g)\) [1711.08722]. ## 1. Formal definition and axiomatic structure A standard starting point is an indexing set \(\mathbf Y\) or \(\mathcal Y\), together with projection data. In one formulation, for each \(Y\in \mathbf Y\) there is a function \[ d_Y\colon \mathbf Y^2\setminus \{(Y,Y)\}\to [0,\infty] \] satisfying the strong projection axioms: symmetry, triangle inequality, a sharpened Behrstock-type axiom, bounded self-distance, and finiteness of the large-projection set [1711.08722]. In the BBFS formulation, one begins with geodesic metric spaces \((Y)\) and projection maps \[ \pi_Y : \mathcal Y\setminus\{Y\}\to \{\text{non-empty subsets of }(Y)\}, \] with projection distance \[ d_Y^\pi(X,Z)=\operatorname{diam}\bigl(\pi_Y(X)\cup \pi_Y(Z)\bigr), \] subject to projection axioms \((P3)\), \((P4)\), and \((P5)\), and then replaces them by modified projections satisfying the strong projection axioms with constant \(\theta=11\xi\) and \[ d_Y^\pi -2\xi \le d_Y \le d_Y^\pi +2\xi \] [2404.02730]. For \(K\ge 2\theta\), the large-projection set is \[ \mathbf Y_K(X,Z)=\{\,Y\in\mathbf Y\setminus\{X,Z\}\mid d_Y(X,Z)>K\,\}, \] or, in equivalent BBFS notation, \[ \mathcal K(X,Z)=\{Y\in\mathcal Y:d_Y(X,Z)>K\},\qquad \mathcal K[X,Z]=\mathcal K(X,Z)\cup\{X,Z\}. \] The projection complex \(\mathcal P_K(\mathbf Y)\), or \(P\), is the graph with vertex set \(\mathbf Y\) or \(\mathcal Y\), where \(X\neq Z\) are adjacent precisely when the corresponding large-projection set is empty [1711.08722; 2404.02730]. A decisive combinatorial feature is ordering. For \(K\ge 2\theta\), the set of large intermediaries between \(X\) and \(Z\) is totally ordered; in BBFS notation, \[ \mathcal K[X,Z]=\{X=X_0\theta \implies d_Z(X,W)=d_Z(Y,W)\quad \forall\,W\neq Z. \] This exactness simplifies ordering arguments and the analysis of standard paths by preventing accumulation of error terms [1711.08722]. A later refinement shows that the quasi-tree geometry can be realized by literal trees. Fix a base vertex \(B\in\mathcal Y\), and define \[ T:=\mathcal K(\mathcal Y,B)=\bigcup_{X\in\mathcal Y}\mathcal K[B,X]. \] This subgraph \(T\subseteq P\) is a tree, and the inclusion \(T\hookrightarrow P\) is a quasiisometry. The proof uses the subpath property for standard paths and the tripod-like behavior of the three paths \(\mathcal K[X,Y]\), \(\mathcal K[Y,Z]\), and \(\mathcal K[X,Z]\). A concrete coarse lower bound obtained in the argument is \[ d_P(X,Z)\ge \frac12\bigl(d_T(X,Z)-5\bigr) \] [2404.02730]. The same simplification extends from the projection complex to the quasi-tree of metric spaces. In the original construction, one takes the disjoint union of the spaces \((Y)\) and adds transverse edges of length \(K\) between projection sets for adjacent vertices of \(P\). The resulting space \(C\) satisfies a distance formula, valid for \(K\ge 4\theta\), \[ \frac14 \sum_{Y\in \mathcal{K}(x,z)} d_Y(x,z)\le d_C(x,z)\le 2\sum_{Y\in \mathcal{K}(x,z)} d_Y(x,z)+3K. \] Keeping only the transverse edges corresponding to the tree \(T\) produces a tree of metric spaces \(\widetilde C\subseteq C\), and the inclusion \(\widetilde C\hookrightarrow C\) is a quasiisometry [2404.02730]. ## 3. Fine and finiteness-free variants The classical BBF framework assumes a finiteness axiom and a Behrstock inequality adapted to discrete domain systems. For \(\Homeo_0(S)\) acting on collections of actual subsurfaces, these hypotheses can fail in two distinct ways: the Behrstock inequality fails in general for arbitrary subsurfaces if one uses the naive collection, and the finiteness axiom \((P2)\) fails badly because there are uncountably many small perturbations of a subsurface with the same large projection behavior [2604.12974]. The finiteness-free response is the fine projection complex. Here the vertices are actual subsurfaces, not isotopy classes, and finiteness is replaced by control modulo a new equivalence relation called velcrotness. For two non-sporadic essential subsurfaces \(X,Y\subset S\), \[ X \text{ and } Y \text{ are velcrot if } C^\dagger(X)\cap C^\dagger(Y) \] has infinite diameter in both \(C^\dagger(X)\) and \(C^\dagger(Y)\). Equivalently, \(X\) and \(Y\) are velcrot iff there exists an essential subsurface \[ Z\subset X\cap Y \] such that \(Z\) is homotopic to both \(X\) and \(Y\) [2604.12974]. The subsurface projection is defined by \[ \pi_Y : \mathcal C^\dagger(S)\to \mathcal P(\mathcal C^\dagger(Y)), \] with the usual cases depending on whether a curve is contained in \(Y\), misses \(Y\) essentially, or intersects it essentially. The projection diameter is coarsely bounded: \[ \operatorname{diam}_{d_Y^\dagger}(\pi_Y(\alpha))\le 12. \] The coarse projection distance is \[ d^\pi_X(\alpha,\beta)\coloneqq \operatorname{diam}_{C^\dagger(X)}\big(\pi_X(\alpha)\cup \pi_X(\beta)\big), \] and for subsurfaces, \[ d^\pi_X(Y,Z)\coloneqq \inf\{d^\pi_X(\alpha,\beta): \alpha\subset\partial Y,\ \beta\subset\partial Z\}. \] A triangle inequality holds: \[ d^\pi_X(Y,Z)\le d^\pi_X(Y,Z')+d^\pi_X(Z',Z). \] The fine Behrstock inequality states that there exists \(M>0\) such that for three essential subsurfaces \(X_1,X_2,X_3\) that pairwise intersect essentially, and where each pair is either overlapping or isotopic, if \[ d^\pi_{X_1}(X_2,X_3)>M, \] then \[ d^\pi_{X_2}(X_1,X_3),\ d^\pi_{X_3}(X_1,X_2)K\}. \] This \(P\) is a quasi-tree by the bottleneck criterion, and in the surface setting discussed below it is unbounded [2604.12974]. ## 4. Projection complexes in major applications Projection complexes were designed to package projection phenomena already visible in the work of Masur–Minsky on subsurface projections, and they supply a large-scale tree-like model that is used for infinite-dimensional spaces of quasi-morphisms, positive stable commutator length, and asymptotic dimension results [2604.12974]. In free-group geometry, subfactor projections provide the analogue of subsurface projections for free factors of \(F_n\). For free factors \(A\) and \(B\) in suitable general position, one defines \(\pi_A(B)\subset \mathcal S(A)\), where \(\mathcal S(A)\) is the splitting complex of \(A\). The projections are well defined up to bounded diameter when \(A\) and \(B\) have the same color or when \(d_{\mathcal S_n}(A,B)>4\). The resulting distances \[ d_A(B,C)=\operatorname{diam}_{\mathcal S(A)}\bigl(\pi_A(B)\cup \pi_A(C)\bigr) \] satisfy a Behrstock-type principle and a finite large-projection property, which is enough to invoke the BBF theorem. Applying the construction color by color yields hyperbolic spaces \(Y_i\) and a product \[ Y = Y_1\times\cdots\times Y_k \] on which \(\mathrm{Out}(F_n)\) acts isometrically. Theorem 5.1 in that work states that every exponentially growing automorphism acts on this product with positive translation length [1211.1730]. For hierarchically hyperbolic groups, a BBF coloring \[ \mathfrak S=\bigsqcup_{i=1}^\chi \mathfrak S_i \] partitions the domains into finitely many \(G\)-invariant families of pairwise transverse domains. Each color class yields a BBF hyperbolic space \(\mathcal C\mathfrak S_i\), and there is an equivariant quasimedian quasiisometric embedding \[ \Psi:G\to \prod_{i=1}^\chi \mathcal C\mathfrak S_i. \] If each domain hyperbolic space \(\mathcal C U\) is quasiisometric to a tree, then the group is quasiisometric to a finite-dimensional CAT(0) cube complex. The same framework yields the Helly property for hierarchically quasiconvex subsets and bounded packing consequences [2108.13232]. ## 5. Acylindricity, quotients, and dynamical robustness Projection complexes are also a natural setting for acylindricity. If a group \(G\) acts on \(\mathbf Y\) preserving the projection distances, then it acts by isometries on \(\mathcal P_K(\mathbf Y)\). When \(K\ge 3\theta\) and there exist \(N,B\) such that the common stabilizer of any \(N\) distinct elements of \(\mathbf Y\) has cardinality at most \(B\), the action \[ G\curvearrowright \mathcal P_K(\mathbf Y) \] is acylindrical. There is a parallel criterion for the quasi-tree of metric spaces: if \(K\ge 4\theta\), each stabilizer acts acylindrically on its vertex space with uniform constants, and the same common-stabilizer bound holds, then the action on the quasi-tree of metric spaces is acylindrical [1711.08722]. Quotient constructions show that this geometry is robust under certain normal closures. Given a projection complex \(P\) with a \(G\)-action, choose subgroups \[ R_v \le \mathrm{Stab}_G(v) \] forming an equivariant \(L\)-spinning family, so that \[ d_v(w,hw)\ge L \] for every distinct \(v,w\) and every nontrivial \(h\in R_v\). Let \[ H=\langle R_v\mid v\in V(P)\rangle. \] For \(L\) large enough, \(H\) is a free product of conjugates of the \(R_v\). More significantly, the quotient graph \(P/H\) is \(\delta\)-hyperbolic, proved by lifting geodesic quadrilaterals from \(P/H\) to geodesic quadrilaterals in \(P\) and using a shortening argument based on pivot points and windmills [2005.14232]. The quotient action preserves non-elementary WPD behavior under suitable hypotheses. If \(G\) acts on \(P\) with a non-elementary WPD action, then for sufficiently large \(L\) the induced action of \(G/H\) on \(P/H\) is again a non-elementary WPD action. By Osin’s criterion, it follows that \[ G/H \text{ is acylindrically hyperbolic.} \] This shows that projection-complex geometry survives large-spin quotients both geometrically and dynamically [2005.14232]. ## 6. Surface homeomorphisms and current structural perspective The surface case for \(\Homeo_0(S_g)\), \(g\ge 2\), illustrates both the necessity of refined axioms and the strength of the resulting machinery. Let \(Y\) be a \(\Homeo_0(S_g)\)-invariant collection of essential subsurfaces that are pairwise overlapping or isotopic, and either non-sporadic or homeomorphic to a once-bordered torus. The fine projection complex \(P\) built from \(Y\) is an unbounded quasi-tree [2604.12974]. Equivariance is expressed by \[ d^\pi_{g(Y)}(g(X),g(Z))=d^\pi_Y(X,Z), \] so \(\Homeo_0(S_g)\) acts by isometries on \(P\). If \(Y\) is taken from finitely many isotopy classes, each orbit is finite, and the action is cobounded. This yields cobounded isometric actions of \(\Homeo_0(S_g)\) on unbounded quasi-trees [2604.12974]. The same construction feeds into stable commutator length. For every essential subsurface \(\Sigma\subset S_g\) that is either non-sporadic or a once-bordered torus, there exists \(g\in \Homeo_0(S_g)\) with \(g(\Sigma)=\Sigma\) and \[ \operatorname{scl}_{\Homeo_0(S_g)}(g)>0. \] A plausible implication is that projection-complex methods remain effective even when the acting group is much less discrete than a mapping class group, provided the projection theory is adjusted to absorb perturbational ambiguity through a relation such as velcrotness [2604.12974]. A recurrent misconception is that projection complexes must be literal trees, or that their vertices must be isotopy classes or similarly discrete objects. The recent literature shows that both assumptions are too rigid. On one side, an explicit subtree \(T\subseteq P\) can be quasiisometric to the full projection complex, so the quasi-tree structure can often be replaced by an actual tree without changing the large-scale metric type [2404.02730]. On the other side, the fine theory demonstrates that vertices can be actual subsurfaces, with finiteness replaced by finite control up to velcrot classes, while still producing unbounded quasi-trees and nontrivial scl phenomena [2604.12974]. Across these developments, projection complexes function less as a single rigid construction than as a scheme for turning projection data into hyperbolic or quasi-tree geometry. The enduring features are the organization of large projections into ordered intermediaries, the use of standard paths and bottleneck arguments, and the persistence of coarse tree-like behavior under simplification, coloring, quotienting, and finiteness-free adaptation [1711.08722; 2404.02730]. Source: https://www.emergentmind.com/topics/projection-complexes