Quasi-isometry

In mathematics, a quasi-isometry is a function between two metric spaces that respects large-scale geometry of these spaces and ignores their small-scale details. Two metric spaces are quasi-isometric if there exists a quasi-isometry between them. The property of being quasi-isometric behaves like an equivalence relation on the class of metric spaces.

The concept of quasi-isometry is especially important in geometric group theory, following the work of Gromov.^[1]

This lattice is quasi-isometric to the plane.

Definition

Suppose that ${\displaystyle f}$ is a (not necessarily continuous) function from one metric space ${\displaystyle (M_{1},d_{1})}$ to a second metric space ${\displaystyle (M_{2},d_{2})}$. Then ${\displaystyle f}$ is called a quasi-isometry from ${\displaystyle (M_{1},d_{1})}$ to ${\displaystyle (M_{2},d_{2})}$ if there exist constants ${\displaystyle A\geq 1}$, ${\displaystyle B\geq 0}$, and ${\displaystyle C\geq 0}$ such that the following two properties both hold:^[2]

1. For every two points ${\displaystyle x}$ and ${\displaystyle y}$ in ${\displaystyle M_{1}}$, the distance between their images is up to the additive constant ${\displaystyle B}$ within a factor of ${\displaystyle A}$ of their original distance. More formally:

   ${\displaystyle \forall x,y\in M_{1}:{\frac {1}{A}}\;d_{1}(x,y)-B\leq d_{2}(f(x),f(y))\leq A\;d_{1}(x,y)+B.}$

2. Every point of ${\displaystyle M_{2}}$ is within the constant distance ${\displaystyle C}$ of an image point. More formally:

   ${\displaystyle \forall z\in M_{2}:\exists x\in M_{1}:d_{2}(z,f(x))\leq C.}$

The two metric spaces ${\displaystyle (M_{1},d_{1})}$ and ${\displaystyle (M_{2},d_{2})}$ are called quasi-isometric if there exists a quasi-isometry ${\displaystyle f}$ from ${\displaystyle (M_{1},d_{1})}$ to ${\displaystyle (M_{2},d_{2})}$.

A map is called a quasi-isometric embedding if it satisfies the first condition but not necessarily the second (i.e. it is coarsely Lipschitz but may fail to be coarsely surjective). In other words, if through the map, ${\displaystyle (M_{1},d_{1})}$ is quasi-isometric to a subspace of ${\displaystyle (M_{2},d_{2})}$.

Two metric spaces M₁ and M₂ are said to be quasi-isometric, denoted ${\displaystyle M_{1}{\underset {q.i.}{\sim }}M_{2}}$, if there exists a quasi-isometry ${\displaystyle f:M_{1}\to M_{2}}$.

Examples

The map between the Euclidean plane and the plane with the Manhattan distance that sends every point to itself is a quasi-isometry: in it, distances are multiplied by a factor of at most ${\displaystyle {\sqrt {2}}}$. Note that there can be no isometry, since, for example, the points ${\displaystyle (1,0),(-1,0),(0,1),(0,-1)}$ are of equal distance to each other in Manhattan distance, but in the Euclidean plane, there are no 4 points that are of equal distance to each other.

The map ${\displaystyle f:\mathbb {Z} ^{n}\to \mathbb {R} ^{n}}$ (both with the Euclidean metric) that sends every ${\displaystyle n}$-tuple of integers to itself is a quasi-isometry: distances are preserved exactly, and every real tuple is within distance ${\displaystyle {\sqrt {n/4}}}$ of an integer tuple. In the other direction, the discontinuous function that rounds every tuple of real numbers to the nearest integer tuple is also a quasi-isometry: each point is taken by this map to a point within distance ${\displaystyle {\sqrt {n/4}}}$ of it, so rounding changes the distance between pairs of points by adding or subtracting at most ${\displaystyle 2{\sqrt {n/4}}}$.

Every pair of finite or bounded metric spaces is quasi-isometric. In this case, every function from one space to the other is a quasi-isometry.

Equivalence relation

If ${\displaystyle f:M_{1}\mapsto M_{2}}$ is a quasi-isometry, then there exists a quasi-isometry ${\displaystyle g:M_{2}\mapsto M_{1}}$. Indeed, ${\displaystyle g(x)}$ may be defined by letting ${\displaystyle y}$ be any point in the image of ${\displaystyle f}$ that is within distance ${\displaystyle C}$ of ${\displaystyle x}$, and letting ${\displaystyle g(x)}$ be any point in ${\displaystyle f^{-1}(y)}$.

