Meridional rank of knots whose exterior is a graph manifold
Abstract.
We prove for a large class of knots that the meridional rank coincides with the bridge number. This class contains all knots whose exterior is a graph manifold. This gives a partial answer to a question of S. Cappell and J. Shaneson [11, pb 1.11].
Second author supported by CAPES grant 13522-13-2
Let be a knot in . It is well-known that the knot group of can be generated by conjugates of the meridian where is the bridge number of . The meridional rank of is the smallest number of conjugates of the meridian that generate its group. Thus we always have . It was asked by S. Cappell and J. Shaneson [11, pb 1.11], as well as by K. Murasugi, whether the opposite inequality always holds, i.e. whether for any knot . To this day no counterexamples are known but the equality has been verified in a number of cases:
-
(1)
For generalized Montesinos knots this is due to Boileau and Zieschang [5].
-
(2)
For torus knots this is a result of Rost and Zieschang [15].
-
(3)
The case of knots of meridional rank (and therefore also knots with bridge number ) is due to Boileau and Zimmermann [6].
-
(4)
For a class of knots also refered to as generalized Montesinos knots, the equality is due to Lustig and Moriah [12].
-
(5)
For some iterated cable knots this is due to Cornwell and Hemminger [9].
-
(6)
For knots of meridional rank whose double branched cover is a graph manifold the equality can be found in [4].
The knot space of is defined as where is a regular neighborhood of in . The knot group of is the fundamental group of . We further denote by the peripheral subgroup of , i.e., .
Let be the meridian of , i.e. an element of which can be represented by a simple closed curve on that bounds a disk in which intersects in exactly one point. In the sequel we refer to any conjugate of as a meridian of .
We call a subgroup meridional if is generated by finitely many meridians of . The minimal number of meridians needed to generated , denoted by , is called the meridional rank of . Observe that the knot group is meridional and its meridional rank is equal to .
A meridional subgroup of meridional rank is called tame if for any one of the following holds:
-
(1)
.
-
(2)
and there exists meridians such that is generated by .
Definition 1.
A non-trivial knot in is called meridionally tame if any meridional subgroup generated by less than meridians is tame.
Remark 1.
If is meridionally tame, then its group cannot be generated by less than meridians. Hence the bridge number equals the meridional rank. Thus the question of Cappell and Shaneson has a positive answer for the class of meridionally tame knots by definition of meridional tameness.
The class of meridionally tame knots trivially contains the class of 2-bridge knots as any cyclic meridional subgroup is obviously tame. In Lemma 14 below we show that the meridional tameness of torus knots is implicit in [15] and in Proposition 1 we show that prime 3-bridge knots are meridionally tame. However it follows from [1] and the discussion at the end of Section 6 that satellite knots are in general not meridionally tame. For examples Whitehead doubles of non-trivial knots are never meridionally tame. These are prime satellite knots, whose satellite patterns have winding number zero, which is opposite to the braid patterns considered in this article. Moreover Whitehead doubles of 2-bridge knots are prime 4-bridge knots for which the question of Cappell and Shaneson has a positive answer by [4, Corollary 1.6]. There exists also connected sums of meridionally tame knots (for examples some 2-bridge knots) which are not meridionally tame. In contrast, it should be noted that we do not know any hyperbolic knots that are not meridionally tame, but it is likely that such knots exist.
In this article we consider the class of knots that is the smallest class of knots that contains all meridionally tame knots and is closed under connected sums and satellite constructions with braid patterns, see Section 1 for details. The following result is our main theorem:
Theorem 1.
Let be a knot from . Then .
As the only Seifert manifolds that can be embedded into are torus knot complements, composing spaces and cable spaces (see [13]) and as cable spaces are special instances of braid patterns we immediately obtain the following consequence of Theorem 1.
Corollary 1.
Let be a knot such that its exterior is a graph manifold. Then
In 2015 the first, third and fourth author found a proof that the meridional rank coincides with the bridge number for the easier case of knots obtained from torus knots by satellite operations with braid patterns. In the meantime the second and fourth authors introduced the notion of meridional tameness, and the second author was able to generalize the result to the broader class of knots by proving Theorem 1. Some basic features of the original proof are preserved, but the proof of Theorem 1 is much more involved and subtle, in particular because of the presence of composing spaces.
1. Description of the class .
In this section we introduce the appropriate formalism to study knots that lie in the class introduced in the introduction. Recall that these knots are obtained from meridionally tame knots by repeatedly taking connected sums and performing satellite constructions with braid patterns.
We first discuss satellite construction with braid patterns. This generalizes the well-known cabling construction. Satellite construction with braid patterns are also discussed in [9].

