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.
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).
A map is -coarse Lipschitz when , and an -quasi-isometric embedding when in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
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).
A map is a bilipschitz embedding when for some , and a bilipschitz equivalence when it is a bijective such map with bilipschitz inverse (Bilipschitz embeddings and bilipschitz equivalences of metric spaces).
Every family of nonempty sets has a choice function >. (The Axiom of Choice).
Under the Axiom of Choice, every nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).
Being quasi-isometric is a reflexive, symmetric and transitive relation on metric spaces (Being quasi-isometric is reflexive, symmetric and transitive).
A subset inherits the ambient metric, and its inclusion is an isometric embedding (Isometry, isometric embedding, and the subspace metric on a subset).
Proof
Let and be quasi-isometric, and by [L2] choose a quasi-isometric embedding with coarsely dense image. Fix constants , and such that is -quasi-isometric and is -coarsely dense. Put . Consider the poset of -separated subsets of , 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 . If some satisfied , then would still be -separated, contradicting maximality. Hence every point of lies within distance of , so is a separated net in .
For distinct one has and so the restriction is bilipschitz. Also, if , choose with and then choose with ; then So is a separated net in , bilipschitz equivalent to .
Conversely, let and be separated nets, and let be a bilipschitz equivalence. By [L7] the inclusions and are isometric embeddings, and because and 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 , so and are quasi-isometric.
Depends on
- Coarse Lipschitz maps and quasi-isometric embeddings
- A map is a quasi-isometry exactly when it is a quasi-isometric embedding with coarsely dense image
- Bilipschitz embeddings and bilipschitz equivalences of metric spaces
- Separated nets in a metric space
- The Axiom of Choice
- Zorn's lemma
- Every isometry is a bilipschitz equivalence and every bilipschitz equivalence is a quasi-isometry, and two metrics on one set are Lipschitz equivalent exactly when the identity is a bilipschitz equivalence between them
- Being quasi-isometric is reflexive, symmetric and transitive
- Isometry, isometric embedding, and the subspace metric on a subset
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
- C. Loh, Geometric Group Theory: An Introduction (2015 course version), 264 pp. (standard reference, not scraped)
- C. Drutu and M. Kapovich, Geometric Group Theory (with an appendix by B. Nica), 837 pp. (standard reference, not scraped)