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 , and to
Example
The infinite dihedral group is quasi-isometric to , and to .
Facts & Assumptions
Given: The objects and hypotheses in the Example.
The Cayley graph of a group with respect to a subset has vertex set and edge set (The Cayley graph of a group with respect to a subset).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
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).
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).
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).
The group with presentation (Group presentation by generators and relations).
If the evaluation of every under is , then there is a unique homomorphism (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
Let and put . The words and represent the same element of if and only if (In , the words and represent the same element if and only if ).
Verification
Take the two presentations of the infinite dihedral group, by two involutions and by an infinite-order element with an inverting involution.
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.
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
- The Cayley graph of a group with respect to a subset
- The word metric of a group with respect to a generating set
- Bilipschitz embeddings and bilipschitz equivalences of metric spaces
- The identity map between the word metrics of two finite generating sets is a bilipschitz equivalence
- The quasi-isometry type of a finitely generated group
- The generalized dihedral group $\operatorname{Dih}(A)=A\rtimes C_2$ for an abelian group $A$
- Group presentation by generators and relations
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
- In $\langle X\mid R\rangle$, the words $u$ and $v$ represent the same element if and only if $u^{-1}v\in\langle\!\langle R\rangle\!\rangle$
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
- D. A. Craven, The Theory of p-Groups (Hilary Term 2008), 48 pp. (standard reference, not scraped)
- M. van Beek, Topics in Finite p-Groups, 62 pp. (standard reference, not scraped)
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups (arXiv:1510.06583v1) (standard reference, not scraped)