Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Axis fellow travelling controls the centralizer

Statement

Let g have infinite order in the standing finitely generated δ-slim hyperbolic group, with identity o=e. Suppose its power orbit has quasi-isometry constants λ≥1,c≥0. Then CG(g)/⟨g⟩ has finitely many cosets, and each coset meets a ball whose radius depends only on δ,λ,c. Here CG(g)={h:hg=gh}.

The following stronger interfaces hold without AC. Put κ=3δ and let J≥4 be any integer such that 2J/λ−c>λ+c+4κJ. There is N∈{1,2,…,2J−1} which is a power of two such that, writing xi=giN, L=d(o,x1) and K=L−d(o,x2)/2, one has K≥0, L>2K+4κ and L≤λ2J+c. Put E=K+2κ+3δ+1. For every pair of integers a<b and every specified geodesic [xa,xb], each xi, a≤i≤b, is within distance less than E of that segment, and every point of the segment is within distance less than L+3E of one of those xi.

Moreover the subgroup H preserving the unordered pole pair {g+,g−} has ⟨g⟩ of finite index: each right coset ⟨g⟩h, h∈H, contains an element of length less than R=L+4K+10κ+12δ+5≤5(λ2J+c)+10κ+12δ+5. Inversion gives the same assertion for left cosets. For use with other orbit points, in any geodesic δ-slim space and any specified segment [a,b], there is z∈[a,b] with d(v,z)<(a∣b)v+3δ+1.

Facts & Assumptions

Given: The group, orbit constants and slimness hypothesis in the Statement.

[F1]

Infinite-order power orbits are quasi-isometrically embedded by Infinite order elements have positive stable translation length. The standing group conventions and word metric are those of Hg toolkit hyperbolic group and stable length.

[F2]

The product inequality holds with κ=3δ by Slim triangles imply the gromov product inequality. Products and infimum-based slimness are defined in Hg toolkit slim triangles products and four point constants.

[F3]

The two signed power sequences and their fixed positive-integer subsequences represent distinct poles, and bijective isometries act on boundary classes, by Hg toolkit loxodromics and independent poles.

[F4]

For each representing pair, its mixed joint liminf P and supremal boundary product B satisfy P≤B≤P+2κ for distinct classes, by Boundary products have controlled representative and basepoint dependence.

[F5]

Word-metric balls are finite for a finite generating set by Balls of a word metric are finite if and only if the generating set is finite.

Proof

1.1F1givenalgebra

Integers J as stated exist. Indeed 2J≥J2 for integers J≥4: equality holds at four, and 2J2≥(J+1)2 for J≥3 propagates the inequality. A sufficiently large integer J satisfies J2/λ>λ+2c+4κJ, by choosing J>8λκ and J2>2λ(λ+2c). Set an=d(o,gn). If a2j+1−a2j≤4κ for every 0≤j<J, summing gives a2J≤a1+4κJ≤λ+c+4κJ, contrary to the lower orbit bound. Thus some N=2j has a2N−aN>4κ. Subadditivity gives K=aN−a2N/2≥0, and L−2K=a2N−aN>4κ. The upper orbit bound gives L≤λ2J+c.

1.2F2algebra

Here is the asserted point-to-segment bound for arbitrary v,a,b. Write p=(a∣b)v and set t=p+2δ+2/3. If t>d(v,a), the endpoint a has distance less than p+3δ+1 from v. Otherwise choose the point w∈[v,a] at distance t from v, using any radial sides together with the specified [a,b]. Slimness supplies a witness within distance less than δ+1/3 on [v,b]∪[a,b]. If such a witness u lies on [v,b], put s=d(v,u). Then s>t−δ−1/3 and the route through w,u gives d(a,b)<d(v,a)−t+δ+1/3+d(v,b)−s. Thus p>(t+s−δ−1/3)/2>t−δ−1/3>p, an impossibility. A witness z must therefore lie on [a,b], with d(v,z)<t+δ+1/3=p+3δ+1. This includes repeated vertices and δ=0.

2.1step 1.1F2algebra

