The normal closure of big Dehn twists, and plate spinning with rotating families
Fran\c{c}ois Dahmani

TL;DR
This paper investigates the structure of the normal closure of large powers of Dehn twists in Mapping Class Groups, providing a new presentation and employing advanced geometric group theory techniques.
Contribution
It introduces a novel presentation for the normal closure of Dehn twists using projection complexes and rotating families, answering a question of Ivanov.
Findings
The normal closure has a presentation with relators as commutators of disjoint twists.
The approach combines projection complexes with rotating families across multiple spaces.
Provides new insights into the algebraic structure of Dehn twists in mapping class groups.
Abstract
We study the normal closure of a big power of one or several Dehn twists in a Mapping Class Group. We prove that it has a presentation whose relators consists only of commutators between twists of disjoint support, thus answering a question of Ivanov. Our method is to use the theory of projection complexes of Bestvina Bromberg and Fujiwara, together with the theory of rotating families, simultaneously on several spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
The normal closure of big Dehn twists, and plate
spinning with rotating families
François Dahmani
Abstract
We study the normal closure of a big power of one or several Dehn twists in a Mapping Class Group. We prove that it has a presentation whose relators consist only of commutators between twists of disjoint support, thus answering a question of Ivanov. Our method is to use the theory of projection complexes of Bestvina Bromberg and Fujiwara, together with the theory of rotating families, simultaneously on several spaces.
Contents
Introduction
Consider a closed orientable surface of negative Euler characteristic. The Mapping Class Group of , denoted by , is the quotient of the group of orientation-preserving homeomorphisms by the path-connected component of the identity. A classical theorem of Dehn and Nielsen indicates a natural isomorphism between this group and a subgroup of index of the outer automorphism group of .
As Riemann uniformisation theorem makes act as a lattice on the hyperbolic plane, one can argue that is (in a sense) some hyperbolic analogue of which is of index in the automorphism group of , a lattice in the euclidean plane.
However, contrarily to , some nontrivial elements of have large centraliser. For instance, consider a simple closed curve on , a tubular neighborhood of it and define a (simple) Dehn twist as the identity in , and as a full twist on , namely, identifying with , the map . A Dehn twist will obviously commute with any mapping class whose support is disjoint from this tube, and therefore with a lot of other Dehn twists. By a theorem of Dehn, is generated by Dehn twists around simple closed curves, thus by an intricate set of generators linked by commutation relations, but also braid relations and lantern relations. These differences can lead to modify the expected analogy with the euclidean case in order to include for (generated by elementary matrices).
Thurston, and Nielsen, (see the discussion and references in [HT]) classified mapping classes into three cases, those of finite order, those that are reducible in the sense that they have infinite order and that some nontrivial power preserves the homotopy class of a simple closed curve, and finally the pseudo-Anosov. The pseudo-Anosov mapping classes happen to be the hyperbolic isometries of an action of on an important graph, the curve graph of , which is Gromov hyperbolic [MM]. They are, in many ways, the witnesses that some phenomena of rank one happen in that are similar to the structure of , and its action on the modular tree. On the other hand, Dehn twists are as reducible as it is possible to be. They are, or should be, the witnesses of some phenomena of higher rank, similar to the structure of for .
Here is an illustration of the difference of behaviors. If one considers a finite collection of pseudo-Anosov elements, one can show that, after taking suitable powers, the group they generate is free [I, McC]. This is a ping-pong argument, for instance on the boundary of Teichmüller space, or on the curve graph. If one considers a finite collection of Dehn twists around simple closed curves, then Koberda [K] proved the beautiful ping-pong result that the group generated by some powers of these Dehn twists is a right angled Artin group: a group whose presentation over the given generating set is a collection of commutators, the obvious ones (two Dehn twists commute if their curves are disjoint).
The case of normal subgroups is our interest. If , by Margulis’ normal subgroup theorem, all normal subgroups of are finite or of finite index. In it is not the case: this group is virtually free, and has uncountably many non-isomorphic quotients.
It is a natural question to ask whether (and how) these phenomena are seen in . What can be the normal closure of a power of a pseudo-Anosov, the normal closure of a power of a Dehn twist, and the group generated by all -th powers of all simple Dehn twists ? Farb and Ivanov asked this question in the case of a pseudo-Anosov (respectively [Fa, §2.4] and [I2, §3]), attributing it to Long, McCarthy, and Penner. Ivanov also asked what he calls the deep relation question [I2, §12], that is whether all relations among certain powers of Dehn twists must derive from obvious commutation relations.
In [DGO, §5], we answered the first question: there is an integer such that for any pseudo-Anosov mapping class , the normal closure is free, and consists only of pseudo-Anosov elements and the identity. This is in line with what happens in , for each infinite order element.
We are interested in the question of the closure of a power of a Dehn twist, and in the group generated by certain powers of all (simple) Dehn twists, as in Ivanov’s deep relation problem. A naive expectation along the lines of the analogy with , and the Margulis normal subgroup theorem, could be to expect such normal subgroups to be a finite index subgroup. Whereas it is the case for squares of Dehn twists [H], it is not the case for large powers (see [H], [Fu], [Cou, 6.17], see also [S] and [Mas] for the case of powers of half-Dehn twists on punctured spheres). Another expectation could be, in light of the finite-type situation, and ping pong arguments, to expect infinitely generated right angled Artin groups. Again, this is not the case in general (see [CLM] and [BM]; Brendle and Margalit proved restrictions on the automorphism group of certain of these normal subgroups, that forbid them to be right angled Artin groups). However, we indeed prove that there is no need of relations other than the obvious ones.
Theorem 1**.**
For every orientable closed surface , there is an integer such that for any multiple of :
- •
for any Dehn twist , the normal closure of in the Mapping Class Group of has a partially commutative presentation, built on an infinite set of generators that are conjugates of , so that the relators are commutations between pairs of conjugates of that have disjoint underlying curves.
- •
the group generated by all -th powers of all simple Dehn twists has a partially commutative presentation, built on an infinite set of generators that are -th powers of Dehn twists, and whose relators are commutations between pairs of conjugates of the generators that have disjoint underlying curves.
The difference with an infinitely generated right angled Artin group is that some elements in the commutator relators are not in the generating set, but merely conjugates of elements in the generating set. We recover that the normal closure is far from being of finite index in , for instance because it has abelianisation of infinite rank (the relators being in the derived subgroup of the free group over the set of generators).
In our point of view, this result above, and its departure from the complexity of normal subgroups of for (granted by Margulis normal subgroup theorem) reinforce [Fu, Cou] in witnessing a dent in the analogy between and . It also answers Ivanov’s question on deep relations.
Let us discuss the proof of this theorem.
In [DGO] the structure of the normal closure of a big pseudo-Anosov was studied with the help of rotating families. Consider a group acting by isometries on a space . A rotating family in on is a collection of subgroups (the rotation groups), that is closed under conjugacy, such that each of them fixes a certain point in (thus inducing some kind of rotation around this point). Take in one of these subgroups, fixing . One may measure an analogue of the angle of rotation of by taking at distance from , and measuring the infimal length between and of paths outside the ball of radius around . If is Gromov-hyperbolic (for a small hyperbolicity constant), if the fixed point of the different rotation groups are sufficiently far from each other, and if the angles of rotations are sufficiently big, the group generated by all the rotation groups is a free product of a selection of them. In [DGO] we applied this theory to the action of on a cone-off of the curve graph of . The rotation groups were the conjugates of the big pseudo-Anosov considered.
The rotating family argument can be explained as follows. One analyses the structure of groups generated by more and more rotation groups, to discover that they arrange as a sequence of free products. Starting from a quasi-convex set (that will change over time) that is at first a small ball around a single fixed point of a single rotation group, one sets the group generated by the rotation groups whose centers are in , and one makes grow until it (almost) touches another center of rotation, for some other group. Call a -transversal of the newly approached centers of rotation. Then one unfolds into by taking its images by the group (thus generated by the new rotations, and the rotation already with center in ). Because of hyperbolicity, and of largeness of angles of rotations involved, the resulting space is still quasi-convex, with almost the same constant – with a little repair, it has the same quasi-convexity constant indeed. Actually has the structure of a tree whose vertices are the images of by the group , and the images of points in by , thus giving by Bass-Serre duality the structure of free product of and the rotation groups around points of (edge stabilizers are trivial since no element can fix two different centers of rotation). Then, one takes the new as and start over. In the direct limit, the group generated by all rotations has been described as a free product of a selection of rotation groups.
In [BBF], Bestvina Bromberg and Fujiwara, using a system of subsurface projections, discovered that there is a normal finite index subgroup of that acts on some spaces quasi-isometric to trees, and on which Dehn twists behave like large rotation subgroups. It has been observed by several people that this implies that the normal closure of a certain power of a Dehn twist in is free, using the argument of [DGO]. However, it is far from obvious how to promote this structural feature to the normal closure in .
In this paper, we use several quasi-trees as above, one for each left coset of in . The group acts on each of them, but its action is twisted by the automorphism of that is the conjugation by elements realising a transversal of in . If is a Dehn twist in , the normal closure of in equals the normal closure of the collection in . Each is a legitimate rotation on the quasi-tree associated to .
The argument of [DGO] is then performed simultanously on each of the quasi-trees. Instead of one convex subset that grows, and gets unfolded in a hyperbolic space, we have convex sets in the quasi-trees. Each of them is invariant by the group generated by the rotations around rotation points in all of them. One looks for a rotation point that is nearby one of these sets, and in a certain sense, nearby all of them (although they do not live in the same quasi-trees, this still makes sense in the framework of projection systems). Then, one unfolds our convex sets in all coordinates . A funny phenomenon happens. The unfolding in the coordinate of provides a nice tree, as the argument of [DGO], and the convexity of the result is quantitively very good. This tree gives the structure of the new group by Bass-Serre duality, and reveals that only commutation relations are involved. There is no reason that the unfolding in all other coordinates produces something resembling a tree, and could in principle destroy the convexity of . However, using the properties of the projection system, we show that the result is still somehow convex (less convex than before though). The game is then to unfold in the different quasitrees at regular intervals of time in the process, and to control the degradation of the convexity so that the repair can wait until a new unfolding occurs. It is a game of plate spinning.
The quasi-trees that we will use come from projection complexes defined in [BBF]. We wrote the argument in this axiomatic language, to avoid dealing with useless hyperbolicity constants. In the end, even if the spaces are indeed quasi-trees, this fact does not appear in the argument. The axioms of projection systems are extensively used though, and they contain the information that the geometric space is a quasi-tree. We will thus prove a similar statement as Theorem 1, namely Theorem 2.2, that gives the structure of groups generated by composite rotating families. There is actually more information coming from this composite rotating family structure, as for instance the Greendlinger property (see Definition 2.4), that describes how an element in the group can be shortened in some coordinate of the composite projection system.
1 Composite projection systems
1.1 Projection systems
Let us recall a part of the axiomatic construction of [BBF].
Definition 1.1**.**
([BBF])
A projection system is a set , with a constant , and for each , a function satisfying the following axioms:
- •
symmetry (* for all ),*
- •
triangle inequality (* for all ),*
- •
Behrstock inequality (* for all ),*
- •
properness (* is finite for all ).*
- •
In this work one also assume the separation (* for all ).*
Observe that if the axioms are true for some they hold for all larger .
From this rudimentary axiomatic set, Bestvina Bromberg and Fujiwara manage to extract meaningful geometry, by modifying the functions into some functions , that satisfy many more properties, usually encapsulated in the statement that the projection complex of , for a suitable parameter is a quasi-tree.
One should think of (or ) as an angular measure between and seen from . The axioms fit in this viewpoint: the Behrstock inequality says that if the angle at between and is large, then from the point of view of , the items and look aligned.
Let us review very quickly the procedure of [BBF] to produce the functions . Given for which the axioms hold, [BBF] define to be the set of pairs such that both and between them is strictly larger than , and one also include the pairs if , symmetrically the pairs if , and finally the pair itself.
Then is defined to be the infimum of over .
For all , denotes the set .
[BBF, Theorem 3.3] states that there exists and depending only on , such that for all :
- •
(Symmetry)
- •
(Coarse equality)
- •
(Coarse triangle inequality)
- •
(Behrstock inequality)
- •
(Properness) is finite
- •
(Monotonicity) If then both are at most .
- •
(Order) is totally ordered by an order such that is lowest, is greatest, and if , then
[TABLE]
and
[TABLE]
Then choosing larger than , the projection complex is defined as follows: it is a graph whose vertices are the elements of and where span an edge if and only if . Then [BBF, Thm. 3.16] states that for sufficiently large , is connected and quasi-isometric to a tree for its path metric.
1.2 Composite projection systems
In this work, we are concerned with a composite situation.
1.2.1 Definitions, and projection complexes
Let be the disjoint union of finitely many countable sets . Their indices are called the coordinates. Given , denote by its coordinate: .
Definition 1.2**.**
A composite projection system on a countable set is the data of a constant , of a family of subsets (the active set for ) such that , and of a family of functions , satisfying the symmetry, the triangle inequality, the Behrstock inequality for whenever both quantities are defined, the properness for when restricted to each , the separation for , and also three other properties related to the map :
- •
(symmetry in action) if and only if ,
- •
(closeness in inaction) if , for all ,
- •
(finite filling) for all , there is a finite collection of elements in such that covers .
The closeness in inaction can be understood as a complement to Behrstock inequality: “if , then is defined and is less than ”.
Applying [BBF] (as recalled in the previous subsection) we get, for each coordinate , and for a suitable choice of , a modified function . This function is unfortunately not defined on , but is defined on it, and thus we choose to define to be if both are in and otherwise.
We then define . The elements need not be in the same coordinate.
In the following we first choose such that the construction of [BBF] applies for all coordinates , and this provides the constants and (suitable for all coordinates).
Then we choose , and . One can choose sufficiently large to get quasi-trees in all coordinates, but this is not important for us.
Finally, choose for later purpose.
To keep track of the constants, it is worth keeping in mind that
[TABLE]
1.2.2 Group in the picture
An automorphism of a composite projection system is a map
- •
that induces a bijection on each ,
- •
that sends to ,
- •
such that for all , and all , .
A rotation around in a composite projection system is an automorphism such that , and such that for all , and for all , , and .
Let us now assume that a group acts on the composite projection system by automorphisms.
Let us denote by the stabilizer of .
We say that a subgroup has proper isotropy if for all there is a finite subset of such that if , and if , then .
1.2.3 Betweenness and orbit estimates
Lemma 1.3**.**
(Betweenness is transitive)
If and , then is in and .
If and , then .
Proof.
By Behrstock inequality, one has in both cases. For the first implication, by triangular inequality, .
For the second implication, is within from . Behrstock inequality gives that and therefore . ∎
Lemma 1.4**.**
(Orbit estimates, or transfer in a coordinate)
Assume that has proper isotropy.
For the finite subset of , and for all , and all that is either in or in , and all , then either or .
Proof.
Let us first treat the case of . If we are done. Assume that . By closeness in inaction, , and by Behrstock inequality (and because ), one has . By proper isotropy (and coarse triangle inequality), . Thus, by Behrstock inequality again, .
Now assume that , but is in . Since we can measure and (since preserves ) also . By proper isotropy, and therefore at least one of the quantities and is larger than . Assume for instance that . Then by Behrstock inequality, . ∎
To facilitate notations, we will say that a property is true for almost all elements of a group if the property holds for all elements outside a certain finite subset of the group. Using this lemma four times, together with triangle inequality, one gets:
Lemma 1.5**.**
(Orbit estimates for proper isotropy)
Let such that . Assume that either is in or in .
If the group and have proper isotropy, then for almost all elements and , one has
[TABLE]
Recall that we chose .
Proposition 1.6**.**
(Ellipticity)
Given , and any , the group has an orbit in of diameter at most .
Proof.
If , and more generally, if fixes an element , it is obvious. Assume then that .
The group preserves the set for any hence for . Consider in this set, we claim that is empty. Assume . Since we can consider and . By triangle inequality, . Thus, one of them needs to be larger than hence is either in or in , and this is a contradiction to our assumption. ∎
Proposition 1.7**.**
(Induced orders)
Consider , with . Assume that are infinite subgroups of with proper isotropy.
For all , for all , the set is finite, and carries a partial order , that is given by the order of , for arbitrary , , in , and almost all and .
Proof.
Let us first check that the set is finite. We may assume that there are and , otherwise is empty. By Lemma 1.4, there exists , such that each is in either one of the four sets for and . The union of these four sets is finite by properness axiom.
We now need to check that the order on includes all and does not depend on the choice of the points . By Lemma 1.5, for arbitrary choice of points, and for any , there is a finite set of and of such that for all elements , outside these finite sets, (the finite sets depend on the choice of though). Since is finite, we may find a finite set of and suitable for all of them. Thus, for almost all , all is ordered, and the order, once chosen the points , does not depend on .
Assume that for two different choices of points , namely and , the orders are different, and take such that for the first order, and for the other.
means that . By the orbit estimate, for suitable .
means that , and by the orbit estimate, . Finally, by coarse triangular inequality, , contradicting the assumption that is in .
∎
1.3 Convexity
Definition 1.8**.**
(Convexity)
Let . We say that a subset is -convex if: for all , for all , for all , the set is a subset of .
Let now be a -tuple of positive numbers. A subset of is said -convex if for all , of same coordinate , and for all , the set is a subset .
Note that being -convex, for is equivalent to being -convex.
Definition 1.9**.**
Let non-empty, and for which is non-empty. Let . Define as the set of satisfying the following.
- •
**
- •
**
- •
* is non-empty, and for all , one has .*
Proposition 1.10**.**
Assume that for all , is invariant by an infinite group of rotations around , with proper isotropy. If , then for all for which it is defined, the set is finite.
Proof.
From the definition, . By finite filling assumption on the projection system, there is a finite collection of elements such that covers .
In particular, is inside a finite union of sets of the form which are finite by Proposition 1.7. ∎
Proposition 1.11**.**
Assume that for all , is invariant by an infinite group of rotations around , with proper isotropy. Let .
If is -convex, and if then .
Moreover, if contains , then .
Proof.
Let in coordinate . There exists such that .
Assume that . If it is not in , then and . Transfering in the coordinate of (by invariance under ), one has . By convexity, though we assumed otherwise. Therefore, . Therefore, by definition of , one has , but also . It follows by transitivity of betweenness (Lemma 1.3) that .
The second assertion is a direct consequence of the definition. ∎
Proposition 1.12**.**
Assume that for all , is invariant by an infinite group of rotations around , with proper isotropy. If is not empty, for all , there exists such that .
Proof.
Let us say that has -links to if has elements.
For any such index , take a minimal item in for the order of Proposition 1.7. Then, by Proposition 1.11, is included in , thus has at most -links to .
Iterating this choice at most times, we find an element that has no -links to . Therefore . ∎
Proposition 1.13**.**
Let . Consider , and assume it is -convex, and that for all , there is , infinite, that leaves invariant and that has proper isotropy.
If is well defined and empty, then is -convex.
Proof.
If is empty, there is nothing to prove. We assume it is non-empty. Consider for some , and assume that . Notice that though, and since they have same coordinate. Hence, .
Let be any other element of . Transfer in the coordinate , inside , by . There exists such that . But, being -convex, one has . It follows by triangular inequality, that . Since this is true for all as above, it follows that , contradicting our assumption.
∎
2 Composite rotating families and windmills
We proceed to adapt the rotating families study of [DGO] to the context of composite projection systems.
2.1 Definition
Definition 2.1**.**
(Composite rotating family)
A composite rotating family on a composite projection system, endowed with an action of a group by isomorphisms, is a family of subgroups such that
- •
for all , is an infinite group of rotations around , with proper isotropy
- •
for all , and all , one has
- •
if then and commute,
- •
for all , for all , if then for all , .
We will show the following.
Theorem 2.2**.**
Consider a composite projection system. If is a composite rotating family for sufficiently large , then the group generated by , has a partially commutative presentation.
More precisely, two presentations of are
[TABLE]
and, for a certain ,
[TABLE]
In these presentations, we consider implicit the relations of the groups that appear in the generating sets. Moreover the expression refers to the following precise collection of formal relations: for all in , for all , given the element equal to (which exists by definition of composite rotating family), we add the relation . It is somewhat tautological, but necessary in a presentation over this generating set. The point of the second presentation is to avoid these tautological relations by reducing the generating set to a certain set of representatives of conjugacy classes of groups .
Unfortunately, it is not so easy to describe a-priori the subset . It is constructed recursively in a number of steps, by taking at each step orbit representatives of a certain subset of under the action of the group generated by the that have been collected so far in the process. In principle, it probably can be enumerated explicitely, but at the cost of a certain complexification of the exposition.
The following result is, in our point of view, an incarnation of the Greendlinger lemma, from the small cancellation theories. If one considers a relation of the quotient group, one can find in it a large part of a defining relation . Compare to [DGO, §5.1.3].
Let us consider as in the previous theorem, and . A principal coordinate for is a coordinate for which, for all , (the constants are somewhat ad-hoc, chosen for the counting arguments to flow properly). In that case, a shortening pair for in a principal coordinate , at , is a pair consisting of a element of , and of an element such that .
Theorem 2.3**.**
Consider a composite projection system. If is a composite rotating family for sufficiently large , let be the group generated by
Then for all , there is a principal coordinate for and a shortening pair for in that coordinate.
A major tool for analysing rotating families was the concept of windmills. We are going to use composite windmills.
Let us fix the -tuple
[TABLE]
Let be the cyclic shift on : , and define obtained by shifting the coordinates of the -tuple.
Thus reaches its maximum on the coordinate , minimal value at . Note that the maximum of is less than .
Definition 2.4**.**
(Composite windmills)
A composite windmill is a collection in which
- •
* is the subgroup of generated by a set of subgroups for either or ,*
- •
* is a subset of for all , invariant under ,*
- •
* is called the principal coordinate, and ,*
- •
* is -convex.*
- •
The group has a partially commutative presentation, that is a presentation of the form
[TABLE]
where is the union over a subset of of generating sets for , and consists of words over the alphabet of the form for a word over . Moreover, if and , the word is in if and only if .
- •
(Greendlinger property) for each there is , and for all , either , or there is an such that . Moreover, there is a such that (the pair is called a shortening pair for at ).
We say that the composite windmill has full group if is the subgroup of generated by .
If we do not mention it, our windmills will be full. Only in specific circumstances do we need non-full windmills. Indeed, we will use the case of a non-full group only at most one time by coordinate, when initiating the process in each coordinate.
Proposition 2.5**.**
In a composite windmill , for all such that , is connected in .
Proof.
Consider two points in it, by [BBF, Thm. 3.7] (more precisely the first claim in its proof), there exists a path between them, such that for each , . Since , it follows that each is in . ∎
We say that a windmill (with its representative set used for the presentation of the definition) is constructed over if and if the set of representatives contains the set of representatives . Note that it is transitive: if is constructed over , and is constructed over , then is constructed over .
2.2 Osculations of two kinds
- •
An osculator of type gap of a composite windmill is an element of such that there exists , , that are in and such that .
- •
An osculator of type neighbor of a composite windmill is an element of such that .
Lemma 2.6**.**
Consider a composite windmill , assume that , and let be an osculator of type gap.
Let in . Then there exists such that .
Proof.
If is an osculator of type gap, there are , for some , such that .
Let , and consider its orbit under the groups , and , which preserves . We may use Lemma 1.5 to find in these orbits, hence in , such that .
By the coarse triangle inequality, for at least one point among , say , we have . Behrstock inequality gives .
∎
Lemma 2.7**.**
Let be a composite windmill, and be two osculators of . Assume , and let .
If is of type neighbor and is -convex, then .
If is of type gap, then .
Proof.
If is an osculator of neighbor type, then the result follows from Proposition 1.13.
If now is an osculator of type gap, the proof is slightly more involved. There is , and there are such that .
Since is non-empty, and invariant for and , we can apply Lemma 1.5 and find such that which is . By coarse triangular inequality, at least one of the quantities and is greater than . Say it is . Behrstock inequality then gives that , and again coarse triangular inequality gives . Since the first is bounded by the maximal convexity constant of , the result follows.
∎
2.3 The unfolding in the different coordinates
Given a composite windmill , we will define its unfolding.
Observe first the following, which justifies the next definition of admissible set of osculators.
Lemma 2.8**.**
If is a composite windmill, it has some gap osculator if and only if it is not -convex.
Assume that for all , . If is -convex, and yet does not contain , then there exists a neighbor osculator.
Proof.
The first assertion is direct from the definitions. To prove the second assertion, take . By Proposition 1.12 there is in such that . It is therefore a neighbor osculator of .
∎
We define now admissible sets of osculators of a composite windmill that does not cover the entire set .
If is not -convex, then the (only) admissible set of osculators for is the set of osculators of type gap in . Note that it can be the empty set if the gap osculators are not in the coordinate .
If is -convex (but does not cover the entire set ), then an admissible set of osculators for is a set for a choice of an osculator (necessarily of type neighbor).
We define the unfolding of as follows.
Definition 2.9**.**
(Unfolding) Let be a composite widmill that does not contain the entire set , and be an admissible set of osculators.
Define, for all , to be the union of all the images of by elements of the group generated by . The unfolding of is then , where is taken modulo .
If contains , its unfolding is .
Here is an obvious lemma.
Lemma 2.10**.**
(Trivial unfolding) Let be a choice of an admissible set of osculators of . If is empty, then the unfolding is a composite windmill.
We thus concentrate on the case where is non-empty.
In the case is empty, we include here a convexity result for an intermediate step in the construction: adding an admissible set of osculators , which produces a non-full composite windmill.
Lemma 2.11**.**
Assume that is a full composite windmill of principal coordinate , with .
Let be a set of admissible osculators as defined above, assumed non-empty.
For all other coordinates, let .
Then is a non-full composite windmill of principal coordinate . If moreover is the orbit of a neighbor osculator, and if is -convex, then is -convex, for .
Proof.
If , there is nothing to prove. Consider the case of the orbit of a neighbor osculator. It suffices to check that is convex in the sense that for all and all the set is in .
By the Greendlinger Property, given , there exists , and such that , or (if is not active for all the shortening pairs of ).
Of course we consider only the first case of the alternative.
Assume that some is in .
If , then one can use a shortening pair at to reduce the length of in its principal coordinate, and this shortening pair gives such that . Thus, as well, and by performing this reduction sufficiently many times, we may assume that .
By Lemma 1.4, either or approximates by the projection of on .
Say that . By osculation if , one has . Therefore, one has which is less than .
If now , one has is within from , which equals . Of course, if and only if , hence, if it is the case, by osculation of , , and .
In the case where is the set of gap osculators, the proof is similar. Indeed, if is a gap between and , and is a gap between and , and if is between and , so that , then is also between (or ) and (or ) so that, say, . One can transfer in the coordinate of by Lemma 1.4, in (in the -orbit of ). The convexity of then shows that .
∎
The aim of the next sections is to prove the following.
Proposition 2.12**.**
If is a (full) composite windmill, and is an admissible set of osculators, then the unfolding is a (full) composite windmill, and can be chosen to contain (in other words, is constructed over ).
2.3.1 Unfolding a tree
Proposition 2.13**.**
(Principal coordinate tree)
Consider a full composite windmill , of principal coordinate .
Let be an admissible set of osculators as defined in the previous section. If , let , and otherwise let .
There exists a -tree , bipartite, with black and white vertices, with an equivariant injective map (the set of subsets of ) that sends black vertices to images of osculators by , and white vertices to images of by , and that sends the neighbors (in ) of the preimage of to .
Moreover, for any pair of distinct white vertices , and any black vertex in the interval between them (in ), and any , one has .
Finally, if are white vertices for which the path from a black vertex starts by the same edge, then for any , one has .
Proof.
Take a transversal of under the action of . For each , let the subgroup of generated by .
Set to be the Bass-Serre tree of the (abstract) graph of groups whose vertex groups are and the groups , and the edges are the pairs , and the edge groups are the groups .
Let the fundamental group of this graph of groups. The group is a quotient of this group, since it is generated by and the stabilizers of elements of , which, by assumption (Definition 2.1), are direct sums of their rotation group with the groups .
is a tree, endowed with a -action, bipartite, and with an equivariant (with respect to ) map that sends black vertices to images of elements of by , and white vertices to images of by .
We need to show that it is injective, and at the same time, we will show the estimate of the end of the statement.
Consider a path of , starting and ending at white vertex. Up to cyclic permutation, and up to the group action, we may assume that the path starts at the vertex fixed by , and its second vertex is fixed by some , and that its length is even.
Let us denote by the consecutive vertices of , and let be a choice of a element of , and .
The monotonicity property in the coordinate says that if then .
We will use it in an induction to establish that for all odd, and all in and all in , one has
[TABLE]
The case happens as follows. Choose .
We first show how a black vertex separates two adjacent white vertices. Note that there is that equals for some . By convexity of (ensured by assumption, or by Lemma 2.11 in case is empty), . And by assumption on the rotating groups, . Thus, , the second inequality.
By Lemma 2.7, and . By triangle inequality, we get . We have both inequalities.
Assume that the inequalities are proven for all such that (and for all ), and let us choose and with , and prove the inequality for .
Set , and and . In the following we set either or , and either or .
By the inductive assumption for , , one has .
Also for , and the induction gives . Behrstock inequality then provides and therefore . This is still far above . One thus may apply the monotonicity property and obtain . In other words,
[TABLE]
The inequality is also proven for in the same manner, symmetrically. This finishes the induction.
In the end, we have obtained for , and , , and it follows that , which is the estimate of the statement.
If we assume that is mapped to a loop, contains both and , and not (it is an osculator), the convexity of imposes , meaning . and this contradicts our choice of .
It also follows from this analysis that if are white vertices of and is a black vertex between then, then (in our induction above). A final use of Behrstock inequality provides that whenever the paths from to a white vertex has more than three edges, then if is the first black vertex after on this path, and if , then . It follows from that and Lemma 2.7 that if is another white vertex whose path from starts at the same edge, .
∎
The former proposition allows to define, for each element of , its principal coordinate, and its principal tree. Indeed, if is not conjugated to , the proposition shows that it is either loxodromic or the stabilizer of a black vertex on the tree . Then we define its principal coordinate as and its principal tree as . If it is in , or conjugate in it, its principal coordinate and its principal tree are defined inductively, according to the process of unfoldings of composite windmills.
2.3.2 Preservation of convexity
Proposition 2.14**.**
(Convexity of )
Let be a composite windmill (possibly non-full).
Assume that is an admissible set of osculators, and the unfolding defined in Definition 2.9
If consists of the orbit of a neighbor, then is -convex.
If consists of gap osculators, then is -convex.
The case of is trivial, so we assume it is not empty.
Proof.
If consists of the orbit of a neighbor, let for all . If consists of gaps, let (which is less than ).
Let , consider .
Here is our main claim.
We will show that is a -translate of one of the following type of elements:
- •
for which there exists such that ;
- •
for which there exists , and an osculator of in such that ;
- •
for which there exists osculators of in such that
We will then finish the proof with this claim established, but before that we will prove the claim.
*Transfer of and to . * In , the groups and preserve which is not empty (it contains ). Therefore, by Lemma 1.5 there are in such that .
The interval in . Taking of and of produces two vertices in the principal coordinate tree of Proposition 2.13. More precisely, either one of is the image of a black vertex of , or in the image of a white vertex of . This thus give two vertices of that we (slightly abusively) denote by .
If these vertices are adjacent, we have achieved the second point of the claim. If these vertices are the same, we have achieved the first point of the claim. If these vertices are different, both black with only one white vertex in the interval, we have achieved the third point of the claim.
Thus, we may assume that there is at least one black vertex of in the open interval . Let the images by of these black vertices, in order starting from the side of .
By Proposition 2.13, we have for all , , which is .
Reduction to the case where
If is equal to one of the then we fall in the first possibility of the main claim. Thus, let us assume that is different from all the .
We may assume that is in for all . Indeed if it was not, one could use an element of to reduce the length of the path , without changing the value of the projection distance since leaves invariant.
Transfer of in . We may apply Lemma 1.4 again, and find an element in (far in an orbit of ) such that, for all , one has .
Position of in the order. Fix . Since , either or is larger than .
All are in therefore they satisfy the order property in this set, which coincide with the ordering of their indices. By this order property and Behrstock inequality, if for some one has , then for all , one still has . Similarly if then for all greater the same holds.
Therefore we have three cases.
Either or , or there exists , largest such that and .
By symmetry, and translation by an element of the first and second case have same resolution. Let us treat the first one. By triangle inequality, which is still greater than .
Going back to : . By Behrstock inequality, , and finally by triangle inequality, . We are in the second point of the claim if is in a white vertex, and in the third point if it is a black vertex.
We thus turn to the case where there exists , largest such that and .
One has
[TABLE]
and
[TABLE]
So, . We have the third point of the claim, and the claim is established.
We need to finish the proof of the lemma. There are several cases to treat. The easiest is when the first case of the claim occurs.
In that case, if , is actually a gap osculator, hence in . If , by convexity of , it is in .
Assume now that the second case occurs.
If is of type neighbor, it simply contradicts Proposition 1.13.
If is an osculator of type gap between , and , one easily gets that is an osculator of type gap between and either or (any one for which is larger than , and by triangular inequality, there must be at least one). If , we may use the same argument. therefore is larger than for either or . Then, and by triangular inequality, . It follows by convexity of that .
Finally, assume that the third case occurs.
Assume that is an osculator of type gap, between . Then, again with the same reasoning, and there is for which it is in and is less than . Thus , and we are back to the case of the claim, with a slightly lower constant. The proof goes nevertheless through, and the desired conclusion holds.
Finally, assume that is of type neighbor. Then both are of type neighbor, and for some . Let us rename , call , and the principal coordinate of (for the Greendlinger property). Let be the vertex of a shortening pair for for which (there exists one, otherwise one can reduce the length of in its principal tree by a shortening pair at ). Thus, .
Suppose . Then, there are two possible cases. Either or (or both).
In the first case, . Thus , and so .
Recall that . Thus , and . Now let any other element of in . By -convexity of , one has and therefore . In other words, and this contradicts the fact that is a neighbor.
In the second case, the situation is similar after composing by the automorphism .
∎
2.3.3 The unfolding is a windmill
Proposition 2.15**.**
If is a composite windmill, and if is an unfolding over an admissible set of osculators, then is a composite windmill.
Moreover, the set of the fifth point of the definition can be assumed to contain the set (in other words, is constructed over ).
Proof.
The first three points follow by construction. The fourth point (convexity) is the result of Proposition 2.14. The sixth point is a consequence of Proposition 2.13. The same proposition introduces an action of on a tree which is Bass-Serre dual to a presentation of as the fundamental group of a graph of group, with one vertex carrying the group and the other vertices , adjacent to a single edge whose other end is , carrying the group , if is a representative of the orbit .
∎
2.4 Towers of windmills, and accessibility
2.4.1 Starting point
We start the process by selecting to be a maximal collection of mutually inactive elements in . Thus, whenever , it is reduced to a single point.
We choose . It is clear that defines a composite windmill where for all , is either empty or a singleton, and where is the direct product of the groups , for (there are at most direct factors).
is -convex, and for all , by maximality of , . Recall that by choice, , hence by Proposition 1.12, there exists a neighbor osculator in .
2.4.2 The process
Recall that we assumed to be countable.
We will work with indices in the set of countable ordinals: we will define for any countable ordinal (not necessarily a number). We take the notation
[TABLE]
Let us convene that means that for all . This is not an order relation, however note that, for full windmills, if , and if is fixed, there are only possibilities for (corresponding to the values of ). We will also write if and one of the inclusions is strict.
We have chosen . In order to define for any countable ordinal, we treat separately the case of a successor of some ordinal, and the case of a limit ordinal.
For any countable ordinal , we define to be the unfolding of (as in Definition 2.9) over an admissible set of osculators. Recall that if there is no gap osculator at all, one may need to choose a certain neighbor osculator to define a choice of admissible set of osculators. We could, but do not impose the choice.
Note that by maximality of , Lemma 2.8 can be applied to show that such a choice is always possible for all .
Lemma 2.16**.**
If is a composite windmill, then is still a composite windmill, constructed over .
Proof.
This follows from Proposition 2.12 if the set of osculators is non-empty, and from Lemma 2.10 otherwise. ∎
We now define assuming is a limit ordinal, and that all , for have been defined, and satisfy for all .
We consider for each , and , and we set .
Lemma 2.17**.**
If is a limit countable ordinal such that for all , is a composite windmill, and that for all , is constructed over . Then is a composite windmill, constructed over , for all .
Proof.
One easily check that all the points, except possibly the fifth (on the partially commutative presentation) of the definition 2.4 of composite windmill are satisied after taking a direct union. Assume that the fifth point is not satisfied. Consider then the smallest ordinal such that this point fails. is a limit ordinal (otherwise Lemma 2.16 says that is a composite windmill constructed over earlier ). Fix . For all , is contained in .
Note that by definition, for each ,
[TABLE]
Since for all less than , is constructed over , we obtain a presentation of by increasing union of the generating sets of (each of which contains that of ), and by increasing union of the relators of . The fifth point of Definition 2.4 is then satisfied by , and it is a composite windmill constructed over . Since this is true for all , we obtain a contradiction with the definition of . ∎
2.4.3 Accessibility
Lemma 2.18**.**
Let be the set of countable ordinals such that . Then is countable. Moreover, for each in , consecutive in , there are at most ordinals between and .
Proof.
For each , unless it is its maximal element, one can associate its successor in , and therefore an element in in but not in . The assignation of is obviouly injective on , and is countable, thus is countable.
For the second assertion, assume that there are consecutive countable ordinals outside , all less than some . Then by the pigeonhole argument, for two of them, , one has . Thus, by the rules of construction of , one has for all , ro equivalently, for all , . Since we take direct limits for limit ordinals, this holds also for all countable ordinal. However is a countable ordinal, and therefore , contradicting that .
∎
Lemma 2.19**.**
There is a countable ordinal , such that .
Proof.
By Lemma 2.18, the suppremum of is still a countable ordinal. Call is this ordinal, is thus well defined. Assume that . Then it follows from Lemma 2.8 that is not -convex. Therefore, there is a gap osculator in one of the coordinates, and this coordinate is reached while . This is a contradiction on the definition of . Thus, .
∎
2.5 End of the proof Theorems 2.2 and 2.3
Consider from Lemma 2.19. Assume it is not a composite windmill. Then there is a smallest ordinal such that is not a composite windmill. If is not a limit ordinal, it is of the form for such that is a composite windmill. Lemma 2.16 concludes a contradiction. If is a limit ordinal, then Lemma 2.17 concludes a contradiction. Thus is a composite windmill.
Since it contains all elements of , the statement of the Theorems 2.2 and 2.3 follow from the definition of composite windmill.
3 Conclusion, application to Dehn twists, and Theorem 1
Let be an orientable closed surface of genus greater than . Consider its Mapping Class Group.
Bestvina Bromberg and Fujiwara produced a finite coloring of the set of simple closed curves of such that two curves of same color intersect, and a finite-index normal subgroup of that preserves the coloring. is called the color preserving group. After refinement of the colors, we actually may assume that the colors are in correspondance with the cosets of . We denote the colors by .
Let and be simple closed curves. If they intersect, the projection of on is the family of elements in the arc complex of the annulus around (that is the cover of associated to ) that come from lifts of . They are all disjoint. If is another simple closed curve intersecting , is the diameter in the curve graph of the union of the projections of and on the annulus around .
defines a composite projection system on the set of all (homotopy classes of) simple closed curves. Indeed, let be the set of curves intersecting . Clearly is symmetric, and satisfies the separation. The symetry in action, and the closeness in inaction are also direct consequences of definitions. The finite filling property is a consequence of the fact that all sequences of subsurfaces up to isotopy, increasing under inclusion, are eventually stationnary. satisfies the triangle inequality since it is a diameter of projections, and the Behrstock inequality [B], see also [Man] [Man2]. The properness is ensured by [BBF, Lemma 5.3]
We can now define two composite projection systems with composite rotating families. The first one is defined on is the set of all homotopy classes of simple closed curves of .
Let us define to be the subset of this set of simple closed curve of color in the Bestvina-Bromberg-Fujiwara coloring, and their union. It is, as we just said, a composite projection system on which acts by automorphisms.
Performing the construction of [BBF] and the choices as after Definition 1.2, we have constants .
We select such that all -powers of Dehn twists in are in . This is possible since there are only finitely many -orbits of simple closed curves in , and has finite index. Then we select a multiple of such that for all simple closed curve , the Dehn twist around satisfies that if is a curve of the same color than (hence intersecting ). Since is comparable with , by definition of the latter, there exists such an exponent . Then it follows that, for all , the collection , is a composite rotating family.
The second composite projection system is a sub-system, invariant for , provided by the -orbit of a simple closed curve . Namely, the composite rotating family is the collection .
It is straightforward that both families are composite rotating families.
One can then apply Theorem 2.2. In the first case, one obtains that the group generated by the -th powers of all Dehn twists has a partially commutative presentation, which is the second point of Theorem 1. In the case of the second composite rotating family, one obtains that the group generated by all -th powers of all Dehn twists that are -conjugated to has a partially commutative presentation. This latter group is the normal closure of in . We therefore obtained Theorem 1.
Acknowledgements
The present work has been mostly developed during the visit of the author to the Mathematical Science Research Institute in Berkeley, during the thematic semester on Geometric Group Theory of the Fall 2016. The author is supported by the Institut Universitaire de France.
I wish to thank M. Bestvina, K. Bromberg, K. Fujiwara, J. Mangahas, J. Manning, and A. Sisto for discussions, and J. Tao, and S. Dowdall for organising an influencial working seminar in MSRI. After I talked in MSRI on a first version of this work, which was performed on cone-offs of the blown-up projection complexes of [BBF], and was more in line with [DGO, §5], J. Mangahas suggested that I work directly in the language of projection complexes, which is indeed more natural for this situation, and allows a similar argument; this choice is in line with one of her work in progress with M. Clay and D. Margalit. I thank T. Brendle and D. Margalit for suggesting relevant references. I finally thank the anonymous referee whose remarks helped to improve the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[B] J. Behrstock, Asymptotic geometry of the mapping class group and Teichmüller space. Geom. Topol. 10 (2006), 1523–1578.
- 2[BBF] M. Bestvina, K. Bromberg, K. Fujiwara, Constructing group actions on quasi-trees and applications to mapping class groups. Publ. Math. Inst. Hautes Études Sci. 122 (2015), 1–64.
- 3[BM] T. Brendle, D. Margalit, Normal subgroups of mapping class groups and the metaconjecture of Ivanov, ar Xiv:1710.08929.
- 4[CLM] M. Clay, C. Leininger, D. Margalit, Abstract commensurators of right angled Artin groups and Mapping Class Groups, Math Research Letters, 21 (3) 461–467 (2014).
- 5[Cou] R. Coulon, Partial periodic quotients of groups acting on a hyperbolic space, Ann. Inst. Fourier, Grenoble, 66, 5 (2016) 1774–1857.
- 6[DGO] F. Dahmani, V. Guirardel, D. Osin, Hyperbolically embedded subgroups and rotating families in groups acting on hyperbolic spaces. Mem. Amer. Math. Soc. 245 (2017), no. 1156, v+152 pp.
- 7[Fa] B. Farb, Some problems on Mapping Class Groups and Moduli Spaces, in Problems on Mapping Class Groups and Related Topics, B. Farb Editor, Proceedings of Symposia in Pure Mathematics, vol.74, Amer. Math. Soc (2006) 11–56.
- 8[Fu] L. Funar, On the TQFT representations of the mapping class groups, Pacific J. Math. 188 (1999), no. 2, 251–274.
