---
title: Coned-off Cayley Graphs in Small Cancellation
url: https://www.emergentmind.com/topics/coned-off-cayley-graphs
type: topic
---

# Coned-off Cayley Graphs in Small Cancellation

Searching arXiv for the cited paper and closely related work on coned-off Cayley graphs in graphical small cancellation.
First, I’ll look up the main paper by arXiv id 2509.05548.
Coned-off Cayley graphs are hyperbolic models attached to groups whose ordinary Cayley graphs retain large non-hyperbolic substructures. In the setting of graphical small cancellation, the coned-off Cayley graph is not an auxiliary construction but the central geometric object: starting from a graphical presentation \(G(\Gamma)\), one enlarges the generating set so that entire embedded relators become uniformly bounded in diameter, producing a graph \(Y\) whose Gromov boundary \(\partial Y\) supports the boundary action studied in "Graphical small cancellation and hyperfiniteness of boundary actions" [2509.05548]. In that framework, the coned-off graph packages the geometry of relator traversal, provides the hyperbolic boundary, and supplies the combinatorial structure used to prove that the induced orbit equivalence relation on \(\partial Y\) is hyperfinite for a class of graphical \(C'(1/10)\) groups including infinitely presented classical small cancellation groups [2509.05548].

## 1. Definition from graphical small cancellation presentations

The construction begins with a set \(S\) and an \(S\)-labeled graph \(\Gamma\), where labels lie in \(S \coprod S^{-1}\), compatibly with edge orientation. The associated graphical presentation is
\[
G(\Gamma)=\langle S \mid \ell(\gamma) : \text{\(\gamma\) is a simple closed path in \(\Gamma\)}\rangle.
\]
A path \(p\subset \Gamma\) is a piece if there is another path \(q\subset \Gamma\) with \(\ell(p)=\ell(q)\) but no label-preserving graph automorphism of \(\Gamma\) sends \(p\) to \(q\). The graph satisfies the graphical \(C'(\lambda)\) condition if no two edges with the same initial vertex have the same label and every piece \(p\) in a component \(\Gamma_i\) satisfies
\[
|p|<\lambda\,\mathrm{girth}(\Gamma_i).
\]
These notions are the small-cancellation input from which the coned-off geometry is defined [2509.05548].

For \(C'(1/6)\) graphical small cancellation groups, each connected component \(\Gamma_i\) embeds isometrically and convexly into the ordinary Cayley graph
\[
X:=\mathrm{Cay}(G,S),
\]
and these embedded copies are called relators in \(X\). A simple closed path in \(X\) contained in a relator is called a contour. The coned-off construction is built from this embedded-relator picture rather than from peripheral cosets or additional apex vertices [2509.05548].

The paper defines
\[
W=\{g\in G : g =_G \ell(p)\text{ for some path }p\subset \Gamma\},
\]
and then sets
\[
Y:=\mathrm{Cay}(G,S\cup W).
\]
This is called the coned-off graph of \(G\) [2509.05548]. The additional generators are therefore exactly the group elements represented by labels of arbitrary paths in the defining graph \(\Gamma\). Geometrically, whenever two vertices of \(X\) lie in a common embedded relator, the path between them inside that relator determines an element of \(W\), so they become adjacent in \(Y\). The paper states that one may think of \(Y\) as obtained from \(X\) by replacing every relator \(\Theta\) in \(X\) by the complete subgraph on its vertices; this yields the same metric space as \(\mathrm{Cay}(G,S\cup W)\) [2509.05548].

This model differs from the more standard relative-hyperbolic coned-off graph. In the latter, one typically adds a cone-vertex for each left coset of a peripheral subgroup. Here, by contrast, one “cones off” each embedded relator by turning its vertex set into a clique. The philosophy is analogous—collapse large non-hyperbolic pieces to expose a hyperbolic large-scale structure—but the mechanism is specific to graphical small cancellation [2509.05548].

## 2. Hyperbolicity and the relator-crossing metric

A central fact is that the coned-off Cayley graph \(Y\) is hyperbolic. The paper states that, by a theorem of Gruber–Sisto, for \(C'(1/6)\) graphical small cancellation groups, the coned-off Cayley graph \(Y\) is always hyperbolic; the main theorem assumes the stronger hypothesis \(C'(1/10)\), but hyperbolicity already follows at the \(C'(1/6)\) level [2509.05548]. Thus the coned-off graph provides the hyperbolic space whose boundary is later studied.

The geometry of \(Y\) is encoded through the way geodesics in \(X\) pass through relators. The paper summarizes this by saying that the metric \(d_Y\) “counts how many relators any geodesic in \(X\) between two given points passes through” [2509.05548]. More precisely, if \(x\neq y\) are vertices in \(X\), \(\gamma\) is a geodesic in \(X\) from \(x\) to \(y\), and \(k=d_Y(x,y)\), then \(k\) is the minimal number such that
\[
\gamma=\gamma_1\cdots \gamma_k,
\]
where each \(\gamma_i\) is either a path in some relator in \(X\) or an edge in \(X\) not occurring on any relator [2509.05548].

This decomposition gives the correct combinatorial model for \(Y\)-geodesics. A geodesic in the coned-off metric is not primarily measuring ordinary word length in \(S\); instead, it records passage through a sequence of relators or isolated non-relator edges. A plausible implication is that \(Y\) suppresses internal geometry within relators while preserving the large-scale combinatorics of how relators intersect and how paths move from one relator to another. That is precisely the feature needed to recover a hyperbolic “skeleton” from a non-hyperbolic ambient Cayley graph.

The paper emphasizes that \(Y\) is connected and geodesic because it is a Cayley graph, and that it need not be locally finite, since adding all of \(W\) can create infinitely many edges at a vertex [2509.05548]. Accordingly, the analysis does not rely on local finiteness of \(Y\). Instead, it uses geodesic rays in the locally finite graph \(X=\mathrm{Cay}(G,S)\) while measuring escape to infinity using the coned-off metric \(d_Y\). That methodological shift is one of the paper’s defining features [2509.05548].

## 3. Boundary theory for the coned-off graph

The boundary under study is the Gromov boundary of \(Y\). For a hyperbolic metric space \(S\), the Gromov product is
\[
(x,y)_z=\frac12\bigl(d_S(x,z)+d_S(y,z)-d_S(x,y)\bigr).
\]
A sequence \((x_n)\) converges to infinity if \((x_i,x_j)_o\to\infty\), and \(\partial S\) is the space of such sequences modulo the equivalence relation \(\sim\) defined by \((x_i,y_j)_o\to\infty\). The paper applies this sequential definition to \(S=Y\) [2509.05548].

Because \(Y\) is hyperbolic and has countable vertex set, its boundary \(\partial Y\) is Polish; the paper attributes this to Oyakawa’s lemma on countable hyperbolic graphs [2509.05548]. The group acts on \(Y\) by left multiplication, since \(Y\) is a Cayley graph of \(G\) with generating set \(S\cup W\). This action preserves graph distance and therefore induces an isometric action on \(\partial Y\) [2509.05548]. The dynamical object of interest is exactly this boundary action
\[
G\curvearrowright \partial Y.
\]

A key issue is that a geodesic ray in the ordinary Cayley graph \(X\) need not determine a point of \(\partial Y\). The paper introduces \(G(\xi)\), the set of geodesic rays in \(X\) based at \(1\) that represent \(\xi\in\partial Y\), and proves that \(G(\xi)\neq\emptyset\) for every \(\xi\) [2509.05548]. More precisely, for a geodesic ray \(p\) in \(X\), the following are equivalent:

1. there exists \(\xi\in\partial Y\) such that \(p(n)\to \xi\);
2. \(\sup_n d_Y(p(0),p(n))=\infty\);
3. there are vertices \(a_n\) on \(p\) such that each segment \(p_{[a_{n-1},a_n]}\) either lies in a relator or is a non-relator edge, and \((a_n)\) is a geodesic ray in \(Y\) [2509.05548].

This equivalence identifies the coned-off metric as the correct notion of escape to infinity. A ray in \(X\) defines a boundary point of \(Y\) precisely when it makes unbounded progress after relators have been collapsed. The paper further proves that the geodesic and sequential boundaries coincide,
\[
\partial_g Y \cong \partial Y,
\]
which permits boundary points to be coded by geodesic rays [2509.05548].

## 4. Geodesic bundles and the internal structure of \(\partial Y\)

The proof theory surrounding the coned-off graph depends on a detailed analysis of geodesic bundles \(G(\xi)\). The existence of \(X\)-geodesic representatives for boundary points is obtained by combining hyperbolicity of \(Y\) with Strebel’s classification of geodesic bigons and triangles in small cancellation Cayley graphs [2509.05548]. Starting from a sequence \(x_n\to\xi\) in \(Y\), one considers \(X\)-geodesics from \(1\) to \(x_n\) and proves that, for each coned-off distance level \(n\), the set of vertices on those geodesics with \(d_Y(1,v)=n\) is finite. The finiteness arises from the fact that hyperbolicity in \(Y\) constrains those vertices to lie either on a fixed reference geodesic or on contours common to two geodesics, while small cancellation bounds where such contours can occur [2509.05548].

Once geodesic representatives are available, the paper derives a strong fellow-travel property. If \(p,q\in G(\xi)\), then they can be decomposed into alternating common subsegments and contour-bounded bigons [2509.05548]. More precisely, there are vertex sequences \((v_i)\) on \(p\) and \((w_i)\) on \(q\) such that each corresponding pair of segments either coincides or, together with two short connecting paths, bounds a contour. Moreover, once a decomposition of \(p\) into \(Y\)-edges via relators \(\Theta_n\) is fixed, every other \(q\in G(\xi)\) lies in \(\bigcup_n \Theta_n\) and intersects every \(\Theta_n\) [2509.05548].

This is a rigid visibility statement for geodesic bundles in the coned-off geometry. A plausible implication is that the relator-chain associated to one representative ray largely determines the geometry of all representatives of the same boundary point. Such rigidity substitutes for more classical bounded-ray-bundle properties familiar from hyperbolic groups and buildings, but the substitute is formulated entirely in terms of relators and contours rather than ambient local finiteness [2509.05548].

The paper then encodes each ray by its label sequence
\[
\mathrm{lab}(p)=\bigl(p(n-1)^{-1}p(n)\bigr)_{n\in\mathbb N}\in S^{\mathbb N}.
\]
Since \(S\) is finite and discrete, \(S^{\mathbb N}\) is compact metrizable. The bundle \(G(\xi)\subset S^{\mathbb N}\) is compact because, for each coned-off distance level \(n\), all vertices on all rays in \(G(\xi)\) at level \(n\) lie in the finite union \(\Theta_{n-1}\cup \Theta_n\cup \Theta_{n+1}\) [2509.05548]. This compactness implies that \(G(\xi)\) has a lexicographically least element after fixing an order on \(S\).

## 5. Coding boundary points and hyperfinite boundary actions

The lexicographically least representative yields a coding map
\[
\Phi:\partial Y\to S^{\mathbb N},\qquad \Phi(\xi)=\sigma_\xi,
\]
where \(\sigma_\xi\) is the label of the lexicographically least geodesic ray in \(G(\xi)\) [2509.05548]. The set
\[
A=\{(\xi,p)\in \partial Y\times S^{\mathbb N}: p\in G(\xi)\}
\]
is shown to be closed, and from this the map \(\Phi\) is proved Borel and injective [2509.05548]. The boundary is therefore embedded into the shift space \(S^{\mathbb N}\) through a coding that is built directly from coned-off geodesic geometry.

The dynamical argument then compares the orbit equivalence relation \(E_G\) on \(\partial Y\) with tail equivalence on \(S^{\mathbb N}\). Let \(E_t\) denote tail equivalence on \(\Omega^{\mathbb N}\), defined by
\[
(w_0,w_1)\in E_t(\Omega) \iff \exists n, \exists m \in\mathbb N\cup\{0\}\ {\rm s.t.}\ \forall i\in\mathbb N,\ s_{n+i}=t_{m+i}.
\]
The paper pulls this back along \(\Phi\) to obtain
\[
R_t'=\Phi^{-1}(E_t),
\]
and then defines
\[
R_t=E_G\cap R_t'.
\]
Since \(E_t\) is hyperfinite, \(R_t\) is hyperfinite as well [2509.05548].

The decisive remaining step is a finite-index statement. Under the hypothesis that \(\Gamma\) is extremely fine—meaning that there exists \(K\in\mathbb N\) such that every edge of \(\Gamma\) lies in at most \(K\) simple closed paths—the paper proves that there exists \(K>0\) such that each \(E_G\)-class in \(\partial Y\) contains at most \(K\) \(R_t\)-classes [2509.05548]. The proof is explicitly relator-by-relator. One fixes a geodesic ray \(p=\alpha_0\in G(\xi_0)\) and its associated sequence of relators \(\Theta_n\); any translated lexicographically least representative of an orbit-equivalent boundary point eventually lives in the same chain of relators. Extreme fineness bounds the number of possible entry points into each \(\Theta_n\), because a ray can enter either along \(p\) or through the last contour in \(\Theta_{n-1}\) that it traverses, and extreme fineness bounds the number of such contours through a chosen edge [2509.05548]. A pigeonhole argument at two far-apart relators then forces two rays to share the same entry points, and because both are lexicographically least, the intervening segment must coincide; their labels are therefore tail equivalent [2509.05548].

From the finite bound on the number of tail classes per orbit, the paper concludes hyperfiniteness of the boundary action using a proposition of Jackson–Kechris–Louveau [2509.05548]. The main theorem states:

\[
\textit{Let }G\text{ be a group defined by a graphical }C'(1/10)\text{ presentation }\langle S\mid \Theta\rangle
\]
with \(S\) finite, \(\Theta\) having countably many finite connected components, and \(\Theta\) extremely fine. Let \(Y\) denote the associated coned-off Cayley graph. Then
\[
G\curvearrowright \partial Y
\]
is hyperfinite [2509.05548].

## 6. Classical small cancellation as a special case

The paper emphasizes that classical small cancellation groups are exactly the special case in which each connected component of \(\Gamma\) is a cycle [2509.05548]. In that situation, the relators in \(X\) are embedded cycles corresponding to relator words, and coning them off means turning each such cycle into a complete graph on its vertices. Equivalently, \(W\) consists of all group elements represented by subwords of cyclic conjugates of defining relators, and
\[
Y=\mathrm{Cay}(G,S\cup W).
\]
This makes the clique-cone model especially concrete in the classical setting [2509.05548].

Extreme fineness is automatic in this case because each edge lies in a unique simple closed path; accordingly, one has \(K=1\) [2509.05548]. The main theorem therefore applies directly to infinitely presented classical \(C'(1/10)\) groups with finite generating set and finite relators. The paper explicitly includes “classical small cancellation groups” among the groups covered by the result [2509.05548].

This specialization clarifies the geometric meaning of the construction. In the ordinary Cayley graph, a long traversal around a relator cycle has large \(X\)-length. In the coned-off graph, that same traversal has uniformly bounded cost because the cycle has been replaced by a clique. The paper’s general graphical framework extends this intuition from cycles to arbitrary finite connected labeled graphs satisfying graphical small cancellation [2509.05548].

## 7. Conceptual significance and relation to other cone-off constructions

Within the broader literature on coned-off Cayley graphs, the construction in this work is notable for being both presentation-sensitive and genuinely Cayley-theoretic. The graph \(Y\) is still a Cayley graph of the same group, but for the enlarged generating set \(S\cup W\), and \(W\) is canonically determined by the path-labels in the chosen defining graph \(\Gamma\) [2509.05548]. The paper does not vary the presentation, so the action studied is always the one arising from the specified graphical presentation.

The contrast with relative hyperbolicity is explicit. Standard coned-off graphs for relatively hyperbolic groups add cone-vertices for peripheral cosets; here, one instead replaces each embedded relator by a complete subgraph on its vertex set [2509.05548]. What is general is the strategy of collapsing large non-hyperbolic pieces. What is specific in this context is the small-cancellation control over relator intersections, the geodesic decomposition by relators and isolated non-relator edges, the existence and compactness of the bundles \(G(\xi)\), and the extreme-fineness argument bounding the number of coding classes in each orbit [2509.05548].

The paper identifies four roles of the coned-off Cayley graph in the proof strategy: it supplies the hyperbolic space whose boundary is studied; its metric defines the correct notion of progress to infinity for rays in the ordinary Cayley graph; its geodesic decomposition by relators creates the combinatorial framework for coding boundary points; and its relator-by-relator structure enables the finite-entry-point argument under extreme fineness [2509.05548]. Taken together, these roles show that coned-off Cayley graphs in graphical small cancellation are not merely technical devices for importing hyperbolic methods. They are the primary geometric models through which the boundary, the dynamics, and the hyperfiniteness theorem are simultaneously formulated.

Source: https://www.emergentmind.com/topics/coned-off-cayley-graphs