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

Asymptotic gromov sequences form an equivalence relation

Statement

In a metric space satisfying the product condition with constant κ≥0, mixed-product divergence is an equivalence relation on Gromov sequences. Both being Gromov and this equivalence relation are unchanged by changing the basepoint. In particular this applies to a geodesic δ-slim space with κ=3δ, and makes the Gromov-sequence boundary well-defined.

Facts & Assumptions

Given: Basepoints o,o′∈X and the product inequality (x∣z)o≥min⁡{(x∣y)o,(y∣z)o}−κ.

[F1]

Joint divergence, Gromov sequences and the conditional quotient are defined in Hg toolkit gromov sequences and boundary product.

[F2]

The product condition with κ=3δ holds in a δ-slim geodesic space by Slim triangles imply the gromov product inequality.

Proof

1.1F1givenalgebra

A Gromov sequence x satisfies x∼x by exactly the joint divergence in F1. Symmetry follows from (xn∣ym)o=(ym∣xn)o, interchanging the two quantified indices. These assertions are also valid when no Gromov sequences exist, since they quantify over that set.

1.2F1given

Suppose x∼y and y∼z, and fix a real threshold R. There is a common integer N such that (xn∣yk)o>R+κ and (yk∣zm)o>R+κ for all n,k,m≥N, by taking the larger of the two divergence cutoffs. Fix the single index k=N. The product inequality gives (xn∣zm)o>R for every n,m≥N, proving transitivity with joint quantifiers.

1.3givenalgebra

Put D=d(o,o′). The reverse triangle inequality gives ∣d(o,x)−d(o′,x)∣≤D for every x. Expanding the two products therefore gives ∣(x∣y)o−(x∣y)o′∣≤D. A joint-divergence cutoff at threshold R+D for one basepoint is a cutoff at R for the other. Apply this first to a sequence paired with itself, then to two sequences. Interchanging o,o′ proves both directions of basepoint independence.

2.1step 1.1step 1.2step 1.3F1F2∎

Steps 1.1–1.2 prove equivalence and therefore justify the quotient specified in F1; step 1.3 identifies the same classes at every basepoint. F2 supplies the stated geodesic specialization. There is no selection of a family of representatives and no AC. All arguments include κ=0 and D=0.

Depends on

Used by

Dependency tree · two levels

3 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