Let be a standardly embedded solid torus in and an -braid with . Assume that the closed braid is standardly embedded in the interior of , see Figure 1. For a knot and a homeomorphism onto a tubular neighborhood of which sends a meridian of onto a meridian of and the longitude of (i.e. the simple closed curve on that is nullhomotopic in the complement of the interior of ) to the longitude of , we define the link , see Figure 1. Note that is a knot if and only if the associated permutation of is a cycle of length . In this case the knot is called a -satellite of and is denote by . We also say that is obtained from by a satellite operation with braid pattern .
In order to define the class we need some terminology.
Let be a finite tree. A subset is called an orientation of if . For a finite rooted tree we will define a natural orientation determined by the root in the following way: for each vertex there exists a unique reduced path in from to . We define
Throughout this paper we assume that any rooted tree is endowed with this orientation.
Suppose that is some orientation for . We say that a path in is oriented if for . For any vertex we define as the sub-tree of spanned by the set
Note that for any vertex we have
where we consider the canonical orientations defined above, see Figure 2.

Recall that for any vertex , the star of is defined as
The cardinality of is called the valence of , written . If is assigned some orientation we further define the positive star of as
and the positive valence of as .
For we set
and we also define
We now define labelings of rooted trees. A labeled rooted tree is a tuple
such that the following hold:
-
(1)
is a finite rooted tree.
-
(2)
For any , is a non-trivial knot.
-
(3)
For any , is an -braid having strands such that the closed braid is a knot.
For we define the labeled rooted tree as
We now associate to any labeled rooted tree a knot . We define . We recursively define in the following way:
-
(1)
If , then we define .
-
(2)
If and , then we define where is the unique vertex of such that .
-
(3)
If and then we define where such that .
Note that this is a (recursive) definition indeed as in situation (2) and (3) we have for all occurring . Note moreover that lies in the class if and only if is meridionally tame for any . Thus we can rephrase the main theorem in the following way:
Theorem 2.
Let be a labeled rooted tree and . Suppose that is meridionally tame for all . Then
The proof relies on computing both the bridge number and the meridional rank. We conclude this section with the computation of the bridge number which is an easy consequence of the work of Schubert.
Remember that any vertex is labeled , where is a braid with strands. We define the function by
Recall that, for any , is the unique reduced path in from to . We define the height of a vertex in as
for and .
Lemma 1.
Let be the knot defined by the labeled rooted tree . Then the bridge number of is given by
The proof of the Lemma relies in the following result of Schubert [16], see also [17] for a more modern proof. Note that the result of Schubert is actually stronger than what we state.
Theorem 3 (Schubert).
Let be knots in and be an -braid such that the closed braid is a knot. Then the following hold:
-
(i)
.
-
(ii)
.
Proof of Lemma 1.
The proof is by induction on . If , then . Hence we have
as .
Suppose that and . Let be the unique vertex such that . In this case . If denotes the height of a vertex in the rooted tree , then it is easy to see that for all . Moreover, for all . By Theorem 3(ii) and the induction hypothesis we obtain:
Suppose now that and . Let such that . By definition, is equal to the connected sum . Observe that if denotes the height of a vertex in the rooted tree , then for any . By Theorem 3(i) and the induction hypothesis we obtain:
since and . ∎
2. Description of .
In the previous section we have constructed a knot from a labeled tree . The construction implies that the knot space contains a collection of incompressible tori corresponding to the edges of such that to each vertex there corresponds a component of the complement of such that the following hold:
-
(1)
The vertex space associated to each vertex is .
-
(2)
The vertex space associated to a vertex is the braid space , see below for details.
-
(3)
The vertex space associated to a vertex is an -fold composing space where .
Thus can be thought of as a tree of spaces. It follows from the theorem of Seifert and van Kampen that corresponding to the tree of spaces there exists a tree of groups decomposition of such that all edge groups are free Abelian of rank . It is the aim of this section to describe this tree of groups. We will first describe the vertex groups that occur in this splitting and then conclude by describing the boundary monomorphisms of the tree of groups.
(1) If then the complementary component of corresponding to is the knot space of . Thus we put . Denote by the meridian and by the longitude of .
(2) We now describe the vertex group for . Let be the number of strands of the associated braid . By definition the associated permutation of is an -cycle (equivalently the closed braid is a knot) and is standardly embedded in the interior of an unknotted solid torus , see Figure 1. The braid space of is defined as
where is a regular neighborhood of contained in the interior of , see Figure 3. The complementary component of corresponding to is by construction homeomorphic to .
There is an obvious fibration of onto induced by the projection of onto the second factor. The fiber is clearly the space
where is the union of the interior of disjoint disks contained in the interior of the unit disk.

