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 map is a quasi-isometry exactly when it is a quasi-isometric embedding with coarsely dense image

Statement

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

A map is a quasi-isometry exactly when it is a quasi-isometric embedding with coarsely dense image.

Facts & Assumptions

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

[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]

Under the Axiom of Choice, a quasi-isometric embedding with coarsely dense image admits a quasi-inverse quasi-isometric embedding (A quasi-isometric embedding with coarsely dense image has a quasi-inverse quasi-isometric embedding).

Proof

technique · direct
1.1

If a map is a quasi-isometric embedding with coarsely dense image, the previous theorem supplies a quasi-inverse quasi-isometric embedding, so the map is a quasi-isometry.

F1L1
2.1

Conversely, if g is a quasi-inverse of f and dY(f(g(y)),y)R for every yY, then every target point lies within distance R of f[X], so the image of f is coarsely dense.

F1step 1.1

Depends on

Used by

Dependency tree · two levels

7 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