In this post I’ll talk about a lovely paper by Sebastian Hensel, Piotr Przytycki and Richard Webb. They show that all curve graphs are 17-hyperbolic. Hyperbolicity of curve graphs is a very very very useful* property because mapping class groups act nicely on them, so you can prove all sorts of things using this action.
The proofs available before HPW were quite complicated and relied on Teichmüller theory, so I was quite amazed to see that this could be proven in 6 self-contained pages. And, as the authors pointed out to me: “Well, there’s one page of introduction and one page of references.”
This post is an illustrated guide to the proof. I won’t define arc/curve complexes here, but I plan to write a BI soon. The more loudly you complain, the sooner I will actually do.
Ok, let’s start. First of all, as it turns out it’s more convenient to deal with arc graphs instead of curve graphs.
Reduction to the arc graph. (Really, just skip this 😀 ) Here’s a very quick sketch of how to deduce hyperbolicity of curve graphs once we know it for arc graphs, which for the moment we assume we do.
If we are dealing with a (complicated) surface with boundary then the idea we can use is that one can construct a path in the curve complex starting from a path in the arc complex by considering curves disjoint from the arcs appearing along (it will be clearer later how to exploit this, if you don’t know how to do it already). I’ll be honest, just this one time: There is a subtle issue I’m sweeping under the carpet here, but I would like not to make the post too technical…
Anyway, suppose instead that your surface, , is closed. If you call the surface obtained by adding a boundary component, then you have a boundary-forgetting map. This map is Lipschitz, this is immediate, and has a section, constructed as follows. Choose a hyperbolic metric on and realise all (homotopy classes of) curves as geodesics. Now you can take a puncture outside the union of all such (countably many) geodesics. Using the two properties it’s not hard to see that the curve graph of must be hyperbolic as well. The details are in section 5 of the paper.
Unicorns! Ok, let’s now take an arc graph. The strategy to show it’s hyperbolic is to prove that, as David puts it, “it smells hyperbolic”**, i.e. that there exists a family of preferred paths with nice properties (you may wish to take a look at this post 🙂 ). The most important property that this family should satisfy is that triangles of preferred paths should be slim. The other properties you need (in simplified form) are that a preferred path is a geodesic if the endpoints have distance at most 1 and that a subpath of a preferred path is a preferred path.
HPW called the nice paths they constructed unicorn paths (!). They were initially called one-corner paths, but then Piotr realised that one-corner and unicorn are almost the same word in Polish, and that unicorn would be a much more awesome name.
And now, here are the paths. You have to start with two arcs in minimal position, and , and it’s convenient to fix preferred endpoints, and . We can assume that intersect minimally. The arcs appearing along the path from to , the unicorn arcs, have a rather simple form: You travel along until you reach some intersection point, , and then you go to .
Not all intersection points work, because the procedure described above might not give an embedded arc (look at , for example).
Let us also include and in the collection of unicorn arcs. So, given you have finitely many arcs, and there is a natural order on them: You write if the common subpath of and is longer than the common subpath of and . The idea is that you are describing a path from to , so the paths more closely resembling should appear first.
Now, we have to check that we actually described a path, i.e. that if is the successor of then can be realised disjointly.
The recipe to construct the successor is simple. Let be the intersection point defining , and let be the subpath of from to . Just travel along after until you hit in some point . Then it’s not hard to convince yourself that defines .
The picture also illustrates how to realise disjointly.
Slim unicorns! And here is the cool part. Unicorn triangles are 1-slim, i.e. given and a unicorn arc , defined by , on the unicorn path from to there is a point on at distance at most 1 from . The proof is very easy, just travel along until you hit , then go to or , whichever you can reach avoiding .
The picture hopefully clearly illustrates that the unicorn arc we just constructed can be realised disjointly from .
The authors told me that the initial argument for 1-slimness of triangles was based on their dismantlability, you may wish to take a look at this paper.
The technical bit. You need one more property to show that arc graphs are hyperbolic and unicorn paths are close to geodesics, that is to say that a subpath of a unicorn path is a unicorn path. Well, this is not actually true, sometimes you can have a subpath of a unicorn path of length 2 connecting points at distance 1 in the arc graph. But that’s the only bad thing that can happen, and this is good enough for us.
Stare at the recipe I told you about earlier to construct the successor. Done? It might now seem to you that if you have two unicorn arcs constructed from , the recipe will give you exactly the same successor of regardless of whether you work “between and ” or “between and .” So… what’s the problem? The problem is that might not be in minimal position! 😦
So you have to understand when they don’t intersect minimally (Sublemma 3.6 in the paper). You can reduce to the case and the predecessor of , once again because of the recipe for the successor. The predecessor of is the unicorn arc travelling as little as possible along , so you just have to find the first intersection point of along .
(Yes, there’s a reason why I’ve drawn the picture in that weird way, see below 😉 )
Let me recall that two arcs are in minimal position if there are no bigons or half bigons:
Now, there cannot be a bigon between and , for otherwise you can easily convince yourself that there would be one between and . Similarly, you can only have a half-bigon if appears on it:
So, if there is a half-bigon, then it must look like this:
So, you have a very good control on what can go wrong. I won’t go into details but I hope that you’ll find it reasonable to believe that it’s possible to deal with this problem.
And that’s the end 🙂
Let me add the comment that Lemma 3.4, which I didn’t go into, is there just to get a better constant at the end, but without it you can prove, say, 19-hyperbolicity.
The lemma says that given 3 unicorn paths forming a triangle you can find a triple of points on them at pairwise distance at most 1. If you allow yourself to substitute 1 with 3, this follows from what we already know. In fact, suppose you start at and move towards . At first, you’ll be 1-close to , and at some point you’ll be 1-close to . When the switch happens, you have the 3 points you’re looking for. Btw, analysing this idea gives you a way of finding your candidate points at pairwise distance 1.
*David Hume was next to me when I wrote this and said “I have a paper that relies on that, so I’m not going to argue.”
** David suggested I add “I would like to thank David for being so quotable.”
Pingback: An even shorter proof that curve graphs are hyperbolic | Alex Sisto
I’ve already started to learn about curves complex. My advisor told me about your blog and I find it really really helpful. May I ask you a silly question about this post? You define inequality in this way:
“You write c<c' if the common subpath of c and a is longer than the common subpath of c' and a."
But in the recipe below the common subpath of c' and a is longer than the common subpath of c and a. Is it just a change of convention?
Thanks for your feedback! You’re right, I’ll correct it.