Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Hg toolkit finitely many cayley cone types

Statement

For a finite generating set S of a hyperbolic group, there are only finitely many geodesic cone types C(g)={hG:ghS=gS+hS}. More precisely, with a slimness constant δ0, set r=max{1,12δ}. The finite-set datum Pr(g)={h:hSr, ghSgS} determines C(g), so at most 2{h:hSr} cone types occur.

Facts & Assumptions

Given: The standing finite-generator geometric hyperbolicity convention of Hg toolkit hyperbolic group and stable length; write x=xS.

[F1]

Finite generating sets have finite word-metric balls by Balls of a word metric are finite if and only if the generating set is finite.

[F2]

The product condition holds with κ=3δ by Slim triangles imply the gromov product inequality.

Proof

1.1

We first derive the radial bound needed below. For specified geodesics [o,x],[o,y], suppose 0t(xy)o, and let xt,yt be their radius-t points. They exist since products do not exceed either radial length. We have (xtx)o=t and (yyt)o=t. Apply F2 through the chain xt,x,y,yt: two product inequalities give (xtyt)ot2κ. Hence d(xt,yt)=2t2(xtyt)o4κ=12δ. This calculation includes t=0 and δ=0.

F2givenalgebra
1.2

Fix g,g with Pr(g)=Pr(g). The identity lies in both cones. If h=1 and hC(g), then hPr(g) and hence hPr(g). Thus gh>g, while ghg+1. Integral word lengths force equality, proving hC(g).

givenalgebra
2.1

Induct on l=h2, assuming cone membership transfers for shorter elements. If hC(g), take a shortest spelling h=hs with h=l1 and s=1. The inequalities g+l=ghgh+1g+l force hC(g); hence gh=g+l1 by induction. Suppose for a contradiction that hC(g). Writing A=g, the endpoint gh has length between A+l2 and A+l1, by its distance 1 from gh and the failed cone equality. In particular its length is at least A.

step 1.2givenalgebra
3.1

Choose the geodesic from e through g to gh provided by the equality in step 2.1, and any geodesic from e to gh. Their endpoints have distance 1 and product at least ((A+l1)+(A+l2)1)/2=A+l2A. Let k1 be the vertex at radius A on the second geodesic, and put k2=k11gh. The vertex exists because its length is at least A. Step 1.1 gives g1k1=d(g,k1)12δr. Also k1=A and k2=ghAl1. Set v=g1k1. Then vPr(g)=Pr(g), so gvg.

step 1.1step 2.1givenalgebra
4.1

Since h=vk2, we obtain g+l=ghgv+k2g+l1, a contradiction. This proves C(g)C(g) by induction. Interchanging g,g proves equality. The finite-radius set in the statement is finite by F1 (it is contained in the open radius-r+1 ball), so has finitely many subsets, at most 2 to its cardinality. Each possible Pr(g) determines just one cone, establishing finiteness and the stated count. Only finitely many geodesics are chosen for each specified inductive comparison; no AC is used.

step 3.1F1algebra

Depends on

Used by

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources