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

Hg toolkit proper ray compactness and sequence comparison

Statement

Assume AC. Let X be a nonempty proper geodesic space with a product hyperbolicity constant κ0, and fix oX. Proper means every closed ball of positive finite radius is compact. Every Gromov-sequence class has a geodesic ray representative r:[0,)X with r(0)=o, represented by (r(n))n1. The quotient of these rays by finite Hausdorff distance, with the topology induced from uniform convergence on bounded parameter intervals, is homeomorphic to the Gromov-sequence boundary with its product topology. In particular the boundary is compact, including when it is empty.

Facts & Assumptions

Given: The specified space, product constant, basepoint and properness.

[F1]

The boundary product, the 2κ representative comparison, and its Hausdorff neighbourhood topology are proved in Boundary products have controlled representative and basepoint dependence.

[A1]

AC is assumed as in The Axiom of Choice, for countable families of geodesics, compactness subsequences and the witnesses in the sequential compactness argument below.

Proof

1.1

We record the compact-metric facts used here. A sequence in a compact metric space has a cluster point: otherwise each point has a neighbourhood containing only finitely many sequence indices, and a finite subcover contradicts the infinite index set. From a cluster point choose increasing indices at distances less than 1/j to obtain a convergent subsequence. A Cauchy sequence in that compact space consequently converges to its subsequential limit. Conversely a metric space in which every sequence has a convergent subsequence is compact. Indeed, failure of a finite cover by radius-η balls allows recursive selection of an infinite η-separated sequence, contradicting subsequential convergence. Thus finite such covers exist for each η>0. For any open cover, there is some η>0 such that each radius-η ball is contained in a cover member: otherwise select points xn whose radius-1/n balls are not so contained, take a subsequence converging to x, and take a cover member containing a ball B(x,r). Eventually d(xn,x)+1/n<r, a contradiction. A finite cover by radius-η/2 balls then has each of its balls contained in a member of the given cover, producing a finite subcover. Empty spaces are compact by the empty subcover.

A1given
2.1

Consider any sequence of 1-Lipschitz paths fn:[0,)X starting at o. At each nonnegative rational t, values lie in a compact closed ball, say of radius t+1. Enumerate the rationals and repeatedly use step 1.1 to extract subsequences converging at the next time; the diagonal subsequence converges at every rational time. AC permits these countably many subsequence choices. On a bounded interval, a finite rational mesh and the common Lipschitz bound show that this subsequence is uniformly Cauchy: approximate any time by a mesh point within η, then bound the distance between two path values by 2η plus their distance at that mesh point. Its values remain in a fixed compact ball, which is complete by step 1.1. Therefore it converges uniformly on each bounded interval to a path f. Passing the Lipschitz inequalities to the limit shows f is 1-Lipschitz and f(0)=o. If the paths are isometric on intervals whose lengths tend to infinity, the same limit gives d(f(s),f(t))=st for all finite s,t, so f is a ray.

step 1.1A1given
3.1

The ray space Ro is metrized by dR(r,s)=j=12jmin{1,sup0tjd(r(t),s(t))}. Each supremum is finite, bounded by 2j. The nonnegative series converges since its tail after j is at most 2j; completeness gives the supremum of its partial sums. Positivity and symmetry are immediate, and the triangle inequality follows termwise from the triangle inequality and min(1,a+b)min(1,a)+min(1,b). Zero distance implies equality at every time. Convergence in this metric is equivalent to uniform convergence on every bounded interval: each fixed term controls its truncated supremum in one direction, and finitely many controlled terms plus the geometric tail give the other direction. Step 2.1 therefore proves sequential compactness of this metric ray space. By step 1.1 it is compact. This includes the case in which there are no rays.

step 1.1step 2.1givenalgebra
3.2

Let (xn) be Gromov. Its radii d(o,xn) tend to infinity by the diagonal products. Use AC to select geodesics from o to xn and extend each constantly past its terminal time. These extensions are 1-Lipschitz. Step 2.1 supplies a subsequence converging uniformly on bounded intervals to a ray r. Fix T0. For large indices n on the subsequence, the radius-T point un of the selected segment satisfies (unxn)o=T and unr(T). For all large n,m, the Gromov property gives (xnxm)oT. The product inequality then gives (unxm)oTκ. Products change by at most d(un,r(T)) when that one endpoint is replaced, so passing along the subsequence gives (r(T)xm)oTκ for every sufficiently large m. For every ST, (r(S)r(T))o=T, and one further product inequality yields (r(S)xm)oT2κ. Taking T larger than any prescribed threshold plus 2κ proves joint mixed divergence. Thus r represents the original class.

step 2.1F1A1givenalgebra
4.1

Each ray is Gromov since (r(n)r(m))o=min{n,m}. If two rays r,s represent the same class, fix T and take integers n,mT with (r(n)s(m))oT. Two product inequalities, through r(n) and s(m), give (r(T)s(T))oT2κ, so d(r(T),s(T))4κ. Hence their Hausdorff distance is finite. Conversely suppose their Hausdorff distance is at most H<. For each T and e>0, choose s(U) within H+e of r(T). Their radii give UTH+e, so d(r(T),s(T))2H+2e, and then at most 2H by letting e decrease to zero. For nm, the route through s(n) gives d(r(n),s(m))2H+mn, so (r(n)s(m))onH. The symmetric case gives the lower bound min{n,m}H, which diverges jointly. Thus the fibers of the map π:RoX are exactly finite-Hausdorff classes.

step 3.1F1givenalgebra
4.2

The map π is continuous. For rays r,s and any T, two product inequalities along their tails show Bo(πr,πs)Td(r(T),s(T))/22κ. Indeed the two outer products through r(T),s(T) equal T for tail parameters at least T, and their middle product is Td(r(T),s(T))/2; take joint liminf and then supremum. For a fixed threshold R, choose T>R+2κ+1. All rays sufficiently close to r uniformly on [0,T] have d(r(T),s(T))<1, so their images belong to UR(πr). F1's open-set criterion now gives continuity at every ray.

step 3.1F1givenalgebra
5.1

By step 3.2, π is onto. By steps 3.1 and 4.2 its image is compact: pull any open cover back to Ro, take a finite subcover, and use surjectivity. Since F1 makes the target Hausdorff, this is also a quotient map. To see this explicitly, a closed subset of the compact ray space is compact, hence its continuous image is compact. Compact subsets of a Hausdorff space are closed: for a point outside such a subset, separate it from each point of the subset, take finitely many of the latter neighbourhoods covering the subset, and intersect the corresponding finitely many neighbourhoods of the outside point. Thus π is a closed surjection. If the preimage of a subset is closed, that subset is the image of its preimage and therefore closed; taking complements proves the quotient criterion. Step 4.1 identifies exactly the desired ray equivalence relation, so its quotient topology agrees with the boundary product topology. This proof uses compactness of a metrized ray space, not an inference from first countability of the boundary.

step 3.1step 3.2step 4.1step 4.2F1

Depends on

Used by

Dependency tree · two levels

4 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