16
$\begingroup$

I am curious to see if anyone knows a proof of the Nielsen-Thurston classification of mapping classes that does not depend on results in Teichmuller theory.

From a naive point of view, translation distances in the curve complex should serve the same purpose as translation distances in Teichmuller space. For instance, if a mapping class fixes a simplex setwise, then it's reducible (actually, reducibles look much simpler from this point of view). Similarly, a mapping class is pseudo-Anosov iff its stable translation length in the curve complex is strictly positive -- but can one prove this without quoting results of Masur-Minsky that need Teichmuller theory anyhow?

$\endgroup$

3 Answers 3

9
$\begingroup$

Masur and Minsky, in their paper "Quasiconvexity in the curve complex", give a purely combinatorial proof that certain "nested" train track sequences project to quasigeodesics in the curve complex. It follows from this, without too much more trouble, that a pseudo-Anosov mapping class has positive stable translation length. Teichmuller theory is not used in this proof.

-----edited after Dave Futer’s comment-----

Here's an argument for the converse, following Dave's suggestion to use Klarreich's boundary. Suppose that $\phi \in MCG(S)$ has positive translation length. So $\phi$ has a unique attracting/repelling pair of fixed points on the Gromov boundary of the curve complex. By Klarreich's theorem, this is a pair of measureable but measureless singular foliations $F_1,F_2$, each of which is arational. They are unequal in the Gromov boundary, so by Klarreich's theorem they are inequivalent (with respect to isotopy and Whitehead moves), and so they can be realized on the surface as a transverse pair of foliations. And there is an actual homeomorphism $\Phi$ in the mapping class $\phi$ that preserves this pair of foliations. What's left is to construct transverse measures on these two foliations with the appropriate stretching properties. This situation occurs as a piece of the proof of Thurston's classification theorem in Fathi-Laudenbach-Poenaru, and the conclusion is that either $\Phi$ is a finite order mapping class or the desired transverse measures exist and $\Phi$ is a pseudo-Anosov homeomorphism. Finite order is ruled out by the assumption of positive translation length in the curve complex.

$\endgroup$
1
  • $\begingroup$ Thanks, Lee. What about the converse implication: positive stable translation length implies pseudo-Anosov? Does that require knowing e.g. Erica Klarreich's work? $\endgroup$
    – Dave Futer
    Mar 15, 2012 at 23:42
6
$\begingroup$

I don't know about the curve complex, but Bestvina-Handel (Train tracks for surface homeos, 1995) give a completely combinatorial/algorithmic proof, which, at a quick glance, never mentions teichmuller space)

$\endgroup$
2
  • 1
    $\begingroup$ Is there a reference for seeing---via Teichmuller theory---that the curve complex has infinite diameter? I mean, as opposed to nested train-tracks a la Masur/Minsky or Bowditch. $\endgroup$
    – JHM
    Mar 16, 2012 at 3:16
  • 1
    $\begingroup$ @jmart: Masur & Minsky give a short proof of infinite diameter that they attribute to Luo. See the parenthetical remark after the statement of Proposition 4.6 in "Geometry of the Curve Complex I". $\endgroup$
    – Lee Mosher
    Mar 16, 2012 at 4:17
2
$\begingroup$

Dave, you might find this interesting:

W. J. Harvey: On the Classification of Surface Homeomorphisms; Wayback Machine

(although this doesn't give the Nielsen-Thurston classification).

$\endgroup$
2
  • 2
    $\begingroup$ Dan, I believe that paper is flawed. For example, the 2nd paragraph of the proof of Theorem 2.3 is just wrong. $\endgroup$
    – Lee Mosher
    Jul 6, 2012 at 13:46
  • $\begingroup$ Thanks, Lee. I thought maybe I should have looked at it before posting. $\endgroup$ Jul 10, 2012 at 15:42

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.