Since the identity map is a quasi-isometry, and the composition of two quasi-isometries is a quasi-isometry, it follows that the property of being quasi-isometric behaves like an equivalence relation on the class of metric spaces.

Use in geometric group theory

Given a finite generating set S of a finitely generated group G, we can form the corresponding Cayley graph of S and G. This graph becomes a metric space if we declare the length of each edge to be 1. Taking a different finite generating set T results in a different graph and a different metric space, however the two spaces are quasi-isometric.^[3] This quasi-isometry class is thus an invariant of the group G. Any property of metric spaces that only depends on a space's quasi-isometry class immediately yields another invariant of groups, opening the field of group theory to geometric methods.

More generally, the Švarc–Milnor lemma states that if a group G acts properly discontinuously with compact quotient on a proper geodesic space X then G is quasi-isometric to X (meaning that any Cayley graph for G is). This gives new examples of groups quasi-isometric to each other:

• If G' is a subgroup of finite index in G then G' is quasi-isometric to G;
• If G and H are the fundamental groups of two compact hyperbolic manifolds of the same dimension d then they are both quasi-isometric to the hyperbolic space H^d and hence to each other; on the other hand there are infinitely many quasi-isometry classes of fundamental groups of finite-volume.^[4]

Quasigeodesics and the Morse lemma

A quasi-geodesic in a metric space ${\displaystyle (X,d)}$ is a quasi-isometric embedding of ${\displaystyle \mathbb {R} }$ into ${\displaystyle X}$. More precisely a map ${\displaystyle \phi :\mathbb {R} \to X}$ such that there exists ${\displaystyle C,K>0}$ so that

${\displaystyle \forall s,t\in \mathbb {R} :C^{-1}|s-t|-K\leq d(\phi (t),\phi (s))\leq C|s-t|+K}$

is called a ${\displaystyle (C,K)}$-quasi-geodesic. Obviously geodesics (parametrised by arclength) are quasi-geodesics. The fact that in some spaces the converse is coarsely true, i.e. that every quasi-geodesic stays within bounded distance of a true geodesic, is called the Morse Lemma (not to be confused with the Morse lemma in differential topology). Formally the statement is:

Let ${\displaystyle \delta ,C,K>0}$ and ${\displaystyle X}$ a proper δ-hyperbolic space. There exists ${\displaystyle M}$ such that for any ${\displaystyle (C,K)}$-quasi-geodesic ${\displaystyle \phi }$ there exists a geodesic ${\displaystyle L}$ in ${\displaystyle X}$ such that ${\displaystyle d(\phi (t),L)\leq M}$ for all ${\displaystyle t\in \mathbb {R} }$.

It is an important tool in geometric group theory. An immediate application is that any quasi-isometry between proper hyperbolic spaces induces a homeomorphism between their boundaries. This result is the first step in the proof of the Mostow rigidity theorem.

Furthermore, this result has found utility in analyzing user interaction design in applications similar to Google Maps.^[5]

Examples of quasi-isometry invariants of groups

The following are some examples of properties of group Cayley graphs that are invariant under quasi-isometry:^[2]

Hyperbolicity

Main article: Hyperbolic group

A group is called hyperbolic if one of its Cayley graphs is a δ-hyperbolic space for some δ. When translating between different definitions of hyperbolicity, the particular value of δ may change, but the resulting notions of a hyperbolic group turn out to be equivalent.

Hyperbolic groups have a solvable word problem. They are biautomatic and automatic.:^[6] indeed, they are strongly geodesically automatic, that is, there is an automatic structure on the group, where the language accepted by the word acceptor is the set of all geodesic words.

Growth

Main article: Growth rate (group theory)

The growth rate of a group with respect to a symmetric generating set describes the size of balls in the group. Every element in the group can be written as a product of generators, and the growth rate counts the number of elements that can be written as a product of length n.

According to Gromov's theorem, a group of polynomial growth is virtually nilpotent, i.e. it has a nilpotent subgroup of finite index. In particular, the order of polynomial growth ${\displaystyle k_{0}}$ has to be a natural number and in fact ${\displaystyle \#(n)\sim n^{k_{0}}}$.

