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.
Cayley Graphs, Word Metrics and Quasi-Isometry — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Limits of Real Functions
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Sequences and Limits
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The Cayley graph of for the generating set is a line and its word metric is
Example
The Cayley graph of for the generating set is a line and its word metric is .
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 length is the least such that is a product of elements of (Word length of a group element with respect to a generating set).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph (The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph).
A free abelian group on a set is an abelian group together with a map such that, for every abelian group and every function , there is a unique group homomorphism satisfying (Free abelian group on a set).
Verification
With the symmetrised set is and the edges join to , so the Cayley graph is a two-way infinite path.
The word length of is , since is a product of copies of or of and no shorter expression exists.
So the word metric is , the metric induced from the real line.
The word metrics of for and for differ at and are bilipschitz equivalent
Example
The word metrics of for and for differ at and are bilipschitz equivalent.
Facts & Assumptions
Given: The objects and hypotheses in the Example.
The word length is the least such that is a product of elements of (Word length of a group element with respect to a generating set).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
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 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).
- and are topologically equivalent if they have the same metric topology: - and are uniformly equivalent if for every real there are reals and such that, for all , - and are Lipschitz equivalent if there are reals with (Topologically, uniformly and Lipschitz equivalent metrics on a set).
Verification
For the length of is one, while for the element is not a one-letter word in and satisfies , so its length is two. Thus the two metrics already differ at the pair .
The comparison theorem gives constants: every member of one symmetrised set has length at most three in the other, so the identity is bilipschitz with constant three.
The Cayley graph of for the standard basis is the integer lattice, and its word metric is the sum of coordinate differences
Example
The Cayley graph of for the standard basis is the integer lattice, and its word metric is the sum of coordinate differences.
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).
A free abelian group on a set is an abelian group together with a map such that, for every abelian group and every function , there is a unique group homomorphism satisfying (Free abelian group on a set).
The word length is the least such that is a product of elements of (Word length of a group element with respect to a generating set).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph (The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph).
Verification
With the standard basis as generating set, the neighbours of a tuple are those differing by one in a single coordinate, so the Cayley graph is the integer lattice.
The word length of a tuple is the sum of the absolute values of its coordinates: that many steps suffice, and each step changes the sum by at most one.
So the word metric is the restriction of the metric, and the inclusion into that normed space is a quasi-isometry.
The Cayley graph of the free group on two generators is the tree in which every vertex has four neighbours
Example
The Cayley graph of the free group on two generators is the tree in which every vertex has four neighbours.
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 Cayley graph of a free group with respect to a free basis is a tree (The Cayley graph of a free group with respect to a free basis is a tree).
Every vertex of a Cayley graph has the same degree, and the graph is locally finite exactly when the symmetrised generating set is finite (Cayley-graph neighbourhoods are equipotent, and local finiteness is equivalent to finiteness of the symmetrised subset).
A cycle is a closed walk of length at least three with distinct vertices apart from its endpoints; a forest is a simple graph with no cycle and a tree is a connected forest (Cycles, trees and forests in a simple graph on an arbitrary vertex set).
A free group on a set is a group together with a map such that, for every group and every function , there is a unique group homomorphism satisfying (Free group on a set of generators).
The subset is a free basis of if is a free group on the set in the sense of. (A free basis of a group).
Verification
A two-element free basis generates and the general theorem makes the Cayley graph a tree.
The symmetrised set has four elements and none is the identity, so every vertex has degree four.
The dihedral group of order eight has Cayley graphs that are a cycle of length eight and a cube
Example
The dihedral group of order eight has Cayley graphs that are a cycle of length eight and a cube.
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).
Every vertex of a Cayley graph has the same degree, and the graph is locally finite exactly when the symmetrised generating set is finite (Cayley-graph neighbourhoods are equipotent, and local finiteness is equivalent to finiteness of the symmetrised subset).
For , one has , , and every element is uniquely or for ( with inversion action has order and the dihedral relations).
The degree of is , equivalently the number of edges incident with . A graph is -regular when every vertex has degree ; it is cubic when it is -regular. (Adjacency, incidence, open and closed neighbourhoods, vertex degree, minimum degree and maximum degree).
Verification
For the generating set , the four vertices form a -cycle under right multiplication by , and the four vertices form another. Right multiplication by joins to for each . Thus the graph is two -cycles joined at corresponding vertices, which is the cube.
For the generating set both generators are involutions and they generate because . Alternating them gives the eight-cycle , whose consecutive vertices differ by right multiplication by or . These are all eight group elements, and every vertex has only the two displayed neighbours, so this Cayley graph is .
The inclusion of in is a quasi-isometry that is neither surjective nor a bilipschitz equivalence
Example
The inclusion of in is a quasi-isometry that is neither surjective nor a bilipschitz equivalence.
Facts & Assumptions
Given: The objects and hypotheses in the Example.
A map is -coarse Lipschitz when , and an -quasi-isometric embedding when in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
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).
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 word metric of with respect to is (The word metric of a group with respect to a generating set).
It is written and called the integer part, or floor, of . (Integer part: for every real there is exactly one integer with ).
Verification
The inclusion preserves distances exactly, so it is a quasi-isometric embedding with constants one and zero.
Let be the integer-part map. Then for every integer , while every real satisfies ; so and is at bounded distance from . Therefore is a quasi-isometry.
It is not a bilipschitz equivalence because it is not surjective, and a bilipschitz equivalence must in particular be bijective.
The subgroup has index two in and its inclusion is a quasi-isometry
Example
The subgroup has index two in and its inclusion is a quasi-isometry.
Facts & Assumptions
Given: The objects and hypotheses in the Example.
A subgroup of finite index in a finitely generated group is finitely generated and its inclusion is a quasi-isometry (A subgroup of finite index in a finitely generated group is finitely generated, and its inclusion is a quasi-isometry).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
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).
A free abelian group on a set is an abelian group together with a map such that, for every abelian group and every function , there is a unique group homomorphism satisfying (Free abelian group on a set).
Verification
The subgroup of pairs with even first coordinate has index two, with transversal the zero pair and the first basis vector.
The general proposition applies and makes the inclusion a quasi-isometry.
Directly, the inclusion doubles the first coordinate of a word expression at worst, so the constants are two and one.
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.
Taking itself as a generating set gives a word metric of diameter one, not bilipschitz equivalent to the standard one
Statement refuted
The comparison theorem for word metrics remains true for arbitrary generating sets.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
The word length is the least such that is a product of elements of (Word length of a group element with respect to a generating set).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
Balls of a word metric are finite if and only if the generating set is finite (Balls of a word metric are finite if and only if the generating set is finite).
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).
Bounded subset. is bounded if or there are and a real with . (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
Counterexample
Taking the whole group of integers as generating set gives every nonzero integer word length one.
So that word metric has diameter one, while the metric for the generating set is unbounded: the distance from to is . Its individual balls are finite, as [L2] requires, but their radii are not bounded uniformly.
The two are therefore not bilipschitz equivalent; the failing hypothesis of the comparison theorem is the finiteness used to take a maximum over the symmetrised set.
A single map exhibiting a quasi-isometry that is discontinuous, non-injective and non-surjective
Statement refuted
A quasi-isometry must be continuous, injective, or surjective.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
A map is -coarse Lipschitz when , and an -quasi-isometric embedding when in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
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).
It is written and called the integer part, or floor, of . (Integer part: for every real there is exactly one integer with ).
- (a) is continuous at every point of in the - sense. (For a map of metric spaces the following agree: - continuity everywhere, preimages of open sets are open, preimages of closed sets are closed, sequential continuity, and ).
Counterexample
Let be , whose image is the even integers, and let be the inclusion of that image into . Then is coarse Lipschitz, for every even integer , and every real satisfies ; so is a quasi-isometry.
It is discontinuous at every even integer, non-injective on each half-open interval , and misses every odd integer, so all three failures occur in one map.
FALSE: the Cayley graph of a group is independent of the chosen generating set
Statement refuted
the Cayley graph of a group is independent of the chosen generating set.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
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).
Every vertex of a Cayley graph has the same degree, and the graph is locally finite exactly when the symmetrised generating set is finite (Cayley-graph neighbourhoods are equipotent, and local finiteness is equivalent to finiteness of the symmetrised subset).
Refutation
The claim asserts that the isomorphism type of the Cayley graph depends only on the group.
For the integers the generating sets and give graphs of degree two and four, so the claim fails.
FALSE: every word metric is invariant under right translation
Statement refuted
every word metric is invariant under right translation.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
The word metric of with respect to is (The word metric of a group with respect to a generating set).
The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph (The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph).
Right translation by a fixed element displaces every point of a word metric space by exactly the word length of that element (Right translation by a fixed element displaces every point of a word metric space by exactly the word length of that element).
Refutation
The claim asserts for all .
In the free group on two generators with its free basis, take , and : the left sides differ, because while .
FALSE: every quasi-isometry is continuous, or bijective
Statement refuted
every quasi-isometry is continuous, or bijective.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
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).
A map is -coarse Lipschitz when , and an -quasi-isometric embedding when in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
It is written and called the integer part, or floor, of . (Integer part: for every real there is exactly one integer with ).
Refutation
The claim asserts that every quasi-isometry is continuous, or that every quasi-isometry is bijective.
The map is a quasi-isometry of : the inclusion of the even integers is a coarse Lipschitz quasi-inverse, since and every real satisfies . But is not bijective, and it is not continuous at any even integer. So it refutes both readings at once.
FALSE: any two infinite finitely generated groups are quasi-isometric
Statement refuted
any two infinite finitely generated groups are quasi-isometric.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
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 word metric of with respect to is (The word metric of a group with respect to a generating set).
Balls of a word metric are finite if and only if the generating set is finite (Balls of a word metric are finite if and only if the generating set is finite).
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).
is the open ball, the closed ball and the sphere of centre and radius . The radius is always a strictly positive real; a ball of radius or of negative radius is never written in this library. (Open ball, closed ball and sphere in a metric space).
A free group on a set is a group together with a map such that, for every group and every function , there is a unique group homomorphism satisfying (Free group on a set of generators).
A set is finite when for some . (The cardinality of a finite set).
A map is -coarse Lipschitz when , and an -quasi-isometric embedding satisfies in addition (Coarse Lipschitz maps and quasi-isometric embeddings).
In a free group with respect to a free basis, word length is reduced-word length (With respect to a free basis, the word length of an element is the length of its reduced word).
For every real number there is a larger natural number (Every complete ordered field is Archimedean).
Refutation
The claim asserts a single quasi-isometry class for all infinite finitely generated groups.
For each integer , the open ball of radius in the integers has elements. In the free group , the positive words of length in the letters are distinct reduced words, so the corresponding ball has at least elements.
Suppose there were a quasi-isometry . By [L3] choose a coarse Lipschitz quasi-inverse , coarse-Lipschitz constants for , and a bound with for every . If , then , so every fibre lies in the open ball . By [L1], left multiplication by bijects that ball with , so every fibre has at most elements by [L2]. Moreover, if then , so has at most elements. Hence . But for by induction, while . By [L9] choose a natural so large that and ; then , contradicting the displayed bound. Thus and are not quasi-isometric.
FALSE: a nontrivial finitely generated group with a word metric is a geodesic metric space
Statement refuted
a nontrivial finitely generated group with a word metric is a geodesic metric space.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
A geodesic of length in a metric space is an isometric embedding of the interval , and the space is geodesic when every two points are the endpoints of one (Geodesics and geodesic metric spaces).
The word metric of with respect to is (The word metric of a group with respect to a generating set).
A group with the word metric of any generating set is a -quasi-geodesic space (A group with the word metric of any generating set is a -quasi-geodesic space).
Refutation
The claim asserts that every two elements are the endpoints of an isometric embedding of a real interval.
A geodesic between two elements at distance one supplies points at every intermediate real distance, while a word metric takes only integer values.
So no nontrivial group with a word metric is geodesic; the correct statement is that it is -quasi-geodesic.
FALSE: groups with isomorphic Cayley graphs are isomorphic
Statement refuted
groups with isomorphic Cayley graphs are isomorphic.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
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).
On a finite vertex set , the empty graph has edge set and the complete graph has edge set . When is an -element labelled set, these are also denoted and . (Empty and complete graphs, complete bipartite graphs, and the convention that and have vertices).
If is cyclic, then exactly one of the following applies: (Every cyclic group is isomorphic to or to for its finite order ).
A graph isomorphism is a bijection such that, for all distinct , (Graph isomorphisms, automorphisms and graph complements).
Refutation
The claim asserts that the isomorphism type of some Cayley graph determines the group.
Taking the whole group as generating set, both the symmetric group on three letters and the cyclic group of order six give the complete graph on six vertices, and those groups are not isomorphic.
The Cayley graphs of for and of for are trees, and neither generating set is free
Statement refuted
Whenever a Cayley graph is a tree, the chosen generating set is a free basis.
Facts & Assumptions
Given: The proposed claim together with the witness named in the Statement refuted.
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).
A cycle is a closed walk of length at least three with distinct vertices apart from its endpoints; a forest is a simple graph with no cycle and a tree is a connected forest (Cycles, trees and forests in a simple graph on an arbitrary vertex set).
If no product of two members of a generating set is the identity and the Cayley graph is a tree, the set is a free basis (If no product of two members of a generating set is the identity and the Cayley graph is a tree, the set is a free basis).
The subset is a free basis of if is a free group on the set in the sense of. (A free basis of a group).
If is cyclic, then exactly one of the following applies: (Every cyclic group is isomorphic to or to for its finite order ).
Counterexample
The Cayley graph of the group of order two for its nonidentity element is a single edge, a tree, and that group is not free.
The Cayley graph of the integers for the generating set is the line, a tree, and that set is not a free basis.
In both cases a product of two members of the generating set is the identity, which is exactly the hypothesis the converse theorem adds.
A nonempty metric space of finite diameter has trivial quasi-isometry group
Example
A nonempty metric space of finite diameter has trivial quasi-isometry group.
Facts & Assumptions
Given: The objects and hypotheses in the Example.
The quasi-isometry group of a metric space is the set of quasi-isometries of it modulo bounded distance (The quasi-isometry group of a metric space).
The quasi-isometry group is a group under composition, and a quasi-isometry induces an isomorphism between the quasi-isometry groups of its source and target (Quasi-isometries modulo bounded distance form a group, and a quasi-isometry induces an isomorphism of these groups).
Bounded subset. is bounded if or there are and a real with . (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
Two maps into a metric space are at bounded distance when the distance between their values is bounded uniformly (Bounded distance between two maps into a metric space).
Verification
In a space of finite diameter every self-map is at distance at most the diameter from the identity.
So there is exactly one bounded-distance class, and the quasi-isometry group is trivial.
Scaling maps embed the multiplicative group of nonzero reals into the quasi-isometry group of
Example
Scaling maps embed the multiplicative group of nonzero reals into the quasi-isometry group of .
Facts & Assumptions
Given: The objects and hypotheses in the Example.
The quasi-isometry group of a metric space is the set of quasi-isometries of it modulo bounded distance (The quasi-isometry group of a metric space).
The quasi-isometry group is a group under composition, and a quasi-isometry induces an isomorphism between the quasi-isometry groups of its source and target (Quasi-isometries modulo bounded distance form a group, and a quasi-isometry induces an isomorphism of these groups).
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).
It is written and called the integer part, or floor, of . (Integer part: for every real there is exactly one integer with ).
Group isomorphisms, automorphisms and the set . (Group isomorphisms, automorphisms and the set ).
Verification
For let . The estimate shows is coarse Lipschitz, and is a quasi-inverse because for every integer . So is a quasi-isometry of .
Composing the maps for and agrees with the map for up to an error of at most , so the assignment is a homomorphism on classes.
For the difference is unbounded, so the homomorphism is injective.
Sources
- C. Loh, Geometric Group Theory: An Introduction (2015 course version), 264 pp.
- C. Drutu and M. Kapovich, Geometric Group Theory (with an appendix by B. Nica), 837 pp.
- D. A. Craven, The Theory of p-Groups (Hilary Term 2008), 48 pp.
- M. van Beek, Topics in Finite p-Groups, 62 pp.
- D. Kaur and A. Kulshrestha, Characters of real special 2-groups (arXiv:1510.06583v1)