You are currently browsing the tag archive for the ‘surface subgroup’ tag.
Let be the free group on two generators, and let be the endomorphism defined on generators by and . We define Sapir’s group to be the ascending HNN extension
This group was studied by Crisp-Sageev-Sapir in the context of their work on right-angled Artin groups, and independently by Feighn (according to Mark Sapir); both sought (unsuccessfully) to determine whether contains a subgroup isomorphic to the fundamental group of a closed, oriented surface of genus at least 2. Sapir has conjectured in personal communication that does not contain a surface subgroup, and explicitly posed this question as Problem 8.1 in his problem list.
After three years of thinking about this question on and off, Alden Walker and I have recently succeeded in finding a surface subgroup of , and it is the purpose of this blog post to describe this surface, how it was found, and some related observations. By pushing the technique further, Alden and I managed to prove that for a fixed free group of finite rank, and for a random endomorphism of length (i.e. one taking the generators to random words of length ), the associated HNN extension contains a closed surface subgroup with probability going to 1 as . This result is part of a larger project which we expect to post to the arXiv soon.
Last Friday, Henry Wilton gave a talk at Caltech about his recent joint work with Sang-hyun Kim on polygonal words in free groups. Their work is motivated by the following well-known question of Gromov:
Question(Gromov): Let be a one-ended word-hyperbolic group. Does contain a subgroup isomorphic to the fundamental group of a closed hyperbolic surface?
Let me briefly say what “one-ended” and “word-hyperbolic” mean.
A group is said to be word-hyperbolic if it acts properly and cocompactly by isometries on a proper -hyperbolic path metric space — i.e. a path metric space in which there is a constant so that geodesic triangles in the metric space have the property that each side of the triangle is contained in the -neighborhood of the union of the other two sides (colloquially, triangles are thin). This condition distills the essence of negative curvature in the large, and was shown by Gromov to be equivalent to several other conditions (eg. that the group satisfies a linear isoperimetric inequality; that every ultralimit of the group is an -tree). Free groups are hyperbolic; fundamental groups of closed manifolds with negative sectional curvature (eg surfaces with negative Euler characteristic) are word-hyperbolic; “random” groups are hyperbolic — and so on. In fact, it is an open question whether a group that admits a finite is word hyperbolic if and only if it does not contain a copy of a Baumslag-Solitar group for (note that the group is the special case ); in any case, this is a very good heuristic for identifying the word-hyperbolic groups one typically meets in examples.
If is a finitely generated group, the ends of really means the ends (as defined by Freudenthal) of the Cayley graph of with respect to some finite generating set. Given a proper topological space , the set of compact subsets of gives rise to an inverse system of inclusions, where includes into whenever is a subset of . This inverse system defines an inverse system of maps of discrete spaces , and the inverse limit of this system is a compact, totally disconnected space , called the space of ends of . A proper topological space is canonically compactified by its set of ends; in fact, the compactification is the “biggest” compactification of by a totally disconnected space, in the sense that for any other compactification where is zero dimensional, there is a continuous map which is the identity on .
For a word-hyperbolic group , the Cayley graph can be compactified by adding the ideal boundary , but this is typically not totally disconnected. In this case, the ends of can be recovered as the components of .
A group acts on its own ends . An elementary argument shows that the cardinality of is one of (if a compact set disconnects then infinitely many translates of converging to separate from infinitely many other ends accumulating on ). A group has no ends if and only if it is finite. Stallings famously showed that a (finitely generated) group has at least ends if and only if it admits a nontrivial description as an HNN extension or amalgamated free product over a finite group. One version of the argument proceeds more or less as follows, at least when is finitely presented. Let be an -dimensional Riemannian manifold with fundamental group , and let denote the universal cover. We can identify the ends of with the ends of . Let be a least (-dimensional) area hypersurface in amongst all hypersurfaces that separate some end from some other (here the hypothesis that has at least two ends is used). Then every translate of by an element of is either equal to or disjoint from it, or else one could use the Meeks-Yau “roundoff trick” to find a new with strictly lower area than . The translates of decompose into pieces, and one can build a tree whose vertices correspond to to components of , and whose edges correspond to the translates . The group acts on this tree, with finite edge stabilizers (by the compactness of ), exhibiting either as an HNN extension or an amalgamated product over the edge stabilizers. Note that the special case occurs if and only if has a finite index subgroup which is isomorphic to .
Free groups and virtually free groups do not contain closed surface subgroups; Gromov’s question more or less asks whether these are the only examples of word-hyperbolic groups with this property.
Kim and Wilton study Gromov’s question in a very, very concrete case, namely that case that is the double of a free group along a word ; i.e. (hereafter denoted ). Such groups are known to be one-ended if and only if is not contained in a proper free factor of (it is clear that this condition is necessary), and to be hyperbolic if and only if is not a proper power, by a result of Bestvina-Feighn. To see that this condition is necessary, observe that the double is isomorphic to the fundamental group of a Seifert fiber space, with base space a disk with two orbifold points of order ; such a group contains a . One might think that such groups are too simple to give an insight into Gromov’s question. However, these groups (or perhaps the slightly larger class of graphs of free groups with cyclic edge groups) are a critical case for at least two reasons:
- The “smaller” a group is, the less room there is inside it for a surface group; thus the “simplest” groups should have the best chance of being a counterexample to Gromov’s question.
- If is word-hyperbolic and one-ended, one can try to find a surface subgroup by first looking for a graph of free groups in , and then looking for a surface group in . Since a closed surface group is itself a graph of free groups, one cannot “miss” any surface groups this way.
Not too long ago, I found an interesting construction of surface groups in certain graphs of free groups with cyclic edge groups. In fact, I showed that every nontrivial element of in such a group is virtually represented by a sum of surface subgroups. Such surface subgroups are obtained by finding maps of surface groups into which minimize the Gromov norm in their (projective) homology class. I think it is useful to extend Gromov’s question by making the following
Conjecture: Let be a word-hyperbolic group, and let be nonzero. Then some multiple of is represented by a norm-minimizing surface (which is necessarily -injective).
Note that this conjecture does not generalize to wider classes of groups. There are even examples of groups with nonzero homology classes with positive, rational Gromov norm, for which there are no -injective surfaces representing a multiple of at all.
It is time to define polygonal words in free groups.
Definition: Let be free. Let be a wedge of circles whose edges are free generators for . A cyclically reduced word in these generators is polygonal if there exists a van-Kampen graph on a surface such that:
- every complementary region is a disk whose boundary is a nontrivial (possibly negative) power of ;
- the (labelled) graph immerses in in a label preserving way;
- the Euler characteristic of is strictly less than the number of disks.
The last condition rules out trivial examples; for example, the double of a single disk whose boundary is labeled by . Notice that it is very important to allow both positive and negative powers of as boundaries of complementary regions. In fact, if is not in the commutator subgroup, then the sum of the powers over all complementary regions is necessarily zero (and if is in the commutator subgroup, then has nontrivial , so one already knows that there is a surface subgroup).
Condition 2. means that at each vertex of , there is at most one oriented label corresponding to each generator of or its inverse. This is really the crucial geometric property. If is a van-Kampen graph as above, then a theorem of Marshall Hall implies that there is a finite cover of into which embeds (in fact, this observation underlies Stallings’s work on foldings of graphs). If we build a -complex with by attaching two ends of a cylinder to suitable loops in two copies of , then a tubular neighborhood of in (i.e. what is sometimes called a “fatgraph” ) embeds in a finite cover of , and its double — a surface of strictly negative Euler characteristic — embeds as a closed surface in , and is therefore -injective. Hence if is polygonal, contains a surface subgroup.
Not every word is polygonal. Kim-Wilton discuss some interesting examples in their paper, including:
- suppose is a cyclically reduced product of proper powers of the generators or their inverses (e.g a word like but not a word like ); then is polygonal;
- a word of the form is polygonal if for each ;
- the word is not polygonal.
To see 3, suppose there were a van-Kampen diagram with more disks than Euler characteristic. Then there must be some vertex of valence at least . Since is positive, the complementary regions must have boundaries which alternate between positive and negative powers of , so the degree of the vertex must be even. On the other hand, since must immerse in a wedge of two circles, the degree of every vertex must be at most , so there is consequently some vertex of degree exactly . Since each is isolated, at least edges must be labelled ; hence exactly two. Hence exactly two edges are labelled . But one of these must be incoming and one outgoing, and therefore these are adjacent, contrary to the fact that does not contain a .
1 above is quite striking to me. When is in the commutator subgroup, one can consider van-Kampen diagrams as above without the injectivity property, but with the property that every power of on the boundary of a disk is positive; call such a van-Kampen diagram monotone. It turns out that monotone van-Kampen diagrams always exist when , and in fact that norm-minimizing surfaces representing powers of the generator of are associated to certain monotone diagrams. The construction of such surfaces is an important step in the argument that stable commutator length (a kind of relative Gromov norm) is rational in free groups. In my paper scl, sails and surgery I showed that monomorphisms of free groups that send every generator to a power of that generator induce isometries of the norm; in other words, there is a natural correspondence between certain equivalence classes of monotone surfaces for an arbitrary word in and for a word of the kind that Kim-Wilton show is polygonal (Note: Henry Wilton tells me that Brady, Forester and Martinez-Pedroza have independently shown that contains a surface group for such , but I have not seen their preprint (though I would be very grateful to get a copy!)).
In any case, if not every word is polygonal, all is not lost. To show that contains a surface subgroup is suffices to show that contains a surface subgroup, where and differ by an automorphism of . Kim-Wilton conjecture that one can always find an automorphism so that is polygonal. In fact, they make the following:
Conjecture (Kim-Wilton; tiling conjecture): A word not contained in a proper free factor of shortest length (in a given generating set) in its orbit under is polygonal.
If true, this would give a positive answer to Gromov’s question for groups of the form .