Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

Two metric spaces are quasi-isometric if and only if each contains a separated net and the two nets are bilipschitz equivalent

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Two metric spaces are quasi-isometric if and only if each contains a separated net and the two nets are bilipschitz equivalent.

Facts & Assumptions

Given: The hypotheses of the Statement, including the Axiom of Choice.

[F1]

A subset of a metric space is a separated net when its points are uniformly separated and it is coarsely dense (Separated nets in a metric space).

[L1]

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).

[L2]

Under the Axiom of Choice, a map is a quasi-isometry if and only if it is a quasi-isometric embedding with coarsely dense image (A map is a quasi-isometry exactly when it is a quasi-isometric embedding with coarsely dense image).

[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).

[A1]

Every family of nonempty sets has a choice function >. (The Axiom of Choice).

[L4]

Under the Axiom of Choice, every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).

[L6]

Being quasi-isometric is a reflexive, symmetric and transitive relation on metric spaces (Being quasi-isometric is reflexive, symmetric and transitive).

[L7]

A subset inherits the ambient metric, and its inclusion is an isometric embedding (Isometry, isometric embedding, and the subspace metric on a subset).

Proof

technique · direct
1.1

Let X and Y be quasi-isometric, and by [L2] choose a quasi-isometric embedding f:XY with coarsely dense image. Fix constants L1, C0 and R0 such that f is (L,C)-quasi-isometric and f[X] is R-coarsely dense. Put δ:=2LC+1. Consider the poset of δ-separated subsets of X, ordered by inclusion. It is nonempty because is δ-separated, and the union of a chain of δ-separated subsets is again δ-separated; so Zorn's lemma gives a maximal δ-separated subset AX. If some xX satisfied d(x,A)δ, then A{x} would still be δ-separated, contradicting maximality. Hence every point of X lies within distance δ of A, so A is a separated net in X.

F1L1L2A1L4
2.1

For distinct a,aA one has dY(f(a),f(a))L1dX(a,a)C(L1Cδ)dX(a,a) and dY(f(a),f(a))(L+Cδ)dX(a,a), so the restriction fA:Af[A] is bilipschitz. Also, if yY, choose xX with dY(y,f(x))R and then choose aA with dX(x,a)<δ; then dY(y,f(a))dY(y,f(x))+dY(f(x),f(a))R+Lδ+C. So f[A] is a separated net in Y, bilipschitz equivalent to A.

F1L1L3step 1.1
3.1

Conversely, let AX and BY be separated nets, and let ϕ:AB be a bilipschitz equivalence. By [L7] the inclusions AX and BY are isometric embeddings, and because A and B are nets those inclusions have coarsely dense image; hence [L2] makes them quasi-isometries. By [L5] the map ϕ is a quasi-isometry. Transitivity of quasi-isometry now gives XABY, so X and Y are quasi-isometric.

F1L2L5L6L7step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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