Isometry gives consecutive distances L and local turns (xi−1∣xi+1)xi=K. Write A=K+κ. For all i<j, the endpoint turn (xi∣xj+1)xj≤A. To prove this by induction on j−i, the first case is K. If the previous bound holds, the product identity gives (xi∣xj−1)xj≥L−A>A. But F2 gives K≥min⁡{(xj−1∣xi)xj,(xi∣xj+1)xj}−κ. Its first minimum entry exceeds K+κ, so the second is at most A, completing the induction. Reversal of any finite subchain proves the reversed endpoint bound as well. Expanding these bounds successively gives d(xi,xj)≥(j−i)(L−2A) for i<j.

3.1step 2.1step 1.1F2algebra

For i<m<j, one has (xi∣xj)xm≤K+2κ. If j=m+1, step 2.1 gives the stronger bound A. Otherwise its reversed version gives (xm∣xj)xm+1≤A, whence (xm+1∣xj)xm≥L−A>K+2κ. Applying F2 with bridge xj to the product (xi∣xm+1)xm≤A shows that the minimum of (xi∣xj)xm and (xj∣xm+1)xm is at most A+κ. The second entry is larger, proving the claim.

4.1step 3.1step 1.2step 2.1algebra

Fix integers a<b and the specified segment γ:[0,D]→X from xa to xb, parametrized by length. Steps 3.1 and 1.2 give for each interior index i a point zi=γ(ti) with d(xi,zi)<E. Use za=xa, zb=xb and ta=0,tb=D at the endpoints. Only finitely many witnesses are selected. Consecutive parameters satisfy ∣ti+1−ti∣=d(zi,zi+1)<L+2E. For 0<t<D, take the first index i with ti≥t. Then i>a, ti−1<t, and ∣ti−t∣<L+2E. Consequently d(γ(t),xi)<L+3E. The endpoints satisfy the same conclusion with distance zero. This proves both orbit-chord bounds; no monotonicity of the parameters was assumed.

4.2step 3.1F3F4algebra

F3 identifies the sequences (x−i)i≥1 and (xj)j≥1 as pole representatives. Step 3.1 bounds their mixed products at o=x0 by K+2κ. Therefore F4 gives Bo(g−,g+)≤K+4κ. For every bijective isometry h, the exact finite-product identity (hy∣hz)ho=(y∣z)o passes first to mixed liminfs and then to the supremum over representatives. This passage is exact because applying h is a bijection between the representing sequences of the respective classes, by F3. Thus Bho(hξ,hη)=Bo(ξ,η). If h∈H, symmetry gives Bho(g−,g+)=Bo(g−,g+)≤K+4κ. F4 implies that the mixed liminf of our same two fixed orbit sequences at ho is at most this number. Some i,j≥1 consequently satisfy (x−i∣xj)ho<K+4κ+1; otherwise every tail infimum would be at least that larger threshold.

5.1step 1.2step 4.1step 4.2F1F3F5algebra

Apply step 1.2 at v=ho to any segment [x−i,xj]. There is z on it with d(ho,z)<K+4κ+3δ+2. Step 4.1 supplies m∈[−i,j]∩Z with d(z,xm)<L+3E. Addition gives d(ho,xm)<R. Since o=e, left invariance identifies this with ∣g−mNh∣<R. F3 shows that g∈H; composition and inverses of pole-pair preserving actions show directly that H is a subgroup. Hence g−mNh∈⟨g⟩h and belongs to H. F5 makes the set of these possible representatives finite, so there are finitely many right cosets. Inversion bijects right and left cosets and preserves word length. Finally K≤L yields the displayed uniform upper bound for R.

6.1step 5.1F1F3F2algebra∎

If h commutes with g, then hg±n=g±nh and d(hg±n,g±n)=∣h∣. Bounded perturbation of sequence terms preserves boundary classes by the product formula, so h fixes each pole and belongs to H. Thus step 5.1 supplies a representative g−mNh in the same centralizer coset, with the same radius bound. The subgroup ⟨g⟩ is central in CG(g), so either coset convention gives the stated quotient. All selections were finite for each specified element or segment; no family of geodesics, nearest-point attainment, properness theorem or AC is used. The inequalities remain strict and valid at δ=0, c=0 and N=1.

Depends on

Used by

Dependency tree · two levels

22 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