Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Loxodromic elements have north south boundary dynamics

Statement

For an infinite-order element g of a finitely generated hyperbolic group and neighbourhoods U+,U of its positive and negative poles, there is an integer N such that gn(GU)U+,gn(GU+)U(nN). The proof is choice-free. In fact the same assertion holds for every loxodromic isometry of a metric space satisfying the product condition.

Facts & Assumptions

Given: Such an isometry, a basepoint o, a product constant κ0, its poles p+,p, and their two neighbourhoods.

[F1]

Loxodromic poles, their distinctness and the isometry action on boundary classes are well-defined. The explicit orbit-chain verification gives positive stable length and joint product estimates without properness or AC (Hg toolkit loxodromics and independent poles).

[F2]

Write B for the supremal boundary product at o. Every representing pair has mixed joint liminf at most B. The sets UR(p)={ξ:B(ξ,p)>R} form a neighbourhood base at p (Boundary products have controlled representative and basepoint dependence).

[F3]

The metric product formula and product inequality hold at every basepoint (Hg toolkit slim triangles products and four point constants).

[F4]

Every infinite-order element of the stated hyperbolic group is loxodromic (Infinite order elements have positive stable translation length).

Proof

1.1

Put zn=gno, wn=gno and an=d(o,zn)=d(o,wn). By the quantitative conclusion in F1, choose τ>0, an integer s1 and C0 such that annτ and, for every mns, (znzm)oanC,(wnwm)oanC. Thus each pole's canonical sequence has product with its corresponding nth orbit point at least anC on its tail.

F1
1.2

For any Gromov sequence (uj) and fixed vX, put bv(u)=lim infj(ujv)o. It is finite in [0,d(o,v)]. For all sufficiently large i,j, the Gromov property gives (uiuj)o>d(o,v)+κ. Since (ujv)od(o,v), F3 yields (uiv)o(ujv)oκ. Interchanging i,j bounds every difference on that tail by κ. Taking tail infima and suprema therefore gives lim supj(ujv)obv(u)+κ. This argument uses only bounded real sequences.

F3givenalgebra
2.1

For representing sequences u and v and an interior point x, apply F3 with bridge x. For every ε>0, all sufficiently late products (uix)o and (vjx)o are at least bx(u)ε and bx(v)ε. Thus their joint liminf satisfies P(u,v)min{bx(u),bx(v)}κ after letting ε decrease to zero. This is a joint tail estimate; neither boundary class nor the bridge point is being selected simultaneously for a family.

step 1.2F3algebra
3.1

Choose R,T0 with UR(p)U and UT(p+)U+, using F2 and increasing the two thresholds to zero if necessary. For any ξU we have B(ξ,p)R. Fix any representing sequence u of this one class. For ns with anC>R+κ, step 1.1 gives bwn(w)anC>R+κ for the canonical negative orbit w. By step 2.1 and F2, RP(u,w)min{bwn(u),bwn(w)}κ. The second entry exceeds R+κ, hence bwn(u)R+κ. Step 1.2 now gives lim supj(ujwn)oR+2κ. This bound is uniform in every class outside U, although its individual sequence tail cutoff need not be uniform.

step 1.1step 1.2step 2.1F2algebra
4.1

The product formula and isometry identities give exactly (gnujzn)o=an(ujwn)o. Taking liminf and using step 3.1 yields bzn(gnu)anR2κ. The image sequence represents gnξ by F1. Step 1.1 gives bzn(z)anC for the canonical positive orbit. Applying step 2.1 with bridge zn therefore gives B(gnξ,p+)P(gnu,z)anmax{R+2κ,C}κ. All expressions involving an interior point are finite, so no subtraction of infinite boundary products has occurred.

step 3.1step 1.1step 2.1F1F2F3algebra
5.1

Choose N+s so large that N+τ>C+R+κ and N+τ>T+max{R+2κ,C}+κ. Then for every nN+ we have both the hypothesis of step 3.1 and B(gnξ,p+)>T in step 4.1, for every ξU. Hence gn(XU)UT(p+)U+. The integer is chosen from constants independent of ξ; there is no appeal to pointwise convergence to claim uniformity.

step 1.1step 3.1step 4.1algebra
6.1

The inverse isometry is loxodromic, with poles interchanged, the same sequence of lengths an, and the same orbit constants in step 1.1. Apply step 5.1 to g1, now using the excluded neighbourhood U+ and the target neighbourhood U. This supplies N such that gn(XU+)U for all nN. Taking N=max(N+,N) gives both inclusions for the same tail.

step 5.1step 1.1F1algebra
7.1

F4 and the boundary/isometry conventions in F1 specialize the result to the given group. If one excluded complement is empty its inclusion is automatic; the uniform proof also covers singleton complements, including a boundary consisting only of the two poles. The constants permit κ=0, and τ>0 is the only quantity whose positivity is needed to choose large integers. Each argument fixes at most one representative of one given class; the final bound is independent of that representative and class. Only finitely many threshold witnesses are used. Thus neither AC, proper-ray selection, compactness, the general quasi-isometry extension theorem nor Morse stability is used.

step 5.1step 6.1F1F4given

Depends on

Used by

Dependency tree · two levels

10 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