FUNDAMENTA MATHEMATICAE 158 (1998)
Mapping class group of a handlebody
by
Bronislaw W a j n r y b (Haifa)
Abstract. Let B be a 3-dimensional handlebody of genus g. Let M be the group of the isotopy classes of orientation preserving homeomorphisms of B. We construct a 2-dimensional simplicial complex X, connected and simply-connected, on which M acts by simplicial transformations and has only a finite number of orbits. From this action we derive an explicit finite presentation of M.
We consider a 3-dimensional handlebody B = Bg of genus g > 0. We may think of B as a solid 3-ball with g solid handles attached to it (see Figure 1). Our goal is to determine an explicit presentation of the map- ping class group of B, the group Mg of the isotopy classes of orientation preserving homeomorphisms of B. Every homeomorphism h of B induces a homeomorphism of the boundary S = ∂B of B and we get an embedding of Mg into the mapping class group MCG(S) of the surface S.
z-axis
α α α α 1 2 i i+1 . . . . . . β β 1 2 ε x-axis i δ -2, i
Fig. 1. Handlebody
An explicit and quite simple presentation of MCG(S) is now known, but it took a lot of time and effort of many people to reach it (see [1], [3], [12],
1991 Mathematics Subject Classification: 20F05, 20F38, 57M05, 57M60. This research was partially supported by the fund for the promotion of research at the Technion.
[195] 196 B.Wajnryb
[9], [7], [11], [6], [14]). The main step towards an explicit presentation of MCG(S) was done by Hatcher and Thurston in [7] where they constructed a connected and simply-connected cellular complex—a cut-system complex of S—on which MCG(S) acts by cellular transformations with a finite number of orbits and well understood stabilizers. A presentation of MCG(S) was ob- tained from this action by methods described more explicitly by Laudenbach [11]. The presentation was simplified by Harer [6], and further simplified by Wajnryb [14]. No presentation of Mg has been known until now. A finite set of genera- tors for Mg was first obtained by Suzuki [13]. It was quite similar to the set of generators in our Theorem 18, the main result of this paper. The group Mg has an infinite index in MCG(S) so the knowledge of MCG(S) does not help directly in the investigation of Mg. However, we apply the main idea of Hatcher and Thurston and construct a simplicial, 2-dimensional cut-system complex X of B, similar to the cut-system complex of S, on which Mg acts by simplicial transformations. We prove by a direct method, quite differ- ent from the method of Hatcher and Thurston, that X is connected and simply-connected. We describe the orbits of the action of Mg on vertices, edges and faces of X. Mg acts transitively on vertices and has only a fi- nite number of edge-orbits and face-orbits. We describe the stabilizer of a vertex and the stabilizer of each edge and then apply the ideas from [7] and [11] to obtain an explicit presentation of Mg (Theorem 18). We follow the Master dissertation of Michael Heusner [8] in which the method of [7] and [11] was very clearly and precisely explained. Unfortunately, an explicit presentation of Mg (Theorem 18) obtained in this way is still rather long and complicated.
1. Cut-system complex. In this section we construct the complex X and prove that it is connected and simply-connected. Let B be a handlebody of genus g and let S be the boundary of B. By a curve on S we always mean a simple closed curve. A curve α is a meridian curve if it bounds a disk D in B such that D ∩ S = ∂D = α. Then D is called a meridian disk. If α is a meridian curve, non-separating on S, and if we cut B along a corresponding meridian disk D, we get a handlebody B′ of genus g − 1. On the boundary of B′ we have two copies of D—two distinguished disks. For the purpose of induction on genus we shall consider a handlebody B with a finite number of disjoint distinguished disks on its boundary S and we shall assume that all homeomorphisms and all isotopies of S are fixed on the distinguished disks. If we have disjoint meridian curves on S we can construct pairwise disjoint meridian disks. We start with disks D1 and D2 and put D2 into general position with respect to D1. Then they intersect along disjoint circles. Consider an inner- Mapping class group of a handlebody 197 most circle C on D1. It bounds a disk A1 in D1. It also bounds a disk A2 in D2. Since C is innermost on D1 the disk A1 does not meet D2 outside C. In particular A1 and A2 meet only at their common boundary C. Their union forms a sphere. Since B is irreducible the sphere bounds a 3-ball. We can push A2 across the 3-ball off A1. By induction we can get rid of all the intersection of D1 and D2. Now we keep D1 and D2 fixed and deform D3 to make it disjoint from the other two disks, and so on. A cut-system on S is an isotopy class of an unordered collection of g disjoint meridian curves α1,...,αg which are linearly independent in the homology group H1(B) and are disjoint from the distinguished disks. When we cut B open along the corresponding disjoint meridian disks we get a 3- ball. We denote a cut-system by hα1,...,αgi. We say that two cut-systems are related by a simple move if they have g − 1 curves in common and the other two curves are disjoint. To simplify notation we drop the symbols for ′ unchanging circles, e.g. hαii → hαii means that the curve αi of a cut-system ′ is replaced by a meridian curve αi and the other g−1 curves of the cut-system ′ do not change. It also means that αi is disjoint from all the curves of the cut-system and that the new collection of curves forms a new cut-system. We construct a 2-dimensional complex X. The vertices of X are the cut- systems on S. Two cut-systems are connected by an edge if they are related by a simple move. If three vertices of X have g − 1 curves in common and the three remaining curves, one from each cut-system, are pairwise disjoint, then each pair of the vertices is connected by an edge in X and the vertices form a triangle, a closed edge-path with three edges. We glue a face to every triangle and get a 2-dimensional simplicial complex X. The complex X is called the cut-system complex of the handlebody B. The main result of this section is the following Theorem 1. The cut-system complex X is connected and simply-con- nected. A homeomorphism h of B onto itself takes a meridian disk to a meridian disk. It takes a cut-system to a cut-system. If we let hhα1,...,αgi = hh(α1),...,h(αg )i we get an action of the mapping class group Mg on the vertices of X. The action also takes vertices connected by an edge to vertices connected by an edge, so it is a simplicial action. Every curve on S is ambient-isotopic to a PL-curve (piecewise-linear). We may assume that all curves in this paper are PL and that in the given, finite collection of curves different curves intersect only in a finite number of points, transversely, and no point belongs to three or more curves. We denote the number of intersection points of α and β by |α ∩ β|. We want to prove that X is simply-connected. We start with a fixed closed edge-path and want to prove that it is null-homotopic in X, i.e. it decomposes into a 198 B.Wajnryb sum of triangles. We fix a particular collection of curves representing each vertex and assume that all curves of all these collections intersect trans- versely at a finite number of points and no point belongs to more than two curves. We may later introduce new curves subject to the same conditions. We first consider the case of genus g = 1. If B is a solid torus than all non-trivial (not contractible on S) meridian curves on the boundary S of B are isotopic. A cut-system is an isotopy class of a single meridian curve and thus X consists of a single point. But if there are distinguished disks on S, which we need for the induction purpose, then different meridian curves may be non-isotopic in the complement of the distinguished disks and they may intersect essentially. In that case the complex X may be quite complicated. We say that two meridian curves α and β on S form a 2-gon if there is a disk (a 2-gon) in S bounded by an arc of α and an arc of β. A 2-gon may contain distinguished disks inside. A collection of curves forms a 2-gon if a pair of curves of this collection form a 2-gon. In that case a minimal 2-gon is one which does not contain another 2-gon inside. If α and β form a minimal 2-gon then any other curve of the collection crosses the 2-gon along arcs which meet each of the curves α and β once. If two curves on S are homotopic and not disjoint then they form a 2-gon (see [5]). Lemma 2. If g = 1 then X is connected. Proof. Let α and β be two meridian curves on S. They are homotopic, so if they are not disjoint they form a 2-gon. Consider a minimal 2-gon, say bounded by arcs a and b of α and β respectively. If we replace the arc a of α by the arc b we get a new curve α′ homotopic to α on S (see Figure 2). Then α′ is a meridian curve, |α ∩ α′| = 0 and |β ∩ α′| < |β ∩ α|. It follows by induction on |α ∩ β| that α and β can be connected by a sequence of curves such that the consecutive curves are disjoint, and thus connected by an edge in X.
Fig. 2. The curves α and β form a 2-gon
Lemma 3. Let g = 1 and let p = {α1,...,αk} be a closed edge-path in ′ ′ ′ X, i.e. α1 = αk. There exists another closed edge-path p = {α1,...,αk} ′ ′ homotopic to p in X and such that the collection of curves α1,...,αk forms no 2-gons. Mapping class group of a handlebody 199
P r o o f. Consider a minimal 2-gon. Suppose it is formed by arcs a and b of curves αi and αj respectively. If we replace b by a (as in Figure 2) we ′ get a new curve αj , homotopic to αj on S and disjoint from αj . So it is ′ a meridian curve and represents a vertex in X. Also |αj ∩ αi| < |αj ∩ αi|. ′ By a previous remark, αj does not form any new intersections with other curves so it is also disjoint from αj−1 and αj+1 and is connected by edges to ′ αj−1, αj, and αj+1. When we replace αj by αj we get a new edge-path and the difference between it and the old path is a sum of two triangles. Thus the new path is homotopic to p in X and its curves intersect in a smaller number of points. Lemma 3 follows by induction. Lemma 4. If g = 1 then X is simply-connected. P r o o f. Consider a closed edge-path in X. We want to prove that it can be decomposed into a sum of triangles. By the previous lemma we may assume that it has no 2-gons. But meridian curves on a solid torus are homotopic. If there are no 2-gons then all curves are disjoint, and every pair is connected by an edge. In particular the edge-path is a sum of triangles as required. From now on we assume that B has genus g greater than 1. Induction Hypothesis 1. The cut-system complex of a handlebody of genus less than g is connected and simply-connected. Our next task is to prove that X is connected. We start with a lemma which will also be used later, in the proof that X is simply-connected, so it may seem unnecessarily complicated at this stage.
Lemma 5. Let α, β, γ1, γ2 be non-separating meridian curves on S such that |γ1 ∩ γ2| = k > 0, |γ1 ∩ α| < n, and |γ2 ∩ α| ≤ n. Then there exists a non-separating meridian curve δ such that |δ ∩ γ1| < k, |δ ∩ γ2| < k, and |δ ∩ α| Proof. We may put the meridian disks D1 and D2, bounded by γ1 and γ2 respectively, into general position. Then they intersect along disjoint arcs and circles. We can get rid of the circles of intersection by moving disks across 3-balls corresponding to innermost circles. Consider now an innermost arc d of the intersection (closest to the boundary) on D1. The ′ arc splits D1 into two disks. One of them, say D1, does not meet D2 (see ′ Figure 3). The disk D1 is bounded by d and by an arc c1 of γ1. The arc c1 contains m points of the curve α. Consider also a corresponding construction for an innermost arc on D2. Among all innermost arcs choose a “minimal” arc d, one for which the number m is minimal. If there are several such “minimal” arcs and one of them is innermost on D2 we choose that one. 200 B.Wajnryb γ 1 p " ' D 1 D 2 d ' D 1 c q 1 " D 2 γ 2 Fig. 3. Meridian disks of γ1 and γ2 Suppose first that the minimal arc d is innermost on D1 (see Figure 3). ′ Let p and q be the end points of d. The arc d also splits D2 into two disks D2 ′′ ′ ′′ and D2 bounded by d and by arcs c2 and c2 of γ2 respectively. These disks ′ ′ ′′ may intersect D1 but not inside D1. When we replace the arc c2 (or c2 ) of ′ ′′ γ2 by c1 we get a meridian curve δ (respectively δ ) on S which bounds ′ ′′ ′ ′ ′ ′′ a meridian disk D1 ∪ D2 (respectively D1 ∪ D2). We can push δ (or δ ) off itself on S, away from the intersections p and q, making it disjoint from ′ γ2. We get rid of the intersection points p and q at least, so |δ ∩ γ1| < k ′′ ′′ ′ and |δ ∩ γ1| < k. In the first homology group of S we have δ + δ = γ2. Since γ2 is non-separating, i.e. non-trivial in the homology group, one of the curves must be non-separating and we choose this curve for δ. The ′ ′′ disks D2 and D2 must contain innermost arcs (possibly d is innermost on ′ ′′ one or both disks), therefore both c2 and c2 meet α more than m times, by the minimality condition on d. We traded such an arc of γ2 for the arc c1, therefore |δ ∩ α| Lemma 6. If v1 and v2 are vertices in X which have one or more curves in common then they can be connected by an edge-path of vertices in X all of which contain the common curves of v1 and v2. P r o o f. When we cut B open along the disjoint meridian disks bounded ′ by the common curves of v1 and v2 we get a handlebody B of a smaller genus and the remaining curves of v1 and v2 form two vertices of the cut-system Mapping class group of a handlebody 201 complex of B′. By Induction Hypothesis 1 there exists an edge-path p′ in this complex which connects the two vertices. When we add the common ′ curves of v1 and v2 to curves of each vertex of the edge-path p we get cut-systems on B which form an edge-path in X connecting v1 and v2. Lemma 7. If α and β are non-separating meridian curves then there exist vertices v1 and v2 of X which are connected by an edge-path in X (possibly v1 = v2) and contain the curves α and β respectively. P r o o f. We prove the lemma by induction on n = |α ∩ β|. Assume first that the curves are disjoint. If α ∪ β does not separate the surface S then the pair α, β can be completed to a cut-system on B representing a vertex v1 = v2. Suppose now that α∪β separates S. When we cut B along disjoint meridian disks bounded by α and β respectively we get two handlebodies B1 and B2. We choose a cut-system on each of the handlebodies. We get together g − 1 meridian curves. When we add α or β to these g − 1 curves we get two cut-systems on B which are related by a simple move. Assume now that n > 0. By Lemma 5 we can find a non-separating meridian curve γ with |γ ∩ α| < n and |γ ∩ β| < n. By the induction hypothesis there exists a vertex v1 of X containing α and connected by an edge-path to a vertex v3 containing γ. There also exists a vertex v4 containing γ and connected by an edge-path to a vertex v2 containing β. Finally, v3 and v4 are connected by an edge-path by Lemma 6. As an easy corollary we get Proposition 8. X is connected. Proof. If v1 is a vertex of X containing some curve α and v2 is a vertex of X containing some curve β then, by Lemma 7, there exist other vertices v3 and v4 connected by an edge-path and containing α and β respectively. By Lemma 6 we can connect v1 to v3 and v4 to v2 by edge-paths in X. We now proceed to prove that X is simply-connected. We define the distance between two curves α and β as their intersection number |α ∩ β|. The distance between a curve γ and a vertex hα1,...,αgi is equal to the minimum of the distances |γ ∩ αi|. The radius of an edge-path around a curve α is equal to the maximum of the distances from α to the vertices of the edge-path. A segment is a sequence of consecutive vertices of an edge-path which have a curve in common. We say it is an (α,β,...,γ)-segment if all vertices of the segment contain the curves (α,β,...,γ). The general idea of the proof is to start with a closed edge-path in X and reduce it to a sum of simpler edge-paths, and eventually to a sum of triangles, by induction on the radius of the edge-path around a fixed curve α and induction on the number of segments of maximal distance from α. 202 B.Wajnryb Lemma 9. A closed segment is null-homotopic. Proof. Wecut B open along the meridian disk bounded by the common curve α of the segment, getting a handlebody B′ of a smaller genus. The remaining curves of each vertex form a vertex of a closed path in the cut- system complex of B′. This path decomposes into a sum of triangles by Induction Hypothesis 1. When we add back the curve α to every vertex we get a decomposition of the initial closed segment into a sum of triangles. Lemma 10. A closed path p = hα, γi → hβ, γi → hβ, δi → hα, δi → hα, γi is null-homotopic in X. Proof. If g > 2 then the path is a closed segment, all vertices of p have at least one additional common curve, so we may assume g = 2. All the curves are disjoint. If α ∪ β (or γ ∪ δ) does not separate S there is a vertex hα, βi (respectively hγ, δi) which is connected by an edge to every vertex of the path and splits the path into a sum of four triangles. In the other case let us split B open along the meridian disks of α, β, γ, and δ. Since α ∪ γ does not separate S we get three connected components and eight boundary components. There is a connected component with at least three boundary compo- nents. By the separation properties of α, β, γ and δ this connected compo- nent has three boundary components corresponding to three different curves out of α, β, γ and δ. Two of them belong to one vertex, say α and γ. We can form a connected sum α+γ of the two curves inside the connected com- ponent. We get a new meridian curve ε disjoint from all four curves. The curve ε forms a vertex with each of the four curves. The path p decomposes into a sum of ten triangles (see Figure 4). h ; i