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).
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).
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).
Proof
Suppose first that and are quasi-isometric. If is empty, a quasi-inverse forces empty, and the empty subsets are separated nets linked by their unique bilipschitz equivalence. Otherwise choose a quasi-isometry with coarse Lipschitz quasi-inverse . Let have constants and let and . Then , so has a quasi-isometric lower bound; its coarse Lipschitz bound supplies the upper bound. Fix common constants for these bounds. The second composite estimate says is -coarsely dense.
Put . Zorn's lemma applied to the poset of -separated subsets of gives a maximal one : a union of a chain is still separated, and the empty set starts the poset. For each there must be an with , since otherwise adjoining would contradict maximality. Thus is a -separated, -net; in particular it is nonempty. This quantified argument also covers the initially empty candidate subset without using .
For distinct , separation absorbs the additive error: and . The first coefficient is positive because . Hence is a bilipschitz equivalence onto , and is separated. Given , choose with and then with ; one has . Thus is also a net in .
Conversely, suppose separated nets and are linked by a bilipschitz equivalence . If is empty, its net property forces empty, while bijectivity forces and hence empty; their unique maps are quasi-inverses. Otherwise choose net radii and, using choice, select maps and within those radii, with and on the nets. The triangle inequality gives , and likewise for , so both maps are coarse Lipschitz. Define by and by , viewing the net values in their ambient spaces. Bilipschitz bounds make both maps coarse Lipschitz. Since and fix their nets, and ; these are within and of the respective identities. Hence and are quasi-inverses and 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
- 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)