We will denote the free generators of corresponding to the boundary paths of the removed disks by . This gives a natural identification of with . We obtain the short exact sequence
Let be the element represented by the loop in defined by , for a point . Thus represensts a longitude of in the above sense. We can write as the semi-direct product where the action of on the fundamental group of the fiber is given by
and the words satisfy the identity
in the free group .
Note that any element of can be uniquely written in the form with and . Moreover
where . Note that in a satellite construction with braid pattern the curve corresponding to is identified with the meridian of the companion knot and the curve corresponding to is identified with the longitude of the companion knot. Finally
where and for some . Note that for a satellite with braid patttern , thus in particular for the knot , and represent the meridian and the longitude of the satellite knot.
Note further that (normal closure in ) as any two elements of are conjugate in . It follows in particular that .
(3) We now describe the vertex group if . Let . By construction the complementary component of corresponding to the vertex is homeomorphic to an -fold composing space , where is as before, see [13]. Thus
Consequently any element of can be uniquely written as with and . Clearly generates the center of .
If the homeomorphism is chosen appropriately then we get the following with the above notation:
-
(1)
corresponds to the peripheral subgroup of where is the longitude and is the meridian.
-
(2)
There exists a bijection such that for any the subgroup correponds to the peripheral subgroup of with the longitude and the meridian.
With the notation introduced we have
We further denote by .
(4) For any edge the associated edge group is free Abelian generated by .
We now describe the boundary monomorphims. For any with and the boundary monomorphism is given by:
while is given by .
3. Vertex Groups
In this section we will study subgroups of the vertex groups of for . As these vertex groups are semidirect products of a finitely generated free group and we start by considering certain subgroups of the free group .
We think of as the group given by the presentation
and identify with where is the -punctured sphere as before.
We will study subgroups of that are generated by finitely many conjugates of the . We call an element of peripheral if it is conjugate to for some and .
Lemma 2.
Let with , , and for . Suppose that .
Then there exists with and and for such that the following hold:
-
(1)
is freely generated by .
-
(2)
Any is in U conjugate to some .
-
(3)
Any peripheral element of is in conjugate to an element of for some .
In particular .
Remark 2.
Proof.
Let be the cover of corresponding to . Note that the -conjugacy classes of maximal peripheral subgroups of correspond to compact boundary components of that finitely cover boundary components of . Note that for any the -conjugacy class of must correspond to a compact boundary component of for which the covering is of degree .
As is generated by peripheral elements it follows that the interior of is a punctured sphere. Note further that all but one punctures must correspond to compact boundary components of that cover components of with degree and correspond to some , otherwise could not be generated by by the above remark.
We now show that is an infinite sheeted cover of , i.e. that the last puncture does not correspond to a compact boundary component of . Suppose that is a -sheeted cover of . As it follows that . Clearly has at least boundary components as boundary components of must have lifts each in . It follows that
Thus and therefore , a contradiction.
Thus is an infinite sheeted cover of whose interior is homeomorphic to a punctured sphere such that all but one punctures correspond to compact boundary components of and such that the conjugacy classes of peripheral subgroups of corresponding to these boundary are represented by some . This implies that there exists satisfying (1) and (2), indeed we take to be the tuple of elements corresponding to the compact boundary components . Item (3) is obvious. ∎
We now use Lemma 2 to describe subgroups of that are generated by finitely many meridians, i.e. conjugates of . Here is an -strand braid such that associated permutation of is an -cycle. Recall that is generated by , that is free in and that in the element is conjugate to for . As in the previous section we denote the peripheral subgroups of by and .
Corollary 2.
Let with and for . Suppose that .
Then either or there exists
with and for such that the following hold:
-
(1)
is freely generated by .
-
(2)
For any one of the following holds:
-
(a)
.
-
(b)
and is in conjugate to for some .
-
(a)
-
(3)
For any we have .
Proof.
For any we have where and . Hence can be rewritten in the form
with and for . By Lemma 2 there exists
with and and for such that is freely generated by and that the other conclusions of Lemma 2 are satisfied. We will show that satisfies (1)-(3).
Now each can be written as for some . Hence satisfies (1).
Note that for any we have
Suppose that , i.e. for some integer . It follows from Lemma 2(3) and the fact that any element in a free group is contained in a unique maximal cyclic subgroup that and that is in conjugate to for some , thus we have shown that satisfies (2).
(3) For any we have
If for some integer , then Lemma 2 implies that is in conjugate to for some . But this is a contradiction since in the element is not conjugate to for . ∎
We now use Lemma 2 to describe subgroups of
that are generated by and conjugates of the . Here and for .
Corollary 3.
Let with and for . Let .
Then either or there exists
with , and for such that the following hold:
-
(1)
.
-
(2)
is freely generated by .
-
(3)
For any and any one of the following holds:
-
(a)
.
-
(b)
and is in conjugate to for some . In particular .
-
(a)
-
(4)
For any we have .
Proof.
For any and we have
Hence can be rewritten in the form
with for and so . If then ; thus we may assume that is a proper subgroup of . By Lemma 2 there exists
with and and for such that is freely generated by and that (1) and (2) are satisfied. We will show that satisfies (3)-(4).
(3) Let and . Clearly we have
If there is nothing to show. Thus we may assume that .
It follows that for some . This clearly implies that . It follows from Lemma 2(3) that and that is in conjugate to for some , thus we have shown that satisfies (3).
(4) For any we have
If then for some integer . It follows that . Lemma 2 implies that is in conjugate to for some . But this is impossible as in the element is not conjugate to for . ∎
4. Proof of the main theorem
In this section we give the proof Theorem 1 or equivalently of Theorem 2. We will show that for any knot from the meridional rank is bounded from below by the bridge number that is given by Lemma 1.
The general idea of the proof is similar to the proof of Grushko’s theorem. Clearly there is an epimorphism from the free group of rank to that maps any basis element (of some fixed basis) to a conjugate of the meridian. This epimorphism can be a realized by a morphism of graphs of groups, see construction of below. Such a morphism can be written as a product of folds and the main difficulty of a proof is to define a complexity that does not increase in the folding sequence such that comparing the complexities of the initial and the terminal graph of groups yields the claim of the theorem.
Morphisms of graphs of groups were introduced by Bass [2], we will use the related notion of -graphs as presented in [18] which in turn a slight modification of the language developed in [10], in fact we assume complete familiarity with the first chapted of [18] which in particular contains a detailed description of folds as introduced by Bestvina and Feighn [3] in the language of -graphs.
The proof is by contradiction, thus we assume that the knot group of is generated by meridians, namely by where for . Since splits as where is the tree of groups described in Section 2, we see that for the element can be written as where is an -path from to of the form
for some . Observe that we do not require to be reduced, otherwise we could possibly not choose such that .
We now define the -graph as follows:
-
(1)
The underlying graph is a finite tree given by:
(a) .
(b) .
(c) For the initial vertex of is
while the terminal vertex of is for .
-
(2)
The graph morphism is given by .
-
(3)
For each the associated group is
-
(4)
For , for all while
Observe that the fundamental group of the associated graph of groups of is freely generated by the elements
for . Additionally, the induced homomorphism is surjective as by our construction of .
Before we continue with the proof we need some terminology. Let be an arbitrary -graph whose underlying graph is a finite tree. Throughout the proof we assume that has the orientation .
We say that a vertex is isolated if for any .
We further say that a vertex is full if there exists a sub-tree of such that the following hold:
-
(1)
.
-
(2)
maps isomorphically onto .
-
(3)
for all .
The following lemma follows immediately from the definition of fullness:
Lemma 3.
Let be an -graph whose underlying graph is a finite tree and . Then is full if and only if and there exists such that the following hold:
-
(1)
is a bijection.
-
(2)
for all .
-
(3)
is full for all .
Lemma 4.
Let be an -graph whose underlying graph is a finite tree. Assume that is obtained from by a fold. Then the image of any full vertex in is full in .
Proof.
First note that if is a folded -subgraph of , then it is easy to see that is isomorphic to its image in . Assume that is a full vertex of . By definition there exists a sub-tree such that:
-
(1)
.
-
(2)
is an isomorphism.
-
(3)
for all .
The -subgraph of having as its underlying graph is trivially folded. Thus is isomorphic to its image in and so the image of in is full. ∎
Definition 2.
We call an -graph with associated graph of groups tame if the graph underlying is a finite tree and the following conditions hold:
-
(1)
For each with one of the following holds:
-
(a)
.
-
(b)
.
-
(c)
and is full.
-
(a)
-
(2)
For every vertex with one of the following holds:
-
(a)
is generated by meridians of .
-
(b)
.
-
(a)
-
(3)
For every vertex with one of the following holds:
-
(a)
is freely generated by finitely many conjugates of .
-
(b)
and is full.
-
(a)
-
(4)
For every vertex with one of the following holds:
-
(a)
.
-
(b)
There exists such that , where is freely generated by
where and is in conjugated to for all . Moreover, if then is full.
Put .
-
(a)
Next we will define the complexity of a tame -graph . First we need to introduce the following notion. We define the positive height of a vertex as
where denotes the height of a vertex in defined in Section 4. Note that for any edge we have . In particular we have if and if .
Definition 3.
Let be a tame -graph.
We define the -complexity of as
where .
We further define the -complexity of as
where denotes the set of edges whose edge group is isomorphic to for .
Lastly, the -complexity of is defines as
As we want to compare complexities we endow the set with the lexicographic order, i.e. we write if one of the following occurs:
-
(1)
.
-
(2)
and .
Observe that the -graph defined above is tame as for all and is infinite cyclic generated be the meridian of . Furthermore, . Thus our assumption (which will yield a contradiction) implies that there exists a tame -graph with -complexity strictly smaller than the bridge number of such that the induced homomorphism
is an epimorphism.
Let now be a tame -graph such that there exists a vertex of type such that is surjective and that among all such the -complexity is minimal. Note that as the -graph constructed above is tame and the map is sujective. We will prove the theorem by deriving a contradiction to this minimality assumption.
Lemma 5.
is not folded.
Proof.
Assume that is folded. As the map
is surjective it follows that is isomorphic to , i.e. the graph morphism is bijective and that all vertex and edge groups are mapped bijectively. Observe that this implies the following:
-
(1)
The morphism maps the isolated vertices of bijectively to . It follows in particular that for any isolated vertex we have as is meridionally tame by assumption.
-
(2)
As all edge groups are non-trivial we have for all .
-
(3)
If is not isolated, then either and therefore or and therefore .
Using Lemma 1 this implies that
contradicting the assumption that .
Thus is not folded. ∎
As the -graph is not folded, a fold can be applied to . As the graph underlying is a tree it follows that only folds of type IA and IIA can occur. We will only apply folds of type IIA if no fold of type IA can be applied. As any fold is a composition of finitely many auxiliary moves (that clearly preserve tameness and do not change the complexity) and an elementary move we can assume that one of the following holds:
-
(1)
An elementary move of type IA can be applied to .
-
(2)
No fold of type IA can be applied to but an elementary move of type IIA can be applied to .
In both cases we will derive the desired contradiction to the minimality of the complexity by producing a tame -graph that is -surjective and such that .
The following lemma will be useful when considering folds. It implies that certain type IIA folds are only possible if also a fold of type IA is possible. Because of our above choice we will therefore not need to consider such folds of type IIA.
Lemma 6.
Let be a tame -graph, and . Suppose that one of the following holds:
-
(1)
and there exists labeled such that and .
-
(2)
, and there exist distinct edges .
Then we can apply a fold of type IA to .
Proof.
(1) Note first that an element
commutes with if and only if for . This follows immediately from the fact that any maximal cyclic subgroup of and therefore also is self-normalizing in .
It follows from Corollary 3(3.b) and the tameness of that there exists an edge labeled such that and
for some . Thus, commutes with which implies that
for . Hence . Since we further have and it follows that is not folded because condition (F1) is not satisfied, see p.615 from [18]. Thus we can apply a fold of type I or type III to . Since the underlying graph of is a tree it follows that we can apply a fold of type IA to .
(2) Since it follows that for some and so and are of the same type. Let where and for . We can write as
Note now that and since and . Thus is not folded because condition (F1) is not satisfied which implies in our context we can apply a fold of type IA to . ∎
The following Lemma implies that if we apply an elementary move of type IIA in the direction of an oriented edge, we only ever add a meridian to the edge group.
Lemma 7.
Let be a tame -graph and labeled with . Assume that no fold of type IA is applicable to (i.e. condition (F1) is satisfied) and that
Then . In particular, .
Proof.
We first assume that . By tameness of we know that or is freely generated by conjugates of .
If , then the tameness of implies that is full. Hence there exists an edge such that . Since no folds of type IA are applicable to , it follows from Lemma 6 that which implies that
contradicting the fact that .
Thus is freely generated by conjugates of . As by hypothesis it implies that is non-trivial. It is a consequence of Corollary 2(3) that in this case and so .
We will now deal with the two cases mentioned above. In both cases we let be the -graph obtained from by the fold of type IA or IIA, respectively. After possibly applying elementary moves first we can assume that the folds are elementary.
Case 1: An elementary move of type IA can be applied to : Let be the -graph obtained from by this elementary move. Thus there exist distinct edges with and for such that is obtained from by identifying and into a single edge . Put , , and and . In particular we have and . We further denote by the underlying graph of , see Figure 4.

