Posts Tagged ‘train track’

A train track on twice punctured torus

April 22, 2012

This is a non-technical post about how I started off trying to prove a lemma and ended up painting this:

One of my favorite books of all time is Thurston‘s ‘Geometry and Topology of 3-manifolds‘ (and I just can’t resist to add here, Thurston, who happen to be my academic grandfather, is in my taste simply the coolest mathematician on earth!) Anyways, for those of you who aren’t topologists, the book is online and I have also blogged about bits and parts of it in some old posts such as this one.

I still vividly remember the time I got my hands on that book for the first time (in fact I had the rare privilege of reading it from an original physical copy of this never-actually-published book, it was a copy on Amie‘s bookshelf, which she ‘robbed’ from Benson Farb, who got it from being a student of Thurston’s here at Princeton years ago). Anyways, the book was darn exciting and inspiring; not only in its wonderful rich mathematical content but also in its humorous, unserious attitude — the book is, in my opinion, not an general-audience expository book, but yet it reads as if one is playing around just to find out how things work, much like what kids do.

To give a taste of what I’m talking about, one of the tiny details which totally caught my heart is this page (I can’t help smiling each time when flipping through the book and seeing the page, and oh it still haunts me >.<):

This was from the chapter about Kleinian groups, when the term ‘train-track’ was first defined, he drew this image of a train(!) on moving on the train tracks, even have smoke steaming out of the engine:

To me such things are simply hilarious (in the most delightful way).

Many years passed and I actually got a bit more into this lamination and train track business. When Dave asked me to ‘draw your favorite maximal train track and test your tube lemma for non-uniquely ergodic laminations’ last week, I ended up drawing:

Here it is, a picture of my favorite maximal train track, on the twice punctured torus~! (Click for larger image)

Indeed, the train is coming with steam~

Since we are at it, let me say a few words about what train tracks are and what they are good for:

A train track (on a surface) is, just as one might expect, a bunch of branches (line segments) with ‘switches’, i.e. whenever multiple branches meet, they must all be tangent at the intersecting point, with at least one branch in each of the two directions. By slightly moving the switches along the track it’s easy to see that generic train track has only switches with one branch on one side and two branches on the other.

On a hyperbolic surface S_{g,p}, a train track is maximal if its completementry region is a disjoint union of triangles and once punctured monogons. i.e. if we try to add more branches to a maximal track, the new branch will be redundant in the sense that it’s merely a translate of some existing branch.

As briefly mentioned in this post, train tracks give natural coordinate system for laminations just like counting how many times a closed geodesic intersect a pair of pants decomposition. To be slightly more precise, any lamination can be pushed into some maximal train track (although not unique), once it’s in the track, any laminations that’s Hausdorff close to it can be pushed into the same track. Hence given a maximal train track, the set of all measured laminations carried by the train track form an open set in the lamination space, (with some work) we can see that as measured lamination they are uniquely determined by the transversal measure at each branch of the track. Hence giving a coordinate system on \mathcal{ML})(S).

Different maximal tracks are of course them pasted together along non-maximal tracks which parametrize a subspace of \mathcal{ML}(S) of lower dimension.

To know more about train tracks and laminations, I highly recommend going through the second part of Chapter 8 of Thurston’s book. I also mentioned them for giving coordinate system on the measured lamination space in the last post.

In any case I shall stop getting into the topology now, otherwise it may seem like the post is here to give exposition to the subject while it’s actually here to remind myself of never losing the Thurston type childlike wonder and imagination (which I found strikingly larking in contemporary practice of mathematics).

A report from the Workshop in Geometric Topology @ Utah (part 1)

May 29, 2011

I went to Park City this passed week for the Workshop in Geometric Topology. It was a quite cool place filled with ski-equipment stores, Christmas souvenir shops, galleries and little wooden houses for family winter vacations. Well, as you may have guessed, the place would look very interesting in summer. :-P

As the ‘principal speaker’, Professor Gabai gave three consecutive lectures on his ending lamination space paper (this paper was also mentioned in my last post). I would like to sketch some little pieces of ideas presented in perhaps couple of posts.

Classification of simple closed curves on surfaces

Let S_{g,p} denote the (hyperbolic) surface of genus g and p punchers. There is a unique geodesic loop in each homotopy class. However, given a geodesic loop drew on the surface, how would you describe it to a friend over telephone?

Here we wish to find a canonical way to describe homotopy classes of curves on surfaces. This classical result was originally due to Dehn (unpublished), but discovered independently by Thurston in 1976. For simplicity let’s assume for now that S is a closed surface of genus g.

Fix pants decomposition \mathcal{T} of S, \mathcal{T} = \{ \tau_1, \tau_2, \cdots, \tau_{3g-3} \} is a disjoint union of 3g-3 ‘cuffs’.

As we can see, any simple closed curve will have an (homology) intersection number with each of the cuffs. Those numbers are non-negative integers:

Around each cuff we may assign an integer twist number, for a cuff with intersection number n and twist number z, we ‘twist’ the curve inside a little neighborhood of the cuff so that all transversal segments to the cuff will have z intersections with the curve.

Negative twists merely corresponds to twisting in the other direction:

Theorem: Every simple closed curve is uniquely defined by its intersection number and twisting number w.r.t each of the cuffs.

Conversely, if we consider multi-curves (disjoint union of finitely many simple closed curves) then any element in \mathbb{Z}^{3g-3} \times \mathbb{Z}_{\geq 0}^{3g-3} describes a unique multi-curve.

To see this we first assume that the pants decomposition comes with a canonical ‘untwisted’ curve connecting each pairs of cuffs in each pants. (i.e. there is no god given ‘0’ twist curves, hence we have to fix which ones to start with.)

In the example above our curve was homotopic to the curve ((1,2), (2,1), (1,-4)).

In other words, pants decompositions (together with the associated 0-twist arcs) give a natural coordinate chart to the set of homotopy class of (multi) curves on a surface. i.e. they are perimetrized by \mathbb{Z}^{3g-3} \times \mathbb{Z}_{\geq 0}^{3g-3}.

For the converse, we see that any triple of integers can be realized by filling the pants with a unique set of untwisted arcs:

In fact, this kind of parametrization can be generalized from integers to real numbers, in which case we have measured laminations instead of multi-curves and maximal train trucks on each pants instead of canonical untwisted arcs. i.e.

Theorem: (Thurston) The space of measured laminations \mathcal{ML}(S) on a surface S of genus g is parametrized by \mathbb{R}^{3g-3} \times \mathbb{R}_{\geq 0}^{3g-3}. Furthermore, the correspondence is a homeomorphism.

Here the intersection numbers with the cuffs are wrights of the branches of the train track, hence it can be any non-negative real number. The twisting number is now defined on a continuous family of arcs, hence can be any real number, as shown below:

As we can see, just as in the case of multi-curves, any triple of real numbers assigned to the cuffs can be realized as the weights of branches of a train track on the pants.