Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-24 (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.

Non-elementary hyperbolic groups contain a rank-two free subgroup

Statement

Every non-elementary hyperbolic group contains a free subgroup of rank 2.

Facts & Assumptions

Given: A non-elementary hyperbolic group G.

[A1]

Every non-elementary hyperbolic group contains independent infinite-order elements g,h with pairwise disjoint attracting and repelling neighborhoods Ug+,Ug−,Uh+,Uh−. Their boundary actions have north--south dynamics: for all sufficiently large N, g±N(∂G∖Ug∓)⊆Ug±,h±N(∂G∖Uh∓)⊆Uh±. (Kapovich--Benakli, Theorem 2.28, Proposition 4.2, and Theorem 4.3.)

Proof

technique · direct
1.1givenA1choose

By [A1], choose independent infinite-order elements g,h∈G with disjoint attracting and repelling neighborhoods on the boundary.

2.1A1step 1.1choosealgebra∎

Choose N large enough for all four north--south inclusions in [A1]. Write DgN=Ug+, Dg−N=Ug−, DhN=Uh+, and Dh−N=Uh−. If w=s1⋯sk is a nonempty reduced word in g±N,h±N, choose a letter t distinct from both s1 and sk−1 and a point x∈Dt. Acting from right to left, [A1] gives successively. [A1, step 1.1, choose] sj⋯skx∈Dsj(j=k,k−1,…,1), because reducedness says sj+1≠sj−1. Thus wx∈Ds1, while x∈Dt, and these domains are disjoint. Hence wx≠x, so w is not trivial. Therefore gN and hN freely generate a free subgroup of rank 2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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