Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-26 (gpt-6-sol)
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′))≤L d(x,x′)+C, and an (L,C)-quasi-isometric embedding when in addition L−1d(x,x′)−C≤d(f(x),f(x′)) (Coarse Lipschitz maps and quasi-isometric embeddings).

[L2]

A quasi-isometry is a coarse Lipschitz map with a coarse Lipschitz quasi-inverse; both composites are at bounded distance from the relevant identities (Coarsely dense subsets, quasi-inverses and quasi-isometries).

[L3]

A map is a bilipschitz embedding when c−1d(x,x′)≤d(f(x),f(x′))≤c d(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).

Proof

technique · direct
1.1L1L2givenalgebra

Suppose first that X and Y are quasi-isometric. If X is empty, a quasi-inverse Y→X forces Y empty, and the empty subsets are separated nets linked by their unique bilipschitz equivalence. Otherwise choose a quasi-isometry f:X→Y with coarse Lipschitz quasi-inverse g:Y→X. Let g have constants Lg≥1,Cg≥0 and let dX(gf(x),x)≤DX and dY(fg(y),y)≤DY. Then dX(x,x′)≤LgdY(fx,fx′)+Cg+2DX, so f has a quasi-isometric lower bound; its coarse Lipschitz bound supplies the upper bound. Fix common constants L≥1,C≥0 for these bounds. The second composite estimate says f[X] is DY-coarsely dense.

2.1F1L4step 1.1

Put δ:=2LC+1. Zorn's lemma applied to the poset of δ-separated subsets of X gives a maximal one A: a union of a chain is still separated, and the empty set starts the poset. For each x∈X there must be an a∈A with dX(x,a)<δ, since otherwise adjoining x would contradict maximality. Thus A is a δ-separated, δ-net; in particular it is nonempty. This quantified argument also covers the initially empty candidate subset without using d(x,∅).

3.1F1L1L3step 1.1step 2.1

For distinct a,a′∈A, separation absorbs the additive error: dY(fa,fa′)≥(L−1−C/δ)dX(a,a′) and dY(fa,fa′)≤(L+C/δ)dX(a,a′). The first coefficient is positive because δ>LC. Hence f∣A is a bilipschitz equivalence onto f[A], and f[A] is separated. Given y∈Y, choose x∈X with dY(y,fx)≤DY and then a∈A with dX(x,a)<δ; one has dY(y,fa)<DY+Lδ+C. Thus f[A] is also a net in Y.

4.1F1L2L3A1givenalgebrastep 3.1∎

Conversely, suppose separated nets A⊆X and B⊆Y are linked by a bilipschitz equivalence ϕ:A→B. If A is empty, its net property forces X empty, while bijectivity forces B and hence Y empty; their unique maps are quasi-inverses. Otherwise choose net radii RX,RY and, using choice, select maps pX:X→A and pY:Y→B within those radii, with pX(a)=a and pY(b)=b on the nets. The triangle inequality gives dX(pXx,pXx′)≤dX(x,x′)+2RX, and likewise for pY, so both maps are coarse Lipschitz. Define F:X→Y by F=ϕpX and G:Y→X by G=ϕ−1pY, viewing the net values in their ambient spaces. Bilipschitz bounds make both maps coarse Lipschitz. Since pX and pY fix their nets, GF=pX and FG=pY; these are within RX and RY of the respective identities. Hence F and G are quasi-inverses and X,Y are quasi-isometric. Together with step 3.1, this proves both directions.

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