Alphabeta Math
CorollaryStatement: 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.

Abelian subgroups of hyperbolic groups are virtually cyclic

Statement

Every abelian subgroup of a hyperbolic group contains a cyclic subgroup of finite index.

Facts & Assumptions

Given: An abelian subgroup A of a hyperbolic group G.

[L2]

The orders of finite subgroups of G have a common finite bound B (Finite subgroups of a hyperbolic group have uniformly bounded order).

[L1]

Centralizers of infinite-order elements are virtually cyclic (The centralizer of an infinite-order element in a hyperbolic group is virtually cyclic).

Proof

technique · direct
1.1givenL1

If A contains an element g of infinite order, then A⊆CG(g). By [L1], the cyclic subgroup ⟨g⟩ has finite index in CG(g). Thus A∩⟨g⟩ has finite index in A and is cyclic as a subgroup of ⟨g⟩. Hence A is virtually cyclic.

2.1L2step 1.1given∎

If every element of A has finite order, each finitely generated subgroup of A is finite: for generators of orders n1,…,nk, commutativity makes it a quotient of the finite group ∏iZ/niZ. By [L2] it has at most B elements. Were A to contain B+1 distinct elements, their finitely generated subgroup would contradict this bound. So A is finite, hence virtually cyclic. The two cases prove the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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