Relative hyperbolicity for automorphisms of free products
Fran\c{c}ois Dahmani, Ruoyu Li

TL;DR
This paper establishes conditions under which automorphisms of free products lead to relatively hyperbolic semidirect products, extending previous results and applying to conjugacy problems in free products of abelian groups.
Contribution
It proves that certain atoroidal automorphisms of free products produce relatively hyperbolic semidirect products, generalizing known theorems and applying to conjugacy problems.
Findings
Semidirect products are relatively hyperbolic under specified automorphisms.
Extension of Gautero-Lustig and Ghosh's theorem to free products.
Application to conjugacy problem in free products of abelian groups.
Abstract
We prove that for a free product with free factor system , any automorphism preserving , atoroidal (in a sense relative to ) and none of whose power send two different conjugates of subgroups in on conjugates of themselves by the same element, gives rise to a semidirect product that is relatively hyperbolic with respect to suspensions of groups in . We recover a theorem of Gautero-Lustig and Ghosh that, if is a free group, an automorphism of , and is its family of polynomially growing subgroups, then the semidirect product by is relatively hyperbolic with respect to the suspensions of these subgroups. We apply the first result to the conjugacy problem for certain automorphisms (atoroidal and toral) of free products of abelian groups.
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.
Relative hyperbolicity for automorphisms of free products, and free groups
FranΓ§ois Dahmani, and Ruoyu Li
Abstract
We prove that for a free product with free factor system , any automorphism preserving , atoroidal (in a sense relative to ) and none of whose power send two different conjugates of subgroups in on conjugates of themselves by the same element, gives rise to a semidirect product that is relatively hyperbolic with respect to suspensions of groups in . We recover a theorem of Gautero-Lustig and Ghosh that, if is a free group, an automorphism of , and is its family of polynomially growing subgroups, then the semidirect product by is relatively hyperbolic with respect to the suspensions of these subgroups. We apply the first result to the conjugacy problem for certain automorphisms (atoroidal and toral) of free products of abelian groups.
Contents
-
1.7 More mapping tori: global preservation of a collection of subgroups
-
3.2 The case of free groups, and a theorem of Gautero-Lustig
Introduction
Context
Given a group and an automorphism , the geometry of is encoded in the group . An appealing feature of geometry in groups is hyperbolicity, in the sense of Gromov. In some circumstances, it can be exhibited by . One of the most iconic examples of this comes from diffeomeorphisms of surfaces. Let be a closed orientable surface of genus larger than , and a pseudo-Anosov diffeomorphism, fixing a base point . Instead of introducing the language of laminations, let us settle for Thurstonβs characterisation of pseudo-Anosov diffeomorphisms, as those that fail to preserve any finite collection of homotopy classes of simple closed curves. Thurston [35] famously proved that the mapping torus of by is a closed three-manifold admitting a hyperbolic metric. Its fundamental group is therefore a uniform lattice in and it is Gromov-hyperbolic. Let be the automorphism of the fundamental group induced by . The fundamental group of can be expressed as . Rephrasing this with eyes only for this semi-direct product, we can say that is a hyperbolic group if and only if is an atoroidal automorphism, in the sense that neither it, nor any of its proper powers, preserve a non-trivial conjugacy class.
In the case of a free group , Brinkmann proved an analoguous result: is hyperbolic if and only if is atoroidal. In [10] the first named author illustrated an application of this geometric study to the conjugacy problem for these automorphisms.
In this paper, we investigate the case of automorphisms of a free product of groups, . The conjugacy classes of the groups form a free factor system, and the group is free of rank . This context is a rich source of examples. It can be traced as early as the work of Fouxe-Rabinovich [15] (and earlier Golowin and Szadowsky [23] for the case of few factors), and it received a modern, illuminating reference in the work of Guirardel and Levitt [25]. We formulate a relevant property of atoroidality for automorphisms preserving a free factor system. We investigate the geometry of the semi-direct products produced by atoroidal automorphisms. One cannot expect hyperbolicity in general, due to the nature of the factors of the free product. Thus we are interested in relative hyperbolicity. Interestingly, one cannot expect proper relative hyperbolicity in general neither.
Let us illustrate this. Consider a free product , and and automorphism. It has to preserve the conjugacy class of the factor , so we may just assume, by conjugating it (by moving the base point) that it preserves the group seen as a subgroup of . Being an automorphism, it has to send the factor on a conjugate of it by an element of . So after conjugating again, we may assume that preserves both and . On each of them, it induces an automorphism described by a matrix in and . One can choose these matrices so that is genuinely atoroidal. However, cannot be interestingly relatively hyperbolic: if it were, the factor would have to be parabolic, hence the semidirect factor , normalizing it, would be in the same parabolic subgroup. But it also normalises the factor , so this factor would be in the same parabolic subgroup too, and we see that would be a single parabolic subgroup.
Results
We propose conditions for the relative hyperbolicity of to hold, when . Francaviglia and Martino have defined the notion of full irreducibility for automorphisms of free products [16]. A first condition is the full irreducibility with the atoroidality, when the Scott complexity is sufficiently large. We propose the obstruction of twinned pair of subgroups (which is crucial for the case of reducible automorphisms). See Definition 1.7, that we anticipate here: we say that has a twinned pair of subgroups in the free factor system of if there are two conjugates of free factors , and an element , such that, for some , simultaneously preserves and (here is the conjugation by ).
Theorem 1
(See Theorem 2.1)
Let be a finitely generated group with a free factor system , of Scott complexity , different from and . Let be fully irreducible and atoroidal. Assume that it has no twinned subgroups in for .
Then the semi-direct product is relatively hyperbolic, with respect to the mapping torus of .
The assumption on the Scott complexity is ensured if the free product decomposition of is different from a single free product , or an HNN extension . We think, but did not prove, that the assumption on absence of twinned subgroups always hold for fully irreducible atoroidal automorphisms in the Scott complexity of the statement. In principle though, the group generated by two preserved subgroups conjugated to free factors can fail to be a free factor.
In the reducible case, we prove the following, in which the assumption on absence of twinned subgroups is crucial.
Theorem 2
(See Theorem 2.20)
Let be a finitely generated group, and be a free factor system. Let be atoroidal for . Assume that there is no pair of twinned subgroups in for and .
Then is relatively hyperbolic with respect to the mapping torus of .
This last statement contains Brinkmannβs result on free groups. It has a number of potentially interesting cases to which it can be applied, as for instance, the following corollary in which we say that an automorphism is toral if for each such that there exists such that is the identity on .
Corollary 3
(See Coro. 3.2)
Assume that is finitely generated, and that is a free factor system of consisting of torsion free abelian groups. If is atoroidal, and toral, then the group is toral relatively hyperbolic.
Theorem 2 can also be applied in the realm of free groups, to automorphisms of free groups that are non-necessarily atoroidal, by hiding the lack of atoroidality in some subgroups, the so-called polynomially growing subgroups for the automorphism. In the favorable case that these subgroups form a free factor system, one may apply our theorem. In the general case, we apply a variant of our study, that applies, not only to trees, but to hyperbolic coned-off graphs from these trees. We thus recover the following theorem of Gautero and Lustig, and Ghosh. See Section 1.5 for a definition and references about polynomially growing subgroups.
Theorem 4
(Gautero-Lustig, and Ghosh) (See Theorem 3.5)
If is an automorphism of a finitely generated free group . The semidirect product is relatively hyperbolic with respect to the mapping torus of the collection of maximal polynomially growing subgroups for the outer class of .
In the case where has at least one exponentially growing element (the only interesting case), this theorem is important. It allows a natural approach to several problems, otherwise rather complicated ([5] [7] [11] among other). Unfortunately, the proof of Gautero and Lustig has to be qualified as incomplete for the time being (it relies on some unwritten, or unavailable material about a certain type of train tracks). Very recently Ghosh proposed a proof [22], relying on some other, advanced, type of train tracks for free group automorphisms. We notice that the train track technology involved in our proof is significantly more accessible, as it is fundamentally based on Bestvinaβs elegant approach in [3], chosen by Francaviglia and Martino [16] for their adaptation for free products.
As an application of this work, we propose a solution to the conjugacy problem for toral atoroidal automorphisms of free products of non-cyclic free abelian groups, for the Scott complexity .
Theorem 5
(See Theorem 3.6)
Let be a finitely generated free product of non-cyclic free abelian groups, . Denote by the free factor system . There is an algorithm that, given , two automorphisms of that are atoroidal, and toral, determines whether they are conjugate in .
On proofs
This strategy for Theorem 1 is to realise the automorphism of the group as an equivariant continuous map from a tree to itself, with special properties. These special properties are those of a train track map, i.e. for which the cancellations of the paths that are image of two consecutive edges is rather well controlled. Being a train track map from a tree to itself allows to iterate the map without losing much in terms of cancellation in reduction of paths. Train track maps are an invention of Bestvina and Handel, for free groups, that replaces, in a much non-linear setting, the property of being in Jordan form for a matrix. A beautiful construction of such maps, by Bestvina [3], was adapted by Francaviglia and Martino [16] to the case of fully irreducible automorphisms of free products of groups. Using the existence of such a map, one can follow arguments of Brinkmann, and Bestvina Feighn and Handel to prove that, for an automorphism that is fully irreducible, and that has a certain atoroidality property, iterating or on hyperbolic elements make their length grow exponentially, and iterating or on different conjugates of the free factors make their distance, in a certain sense, grow exponentially. This is sufficient to apply a combination theorem, as in [32], or [21], that ensure relative hyperbolicity.
For Theorem 2, we use an induction on Scott complexity, proving first a relative hyperbolicity for a larger free factor system, for which a power of is fully irreducible, and telescoping with a relative hyperbolic structures for the large free factors of this system. In case of sufficiently large complexity, one can use the previous theorem. In case of low complexity, one proves by hand the relative hyperbolicity, using the combination theorem of [8]. We then prove that a certain condition, the central condition, satisfied by toral automorphisms, ensures that there is no twinned subgroups by , our only obstruction.
For Theorem 4, the argument is similar, but applied, not on the Bass-Serre tree of some decomposition, but on its cone-off over the family of maximal polynomially growing subgroups. Atoroidality, and absence of twinned subgroups in that cone-off space are automatic. We need to introduce the theory of polynomially growing subgroups (under an automorphism) in the context of a free product, in order to pursue the general strategy that consists in treating fully irreducible automorphisms, and concluding by telescoping the relative hyperbolic structures.
A comment is in order at this stage, even though it is independent of the rest of the paper. Vincent Guirardel has informed us that a sensible use of the Rips machine on the limit -tree of an automorphism reveals the following. If an automorphism of a free product is fully irreducible, then either is a surface group and its polynomially growing subgroups correspond to the boundary components of the surface, or its polynomially growing subgroups are conjugate of the free factors. (In order to see this, we refer to Horbezβ [30, Β§4.2]: if the limit tree is so-called relatively free, by definition of relative freeness in [30, Β§1.3], all polynomially growing subgroups are conjugate to subgroups of the free factors, and if it is not relatively free, by full irreducibility and [30, Prop. 4.11], and finiteness of the number of orbits of points with non-trivial stabilizer, the alternative of [30, Lemma 4.6] reduces to the case of an arational surface tree). Thus, in that case, the cone-off of the tree is trivial (one cones-off single vertices). This insight can be used to remove all mention of coning-off the subtrees in the proof of Theorem 4, and use only in the Bass-Serre trees of the free product.
Theorem 5 largely follows the approach of [10]. Given the work in [13], it is tempting, and might be possible, to try to extend this result to the case where are nilpotent and induce the identity on them, or to the case where the are abelian and induce unipotent automorphism on them (after suitable conjugation). There are some difficulties though, as the current lack of computability of the automorphism group of the semi-direct products.
Acknowledgments
We wish to thank I. Chatterji, S. Francaviglia, F. Gautero, V. Guirardel, M. Mj, and A. Parreau for discussions related to this work.
Ruoyu Li was supported by the Chinese Scholarship Council.
1 Setting and main tools
1.1 Free factor systems, and automorphisms
Let be a group. A finite collection of conjugacy classes of non-trivial subgroups will be called a free factor system of if there are representatives of these conjugacy classes, and a subgroup of , free of rank , such that is a free product . The Scott complexity of this decomposition, and by extension of the free factor system of , is the pair .
The set is the space of all metric -trees whose vertex stabilizers are the conjugates of the groups , up to equivariant isometry. This space contains the (simplicial) Bass-Serre tree for the proposed decomposition. In a tree in , we say that a vertex is a free vertex if its stabilizer is trivial. If its stabilizer is a group whose conjugacy class is in , we say that it is a non-free vertex. See [25] for further references on this space of trees.
The subset of consists of all elements that are not conjugate into any of the subgroups . Those elements are said to be hyperbolic relative to . They define loxodromic isometries of the trees in . We will say that elements conjugated to a subgroup are elliptic relative to . They define elliptic isometries of the trees in .
On the level of automorphisms, denotes the group of all automorphisms of that preserve the conjugacy classes of each .
Given any such automorphism , and given any tree in , by [16, Lem. 4.2] one can construct a continuous map that is -equivariant with respect to in the following sense: for all for all , . Such a map is called a topological realisation of , and we say that it represents .
Let us now compare two differerent free factor systems. If for some other subgroups and , and if for each there exists and satisfying , then one says that the free factor system is lower than . It is strictly lower if moreover is not lower than . For instance, any Grushkoβs decomposition of provides a lowest free factor system for this order.
If is strictly lower than , then one may endow each with a free factor system inherited by its action on a tree of . Denote by the Scott complexity of this free factor system for . The integer counts the number of conjugates of the in its decomposition, and the integer counts the rank of the free group in its decomposition. Writting the identity allows to show that and . This shows that, for the lexicographical order, for all , one has for all , and that . This is recorded in the next statement.
Lemma 1.1
If the free factor system is strictly lower than , then its Scott complexity is strictly larger than the complexity of . If , then the Scott complexity of its free factor system induces by is strictly lower than the complexity of .
1.2 Irreducibility, atoroidality, and twinned subgroups
We recall two equivalent definitions of irreducibility of automorphisms of a free product, proposed by Francaviglia and Martino [16]. They generalise the case of automorphisms of a free group.
Definition 1.2
[16, Def. 8.1]** Let be a group with a free factor system . Let and , and representing .
We call irreducible, if for every proper subgraph of the tree that is -invariant and -invariant, the quotient graph is a collection of isolated subtrees with at most one non-free vertex. We say is fully irreducible if for any integer , is irreducible.
We say is -fully irreducible if for any , and for any representing , the map is fully irreducible.
This is equivalent to the following (see [16, Def. 8.2, Lem. 8.3]):
Definition 1.3
(Irreducible automorphisms relative to a free factor system) Given a group with a free factor system , an automorphism is irreducible (relative to ) if is a maximal proper free factor system that is invariant under .
Let us make the following observation.
Lemma 1.4
Let be a group with a free factor system , and let .
There exist a proper free factor system of , preserved by some power of , such that this power of is fully irreducible with respect to .
Proof:β Denote by , and . Recursively, for all , we construct from , and , a multiple of , as follows.
If is fully irreducible relative to , then , and . If is not fully irreducible relative to , some of its power preserves a strictly larger proper free factor system , which hence has a strictly lower Scott complexity, by Lemma 1.1. Since any lexicographically decreasing sequence in is eventually constant, there is such that . This proves the lemma.
Generalising a similar notion in free groups, we have the following.
Definition 1.5
(Atoroidal automorphisms) We say is atoroidal, if for any , and for any positive integer , .
We will need the following related notion.
Definition 1.6
(Nielsen and pre-Nielsen paths)
Consider a group with a free factor system , a tree , an automorphism , and a map representing .
A reduced path in is called a Nielsen path if there exist an exponent such that, for some , the path obtained by after path reduction, is equal to . A reduced path is called pre-Nielsen if there exist an exponent such that is Nielsen.
Observe that even if is atoroidal, there can be Nielsen paths: they do not map on closed loops in .
We also introduce a related notion.
Definition 1.7
Let be a group, be a free factor system, and . We say that two different subgroups , such that and are preserved by , form a twinned pair of subgroups for , if there exists and an integer such that and .
Let us underline that and are possibly (but not necessarily) equal. The groups can be in , or in some other collection of preserved conjugacy classes of subgroups.
1.3 Train Tracks Maps
1.3.1 Definitions and existence
In [1] Bestvina and Handel have defined a particular class of maps from a tree to itself, that is a cornerstone of the study of maps realising automorphisms.
In an oriented graph, let us denote by the inital vertex of an oriented edge .
Definition 1.8
(Train track structure, legal turn, and legal paths) [1]
Given a graph , an ordered pair of oriented edges such that is called a turn (at the vertex ). A trivial turn is a turn of the form .
A train track structure (or a gate structure) on a -tree is a -invariant equivalence relation on the set of oriented edges at each vertex of , with at least two equivalence classes at each vertex.
Each equivalence class of oriented edges is referred to as a gate.
In a gate structure, a turn is said to be legal if the two oriented edges are in different equivalent classes. A reduced path is said to be legal if all its turns are legal.
To describe a gate structure, it is enough to specify which turns are legal (or illegal).
An important example of gate structure is the one given as follows (and this is the one we will use). Consider and two -trees, and a map which is equivariant, and piecewise linear (linear, non constant, on edges). Define the gate structure on induced by as follows. Declare that a turn is illegal if and share their first edge in . It is easy to check that this defines an equivalence relation on the oriented edges issued from a same vertex, and that it is invariant for , by equivariance of .
In this construction, it is obvious that any legal turn is sent by on a pair of paths whose first edges define a non-trivial turn (by abuse of language we say that any legal turn is send by on a non-trivial turn). However, if , in principle, a legal turn could be sent on an illegal turn, and in that case would send a legal turn to a trivial turn. This is not a pleasant situation, and motivates the following.
Definition 1.9
(Train track maps) Given , and given a piecewise linear -equivariant map (linear, non constant, on edges) realising , we say that is a train track map if, for the gate structure it defines,
- β’
* maps edges to legal paths;*
- β’
if is a vertex, then maps legal turns at to legal turns at .
One of the main results of Francaviglia and Martino in [16], is the following.
Theorem 1.10
[16, Thm. 8.18]**
If is irreducible, then there exist and representing , such that is a train track map.
Note also the following useful fact: by [16, Lem. 8.20], if is a train track map representing , then is a train track map representing .
1.3.2 Growth rate of edges
The metric point of view on train tracks is facilitated by the following.
Lemma 1.11
(see also [16, Lem. 8.16])
If is a (piecewise linear) train track map representing a fully irreducible automorphism , and if has at least two orbits of edges, then there is a rescaling of each orbit of edge of such that, for this metric, every edge is stretched by the same factor by . More precisely, there is a constant such that for all edge in .
Such a constant is called the growth rate of the train track map .
Proof:β [16, Lem. 8.16] establishes the existence of a rescaling to obtain the statement with . We show that under the extra assumption of the lemma, that has at least two orbits of edges, one has .
Assume that this factor is . Then, partition the edges in subsets of edges of equal length, from the shortest to the longest. The set of the -orbits of the edges in (the longest) is permuted by , otherwise one of them is not in the image of . Hence, by iterating the argument, for all the set of -orbits of the edges in is permuted by . There is therefore such that sends any edge to one of its image by an element of .
If, in , there is an arc between two vertices fixed respectively by and , and whose all other vertices are free vertices (i.e. have trivial stabiliser), then the free factor is sent on of conjugate of itself by . Since is assumed to be fully irreducible, this means that either (and has only one orbit of edge), or has at most one free factor, . We thus place ourselves in the later case: its Scott complexity is .
Consider then in , a shortest arc between two different points of the same orbit, and consisting only of free vertices, except possibly and . Let us say that . The image in of this arc has to be a simple loop (otherwise a strict subloop is suitable). We may assume, after a possible translation, that the stabiliser of is either trivial or . Thus, with in this stabilizer. It follows that preserves , which is either or . In either case, full irreducibility of forces to be . Hence, has a Scott complexity , and has one orbit of edges.
We have proved that if has at least two orbit of edges, then .
1.4 Coning off subtrees
In this subsection, we consider a group, with a free factor system , and a -tree in .
Let us assume that we are given a collection of conjugacy classes of subgroups of , , invariant under (in the stronger sense that each is invariant). For each , let be the minimal subtree of invariant under .
In this situation, one considers the cone-off tree of , adding one vertex for each coset and adding edges from to all free vertices of (by subdividing edges in an orbit of , if necessary, we may always assume that there are such free vertices). We choose the length of these new edges to be smaller than half the minimal length of edges in , and smaller than . The length of a segment will be denoted .
We say that is above if any group whose conjugacy class is in is contained in a group whose conjugacy class is in . Recall that is malnormal if for each indices , and each , if is non-trivial, then and .
Proposition 1.12
Assume that is a finite collection of conjugacy classes of subgroups of that is above . Assume that for all , the action of on is cofinite, and that the collection is malnormal. Then is hyperbolic relative to , and is hyperbolic.
Proof:β The assumption on cofiniteness of on ensures that is relatively quasi-convex in relative to . One can then apply Yangβs [36, Thm 1.1] to get the conclusion.
We will say that is hyperbolically coning-off if it satisfies the four assumptions of the Proposition: is a finite collection of conjugacy classes of subgroups of , is malnormal, is above , and for all , the action of on is cofinite.
We then define a reduction in of a path of as follows. Call a path in collapsible if its end points are neighbors of a same vertex , and its collapse is the two-edge path between its end points that goes through . For an arbitrary reduced path in , choose a maximal collection of maximal collapsible subsegments, and replace each of them by its collapse. The reduction of a reduced path in is a uniform quasigeodesic in ([12, Prop. 2.11]).
If is a map representing an automorphism that preserves every conjugacy class of groups in , then induces by sending, for each (with in ), the vertex fixed by on the vertex fixed by (and edges according to the action). Observe that if is a train track map, then every turn at a vertex fixed by is a legal turn for , and is sent on a legal turn.
1.5 Polynomially growing subgroups
Consider a free group, and and automorphism of . We briefly discuss some material covered in the preliminary section of [31], to which the reader is warmly refered.
A subgroup of is said polynomially growing for if for every , the length of a cyclically reduced element in the conjugacy class is bounded above by a polynomial in . If itself is polynomially growing, one says that is a polynomially growing automophism.
Recall that the group contains as a normal subgroup the group of all inner automorphisms , which are conjugations by elements of , and the quotient is the outer automorphism group of .
For an outer automorphism , we say that a subgroup of is polynomially growing for if there is and automorphism in the class of , for which and is polynomially growing.
In [31, Prop 1.4] Levitt proves that for any outer automorphism of a free group , there is a finite family of finitely generated subgroups of , that are polynomially growing for , such that all polynomially growing subgroups for are conjugated into one of them. These are maximal polynomially growing subgroups for . Levitt also proves in the same reference, that the family of their conjugates is malnormal in sense recalled in Section 1.7.
We now adapt this setting to the case of free products.
Let be a group and be a free factor system for . Let be a fully irreducible automorphism. Let be a train track map representing on a tree .
We define polynomial growth for in as follows. An element of is said to be polynomially growing (or to have polynomial growth) for in , if the translation length of in is bounded above by a polynomial in . A subgroup of is said polynomially growing for if there exists , and such that for one has and such that for every , the translation length of is bounded above by a polynomial in . Note that this property is invariant if one considers a power of instead of .
Observe that if the stretching factor is , then the whole group is polynomially growing for . We assume now that the stretching factor is , or in view of Lemma 1.11, that has more than one orbit of edges under the -action, or in other words, that the Scott complexity is different from or .
We now recall the construction of a limiting -tree, found in [18, Β§2.5], to which we refer for the details (our setting is slightly eased by the assumption that is fully irreducible, that is in the notation of [18, Β§2.5]). One may endow with a sequence of actions of , by precomposing by powers of , and rescaling by the factor .
One may then go to an ultralimit of these metrics and obtain an -tree endowed with an action of which is non-trivial and minimal (see [18, Lem. 2.7]), and with an homothety of scale . This action has been considered in several places, we indicate to the reader [18, Β§2.5] as a reference. We gather a few useful facts about it.
By [18, Lemma 2.8] (its proof applies without change in our case), this action has trivial arc stabilizers. Let us observe that any polynomially growing subgroup of fixes a point in . Indeed in the rescaling process, all its elements have translation length going to [math], and, even if we do not know yet that these subgroups are finitely generated, we may still deduce that they all fix a unique point, since arc stabilizers are trivial. By [29, Prop. 4.4], point stabilizers in have strictly smaller Kurosh rank than .
By [29, Coro. 4.5], there are finitely many orbits of branch points in . It follows that if is a point stabilizer in , there is , and such that preserves . If moreover is a polynomially growing subgroup of for on , then on the minimal subtree of in , the subgroup is polynomially growing for .
Following [31], we discuss the next five properties.
Proposition 1.13
If is a polynomially growing subgroup of for on , (resp. if is a polynomially growing element for in ), then there exists a unique maximal polynomially growing subgroup of for on , such that (resp. such that ).
The collection of maximal polynomially growing subgroup of for on is malnormal.
Any maximal polynomially growing subgroup of for on acts cofinitely on its minimal subtree in and has Kurosh rank smaller than the rank of (strictly if it is not ).
If and are two maximal polynomially growing subgroup of for on , such that there exists for which , then .
There are only finitely many conjugacy classes of maximal polynomially growing subgroups for , in .
Proof:β If the rank is (or more generally if the Scott complexity is or ), then itself is polynomially growing, and the statements are obvious.
The five statements are obtained by induction on the Kurosh rank of . We may assume that the statement is established for groups of Kurosh rank smaller than , and that is not polynomially growing itself. Recall that by [29, Prop. 4.4], point stabilizers in have strictly smaller rank than (strictly, since they are different from ).
First (resp. ) is elliptic in , hence is contained in a point stabilizer in , unique (since arc stabilizers are trivial), call it , as is any polynomially growing subgroup containing (resp. containing ). The induction hypothesis thus proves the first point.
If are two maximal polynomially growing subgroups that intersect, they must be contained in a same point stabilizer in , and the induction hypothesis shows that . For malnormality it remains to check that any such is its own normalizer. If normalises , then must be in the point stabilizer on containing , and by induction, . The second point is proved.
The rank statement in the third point also follows by induction, since by induction has Kurosh rank smaller than that of containing it, and has Kurosh rank strictly smaller than . The statement on cofiniteness on its minimal tree follows similarily. First, acts on its minimal subtree, and inherits the structure of graph of groups with trivial edge groups from the quotient graph. Since its rank is finite, the quotient graph is finite, and acts cofinitely on its minimal subtree. By induction then, acts cofinitely on its minimal subtree inside that of , which is its minimal subtree in .
For the fourth point, assume that , then and must fix the same point in , since produces a dilatation of factor in . Then the statement follows by induction.
Finally for the fifth point, first by [17, Coro. III.3], there are only finitely many -conjugacy classes of stabilizers of points in . In each of them, we may use the induction hypothesis to find that there are finitely many conjugacy classes of maximal polynomially growing subgroups.
Let now be the collection of conjugacy classes of maximal polynomially growing subgroups for on , and the coned-off tree of for this collection, as in the previous subsection.
We say that is atoroidal in if for all hyperbolic on , and all , and are not conjugate in .
Proposition 1.14
If is the collection of conjugacy classes of maximal polynomially growing subgroups for on , then is atoroidal in .
Proof:β If was not atoroidal with respect to , there is an element of polynomial growth (of degree 0 !) that is not in a group of , hence does not cover the polynomial growth.
Recall that by assumption, is fully irreducible for , and that is a train track map.
Proposition 1.15
(Transversality of legal paths)
Let be a group, a free factor system, be fully irreducible. Let be a train track map representing , for some .
Let be the cone off of over the family of maximal polynomially growing subgroups of in .
There exists such that if is a legal path in , then the length of its reduction in is larger than .
Proof:β Assume the contrary, that for all there exists , a legal path, for which the length of its reduction in is less than . Then must contain a long subsegment contained in a translate of some . Since the action of on is co-finite, must pass several times through free vertices in the same -orbit. This means that contains subpaths with same initial point (that is a free vertex) that are legal, and that are the fundamental segments of elements , conjugated in some , that are loxodromic in . Denote by the last edge of . Now, consider the turn made by , and the (common) first edge of . If one of these turn is legal, then the whole axis of is a legal path, and the growth of the conjugacy class of is exponential, contradicting its belonging to .
If none of them is legal, then consider the path between the end point of and the last point of . It is legal, and since and both are in the same gate than , the turn made by and the first edge of must be legal, as is the turn of and by assumption. We can use the same argument than before to get the desired contradiction.
1.6 Hyperbolicity of an automorphism
Let be a finitely generated group with a generating set and Cayley graph . Let be a set and let be a family of subgroups of ;
The -word metric is the word-metric for equipped with generating set .
The following definition, from [21], might appear technical. It extends a similar definition of hyperbolicity of automorphisms. We will only use it for free products endowed with a free factor system, so the reader is free to restrict the definition to this case.
Definition 1.16
(Relatively hyperbolic automorphisms)
Let be a group with a generating set . Let be a set and let be a family of subgroups of such that each is its own normalizer. Let . An automorphism is hyperbolic relative to (or in short, relatively hyperbolic) if it satisfies the following:
there exist , , such that for any with , the inequality holds:
[TABLE]
Recall that for a path in a metric tree , is its length. Assume now that is a free product. For a hyperbolic element in , a fundamental segment in is a segment in its translation axis that starts and ends at free vertices (i.e. with trivial stabilizers), such that . Up to subdividing edges of , such a fundamental segment for always exists.
Definition 1.17
Let be a finitely generated group, and be a free factor system, and a collection hyperbolically coning off .
Let be metric trees in , and their cone-off over .
Let and be -equivariant Lipschitz maps between these spaces.
Let , preserving , and consider , induced on the cone-off by maps representing and respectively.
If there exist a natural number and a real number such that whenever is either a path between two different non-free vertices of , or a fundamental segment in for a hyperbolic element of , and and the pull-tight of its image by one has:
[TABLE]
then the pair is refered to as a hyperbolic pair for .
Remark 1.18
Notice that, given and a free factor system, if , and if is in , then the -word metric is quasi-isometric to the distance induced by an orbit in . Therefore, if is a hyperbolic pair, then it is relatively hyperbolic.
The relevance of hyperbolic automorphisms, for us, is through the following combination theorem, which is proven by Gautero and Weidmann. For a definition of relatively hyperbolic group, we refer to [4].
Theorem 1.19
[21, Coro 7.3]**
Let be a finitely generated group that is hyperbolic relative to a finite family of conjugacy classes of infinite subgroups . Let us write for .
Assume that is hyperbolic relative to . Assume that for all , the element is such that .
Then the semi-direct product is relatively hyperbolic with respect to the subgroups , where denotes the generator of the semidirect product associated to the automorphism .
For brevity one calls the collection of conjugacy classes of subgroups , the mapping torus of .
As an alternative of the previous theorem, one may also use the following form of [32, Thm 4.6], for the case of an HNN extension. We will explain how to use it instead, when we will need it.
Theorem 1.20
(Mj-Reeves, Particular case of [32, Thm 4.6])
Let be the fundamental group of a finite graph of relatively hyperbolic groups satisfying (1) the qi-embedded condition, (2) the strictly type-preserving condition, (3) the qi-preserving electrocution condition, (4) the induced tree of coned-off spaces satisfies the hallways flare condition, (5) the cone-bounded hallways strictly flare condition. Then is hyperbolic relative to the family of maximal parabolic subgroups.
1.7 More mapping tori: global preservation of a collection of subgroups
Consider the case where is a group, is an automorphism, and is a malnormal collection of conjugacy classes of subgroups of , globally preserved by . Up to taking a power we retrieve the preferred case in which each is preserved by . In this subsection, we argue that, in the interesting cases, the relative hyperbolicity result that one may have for the mapping torus by descend to the mapping torus by .
We first define mapping tori of groups in the collection .
If preserves the conjugacy class of each , let us choose such that . Note that by malnormality, is unique up to a multiplication on the right by an element of . Consider the semidirect product , and call the generator of the factor that acts on as . We call the mapping torus of the collection by , the collection of conjugacy classes of subgroups in , for . Note that normalises , and that these subgroups are uniquely defined (a change in the choice of does not change the subgroup).
If now preserves globally, then there is (dividing ) such that .
In that case, for each , there is for which preserves the conjugacy class of . One may define the mapping torus of by as before (choosing an element so that normalises ), and we declare that the mapping torus of the collection by is the collection of conjugacy classes of mapping tori of by .
Lemma 1.21
Let be a free group. If is a non-trivial, malnormal finitely generated subgroup in and if is the image of by an automorphism of , that is at bounded distance from in the word distance, then .
Proof:β Since is malnormal it is not a proper finite index subgroup of another subgroup of . Since is an automorphic image, the same is true for . However, being finitely generated, they both are of finite index in the stabilizer of their common limit set in the boundary of the free group . Therefore they are equal.
Proposition 1.22
With the notations above, assume that is free, and that the groups in are infinite.
If is relatively hyperbolic relative the mapping torus of by , then is relatively hyperbolic relative to the mapping torus of the collection by .
Proof:β The group is a finite index subgroup of , therefore, by DruΕ£uβs theorem on invariance of relative hyperbolicity by quasi-isometry [14, Thm. 5.1], is relatively hyperbolic with respect to a collection of subgroups such that each is at bounded distance from a peripheral subgroup in . Consider a peripheral subgroup of , and (possibly after conjugation) let be the peripheral subgroup of that remains at bounded distance. First, must be at bounded distance from , therefore equal, by the previous lemma. Second, if is not in , it conjugates into some subgroup of , therefore it must normalise . It follows it must be of the form for some . This ensures is contained in the mapping torus of by . Conversely, since normalises which is an infinite parabolic subgroup, it must be in the associated peripheral subgroup. This proves that is the mapping torus of by , and it proves our proposition.
2 Relative Hyperbolicity of semi-direct products
2.1 Statements in full irreducibility
We first state the following result, an analogue of Brinkmanβs first result in [6], and of a result of Bestvina-Feighn-Handel for free groups in [2, Thm. 5.1].
Theorem 2.1
Let be a finitely generated group with a free factor system , of Scott complexity , different from and . Let be fully irreducible and atoroidal. Assume that it has no twinned subgroups in .
Then the semi-direct product is relatively hyperbolic, with respect to the mapping torus of .
We will actually prove the following variant, which immediately implies Theorem 2.1,Β by choosing to be equal to .
Theorem 2.2
Let be a finitely generated group with a free factor system , of Scott complexity , different from and . Let .
Let be a -invariant (in the strong sense that ) collection that is hyperbolically coning-off .
Assume that is fully irreducible with respect to , atoroidal with respect to , and has no twinned subgroups in .
Assume that for a tree and a train track map realizing , there exists such that if is a legal path in of length in , its reduction in is of length at least , and similarily for .
Then, for some power of , (with if ) the semi-direct product is relatively hyperbolic, with respect to the mapping torus of .
The last condition, about the existence of will be refered to as being transversal to legal paths for .
Observe that if is the collection of maximal polynomially growing subgroups of in , then the assumptions of the theorem are satisfied, by Propositions 1.13, 1.15 and 1.14. We thus obtain from Theorem 2.2 the following corollary.
Corollary 2.3
Let be a finitely generated group with a free factor system , of Scott complexity , different from and . Let be fully irreducible.
Let be the collection of conjugacy classes of maximal polynomially growing subgroups for on a (any) tree in . Then, there is a power of for which , and for which the semi-direct product is relatively hyperbolic, with respect to the mapping torus of .
The proof of Theorem 2.2 will take the next subsections, until the end of Section 2.3, where it will be formally given. As discussed in the introduction, it will follow closely Brinkmannβs and Bestvina Feighn and Handelβs proofs [6, 2], with the additionnal difficulty of dealing with the lack of local finiteness of the trees involved, and their cone-off.
2.2 Growth in train tracks
In this section, is a group, endowed with a free factor system , of Scott complexity different from or , and a collection hyperbolically coning-off . We will denote for convenience and unification of notations.
Recall that, if is a fully irreducible automorphism, that preserves , we have agreed (in Lemma 1.11) on a metric on a train track tree so that each edge is stretched by the train track map by a factor , as the Scott complexity is different from or .
2.2.1 Angles
The following introduces our tool for coping with the non-local finiteness of the trees in and their cone-off, an issue that already showed in the previous lemma.
Definition 2.4
For each , fix a word metric on . Let and let be a vertex of or , that is fixed by . Choose a transversal of adjacent edges of for the action of its stabiliser.
For each pair of edges adjacent to , the angle is the word length of , where satisfy that bot are in .
For each , for each , and for each pair of edges adjacent to , define the angle to be where is the element in such that .
We say that a path is -straight if angles between its consecutive edges are at most .
Remark 2.5
Angles are well-defined. Indeed, the choice of and is unique, because stabilizer of each edge (and thus of each edge in ) is trivial. In general, the choice of in the definition is not unique, but only differs from an element in , and by the definition of angles at the vertex whose stabilizer is , element in preserves the angle.
We also notice that the angles safisfy a local finiteness: for a given edge with starting vertex and a given number , there are only finitely many possible satisfying . This is easy to see as there are only finitely many edges (up to -orbit) adjacent to and that there are only finitely many elements in whose word length is bounded by .
Finally, we notice that angles are -invariant.
Lemma 2.6
Let be an automorphism of , be a map representing , and the induced map on . Then for any , there exist , such that for any pair of edges starting from a vertex with , we have that .
Proof:β Assume the contrary, let such that but for which . After translation, and extraction, we may assume that is constant (weβll denote it by ), and stabilised by for some , and that is also constant (denoted by ). Let and such that is stabilised by . Since represents , the automorphism induces, by restriction to an isomorphism to , hence a quasi-isometry for their word metrics. However, that indicates that there is , a sequence of elements of going to infinity, such that remains among finitely many edges. After extraction it is constant, . The image of by correspond to the images of by hence is going to infinity in angle from . This is a contradiction.
From the above lemma, we have:
Lemma 2.7
Let be a group with a free factor system , a collection that is hyperbolically coning-off as before, an automorphism preserving . Assume that the Scott complexity of is different from , and that is atoroidal for . Let , and representing on . Let the induced map on the cone-off.
Then for any given hyperbolic on , any fundamental segment of in , and for any , there is an integer such that .
Moreover, if is a path in between two non-free vertices, and if has no twinned subgroups for , then the same conclusion holds.
Proof:β Suppose otherwise, that there is a fundamental segment of a hyperbolic element , or a path between two non-free vertices, for which the consecutive images by remain of bounded reduced length.
Assume first that angles in the paths remain bounded, as goes to infinity.
In this case, all paths are -straight for sufficiently large , and bounded in length. Therefore there are finitely possible up to the action of . Let and such that . If is the fundamental segment of , then , and this contradicts the fact that is atoroidal. If is a path between two non-free vertices, it contradicts the absence of twinned subgroups.
Assume now that the angles in the paths are unbounded.
We first treat the case of the following lemma, that we will re-use later.
Lemma 2.8
Assume that is a path in , and that the sequence of paths (after reduction) remains bounded in length. Denote by be the consecutive non-free vertices on , different from its end points.
Assume that we may extract a subsequence so that the angle at two vertices , for , is tending to infinity, then has twinned subgroups.
Proof:β Note that is bounded by assumption. First we may choose the subsequence so that is constant minimal.
For arbitrary and , there is such that if , then the angles at are so large that by Lemma 2.6, the map applied consecutive times to the path contains after reduction, the vertices , in that order, and the angle there is still larger than . However, by minimality of the extracted subsequence, we may assume that the angles at the vertices between these two are bounded by . Thus, the paths between and are -straight, of bounded length (as subpaths of ) and live in a finite set. If is larger than the cardinality of this finite set, we see that we two of them are -translates of one another, and this produces twinned subgroups.
Let us come back to the proof of Lemma 2.7. The lemma allows to exclude the case described in its assumption. We thus now assume that there is a bound so that all angles except perhaps one, in , are smaller than . On the other hand, we assumed that angles were not bounded, so we may extract a subsequence and find so that the angle at two vertices goes to infinity. We may assume that is constant, and minimal. In that way, if the initial point of is a non-free vertex, we obtain the same contradiction as in the previous paragraph. So we now assume that the initial point of is a free vertex, which means that is the fundamental segment of some hyperbolic element . Consider then . A fundamental segment for this element consists of the concatenation of and , which is a reduced concatenation, since is in the axis of . Now, images by also fail to grow, and have a pair of angles going to infinity. The previous case applies, and leads to the desired contradiction.
For a path in the tree , denotes its reduction in , a reduced path in with same end points, and no collapsible subsegment.
For the following lemma, one can also refer to [28, Prop. 3.12].
Lemma 2.9** (Bounded cancellation lemma)**
Let be an automorphism of , , be piecewise linear representing . Let be a -invariant collection that is hyperbolically coning-off , and the induced map on the cone-off. Then exist a constant , depending only on and , such that for any path obtained by concatenating two paths without cancellation, we have
[TABLE]
Proof:β Observe that is a quasi-isometry (see for instance [34, Prop. 3.2]). Thus there is a distance bound on the pairs of points of and that are sent at distance (for the hyperbolicity constant of ). Consider the two paths and , and write and their respective end points in . Consider points on theses paths, at distance at most from the center of the tripod in . The distance , in between and is, up to an error bounded by at most , the sum of the length of the subpaths from to and from to . As we initially noticed, the distance in from to is at most . Thus the length of is at least , hence at least .
Assume that is a train track map representing . Denote by the growth rate of . After taking a power of , the map on the tree still is a train track map representing , and its growth rate is . Thus, up to taking a power, we may assume that , for the constant of the transversality assumption of Theorem 2.2. Note that if we do not need to take this power. From now on we assume .
Note that this means that for any legal segment , in one has , and in , one has .
The bounded cancellation lemma allows to prove the following, by induction (we refer to the proof of Brinkmann, in [6, Lem. 5.2]).
Lemma 2.10
(See [6, Lem. 5.2]) If is a legal path in with (i.e. ), and if are paths such that the concatenation is locally injective, then there exists a constant (independent of ) such that the length of a maximal legal segment of corresponding to is at least for all integer .
Definition 2.11
(Critical constant of a train track map) Let be a free product, with free factor system , and hyperbolically coning off . Let be irreducible, be a train track map representing , be the growth rate of , and the transversality constant of legal paths with respect to . The constant is called the critical constant of , where is the constant defined in the Bounded Cancellation Lemma.
2.2.2 Legal Control in Iteration
Lemma 2.12
(Analogue of Lemma [2, Lem. 2.9])
The concatenation in of two (pre-)Nielsen paths whose only common point is a free vertex is still (pre-)Nielsen.
Proof:β Let be Nielsen paths with only one common point, end point of , and starting point of , which we write as . By assumption, there exist some such that . It follows that . Since the stabilizer of is trivial, . This implies that is still a Nielsen path.
If the paths are only pre-Nielsen, then there are such that are Nielsen paths, and all their images by too. Thus is a Nielsen path, and there is pre-Nielsen.
Following [2], the next lemma will be proved by a similar idea, but an angle analysis is used to overcome the obstacle of the non-local finiteness of the involved tree.
Lemma 2.13
Let be a group with a free factor system , of Scott complexity different from , and hyperbolically coning off . Let be fully irreducible, without twinned subgroups in , transversal to legal paths for . Let be a train track map representing .
Then for every , there exist an exponent , such that for any path in , one of the three following holds:
- β’
(A) the length in of the longest legal segment of the reduction is greater than ;
- β’
(B) the reduction in of has strictly less illegal turns than ;
- β’
(C) the reduced path is equal to a concatenation of , where has at most 1 illegal turn with length at most , and that each is a pre-Nielsen path with at most 1 illegal turn, and the end points of the are all free vertices, except at most one.
Proof:β Assume (B) fails for all integer , then no illegal turn becomes legal after iteration. In addition, let us assume that (A) fails as well. As is a train track map, none of the legal turns become illegal, the total number of illegal turns (and henceforth the number of legal segments) thus remains the same after iteration. Since fails, each legal segment has a uniformly bounded length (in ) after iteration, then there is an exponent such that, if is the quotient map,
[TABLE]
for all .
We classify in the following cases.
Assume first that angles at every vertex in remain bounded. The argument takes place in for this case.
If statements (A) and (B) fail, the length of (in ) is bounded after iteration (by assumption of transversality of to legal paths, or alternatively, by bound on the angles at vertices of the cone-off by ). Hence, if angles are bounded too, there are only finitely many possible -orbits of paths, for the reduction in of . Hence, there exist such that, for reductions in , (in other word, is pre-Nielsen). Denote by the starting and ending vertices of the maximal legal segment .
Apply to each maximal legal segment in . Since these segments are legal, the length of grows by a factor . These paths cancel at the possible illegal turns with other connected maximal legal segment(s), and reduces to for the element above. The legal segment between and (if they are different) and the legal segment between and (if they are different) are canceled. Hence there is a subsegment (which is legal) of such that . For this reason, there is a vertex in each (thus it is in ) such that . We have that is a concatenation of , where have at most 1 illegal turn with length at most , and that each is a pre-Nielsen path with at most 1 illegal turn. In addition, as pre-Nielsen, are also pre-Nielsen. Finally observe that the reduction is obtained by taking a concatenation of reductions and reducing it further. Assume that this concatenation is not reduced (that one has to reduce it further), it means that for some indices , and respectively end and start by the same edge adjacent to a vertex of the cone-off. One can then replace by the path that is equal to it except the last edge that is replaced by the first edge of , and then replace by the path that is equal to it except with the first edge removed. This still satisfy the conditions, and has less non-reduced points, thus after finitely many such changes, one get a reduced path, hence equality with .
Assume now that the sequence have unbounded angles. We may apply Lemma 2.8, in order to reduce to the case that there exists for which at most one vertex of has angle larger than . Let us extract a subsequence, so that there is in for which the image by has angle larger than .
Denote the starting and ending vertex of by respectively, subdivide the path into two segments . Since has a large angle at , the segments and make a reduced concatenation at .
It follows that both segments remain short, and have no large angle. Thus and are pre-Nielsen.
By induction on the length, we can further subdivide and such that is a concatenation of , where has at most 1 illegal turn with length at most , and that each is a pre-Nielsen path with at most 1 illegal turn.
To see that at most one of the end points of can be non-free, assume that two of them are, we thus have , for , which is a concatenation of pre-Nielsen paths with only free vertices as intermediate subdivision points. Their concatenation is still pre-Nielsen, by Lemma 2.12. However the end points of are non-free vertices, therefore by Lemma 2.7 the iterates of on are eventually arbitrarily long. This contradicts that they are periodic. Thus, at most one of the end points of can be non-free.
In conclusion, statement (C) of the lemma holds.
Lemma 2.14
Let be a group with a free factor system of Scott complexity is different from , and as before, coning-off , and fully irreducible, preserving .
Assume that is atoroidal for , and without twinned subgroups for , and transversal to legal paths for .
If is a train track representative for on . Then there exist a constant such that for any reduced (in ) concatenation of pre-Nielsen paths in whose end points are free vertices, one has .
Proof:β Recall that by Lemma 2.12, the concatenation of such pre-Nielsen paths is still a pre-Nielsen path.
In order to prove the lemma, it suffices to prove that after concatenating sufficiently many pre-Nielsen paths in , in such a way that the concatenation is reduced in , any resulting path contains a subconcatenation that will grow eventually after iteration of . This lead to a contradiction, since this subconcatenation is still a concatenation of Nielsen paths, hence the length remains the same after iteration).
Let us write our concatenation in , and the initial oreiented edge of . The graph is finite, thus if is larger than its number of oriented edges, there is such that the path starts by the same free vertex and oriented edge than . Thus, there is an hyperbolic element that sends the initial vertex of to the initial vertex of , and that has as fundamental segment ( is reduced). Since is a Nielsen path, it contradicts Lemma 2.7.
As an application of Lemmas 2.13, 2.14 and 2.10 we have:
Lemma 2.15
(Analogue of [2, Lem. 2.10])
Let and assume that and are train track maps representing and respectively, that satisfy the conclusion of Lemma 2.13, Lemma 2.14, and Lemma 2.10, and such that . Let and be -equivariant, and Lipschitz.
Then for any there exist exponent and , such that if is a path whose reduction in is of length , and is a reduction in of , then either or contains a legal segment of length greater than .
Proof:β We first gather a few constants before starting the proof. By the above lemma 2.14, there exist a constant such that it is impossible to concatenate more than pre-Nielsen paths with end points being free vertices, and the concatenation being reduced in .
Fix such that it is larger than the critical constant for both and (see Lemma 2.10).
Let be the greater one of the integers according to Lemma 2.13 when we apply it to and .
We may assume, after global rescaling, that the length of the shortest edge in and in is larger than .
Fix , and such that .
We argue by contradiction, assuming that for all and all there is a path that is a counterexample to the statement, a path whose reduction in is longer than , and such that for all , neither the reduction , nor contain a legal segment of length greater than . We want to show that, for sufficiently large and , this leads to a contradiction. We thus fix and , and extra conditions on their size (to reach a contradiction) will appear at the end.
We may represent as a concatenation of segments such that , each has at least illegal turns, and whose length is at most .
Then (A) of Lemma 2.13 fails for such a subpath . In addition, the case (C) of Lemma 2.13 also fails: there are at most subpath in the notations of , and one of them has to be longer than , implying that there is a legal subsegment of length , which we excluded.
Then (B) of Lemma 2.13 must hold for .
The constant is also an upper bound to the number of illegal turns in each of these segments. Recall that . For a path we denote by the number of illegal turns in .
Then for these segments we have
[TABLE]
This inequality is thus also true for any concatenation of such segments in , hence for any sufficiently long subsegment of .
We do the same construction to , as long as . Then for all such , and all segments in whose lenght is sufficiently large (say, for notation, larger than ),
[TABLE]
Of course for such a to exist, one must have .
Since we require that, for all , any legal segment in each is bounded by , and it is obviously not less than the length of shortest edge (which has length larger than ), one has, for , and for all such larger than ,
[TABLE]
Apply the same discussion to as we did to , and consider instead of . We then have, for larger than some constant ,
[TABLE]
For sake of notations, we will redefine to be at least .
Notice that is conjugate to , hence there is some constant such that for long segments,
[TABLE]
Multiply (), () and the inverse of () we have
[TABLE]
Notice that , where is the Lipschitz constant of respectively, we have
[TABLE]
Therefore, setting , the integer is bounded by the inequality and let the maximal value satisfying this.
We now take the length to be larger than , and , in order to have a path in of size and thus obtain contradicting the maximality of .
Definition 2.16
(-legality of a path) Given a and a constant , for any reduced path , the -legality of is the ratio of the sum of lengths (in ) of legal segments in longer than over the total length (in ) of , denoted by .
Lemma 2.17
(See [2, Lem. 5.6]) Let be fully irreducible for and atoroidal for , without twinned subgroups in , and with Scott complexity different from . Let , be train track maps representing and respectively. And let and be Lipschitz map corresponding to difference of markings. Assume that is the larger one of the critical constant of and .
There is and an integer such that for every nontrivial hyperbolic on , if is a fundamental segment of in , or a path between two non free vertices, and if is in , then for every , either or .
Proof:β By Lemma 2.7, there is an integer , such that and , where is defined according to Lemma 2.15. And by Lemma 2.15, there is such that either or contains a legal segment of length greater than .
Suppose the result does not hold, then there is a sequence with and in and respectively such that the legality of and of converges to 0.
Then there exists arbitrarily long segments in and in (as varies) that do not contain a legal segment of length . Thus contradicts the Lemma 2.15.
2.3 Relative hyperbolicity in the fully irreducible case
Proposition 2.18
Let be a finitely generated group with a free factor system of Scott complexity different from .
Consider fully irreducible. Consider hyperbolically coning off , preserved by , transverse to the legal paths of , and such that is atoroidal for , with no twinned subgroups for .
Let be a train track map realizing , and a train track map realising . Let and the maps on the cone-off for .
Assume that there is such that if is a legal path in , the length of its reduction in is of length at least , and similarily for .
Then, for some , the pair is a hyperbolic pair, in the sense of Definition 1.17.
Proof:β By Lemma 1.11 the growth rate of and are greater than some . Up to taking some power, we may assume that .
Both trees being in , coned by the same family, there exists and two -equivariant Lipschitz maps. For any hyperbolic element , let be a fundamental segment of in , or a path between non free vertices, let be , the reduction in of .
Choose be the larger one of the critical constant of and . By Lemma 2.17, there is and integer (regardless of the choice of and ) such that for every , either or .
Denote here by the set of all maximal legal segments in with length longer than .
We assume that (the other case is similar). By definition of critical length and Lemma 2.10, there is such that for all , .
Moreover, we have that . It follows that for all large .
For sufficiently large , this establishes that is a hyperbolic pair.
By Remark 1.18 and the previous proposition, we thus have the following.
Proposition 2.19
Let be a finitely generated group with a free factor system of Scott complexity different from .
Consider fully irreducible. Consider hyperbolically coning off , preserved by , transverse to the legal paths of , and such that is atoroidal for , with no twinned subgroups for .
Then is hyperbolic relative to , in the sense of Definition 1.16.
We may finally prove Theorem 2.2: it is a direct consequence of Proposition 2.19 and Gautero and Weidmannβs Theorem 1.19.
Alternatively, one may use Mj and Reevesβs Theorem 1.20 (see also [19, Thm. 2.20]) instead of 1.19. We briefly indicate how, without entering in the detail of the definitions from [32].
In our case, the finite graph of groups is a loop of groups, whose vertex and edge groups are , and attaching maps are given by the identity and . All properties from to are obviously satisfied. The induced tree of spaces, is just a bi-infinite line of spaces, and at each integer, the space is the cone-off tree associated to the train track, with attachments with next cone-off tree, and the previous being given, respectively, by and , a continuous map from to itself realizing . The hallways flare condition [32, Def. 3.3 β 3.5] is the expansion (under the power of , or of ) of sufficiently long paths in , which is ensured by the expansion of the paths corresponding to fundamental segments of hyperbolic elements, from Proposition 2.18, and the cone-bounded hallways strictly flare condition is the expansion (under the power of , or of ) of the paths between two non-free vertices, from Proposition 2.18. The collection corresponds, in [32], to our mapping torus of the free factor system.
Let us finally make the comment that, using the theorem of Gautero-Weidmann does not require the control of the expansion of the paths between non-free vertices, and therefore can be done without the assumption of absence of twinned subgroups. We do not know whether this makes a difference.
2.4 Relative hyperbolicity in the reducible case
Let be a group with a free factor system , and consider an automorphism , that is atoroidal, but possibly reducible with respect to .
Theorem 2.20
Let be a finitely generated group, and be a free factor system. Let be atoroidal for . Assume that there is no pair of twinned subgroups in for and .
Then is relatively hyperbolic with respect to the mapping torus of .
Proof:β Let be the free factor system of provided by Lemma 1.4: it is preserved by some power of , and is fully irreducible with respect to .
We claim that for some is relatively hyperbolic with respect to the mapping torus of . We prove this by discussing according to the Scott complexity of for .
If the Scott complexity of for is , then and . After composing by a conjugation, we may assume that automorphism preserves , and then it sends on a conjugate of by an element of . By composing by another conjugation we may assume that it preserves both and . Thus, is isomorphic to , where is the infinite cyclic group generated by the element associated to . As we have proved, both factors are relatively hyperbolic, with respect to mapping tori of the free factor systems induced by . Since (hence ) has no twinned subgroups in , the group is non-parabolic in at least one of the factors. The combination theorem [8, Thm. 0.1, case 3] can thus be applied, and the group is hyperbolic relative to the mapping torus of the union of the free factor systems of and induced by , hence to the mapping torus of for . We have the claim for this case.
If the Scott complexity of for is , then and for a subgroup , infinite cyclic, generated by . We may assume, after composing by a conjugation, that preserves . Also, since is an automorphism, there exists such that is (the square ensures that the exponent of is instead of ). One can thus express as isomorphic to . As we have proved, is relatively hyperbolic with respect to mapping torus of the free factor system induced by .
We claim that either or is not parabolic in . If both are parabolic, there are two free factors of in , say , such that is normalized by and by . Since , we have that normalises both and . By the absence of twinned groups for , it follows that . But considering normal forms for the free product , we have that is not a subgroup of . This proves that either or is not parabolic in . We may therefore apply the combination theorem [8, Thm. 0.1, case 4] to obtain that the HNN extension is relatively hyperbolic with respect to the conjugates of the parabolic subgroups of . In other words is hyperbolic relative to the mapping torus of for .
If the Scott complexity of for is different from and , then is relatively hyperbolic with respect to the mapping torus of by Theorem 2.1.
We argue then by induction on the Scott complexity of . The lowest complexities and have just been treated. Consider such that , and let such that preserves . Let be the free factor system of induced by . One can easily check that the automorphism of is atoroidal and has no twinned subgroups for . Also, the Scott complexity of for the free factor system is strictly lower than that of for , by Lemma 1.1. By induction hypothesis, for each element of , its mapping torus by is hyperbolic relative to the mapping torus of the free factor system induced by .
We can conclude about the claim for , by the telescoping argument of Osin [33, Thm 2.40]: the group is relatively hyperbolic with respect to the mapping torus of , for the product of and of the exponents associated to the groups in .
We thus have proved the claim for all cases.
Finally, by Proposition 1.22 we get that the group is relatively hyperbolic with respect to the mapping torus of .
3 Applications
3.1 The central element condition
Proposition 3.1
Assume that satisfies the central element condition: for all , there exists such that is an automorphism of , there is a non-trivial central element in .
Then, if is atoroidal, then it has no twinned subgroups for .
Proof:β Assume it has a pair of twinned subgroups. There exists , and such that , both fixed by . By the central element condition, there exists respectively in , non-trivial, so that and . The product is in but is fixed by . This contradicts atoroidality of .
In the next statement, we say that an automorphism is toral, if for each such that , there exists such that is the identity on . The three corollaries are consequences of Proposition 3.1 and Theorem 2.20.
Corollary 3.2
Assume that is finitely generated, and that consists of torsion free abelian groups. If is atoroidal, and toral, then the group is toral relatively hyperbolic.
Corollary 3.3
Assume that is torsion free, and that consists of nilpotent groups and that is such that for each , there exists such that is the identity on . Then if is atoroidal, the group is relatively hyperbolic with nilpotent parabolic subgroups.
Corollary 3.4
Assume that is torsion free, and that consists of abelian groups and that is such that for each , there exists such that is unipotent on (seen as -module). Then if is atoroidal, the group is relatively hyperbolic with nilpotent parabolic subgroups.
3.2 The case of free groups, and a theorem of Gautero-Lustig
Theorem 3.5
(Gautero-Lustig, and Ghosh) [20] [22]
If is an automorphism of a free group with at least one exponentially growing element, the semidirect product is relatively hyperbolic with respect to the mapping torus of the collection of maximal polynomially growing subgroups.
Proof:β We now assume that is an automorphism of a finitely generated free group . We argue by induction on the rank of .
Let be a maximal invariant free factor system provided by Lemma 1.4, and passing to a power we may assume that , and thus is fully irreducible.
By Corollary 2.3, there is such that is hyperbolic relatively to the mapping tori of the maximal polynomially growing subgroups of with respect to . Note that in the case of Scott complexity and , this holds trivially because the maximal polynomially growing subgroups of with respect to is itself.
Consider then a maximal polynomially growing subgroup in for . By Proposition 1.13 its rank is strictly less than the rank of , or perhaps, it is itself. Consider its minimal subtree in , it provides a decomposition of finite graph of groups, with trivial edge groups, and with vertex groups in the collection . The Scott complexity of this decomposition is necessarily or , since otherwise, some element in would be growing exponentially fast by iterations of . Thus it is simply either a free product of two groups in , or a group in free product with , and this last free factor is growing polynomially for (for the word metric of conjugacy classes).
In the first case, the suspension of by (possibly precomposed by somme inner automorphism) is isomorphic to the amalgam over some maximal infinite cyclic subgroup of the suspensions of and of . By induction hypothesis, both suspensions of and are relatively hyperbolic with respect to suspension of polynomially growing subgroups. Writing as the generator of the factor, over which the amalgamation is performed, if is non-parabolic in at least one of these two suspensions, the combination theorem [8, Thm 0.1] ensures that the suspension of is relatively hyperbolic with respect to the conjugates of the parabolic subgroups in both and , as wanted. If it is parabolic in both, then and possess polynomially growing subgroups and normalized by . The group is then polynomially growing in for the automorphism, and the combination theorem guaranties that , which is isomorphic to
[TABLE]
is indeed relatively hyperbolic with respect to suspensions of polynomially growing subgroups.
In the second case, the suspension of by is isomorphic to the HNN of the suspension of over two maximal infinite cyclic subgroups, with the stable letter being an element of , growing polynomially for (for the word metric of conjugacy classes).
For each group whose conjugacy class is in , there is such that preserves . By induction hypothesis, since has smaller rank than , the group is relatively hyperbolic with respect to its polynomially growing subgroups for (for its Cayley tree).
If the edge group is not parabolic in at least one of its embedding in its adjacent vertex group, the combination theorem [8, Thm 0.1] directly ensures that, for , the suspension of by is relatively hyperbolic with respect to the suspensions of the maximal polynomially growing subgroups in .
If it is parabolic in both embeddings, then first perform the amalgam, over the edge group, of with the maximal parabolic group containing the edge group of (or with an abstract copy of the maximal parabolic group containing the second image of the edge group of ) thus enlarging the parabolic subgroup of , but keeping the relatively hyperbolic structure. Then, perform the amalgam with over a maximal parabolic group in , or the HNN over the maximal parabolic group in , using again the combination theorem [8, Thm 0.1] to obtain that the suspension of by is relatively hyperbolic with respect to the suspensions of the maximal polynomially growing subgroups in .
Therefore, in all cases, the suspension of by is relatively hyperbolic with respect to the suspensions of the maximal polynomially growing subgroups in .
By the telescopic argument of Osin [33, Thm 2.40], we conclude that for some , is relatively hyperbolic with respect to suspensions of maximal polynomially growing subgroups.
By the reduction of Proposition 1.22 we obtain the result.
3.3 Application to the conjugacy problem
In this section, we consider the conjugacy problem for certain outer automorphisms of a group that is a free products of non-cyclic abelian groups. We present an algorithm that will decide whether two given toral atoroidal automorphisms of free products of abelian groups are conjugate in . Hence we will prove the following.
Theorem 3.6
Let be a finitely generated free product of non-cyclic free abelian groups, . Denote by the free factor system
There is an algorithm that, given , two automorphisms of that are atoroidal, and toral, determines whether they are conjugate in .
Note that we assume that the Scott complexity of in the statement is .
3.3.1 Reduction to an orbit problem for the group
We will write for the image of an object in the abelianisation of . We consider , two copies of , (canonically isomorphic to ).
Lemma 3.7
* are conjugated in if and only if the following holds:*
- β’
there exists an isomorphism
- β’
and there exists an automorphism of such that, in the abelianisation, if , , and are the images of , , and in the abelianisation of , then
[TABLE]
Proof:β By [10, Lem. 3.1], are conjugated in if and only if there is an isomorphism between and such that at the level of the abelianisations, contains (hence is equal to) , and is in . The Lemma follows.
Lemma 3.8
The first point of the characterisation in the previous lemma is decidable: there is an algorithm that given indicates whether there exists such an .
Proof:β If is a free factor system of consisting of torsion free abelian groups, and are atoroidal for and toral in the sense of Corollary 3.2, then and are relatively hyperbolic with torsion free abelian parabolic subgroups, in other words they are toral relatively hyperbolic. By [9, Thm. D] we have an algorithm determining whether they are abstractly isomorphic, and if they are, we may find an isomorphism .
The problem is now, assuming that such an isomorphism is given, to decide the second point of the characterisation, which we call our orbit problem in .
Observe that the properties involved in the orbit problem only depend on the class of in .
We will need this decomposition lemma.
Lemma 3.9
If where are abelian, and if is an automorphism of , the image of in the abelianisation of splits as a direct product , where each is the image of .
Proof:β The abelianisation of is , where is canonically isomorphic to . Let the induced automorphism of . Since preserves the conjugacy class of , the automorphism preserves each in . Write for the abelianisation of , and the element associated to the factor . The abelianisation of is isomorphic to the abelianisation of , therefore isomorphic to the quotient of by the relations . Since each generates a direct factor of , we have the result.
3.3.2 Structure of the group
A theorem of Guirardel and Levitt provides a structural feature of , because of the relative hyperbolicity of (from Corollary 3.2). They first prove (although a modern definitive reference is their essay [26]) that there exists a canonical JSJ decomposition for as a finite graph of groups in which vertex groups can be surface groups (with boundary), parabolic subgroups, hence free abelian, in which the collection of adjacent edge groups generate a direct factor, and other, so-called rigid groups (see also [9, Β§10]).
Lemma 3.10
The JSJ graph-of-group decomposition of contains no vertex group that is a surface groups (with boundary), and has an underlying graph that is a finite tree.
Proof:β We refer to [10, Prop. 2.11] for the first claim. For the second claim, take the Bass-Serre tree of the decomposition. Consider it as a -tree, being a normal subgroup of . The quotient gives a graph of groups decomposition of that is a free decomposition, i.e. edge groups in are trivial (see [10, Lem. 2.8]). By assumption on and unicity of the Grushko decomposition, the graph is a tree. The underlying graph of the decomposition of is the quotient of by the action of the cyclic group induced by . But since preserves the conjugacy class of all free factors of , it induces the identity on the graph . Thus, underlying graph of the decomposition of is a tree.
A graph-of-group presentation for is then given by presentations for each vertex and unoriented-edge groups, and relations given by attaching maps of each oriented edge.
Guirardel and Levitt prove in [27, Thm 1.4] that there exists a finite index subgroup that preserve the conjugacy class of each maximal parabolic group, and that fits ain a short exact sequence
[TABLE]
in which is a free abelian group, and in which the groups are Mapping Class Groups for surface vertices of the JSJ decomposition of (indexed by the set ), and in which the groups are the groups of automorphisms of fixing the first generators.
As we recalled in the Lemma 3.10, is empty in our case.
The factors correspond to the automorphism groups of parabolic vertex groups (indexed by the set ), of rank , fixing the direct factor generated by adjacent edge groups, of rank .
The group is generated by Dehn twists over edges of the JSJ graph of groups. We will only be interested by its image in the automorphism group of the abelianisation of , and this image is trivial, since in our setting all Dehn twists are piecewise conjugations (all edges of the graph of groups are separating).
Using [9, Thm 4.4] on the relatively hyperbolic structures of the vertex groups of the JSJ decomposition, we can algorithmically compute a collection of coset representatives of in . Let be such a collection. Let . The following is straightforward, from Lemma 3.7.
Lemma 3.11
There exists solving the orbit problem of Lemma 3.7 in if and only if there exists , and whose class in is in , such that the inclusions of Lemma 3.7 1 are satisfied for andf :
[TABLE]
3.3.3 The orbit problem in the terms of the short exact sequence
We first agree on a section of in . This can be done by choosing a graph-of-group presentation of for the JSJ decomposition, and for which the parabolic vertex groups of the JSJ decomposition are generated by a certain basis (as free abelian group) such that the first vectors are in the group generated by the adjacent edge groups. One then realises the group , as an automorphism group of the -th parabolic vertex group, that induces the identity on the adjacent edge groups, and therefore, that embeds as a subgroup of the automorphism group of the graph of groups, hence of .
Now with this choice, a collection of elements of together with an element in defines an element of , and conversely an element in the later group defines a collection in and an element in , and all elements of are thus obtained.
Let us consider a generating set for , compatible with the free product: for generating sets for the . One can derive a generating set of , as an union , where each is in the image of the groups .
Note that is the identity on all elements of except those in . Hence it is the identity on all elements of except those in .
Lemma 3.12
Fix . There exists satisfying the inclusions in Lemma 3.11 if and only if for all , there exists such that , for all and for the preimage of by , and, if in the abelianisation is in the image of , such that .
Proof:β If there exists resolving the orbit problem of Lemma 3.11 (for ), then, one consider and its decomposition in and . The automorphism sends to the image of by . One easily derives the given relations since acts trivially on the abelianisation.
Conversely, it there are as in the statement, since their support among the elements of are disjoint, they define an element of sending to the image of by . Its inverse thus satisfies the orbit problem of Lemma 3.11.
Lemma 3.13
For each , it is decidable whether there exists an element of such that, for all , , and, if in the abelianisation is in the image of , such that .
Proof:β This amounts to check whether there is a matrix in sending an hyperplane of in another, and possibly, an element in a given hyperplane, thus on a point in the suitable quotient. The first condition, expressed in the dual, is requiring sending a vector on another.
The matrices in are exactly those that are with integer entries, triangular by block, with the top diagonal block being the identity, the bottom diagonal block having determinant , and the top right block arbitrary. This is an arithmetic group in an explicit algebraic subgroup of matrices. One can thus apply Grunewald and Segalβs algorithm, [24, Algorithm A] in order to treat this orbit problem.
By Lemma 3.13 and 3.12, the orbit problem of Lemma 3.11 is decidable. Therefore, the problem of Lemma 3.7 is decidable. Therefore, the conjugacy problem in for atoroidal toral automorphisms of is then solved.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Bestvina, M. Handel. Train tracks and automorphisms of free groups. Ann. of Math. (2) 135 (1992), no. 1, 1β51.
- 2[2] M.Bestvina, M.Feighn, M.Handel. Laminations, trees, and irreducible automorphisms of free groups. Geometric and Functional Analysis. 7:2 (1997), 215-244.
- 3[3] Mladen Bestvina, A Bers-like proof of the existence of train tracks for free group automorphisms. Fund. Math. 214 (2011), no. 1, 1β12.
- 4[4] Brian Bowditch. Relatively hyperbolic groups. Internat. J. Algebra and Computation. 22 no.3 (2012), 66pp.
- 5[5] Martin Bridson, Daniel Groves. The quadratic isoperimetric inequality for mapping tori of free group automorphisms. Mem. Amer. Math. Soc. 203 (2010), no. 955, xii+152 pp.
- 6[6] Peter Brinkmann. Hyperbolic Automorphisms of Free Groups. Geom. Funct. Anal. 10 (2000), no. 5, 1071β1089.
- 7[7] Remi Coulon, Arnaud Hilion. Growth and order of automorphisms of free groups and free Burnside groups. Geom. Topol. 21 (2017), no. 4, 1969β2014.
- 8[8] FranΓ§ois Dahmani, Combination of convergence groups, Geom. Topol. 7 (2003), 933-963.