If ${\displaystyle \#(n)}$ grows more slowly than any exponential function, G has a subexponential growth rate. Any such group is amenable.

Ends

Main article: End (topology)

The ends of a topological space are, roughly speaking, the connected components of the “ideal boundary” of the space. That is, each end represents a topologically distinct way to move to infinity within the space. Adding a point at each end yields a compactification of the original space, known as the end compactification.

The ends of a finitely generated group are defined to be the ends of the corresponding Cayley graph; this definition is independent of the choice of a finite generating set. Every finitely-generated infinite group has either 0,1, 2, or infinitely many ends, and Stallings theorem about ends of groups provides a decomposition for groups with more than one end.

If two connected locally finite graphs are quasi-isometric then they have the same number of ends.^[7] In particular, two quasi-isometric finitely generated groups have the same number of ends.

Amenability

Main article: Amenable group

An amenable group is a locally compact topological group G carrying a kind of averaging operation on bounded functions that is invariant under translation by group elements. The original definition, in terms of a finitely additive invariant measure (or mean) on subsets of G, was introduced by John von Neumann in 1929 under the German name "messbar" ("measurable" in English) in response to the Banach–Tarski paradox. In 1949 Mahlon M. Day introduced the English translation "amenable", apparently as a pun.^[8]

In discrete group theory, where G has the discrete topology, a simpler definition is used. In this setting, a group is amenable if one can say what proportion of G any given subset takes up.

If a group has a Følner sequence then it is automatically amenable.

Asymptotic cone

Main article: Ultralimit § Asymptotic cones

An ultralimit is a geometric construction that assigns to a sequence of metric spaces X_n a limiting metric space. An important class of ultralimits are the so-called asymptotic cones of metric spaces. Let (X,d) be a metric space, let ω be a non-principal ultrafilter on ${\displaystyle \mathbb {N} }$ and let p_n ∈ X be a sequence of base-points. Then the ω–ultralimit of the sequence ${\displaystyle (X,{\frac {d}{n}},p_{n})}$ is called the asymptotic cone of X with respect to ω and ${\displaystyle (p_{n})_{n}\,}$ and is denoted ${\displaystyle Cone_{\omega }(X,d,(p_{n})_{n})\,}$. One often takes the base-point sequence to be constant, p_n = p for some p ∈ X; in this case the asymptotic cone does not depend on the choice of p ∈ X and is denoted by ${\displaystyle Cone_{\omega }(X,d)\,}$ or just ${\displaystyle Cone_{\omega }(X)\,}$.

The notion of an asymptotic cone plays an important role in geometric group theory since asymptotic cones (or, more precisely, their topological types and bi-Lipschitz types) provide quasi-isometry invariants of metric spaces in general and of finitely generated groups in particular.^[9] Asymptotic cones also turn out to be a useful tool in the study of relatively hyperbolic groups and their generalizations.^[10]

See also

• Isometry
• Coarse structure

References

1. Bridson, Martin R. (2008), "Geometric and combinatorial group theory", in Gowers, Timothy; Barrow-Green, June; Leader, Imre (eds.), The Princeton Companion to Mathematics, Princeton University Press, pp. 431–448, ISBN 978-0-691-11880-2
2. P. de la Harpe, Topics in geometric group theory. Chicago Lectures in Mathematics. University of Chicago Press, Chicago, IL, 2000. ISBN 0-226-31719-6
3. R. B. Sher and R. J. Daverman (2002), Handbook of Geometric Topology, North-Holland. ISBN 0-444-82432-4.
4. Schwartz, Richard (1995). "The Quasi-Isometry Classification of Rank One Lattices". I.H.É.S. Publications Mathématiques. 82: 133–168. doi:10.1007/BF02698639. S2CID 67824718.
5. Baryshnikov, Yuliy; Ghrist, Robert (2023-05-08). "Navigating the Negative Curvature of Google Maps". The Mathematical Intelligencer. doi:10.1007/s00283-023-10270-w. ISSN 0343-6993.
6. Charney, Ruth (1992), "Artin groups of finite type are biautomatic", Mathematische Annalen, 292: 671–683, doi:10.1007/BF01444642, S2CID 120654588
7. Stephen G.Brick (1993). "Quasi-isometries and ends of groups". Journal of Pure and Applied Algebra. 86 (1): 23–33. doi:10.1016/0022-4049(93)90150-R.
8. Day's first published use of the word is in his abstract for an AMS summer meeting in 1949, Means on semigroups and groups, Bull. A.M.S. 55 (1949) 1054–1055. Many text books on amenability, such as Volker Runde's, suggest that Day chose the word as a pun.
9. John Roe. Lectures on Coarse Geometry. American Mathematical Society, 2003. ISBN 978-0-8218-3332-2
10. Cornelia Druţu and Mark Sapir (with an Appendix by Denis Osin and Mark Sapir), Tree-graded spaces and asymptotic cones of groups. Topology, Volume 44 (2005), no. 5, pp. 959–1058.