HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a quasi-isometry is a function between two
metric space In mathematics, a metric space is a Set (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
s 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 In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...
on the
class Class, Classes, or The Class may refer to: Common uses not otherwise categorized * Class (biology), a taxonomic rank * Class (knowledge representation), a collection of individuals or objects * Class (philosophy), an analytical concept used d ...
of metric spaces. The concept of quasi-isometry is especially important in geometric group theory, following the work of Gromov.


Definition

Suppose that f is a (not necessarily continuous) function from one metric space (M_1,d_1) to a second metric space (M_2,d_2). Then f is called a ''quasi-isometry'' from (M_1,d_1) to (M_2,d_2) if there exist constants A\ge 1, B\ge 0, and C\ge 0 such that the following two properties both hold:P. de la Harpe, ''Topics in geometric group theory''. Chicago Lectures in Mathematics. University of Chicago Press, Chicago, IL, 2000. #For every two points x and y in M_1, the distance between their images is up to the additive constant B within a factor of A of their original distance. More formally: #:\forall x,y\in M_1: \frac\; d_1(x,y)-B\leq d_2(f(x),f(y))\leq A\; d_1(x,y)+B. #Every point of M_2 is within the constant distance C of an image point. More formally: #:\forall z\in M_2:\exists x\in M_1: d_2(z,f(x))\le C. The two metric spaces (M_1,d_1) and (M_2,d_2) are called quasi-isometric if there exists a quasi-isometry f from (M_1,d_1) to (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, (M_1,d_1) is quasi-isometric to a subspace of (M_2,d_2). Two metric spaces ''M1'' and ''M2'' are said to be quasi-isometric, denoted M_1\underset M_2 , if there exists a quasi-isometry f:M_1\to M_2.


Examples

The map between the
Euclidean plane In mathematics, a Euclidean plane is a Euclidean space of Two-dimensional space, dimension two, denoted \textbf^2 or \mathbb^2. It is a geometric space in which two real numbers are required to determine the position (geometry), position of eac ...
and the plane with the
Manhattan distance Taxicab geometry or Manhattan geometry is geometry where the familiar Euclidean distance is ignored, and the distance between two point (geometry), points is instead defined to be the sum of the absolute differences of their respective Cartesian ...
that sends every point to itself is a quasi-isometry: in it, distances are multiplied by a factor of at most \sqrt 2. Note that there can be no isometry, since, for example, the points (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 f:\mathbb^n\to\mathbb^n (both with the
Euclidean metric In mathematics, the Euclidean distance between two points in Euclidean space is the length of the line segment between them. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem, and therefore is oc ...
) that sends every n-tuple of integers to itself is a quasi-isometry: distances are preserved exactly, and every real tuple is within distance \sqrt 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 \sqrt of it, so rounding changes the distance between pairs of points by adding or subtracting at most 2\sqrt. 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 f:M_1\mapsto M_2 is a quasi-isometry, then there exists a quasi-isometry g:M_2\mapsto M_1. Indeed, g(x) may be defined by letting y be any point in the image of f that is within distance C of x, and letting g(x) be any point in f^(y). Since the
identity map Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, unc ...
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 In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...
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 In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a Graph (discrete mathematics), graph that encodes the abstract structure of a group (mathematics), group. Its definition is sug ...
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. 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 Index (: indexes or indices) may refer to: Arts, entertainment, and media Fictional entities * Index (''A Certain Magical Index''), a character in the light novel series ''A Certain Magical Index'' * The Index, an item on the Halo Array in the ...
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.


Quasigeodesics and the Morse lemma

A ''quasi-geodesic'' in a metric space (X, d) is a quasi-isometric embedding of \mathbb R into X. More precisely a map \phi: \mathbb R \to X such that there exists C,K > 0 so that :\forall s, t \in \mathbb R : C^ , s - t, - K \le d(\phi(t), \phi(s)) \le C, s - t, + K is called a (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 \delta, C, K > 0 and X a proper δ-hyperbolic space. There exists M such that for any (C, K)-quasi-geodesic \phi there exists a geodesic L in X such that d(\phi(t), L) \le M for all 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 Google Maps is a web mapping platform and consumer application offered by Google. It offers satellite imagery, aerial photography, street maps, 360° interactive panorama, interactive panoramic views of streets (Google Street View, Street View ...
.


Examples of quasi-isometry invariants of groups

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


Hyperbolicity

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

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 In mathematics, an element x of a ring (mathematics), ring R is called nilpotent if there exists some positive integer n, called the index (or sometimes the degree), such that x^n=0. The term, along with its sister Idempotent (ring theory), idem ...
subgroup In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G. Formally, given a group (mathematics), group under a binary operation  ...
of finite
index Index (: indexes or indices) may refer to: Arts, entertainment, and media Fictional entities * Index (''A Certain Magical Index''), a character in the light novel series ''A Certain Magical Index'' * The Index, an item on the Halo Array in the ...
. In particular, the order of polynomial growth k_0 has to be a
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
and in fact \#(n)\sim n^. If \#(n) grows more slowly than any exponential function, ''G'' has a subexponential growth rate. Any such group is amenable.


Ends

The ends of a
topological space In mathematics, a topological space is, roughly speaking, a Geometry, geometrical space in which Closeness (mathematics), closeness is defined but cannot necessarily be measured by a numeric Distance (mathematics), distance. More specifically, a to ...
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 Infinity is something which is boundless, endless, or larger than any natural number. It is denoted by \infty, called the infinity symbol. From the time of the Ancient Greek mathematics, ancient Greeks, the Infinity (philosophy), philosophic ...
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 In algebra, a finitely generated group is a group ''G'' that has some finite generating set ''S'' so that every element of ''G'' can be written as the combination (under the group operation) of finitely many elements of ''S'' and of inverses o ...
are defined to be the ends of the corresponding
Cayley graph In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a Graph (discrete mathematics), graph that encodes the abstract structure of a group (mathematics), group. Its definition is sug ...
; 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. In particular, two quasi-isometric finitely generated groups have the same number of ends.


Amenability

An amenable group is a locally compact
topological group In mathematics, topological groups are the combination of groups and topological spaces, i.e. they are groups and topological spaces at the same time, such that the continuity condition for the group operations connects these two structures ...
''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 John von Neumann ( ; ; December 28, 1903 â€“ February 8, 1957) was a Hungarian and American mathematician, physicist, computer scientist and engineer. Von Neumann had perhaps the widest coverage of any mathematician of his time, in ...
in 1929 under the German name "messbar" ("measurable" in English) in response to the
Banach–Tarski paradox The Banach–Tarski paradox is a theorem in set-theoretic geometry, which states the following: Given a solid ball in three-dimensional space, there exists a decomposition of the ball into a finite number of disjoint subsets, which can then ...
. In 1949 Mahlon M. Day introduced the English translation "amenable", apparently as a pun. In discrete group theory, where ''G'' has the
discrete topology In topology, a discrete space is a particularly simple example of a topological space or similar structure, one in which the points form a , meaning they are '' isolated'' from each other in a certain sense. The discrete topology is the finest to ...
, 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

An ultralimit is a geometric construction that assigns to a sequence of
metric space In mathematics, a metric space is a Set (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
s ''Xn'' 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 \mathbb N and let ''pn'' âˆˆ ''X'' be a sequence of base-points. Then the ''ω''–ultralimit of the sequence (X, \frac, p_n) is called the asymptotic cone of ''X'' with respect to ''ω'' and (p_n)_n\, and is denoted Cone_\omega(X,d, (p_n)_n)\,. One often takes the base-point sequence to be constant, ''pn'' = ''p'' for some ''p ∈ X''; in this case the asymptotic cone does not depend on the choice of ''p ∈ X'' and is denoted by Cone_\omega(X,d)\, or just 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.John Roe. ''Lectures on Coarse Geometry.''
American Mathematical Society The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, ...
, 2003.
Asymptotic cones also turn out to be a useful tool in the study of relatively hyperbolic groups and their generalizations. Cornelia DruĹŁu and Mark Sapir (with an Appendix by Denis Osin and Mark Sapir), ''Tree-graded spaces and asymptotic cones of groups.''
Topology Topology (from the Greek language, Greek words , and ) is the branch of mathematics concerned with the properties of a Mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformat ...
, Volume 44 (2005), no. 5, pp. 959–1058.


See also

*
Isometry In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' me ...
*
Coarse structure In the mathematical fields of geometry and topology, a coarse structure on a set ''X'' is a collection of subsets of the cartesian product ''X'' × ''X'' with certain properties which allow the ''large-scale structure'' of metric spaces and topolo ...


References

{{Metric spaces Equivalence (mathematics) Geometric group theory Metric geometry