Let now be the -graph obtained from by replacing the vertex group by the group defined as follows:
From Proposition 8 of [18] it follows that is -surjective which implies that is -surjective since is defined from by possibly enlarging the vertex group at . Note that the underlying graph of is equal to . Moreover, for all while .
Lemma 8.
The -graph is tame.
Proof.
We first show that edge groups are as in Definition 2. From the tameness of we conclude that one of the following occurs:
-
(1)
.
-
(2)
.
-
(3)
. This occurs if and only if for some . In this case is full by tameness and therefore is also full by Lemma 4.
Since the remaining edge groups do not change we conclude that edge groups are as in Definition 2.
We can easily see that is tame if . Indeed, by definition or is generated by at most meridians of . Hence condition (2) of Definition 2 is fulfilled.
We next show that is tame if . Note first that if for some , then obviously . Tameness of implies that is full and so is full by Lemma 4.
Thus we may assume that both and are freely generated by conjugates of . It follows from Corollary 2 that is freely generated by at most conjugates of . Since any subgroup of that is generated by conjugates of is contained in , which in turn is a proper subgroup of , we conclude that if and only if for some . Therefore is tame.
Lastly, suppose that . If or , say , then clearly and there is nothing to show. Thus we may assume that for we have with
where and for all . Thus where
From Corollary 3 we conclude that there exists a subset such that
and is in conjugated to for all . From tameness we know that is conjugated to and so it is also conjugated to .
We next show that is preserved by the fold, i.e. that is mapped injectively into . This is trivial if since
If , then it is clear that
As is free on the set and for , we conclude that contains at most one element of which implies that is mapped injectively into .
Lemma 9.
.
Proof.
Case i(a): Assume that and or .
If and are isolated in , then obviously is isolated in and we clearly have . Thus
If one of the vertices or , say , is not isolated in , then is not isolated in . In this case we have and consequently
Since and we get .
As at least one of the edges involved on the fold has trivial group we obtain
Therefore .
Case i(b): Assume that and . Thus
If both and are isolated in , then clearly is isolated in . Moreover, . Indeed, for the inequality follows from the fact that is meridionally tame and for . For we know from the tameness of that is generated by conjugates of since is isolated. Thus since otherwise the vertex is full. Hence for the inequality follows from Corollary 2(2.b) and for this is trivial since and hence . As we obtain
Now suppose that is not isolated in , the case that is not isolated in is analogous. Hence is not isolated in . Note that
and . Since is non-trivial it follows that . Thus if is isolated in we obtain
If is not isolated in then
Since we conclude that the -complexity decreases.
Case ii: Suppose that .
Initially observe that if and are isolated in then is isolated in and we clearly have . Hence
If or , say , is not isolated in then is not isolated in . Furthermore, we have
If is isolated in , then a simple calculation shows that
If is not isolated in then we see that
Since and it follows that . In any case the -complexity decreases by at least two so that the -complexity decreases. ∎
Case 2: No fold of type IA can be applied to but an elementary move of type IIA can be applied to : Let be the -graph obtained from by this elementary move. Hence there is an edge with label , initial vertex labeled and terminal vertex labeled such that
We will distinguish two cases depending on whether or .
Case i: Assume that .
It follows from Lemma 7 that and . Denote by the -graph obtained from by this fold, i.e. we replace by and by . From Proposition 8 of [18] it follows that is -surjective.

