Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 infinite dihedral group is quasi-isometric to Z, and to Z×Z/2

Example

The infinite dihedral group is quasi-isometric to Z, and to Z×Z/2.

Facts & Assumptions

Given: The objects and hypotheses in the Example.

[F1]

The Cayley graph of a group G with respect to a subset S has vertex set G and edge set {{g,gs}:g∈G, s∈(S∪S−1)∖{e}} (The Cayley graph of a group with respect to a subset).

[L1]

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

[L2]

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

[L3]

The identity map between the word metrics of two finite generating sets of a group is a bilipschitz equivalence (The identity map between the word metrics of two finite generating sets is a bilipschitz equivalence).

[L4]

A finitely generated group is quasi-isometric to a metric space when its word metric for some, equivalently every, finite generating set is (The quasi-isometry type of a finitely generated group).

[L5]

The group with presentation (Group presentation by generators and relations).

[L6]

If the evaluation of every r∈R under u is eH, then there is a unique homomorphism (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

[L7]

Let u,v∈F(X) and put N=⟨ ⁣⟨R⟩ ⁣⟩F(X). The words u and v represent the same element of ⟨X∣R⟩ if and only if (In ⟨X∣R⟩, the words u and v represent the same element if and only if u−1v∈⟨ ⁣⟨R⟩ ⁣⟩).

Verification

technique · direct
1.1F1L5L6L7

Take the two presentations of the infinite dihedral group, by two involutions and by an infinite-order element with an inverting involution.

2.1F1L8step 1.1

The Cayley graph for the first is a two-way infinite path, isomorphic to that of the integers with generator one; for the second it is the two-way infinite ladder, isomorphic to that of the integers times a group of order two.

3.1L1L2L3L4step 2.1∎

Isomorphic Cayley graphs give isometric word metrics, and the comparison theorem transports the identification across generating sets, so all three groups are quasi-isometric.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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