Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

The quotient map by a finite normal subgroup is a quasi-isometry of word metric spaces

Statement

The quotient map by a finite normal subgroup is a quasi-isometry of word metric spaces.

Facts & Assumptions

Given: The hypotheses of the Statement.

[F1]

A group is finitely generated when some finite subset generates it (Finitely generated groups).

[L1]

The word length ∣g∣S is the least n such that g is a product of n elements of S∪S−1 (Word length of a group element with respect to a generating set).

[L2]

Word length is defined on every element and satisfies ∣gh∣S≤∣g∣S+∣h∣S, ∣g−1∣S=∣g∣S, and ∣g∣S=0 exactly when g is the identity (Word length is defined on every element and satisfies the subadditivity, inversion and vanishing laws).

[L3]

The word metric of G with respect to S is dS(g,h)=∣g−1h∣S (The word metric of a group with respect to a generating set).

[L4]

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

[L5]

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

[L6]

The quotient group, or factor group, G/N has the left cosets (The quotient group G/N and coset product (gN)(hN)=ghN).

[L7]

The subgroup N is normal in G when (Normal subgroup: invariance under conjugation).

[L8]

A set A is finite when A≈n for some n∈N. (The cardinality ∣A∣ of a finite set).

Proof

technique · direct
1.1F1L1L2L3L4L6L7

The image of a finite generating set generates the quotient, so the quotient map does not increase word length and is one-Lipschitz.

2.1L1L3L6L8step 1.1choose

Let M=max⁡{∣n∣S:n∈N}, which exists because N is finite. For each coset gˉ∈G/N, choose a representative s(gˉ)∈G of minimal word length in that coset, breaking ties lexicographically in the fixed finite alphabet S∪S−1; then the quotient map q satisfies q(s(gˉ))=gˉ. If hˉ=gˉ q(t) with t∈S∪S−1, then s(gˉ)−1s(hˉ)t−1∈N, so ∣s(gˉ)−1s(hˉ)∣S≤M+1. Chaining along a shortest quotient expression gives dG(s(gˉ),s(hˉ))≤(M+1)dG/N(gˉ,hˉ), so s:G/N→G is Lipschitz.

3.1L5step 2.1∎

For every g∈G, the elements s(q(g)) and g lie in the same coset, so s(q(g))−1g∈N and therefore dG(s(q(g)),g)≤M. Thus q∘s=id⁡G/N and s∘q is at bounded distance from id⁡G. Therefore q is a quasi-isometry with quasi-inverse s.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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