Let now be the -graph obtained from by replacing the vertex group by the group defined as follows:
Observe that the underlying graphs of and are both equal to the underlying graph of . Moreover, for all while . By the same reasons as before we see that is -surjective.
Lemma 10.
The -graph is tame.
Proof.
Edge groups are as in Definition 2 as and the remaining edge groups do not change.
It is trivial to see that the vertex group is as in Definition 2 since and .
It remains to check that the tameness condition is satisfied for . If then this is immediate as or is generated by at most meridians.
We now show that is tame if . Note first that clearly implies . From tameness it follows that is full and consequently is full in by Lemma 4. Assume now that is freely generated by conjugates of . It follows from Corollary 2 that is freely generated by at most conjugates of and so is a proper subgroup of . Thus we have showed that is tame if .
Finally we show that is tame if . This case is trivial since for all and
∎
Lemma 11.
.
Proof.
In order to compute the complexity recall that is replaced by which implies that .
If is not isolated in , then is not isolated in . A straightforward calculation shows that
As and we obtain .
Assume now that is isolated in which implies that is isolated in . For the case in which it was showed in the proof of Lemma 7 that . Since no fold of type IA is applicable to , Lemma 6 implies that . Hence the vertex is isolated in and its contribution to the -complexity is . It is now easy to see that
as .
Let us now consider that case in which . If is isolated in , then its contribution to the -complexity of is since in this case the tameness of tells us that . A simple calculation shows that
Since we conclude that .
If is not isolated in , then as .
Finally, as it implies that . ∎
Case ii: Assume now that . Note that in this case . The fact that the fold is possible, combined with Corollaries 2 and 3, imply that one of the following occurs:
-
(1)
.
-
(2)
. This occurs iff .
Denote by the -graph obtained from by this fold, i.e. we replace by defined as follows:
and the vertex group by defined as
Once again, it follows from Proposition 8 of [18] that is -surjective.
Let be the -graph obtained from by replacing the vertex group by defined as follows:
We remark that is -surjective as it is defined from the -surjective -graph by possibly enlarging the vertex group at .
Lemma 12.
The -graph is tame.
Proof.
Note that or . The latter case occurs only when . By tameness it follows that is full in and hence is full in by Lemma 4.
The -graph is obviously tame if since by definition or . The latter case occurs only when and so . As and we conclude from Lemma 3 that is full in .
Finally we show that is tame if . It is trivial to see that is tame if since in this situation we have
It is also trivial to see that is tame if and since in this case . So assume that and where is freely generated by
Thus
where
Corollary 3 implies that there exists a subset such that is freely generated by and is in is conjugated to or to . If then which implies that . Combining Lemmas 3 and 4 and the tameness of we conclude that is full in . Therefore is tame if . ∎
Lemma 13.
.
Proof.
Note that if is isolated in , then we obtain
since is not isolated in and .
If is not isolated in , then . Thus
In both cases a simple calculation shows that which implies that the -complexity decreases. ∎
5. Meridional tameness of torus knots
In this section we show that torus knots are meridionally tame. This fact is implicit in [15]. Note that this implies Corollary 1 since any knot whose exterior is a graph manifold is equal to for some labeled tree , where a torus knot for any .
Lemma 14.
Torus knots are meridionally tame.
Proof.
Let be a -torus knot. Without loss of generality we may assume that . Suppose that and is a meridional subgroup of .
It follows from Theorem 1.4 of [15] that there exist meridians such that is freely generated by .
We will show that for any one of the following holds:
-
(1)
.
-
(2)
and is in conjugate to for some .
Note that this claim is implicit in the argument in [15], however, in order to avoid getting involved with the combinatorial details, we give an alternative argument.
Observe that it suffices to show that any conjugate of a peripheral element that lies in is in conjugate to some element of for some since the meridional subgroup is premalnormal in with respect to the peripheral subgroup , that is, implies , see Lemma 3.1 of [19].
Let be the map that quotients out the center. Note that we can think of as the fundamental group of the hyperbolic 2-orbifold of finite volume. Thus the boundary corresponds to a parabolic element. As is free and has therefore trivial center it follows that is injective. Thus is free in the parabolic elements .
Now consider the covering of corresponding to . As is freely generated by parabolic elements it follows that is an ()-punctured sphere with at least parabolic boundary components. If the last boundary component corresponds to a hyperbolic element then the claim of the lemma holds. Thus we may assume that all boundary components correspond to parabolic elements, i.e., that is a finite sheeted cover of with
() |
Note that . As is a torsion free subgroup of and as and are coprime it follows that . Thus, as we obtain
As and therefore it follows that
a contradiction to ( ‣ 5). Thus this case cannot occur. ∎
6. Meridional tameness of 3-bridge knots
Proposition 1.
A prime 3-bridge knot is meridionally tame.
Proof.
From [4, Corollary 1.6] it follows that for a prime 3-bridge knot is either hyperbolic or a torus knot.
In the case of a torus knot the meridional tameness follows from Lemma 14. Thus we can assume that is hyperbolic.
We need to check that any subgroup that is generated by at most two meridians is tame. It follows from [4, Prop. 4.2] that any such subgroup is either cyclic or the fundamental group of a 2-bridge knot summand of or free of rank . In the first case the tameness of is trivial and the second case cannot occur as is a prime 3-bridge knot.
Thus we are left with the case where the knot is hyperbolic and the meridional subgroup is a free group generated by two parabolic elements which are meridians. In [14] a Kleinian free group generated by two parabolics is shown to be geometrically finite. In the course of the proof it is proved that is of Schottky type and obtained from a handlebody of genus 2 by pinching at most 3 disjoint and non parallel simple curves to a point corresponding to cusps. Each curve generates a maximal parabolic subgroup of and there are at most 3 conjugacy classes of such subroups.
If there are only two conjugacy classes of maximal parabolic subgroups, they correspond to the two meridian generators and so the group is tame. This is the 4-times punctured sphere case in [14, case 4] .
The group may also have 3 conjugacy classes of maximal parabolic subgroups, corresponding to two 3-times punctured spheres on the boundary of the core of the associated Kleinian manifold, see [14, case 5]. They give -injective properly immersed pants in the hyperbolic knot exterior . Then it follows from Agol’s result [1] that such a -injective properly immersed pant is either embedded or can be obtained by Dehn filling one boundary component of the Whitehead link exterior. A knot exterior in cannot contain a properly embedded pant. Therefore one may assume that is obtained by a Dehn filling of slope along one boundary component of the Whitehead link exterior. Then a homological computation shows that , so . Thus must be a twist knot, which is a 2-bridge knot. Hence this case is also impossible.∎
Agol’s construction [1] of a -injective properly immersed pant in the exterior of the whitehead link shows that meridional tameness never holds for Whitehead doubles of non-trivial knots.The exterior of such a knot is obtained by gluing the exterior of a non-trivial knot to one boundary component of the Whitehead link exterior. Thus by van Kampen’s theorem the -injectivity of the properly immersed pant in the exterior of the whitehead link is preserved. The image is a free subgroup generated by two meridians that is not tame as the third boundary component gives rise to another conjugacy class of peripheral elements which is generated by the square of some meridian. Note that for non-prime knots meridional tameness does not hold also in general. By [1] if one summand is a twist knot (hyperbolic but also the trefoil can occur) then there might exist -injective properly immersed pants with two boundary components corresponding to a meridian, and thus yielding a non-tame meridional subgroup.
References
- [1] I. Agol, Pants immersed in hyperbolic 3-manifolds, Pacific J. Math. 241 (2009), 201–214.
- [2] H. Bass, Covering theory for graphs of groups, Journal of Pure and Applied Algebra 89 (1993), 3–47.
- [3] M. Bestvina and M. Feighn, Bounding the complexity of simplicial group actions on trees, Invent. math. 103 (1991), 449-469.
- [4] M. Boileau, Y. Jang and R. Weidmann, Meridional rank and bridge number for a class of links, preprint.
- [5] M. Boileau and H. Zieschang, Nombre de ponts et générateurs méridiens des entrelacs de Montesinos, Comment. Math. Helvetici 60 (1985), 270–279.
- [6] M. Boileau and B. Zimmermann, The -orbifold group of a link, Math. Z. 200 (1989), 187–208.
- [7] G. Burde, H. Zieschang. Knots. Walter de Gruyter, 1985.
- [8] C. R. Cornwell, Knot contact homology and representations of knot groups, Journal of Topology 7 (2014) 1221–-1242.
- [9] C. R. Cornwell and D. R. Hemminger, Augmentation Rank of Satellites with Braid Pattern, arXiv:1408.4110
- [10] I. Kapovich, A. Myasnikov and R. Weidmann, Foldings, graphs of groups and the membership problem. Internat. J. Algebra Comput. 15 (2005), no. 1, 95–128.
- [11] R. (Ed.) Kirby. Problems in low-dimensional topology. In Proceedings of Georgia Topology Conference, Part 2, pages 35-473. Press, 1995.
- [12] M. Lustig and Y, Moriah, Generalized Montesinos knots, tunnels and -torsion, Math. Ann. 295 (1992), 167-189.
- [13] W. Jaco and P. Shalen, Seifert fibered spaces in 3-manifolds, Mem. AMS 220(1979).
- [14] B. Maskit, G. Swarup, Two parabolic generator kleinian groups, Israel J. Math. 64 (1988), 257–266.
- [15] M. Rost and H. Zieschang, Meridional generators and plat presentations of torus links, J. London Math. Soc. (2) 35 (1987), no. 3, 551-562.
- [16] H. Schubert. Über einer numerische knoteninvarianten. Math. Z. (61) 1954 245-288.
- [17] J. Schultens (2003). Additivity of bridge numbers of knots. Math. Proc. Cambridge Philos. Soc., 135, pp 539-544 doi:10.1017/S0305004103006832
- [18] R. Weidmann, The rank problem for suficiently large fuchsian groups, Proc. London Math. Soc. (3) 95 (2007), 609-652.
- [19] R. Weidmann, On the rank of amalgamated products and product knot groups, Math. Ann. 312, 761–771(1998).