Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)
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.

The centralizer of an infinite-order element in a hyperbolic group is virtually cyclic

Statement

Let G be a hyperbolic group and let g∈G have infinite order. Then its centralizer

CG(g)={h∈G:hg=gh}

contains a cyclic subgroup of finite index.

Facts & Assumptions

Given: A hyperbolic group G and an infinite-order element g∈G.

[L1]

Infinite-order elements are undistorted (Infinite-order elements of hyperbolic groups are undistorted).

[L2]

In a finitely generated δ-slim hyperbolic group, if an infinite-order element has a power orbit with quasi-isometry constants λ,c, then its centralizer contains its cyclic subgroup with finite index; each coset has a representative in a ball whose radius depends only on δ,λ,c (Axis fellow travelling controls the centralizer).

Proof

technique · direct
1.1L1given

The standing hyperbolic-group convention supplies a finite generating set whose geodesic Cayley realization is δ-slim. By [L1], the power orbit of g is quasi-isometrically embedded; fix its constants λ,c. The hypotheses of [L2] are therefore met.

2.1L2step 1.1∎

Apply [L2]. It gives finitely many cosets of ⟨g⟩ in CG(g), with a representative of each in one finite word ball. Thus ⟨g⟩ is a cyclic subgroup of finite index in the centralizer, as claimed.

Depends on

Used by

Dependency tree · two levels

18 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