Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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.

A bijective quasi-isometry between word metric spaces of finitely generated groups is a bilipschitz equivalence

Statement

A bijective quasi-isometry between word metric spaces of finitely generated groups is a bilipschitz equivalence.

Facts & Assumptions

Given: The hypotheses of the Statement.

[F1]

A subset is coarsely dense when every point of the space is within a fixed distance of it, and a quasi-isometry is a coarse Lipschitz map admitting a coarse Lipschitz quasi-inverse (Coarsely dense subsets, quasi-inverses and quasi-isometries).

[L1]

A coarse Lipschitz map between word metric spaces of finitely generated groups is Lipschitz (A coarse Lipschitz map between word metric spaces of finitely generated groups is Lipschitz).

[L2]

A map is (L,C)-coarse Lipschitz when d(f(x),f(x))Ld(x,x)+C, and an (L,C)-quasi-isometric embedding when in addition L1d(x,x)Cd(f(x),f(x)) (Coarse Lipschitz maps and quasi-isometric embeddings).

[L3]

A map is a bilipschitz embedding when c1d(x,x)d(f(x),f(x))cd(x,x) for some c>0, and a bilipschitz equivalence when it is a bijective such map with bilipschitz inverse (Bilipschitz embeddings and bilipschitz equivalences of metric spaces).

[L4]

Proof

technique · direct
1.1

Let f:GH be a bijective quasi-isometry, and let g:HG be a coarse Lipschitz quasi-inverse. If dG(g(f(x)),x)R for every xG and g is (A,B)-coarse Lipschitz, then for y=f(x) and y=f(x) one has dG(f1(y),f1(y))=dG(x,x)AdH(y,y)+(B+2R). So the set-theoretic inverse f1 is coarse Lipschitz.

F1L2
2.1

Both f and f1 are therefore coarse Lipschitz, hence Lipschitz by the previous proposition.

L1L4step 1.1
3.1

If f has Lipschitz constant L and f1 has Lipschitz constant M, then M1dG(x,x)dH(f(x),f(x))LdG(x,x) for all x,xG, so f is a bilipschitz equivalence.

L3L4step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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