Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 143 2 b Solution 2026-10-03
A map is a quasi-isometry if there are and such thatfor all , and every point of lies within distance of . The Milnor–Švarc lemma says that a group acting properly discontinuously, cocompactly and isometrically on a proper geodesic metric space is finitely generated, and each orbit map from a word metric is a quasi-isometry.
Now let be finite generating sets of . PutReplacing each letter in an -word by a -word and conversely givesThus the identity map is a bilipschitz equivalence, hence a quasi-isometry. All finite generating sets of a finitely generated group give quasi-isometric Cayley graphs.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 133 3 c Solution Created 2026-09-24 Updated 2026-09-25
The relations and say that conjugation by either or sends to . Thus is a normal subgroup of order at most . Quotienting by it givesthe orientation-preserving hyperbolic triangle group . This group acts properly discontinuously and cocompactly by isometries on the hyperbolic plane. The Milnor–Švarc lemma therefore makes quasi-isometric to .
The quotient map has finite kernel, so part (b), equivalently the finite-kernel quotient quasi-isometry, makes quasi-isometric to . By transitivity of quasi-isometry,
Past exam of the mathematics course of the University of Cambridge 2025 iii Paper 133 1 c Solution Created 2026-09-24 Updated 2026-09-25
The infinite dihedral group is , with factors and . Its Bass-Serre tree has vertex setand one edge indexed by each , joining to . Since both factors have order two, every vertex has degree two. The connected tree is therefore a bi-infinite line.
The action is cocompact, and its vertex stabilizers are the finite conjugates of and , so it is proper. By the Milnor–Švarc lemma, an orbit map from with a word metric to this line is a quasi-isometry. A simplicial bi-infinite line is quasi-isometric to , hence so is .
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 133 4 a Solution Created 2026-09-24 Updated 2026-10-03
Let be a -quasi-isometry to a tree. The image under of every geodesic segment in is a -quasigeodesic in . By the Morse lemma for quasi-geodesics, it lies within a constant of the tree geodesic with the same endpoints.
Consider a geodesic triangle in . A point on one side maps within of the corresponding side of the comparison triangle in . Every geodesic triangle in a tree is -thin, so that comparison side is contained in the other two sides. Those two tree sides are in turn within of the images of the other two sides of the original triangle. Hence some point on one of those sides satisfiesThe lower quasi-isometry inequality givesThus is Gromov-hyperbolic metric space with .
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 133 4 d Solution Created 2026-09-24 Updated 2026-09-25
Fix a hyperbolicity constant for . For a prescribed , scale its distance byAll distances in every geodesic triangle, including its thinness constant, scale by . Henceis -hyperbolic. Multiplication of a metric by a fixed positive constant is a bilipschitz equivalence and hence a quasi-isometry. Therefore is quasi-isometric to and cannot be a quasi-tree. This supplies an example for every .
Quasi-inverse of a quasi-isometry 2026-10-14
For a quasi-isometry with multiplicative constant and additive/coarse-surjectivity constant , choose with . The triangle inequality and the two distortion inequalities giveAlso . Hence is a quasi-isometry and both composites stay uniformly close to their respective identities. No continuity is required.
Quasi-isometric embedding Created 2026-09-24 Updated 2026-09-24
A quasi-isometric embedding satisfies the two-sided coarse distance inequality in the definition of quasi-isometry, without requiring its image to be coarsely dense.
For finitely generated groups , a group homomorphism is a quasi-isometry exactly when its kernel is finite and its image is a finite-index subgroup of . The finite kernel controls collapse of distances, and finite index is exactly the coarse-surjectivity condition.