Fix a hyperbolicity constant for . For a prescribed , scale its distance by
All distances in every geodesic triangle, including its thinness constant, scale by . Hence
is -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 .
The hyperbolic plane is a geodesic Gromov-hyperbolic metric space for some universal constant . It is not a quasi-tree. Indeed, for every , choose two points on opposite sides of a large closed metric ball centred at the midpoint of their joining geodesic. The complement of that ball in is path connected, so the endpoints can be joined by a continuous path that stays more than from the midpoint. Thus fails the bottleneck property, whereas part (b) shows that every quasi-tree satisfies it.
Retain the -quasi-isometry and the Morse lemma for quasi-geodesics constant . Given , let be the midpoint of a geodesic . There is a point on the tree geodesic with
For any continuous path from to , choose a partition fine enough that consecutive are at distance at most one. Consecutive images under are then at distance at most
Removing separates from in the tree along their geodesic, so this finite -chain must contain an element within of . For the corresponding ,
The lower quasi-isometry inequality yields
This constant depends only on the chosen quasi-isometry, so every quasi-tree has the bottleneck property.
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 satisfies
The lower quasi-isometry inequality gives
Thus is Gromov-hyperbolic metric space with .
Let be the common fixed subtree of the centre, which is nonempty by hypothesis and is -invariant because is central. Restrict the action to this subtree. There and act pointwise trivially, so the action factors through
In particular, the induced tree isometries satisfy
Assume, as usual for a combinatorial tree action, that edge inversions have been removed by barycentric subdivision. The finite-order elements are then elliptic. Moreover
so each pairwise product is elliptic. Serre lemma for tree actions implies that the fixed subtrees of each pair intersect. Convex subtrees of a tree have the Helly property, so
Since generate , fixes a vertex of . Thus the action of on is trivial in the tree-action sense.
A hyperbolic isometry of a tree has a unique invariant axis of a tree isometry, on which it acts by a nonzero translation. Let be the axis of . By part (c), is central, so for every ,
Thus is another axis of . Uniqueness gives , and hence the whole group preserves the line .
The equality and the relator show that commutes with both and . Since , it also commutes with , and then with . Hence . Similarly, commutes with and, by , with ; it therefore commutes with and . Thus
Quotienting by gives
A non-elementary Fuchsian group has trivial center: two hyperbolic elements with different pairs of boundary fixed points have only the identity in their common centralizer in . Therefore the image in the quotient of every element of is trivial. It follows that
Let
be the orientation-preserving hyperbolic triangle group. Define
Every defining relator of maps to the identity, and lie in the image, so this is a surjective group homomorphism. Since
is a non-elementary Fuchsian group.
Write the generators additively in the abelianization. The relators give
and
After substitution, the last relation becomes
The commutator relators disappear automatically, so
because . Explicitly, an isomorphism to sends
Use the amalgam from part (c), with edge group
An odd power of belongs to , because is the index-two translation subgroup of the Klein bottle group . Similarly, an odd power of belongs to . Thus
is a reduced alternating word whose syllables lie in and . The normal form theorem for an amalgamated free product says that every nonempty reduced alternating word is nonidentity. The displayed element is therefore nontrivial for every .
Introduce and . The two vertex groups
are Klein bottle groups. In , the subgroup is of index two; in , the subgroup is also of index two. Identifying
gives
Eliminating from this amalgamated free product recovers exactly the two given relators.
The Bass-Serre tree is bipartite with vertex sets and and edge set . Both edge-group inclusions have index two, so every vertex has degree two. The tree is therefore a bi-infinite line, with - and -type vertices alternating.
The relation is
so is the Klein bottle group. Let it act on by
These are Euclidean isometries and satisfy . Every element has a normal form . The orbit of is discrete, and a rectangle of finite size meets every orbit, so the action is proper and cocompact.
The square
is a vertical translation, while is a horizontal translation. They commute, and
as an isometry only when . Hence . The normal form shows that every element lies in either or , so this subgroup has index two in .
Choose a finite generating set for . Under the standard classification of connected covering spaces, each is represented by a based combinatorial loop in . Let be the union of the images of these finitely many finite edge paths. Then is a finite connected subgraph containing .
Part (b) makes the inclusion-induced map
injective. Its image contains every , because every lies in , and therefore contains the subgroup they generate, namely all of . The map is consequently an isomorphism.
Whenever a combinatorial loop traverses an oriented edge and immediately traverses the same edge backwards, delete that backtracking pair. Each deletion is a homotopy relative to endpoints inside and reduces the edge length by two, so the process terminates at a reduced, hence locally injective, combinatorial loop .
The universal cover of a connected graph is a tree. The lift is also locally injective because a covering map is a local graph isomorphism. A locally injective edge path in a tree cannot repeat a vertex: the segment between two successive visits would be a nonempty reduced closed path, whereas every closed path in a tree backtracks. Thus is injective unless is constant.
Now let a loop in become null-homotopic in . Its reduced representative lifts to a closed path in . The preceding injectivity forces that lift, and hence , to be constant. The original loop is null-homotopic in , proving that
is an injective group homomorphism.
Suppose for a contradiction that carries a complete Ricci-flat metric. Since is closed, the two subsets and are different unbounded components outside the compact set . Thus is disconnected at infinity and, by part (a), contains a line in a Riemannian manifold.
Its Ricci curvature is zero, so the Cheeger-Gromoll splitting theorem gives an isometry
The product Ricci tensor shows that is a complete three-dimensional Ricci-flat manifold. By the allowed fact, is flat, and hence so is .
The universal cover of a complete flat manifold is complete, simply connected, and has zero sectional curvature. The Hadamard-Cartan theorem therefore identifies it diffeomorphically with , so it is contractible. On the other hand, the universal cover of the product is
which deformation retracts onto . It is contractible only if is contractible, contrary to the hypothesis. Hence no such complete Ricci-flat metric exists.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact