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 infinite hyperbolic groups have infinite order elements

Statement

Every infinite finitely generated hyperbolic group contains an element of infinite order. More generally this holds for any infinite finitely generated group with finitely many geodesic cone types.

Facts & Assumptions

Given: An infinite group with a specified finite generating set; use its word length .

[F1]

Its cone is C(g)={h:gh=g+h}. Hyperbolicity gives finitely many such cones by Hg toolkit finitely many cayley cone types.

[F2]

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

Proof

1.1

Let k be the positive finite number of cone types. The group is not contained in its finite closed radius-k set, by F2 and infinitude. Choose g with g=m>k and a shortest word path e=g0,g1,,gm=g. Prefixes of a shortest word are shortest, so gi=i and gi1gj=ji for i<j; shortening either prefix or intervening subword would shorten the whole word. Among the m+1 cone types of these vertices, two are equal. Fix i<j with C(gi)=C(gj), and put h=gi1gj, l=ji>0. Then h=l and gih=i+l.

F1F2given
2.1

We prove by induction that hn=nl and gihn=i+nl for every integer n0. For n=0 this is the identity, and for n=1 it is step 1.1. Suppose the assertion holds for n. Then hnC(gi)=C(gih), so gihn+1=gih+hn=i+(n+1)l. The inequalities gihn+1i+hn+1i+(n+1)l force hn+1=(n+1)l. This completes the induction.

step 1.1F1algebra
3.1

For every n>0, step 2.1 gives hn=nl>0, hence hne. Thus h has infinite order. In the hyperbolic case F1 supplies the required finite cone hypothesis, proving the first assertion. The proof uses only a single long word and finitely many cone comparisons, not an infinite ray selection or AC.

step 2.1F1given

Depends on

Used by

Dependency tree · two levels

13 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