You are currently browsing the monthly archive for May 2009.

A few days ago, Joel Friedman posted a paper on the arXiv purporting to give a proof of the (strengthened) Hanna Neumann conjecture, a well-known problem in geometric group theory.

Simply stated, the problem is as follows.

Conjecture (Hanna Neumann): Let F be a free group, and let G and H be finitely generated subgroups. For a subgroup E of F, let \rho(E) = \max(\text{rank}(E)-1,0). Then there is an inequality \rho(G \cap H) \le \rho(G)\rho(H).

This conjecture was further strengthened by Walter Neumann (her son):

Conjecture (strengthened Hanna Neumann): With notation above, there is an inequality \sum_x \rho(G \cap xHx^{-1}) \le \rho(G)\rho(H) where the sum is taken over x \in H\backslash F / G, i.e. the double coset representatives.

Notice by the way that since any free group embeds into F_2, the free group of rank 2, one can assume that F has rank 2 above. This fact is implicit in the discussion below.

Friedman’s paper seems to be very carefully written, and contains some new ideas (which I do not yet really understand), namely an approach using sheaf theory. But in this post I want to restrict myself to some simple (and probably well-known) geometric observations.

The first step is to reduce the problem to a completely graph-theoretic one, following Stallings; in fact, Benson Farb tells me that he thinks this reduction was known to Stallings, or at least to Dicks/Formanek (and in any case is very close to some ideas Stallings and Gersten introduced to study the problem; more on that in a later post). Friedman makes the following definition:

Definition: Let \mathcal{G} be a finite group and g_1,g_2 \in \mathcal{G} be two elements (that do not necessarily generate \mathcal{G}). The directed Cayley graph C is the graph with vertex set \mathcal{G} and with a directed edge from v to vg_i labeled i for each v \in \mathcal{G} and i=1,2.

In other words, C is a graph whose edges are oriented and labeled with either 1 or 2 in such a way that each vertex has at most one outgoing and one incoming edge with each label, and such that there is a transitive (on the vertices) free action of a group \mathcal{G} on C. (Note: for some reason, Friedman wants his group to act on the right, and therefore has directed edges from v to g_iv, but this is just a matter of convention).

For any finite graph K, not necessarily connected, let \rho(K) = \sum_j \max(0,-\chi(K_j)); i.e. \rho(K) = \sum_j \rho(\pi_1(K_j)) where the sum is taken over the connected components K_j of K. Friedman shows (but this reduction is well-known) that the SHNC is equivalent to the following graph-theoretic inequality:

Theorem: The SHNC is equivalent to the following statement. For any graph C as above, and any two subgraphs K,K' we have \sum_{g \in \mathcal{G}} \rho(K \cap gK') \le \rho(K)\rho(K').

The purpose of this blog entry is to show that there is a very simple proof of this inequality when \rho is replaced with -\chi. This is not such a strange thing to do, since \rho and -\chi are equal for graphs without acyclic components (i.e. without components that are trees), and for “random” graphs K,K' one does not expect the difference between \rho and -\chi to be very big. The argument proceeds as follows. Suppose K has v vertices and e_1,e_2 edges of kind 1,2 respectively, and define v',e_1',e_2' similarly for K'. Then

  • (-\chi(K))(-\chi(K')) = (v-e_1-e_2)(v'-e_1'-e_2')

On the other hand, since Euler characteristic is local, we just need to count how many vertices and edges of each kind turn up in each K \cap gK'. But this is easy: every vertex of K is equal to exactly one translate of every vertex of K', and similarly for edges of each kind. Hence

  • \sum_g -\chi(K \cap gK') = e_1e_1' + e_2e_2' - vv'

So the inequality one wants to show is e_1e_1' + e_2e_2' - vv' \le (v-e_1-e_2)(v'-e_1'-e_2') which simplifies to

  • v(e_1' + e_2') + v'(e_1 + e_2) \le 2vv' + e_1e_2' + e_2 e_1'

On the other hand, each graph K,K' has at most two edges at any vertex with either label, and therefore we have inequalities 0 \le e_1,e_2 \le v, 0 \le e_1',e_2' \le v'. Subject to these constraints, the inequality above is straightforward to prove. To see this, first fix some non-negative values of v,v' and let X be the four-dimensional cube of possible values of e_1,e_2,e_1',e_2'. Since both sides of the inequality are linear as a function of each e_i or e_i', if the inequality is violated at any point in X one may draw a straight line in X corresponding to varying one of the co-ordinates (e.g. e_1) while keeping the others fixed, and deduce that the inequality must be violated on one of the faces of X. Inductively, if the inequality is violated at all, it is violated at a vertex of X, which may be ruled out by inspection; qed.

This argument shows that the whole game is to understand the acyclic components of K \cap gK'; i.e. those which are topologically trees, and therefore contribute 0 to \rho, but -1 to -\chi.

Incidentally, for all I know, this simple argument is explicitly contained in either Stallings’ or Gersten’s paper (it is surely not original in any case). If a reader can verify this, please let me know!

Update: Walter Neumann informs me that this observation (that the inequality is true with -\chi in place of \rho) is in his paper in which he introduces the SHNC! He further shows in that paper that for “most” G, the SHNC is true for all H.

Update (6/29): Warren Dicks informs me that he was not aware of the reduction of SHNC to the graph-theoretic formulation described above. Friedman’s webpage acknowledges the existence of an error in the paper, and says that he is working to correct it. One problem that I know of (discovered mostly by my student Steven Frankel) concerns the commutativity of the diagram on page 10.

Update (10/22): It has been a few months since I last edited this page, and Joel Friedman has not updated either the arXiv paper, or the statement on his webpage that he is “trying to fix the error”. Since wikipedia mentions Friedman’s announcement, I thought it would be worth going on record at this point to say that Friedman’s arXiv paper (version 1 — the only version at the point I write this) is definitely in error, and that I believe the error is fundamental, and cannot be repaired (this is not to say that the paper does not contain some things of interest (it does), or that Friedman does not acknowledge the error (he does), just that it is worth clearing up any possible ambiguity about the situation for readers who are wondering about the status of the SHNC). The problem is the “not entirely standard” (quote from Friedman’s paper) diagrams, like the one on page 10. In particular, the claimed proof of Theorem 5.6, that the projections constructed in Lemma 5.5 (by a very general dimension counting argument) fit into a diagram with the desired properties is false. Any construction of projections satisfying the desired properties must be quite special. Nevertheless, one can certainly still define Friedman’s sheaf \mathcal{K}, and ask whether it has \rho(\mathcal{K})=0 (in Friedman’s sense); this would, as far as I can tell, prove SHNC; however, I do not know of any reason why it should hold (or whether there are any counterexamples, which might exist even if SHNC is true).

More ambitious than simply showing that a group is infinite is to show that it contains an infinite subgroup of a certain kind. One of the most important kinds of subgroup to study are free groups. Hence, one is interested in the question:

Question: When does a group contain a (nonabelian) free subgroup?

Again, one can (and does) ask this question both about a specific group, and about certain classes of groups, or for a typical (in some sense) group from some given family.

Example: If \mathcal{P} is a property of groups that is inherited by subgroups, then if no free group satisfies \mathcal{P}, no group that satisfies \mathcal{P} can contain a free subgroup. An important property of this kind is amenability. A (discrete) group G is amenable if it admits an invariant mean; that is, if there is a linear map m: L^\infty(G) \to \mathbb{R} (i.e. a way to define the average of a bounded function over G) satisfying three basic properties:

  1. m(f) \ge 0 if f\ge 0 (i.e. the average of a non-negative function is non-negative)
  2. m(\chi_G)=1 where \chi_G is the constant function taking the value 1 everywhere on G (i.e. the average of the constant function 1 is normalized to be 1)
  3. m(g\cdot f) = m(f) for every {}g \in G and f \in L^\infty(G), where (g\cdot f)(x) = f(g^{-1}x) (i.e. the mean is invariant under the obvious action of G on L^\infty(G))

If H is a subgroup of G, there are (many) H-invariant homomorphisms j: L^\infty(H) \to L^\infty(G) taking non-negative functions to non-negative functions, and \chi_H to \chi_G; for example, the (left) action of H on G breaks up into a collection of copies of H acting on itself, right-multiplied by a collection of right coset representatives. After choosing such a choice of representatives \lbrace g_\alpha \rbrace, one for each coset Hg_\alpha, we can define j(f)(hg_\alpha) = f(h). Composing with m shows that every subgroup of an amenable group is amenable (this is harder to see in the “geometric” definition of amenable groups in terms of Folner sets). On the other hand, as is well-known, a nonabelian free group is not amenable. Hence, amenable groups do not contain nonabelian free subgroups.

The usual way to see that a nonabelian free group is not amenable is to observe that it contains enough disjoint “copies” of big subsets. For concreteness, let F denote the free group on two generators a,b, and write their inverses as A,B. Let W_a, W_A denote the set of reduced words that start with either a or A, and let \chi_a,\chi_A denote the indicator functions of W_a,W_A respectively. We suppose that F is amenable, and derive a contradiction. Note that F = W_a \cup aW_A, so m(\chi_a) + m(\chi_A) \ge 1. Let V denote the set of reduced words that start with one of the strings a,A,ba,bA, and let \chi_V denote the indicator function of V. Notice that V is made of two disjoint copies of each of W_a,W_A. So on the one hand, m(\chi_V) \le m(\chi_F) = 1, but on the other hand, m(\chi_V) = 2 (m(\chi_a)+m(\chi_A)) \ge 2.

Conversely, the usual way to show that a group G is amenable is to use the Folner condition. Suppose that G is finitely generated by some subset S, and let C denote the Cayley graph of G (so that C is a homogeneous locally finite graph). Suppose one can find finite subsets U_i of vertices so that |\partial U_i|/|U_i| \to 0 (here |U_i| means the number of vertices in U_i, and  |\partial U_i| means the number of vertices in U_i that share an edge with C - U_i). Since the “boundary” of U_i is small compared to U_i, averaging a bounded function over U_i is an “almost invariant” mean; a weak limit (in the dual space to L^\infty(G)) is an invariant mean. Examples of amenable groups include

  1. Finite groups
  2. Abelian groups
  3. Unions and extensions of amenable groups
  4. Groups of subexponential growth

and many others. For instance, virtually solvable groups (i.e. groups containing a solvable subgroup with finite index) are amenable.

Example: No amenable group can contain a nonabelian free subgroup. The von Neumann conjecture asked whether the converse was true. This conjecture was disproved by Olshanskii. Subsequently, Adyan showed that the infinite free Burnside groups are not amenable. These are groups B(m,n) with m\ge 2 generators, and subject only to the relations that the nth power of every element is trivial. When n is odd and at least 665, these groups are infinite and nonamenable. Since they are torsion groups, they do not even contain a copy of \mathbb{Z}, let alone a nonabelian free group!

Example: The Burnside groups are examples of groups that obey a law; i.e. there is a word w(x_1,x_2,\cdots,x_n) in finitely many free variables, such that w(g_1,g_2,\cdots,g_n)=\text{id} for every choice of g_1,\cdots,g_n \in G. For example, an abelian group satisfies the law x_1x_2x_1^{-1}x_2^{-1}=\text{id}. Evidently, a group that obeys a law does not contain a nonabelian free subgroup. However, there are examples of groups which do not obey a law, but which also do not contain any nonabelian free subgroup. An example is the classical Thompson’s group F, which is the group of orientation-preserving piecewise-linear homeomorphisms of [0,1] with finitely many breakpoints at dyadic rationals (i.e. points of the form p/2^q for integers p,q) and with slopes integral powers of 2. To see that this group does not obey a law, one can show (quite easily) that in fact F is dense (in the C^0 topology) in the group \text{Homeo}^+([0,1]) of all orientation-preserving homeomorphisms of the interval. This latter group contains nonabelian free groups; by approximating the generators of such a group arbitrarily closely, one obtains pairs of elements in F that do not satisfy any identity of length shorter than any given constant. On the other hand, a famous theorem of Brin-Squier says that F does not contain any nonabelian free subgroup. In fact, the entire group \text{PL}^+([0,1]) does not contain any nonabelian free subgroup. A short proof of this fact can be found in my paper as a corollary of the fact that every subgroup G of \text{PL}^+([0,1]) has vanishing stable commutator length; since stable commutator length is nonvanishing in nonabelian free groups, this shows that there are no such subgroups of \text{PL}^+([0,1]). (Incidentally, and complementarily, there is a very short proof that stable commutator length vanishes on any group that obeys a law; we will give this proof in a subsequent post).

Example: If G surjects onto H, and H contains a free subgroup F, then there is a section from F to G (by freeness), and therefore G contains a free subgroup.

Example: The most useful way to show that G contains a nonabelian free subgroup is to find a suitable action of G on some space X. The following is known as Klein’s ping-pong lemma. Suppose one can find disjoint subsets U^\pm and V^\pm of X, and elements g,h \in G so that g(U^+ \cup V^\pm) \subset U^+g^{-1}(U^- \cup V^\pm) \subset U^-, and similarly interchanging the roles of U^\pm, V^\pm and g,h. If w is a reduced word in g^{\pm 1},h^{\pm 1}, one can follow the trajectory of a point under the orbit of subwords of w to verify that w is nontrivial. The most common way to apply this in practice is when g,h act on X with source-sink dynamics; i.e. the element g has two fixed points u^\pm so that every other point converges to u^+ under positive powers of g, and to u^- under negative powers of g. Similarly, h has two fixed points v^\pm with similar dynamics. If the points u^\pm,v^\pm are disjoint, and X is compact, one can take any small open neighborhoods U^\pm,V^\pm of u^\pm,v^\pm, and then sufficiently large powers of g and h will satisfy the hypotheses of ping-pong.

Example: Every hyperbolic group G acts on its Gromov boundary \partial_\infty G. This boundary is the set of equivalence classes of quasigeodesic rays in (the Cayley graph of) G, where two rays are equivalent if they are a finite Hausdorff distance apart. Non-torsion elements act on the boundary with source-sink dynamics. Consequently, every pair of non-torsion elements in a hyperbolic group either generate a virtually cyclic group, or have powers that generate a nonabelian free group.

It is striking to see how easy it is to construct nonabelian free subgroups of a hyperbolic group, and how difficult to construct closed surface subgroups. We will return to the example of hyperbolic groups in a future post.

Example: The Tits alternative says that any linear group G (i.e. any subgroup of \text{GL}(n,\mathbb{R}) for some n) either contains a nonabelian free subgroup, or is virtually solvable (and therefore amenable). This can be derived from ping-pong, where G is made to act on certain spaces derived from the linear action (e.g. locally symmetric spaces compactified in certain ways, and buildings associated to discrete valuations on the ring of entries of matrix elements of G). 

Example: There is a Tits alternative for subgroups of other kinds of groups, for example mapping class groups, as shown by Ivanov and McCarthy. The mapping class group (of a surface) acts on the Thurston boundary of Teichmuller space. Every subgroup of the mapping class group either contains a nonabelian free subgroup, or is virtually abelian. Roughly speaking, either elements move points in the boundary with enough dynamics to be able to do ping-pong, or else the action is “localized” in a train-track chart, and one obtains a linear representation of the group (enough to apply the ordinary Tits alternative). Virtually solvable subgroups of mapping class groups are virtually abelian.

Example: A similar Tits alternative holds for \text{Out}(F_n). This was shown by Bestvina-Feighn-Handel in these three papers (the third paper shows that solvable subgroups are virtually abelian, thus emphasizing the parallels with mapping class groups).

Example: If G is a finitely generated group of homeomorphisms of S^1, then there is a kind of Tits alternative, first proposed by Ghys, and proved by Margulis: either G preserves a probability measure on S^1 (which might be singular), or it contains a nonabelian free subgroup. To see this, first note that either G has a finite orbit (which supports an invariant probability measure) or the action is semi-conjugate to a minimal action (one with all orbits dense). In the second case, the proof depends on understanding the centralizer of the group action: either the centralizer is infinite, in which case the group is conjugate to a group of rotations, or it is finite cyclic, and one obtains an action of G on a “smaller” circle, by quotienting out by the centralizer. So one may assume the action is minimal with trivial centralizer. In this case, one shows that the action has the property that for any nonempty intervals I,J in S^1, there is some {}g \in G with g(I) \subset J; i.e. any interval may be put inside any other interval by some element of the group. For such an action, it is very easy to do ping-pong. Incidentally, a minor variation on this result, and with essentially this argument, was established by Thurston in the context of uniform foliations of 3-manifolds before Ghys proposed his question.

Example: If \rho_t is an (algebraic) family of representations of a (countable) free group F into an algebraic group, then either some element g \in F is in the kernel of every \rho_t, or the set of faithful representations is “generic”, i.e. the intersection of countably many open dense sets. This is because the set of representations for which a given element is in the kernel is Zariski closed, and therefore its complement is open and either empty or dense (one must add suitable hypotheses or conditions to the above to make it rigorous).

Before looking for surface subgroups, it is worth thinking about how to find (or rule out the existence of) simpler classes of subgroups. This is a very general question, and I do not intend to give a complete survey; however, it is instructive to build up to the question of surface subgroups incrementally and to catalog some of the interesting examples and counterexamples along the way.

Question: When is a group infinite?

Already this question is more than hard enough. But first we must examine some unstated assumptions behind the question. We have some group G in mind, and want to know whether it is infinite or not. But in what sense do we “have” the group G? There are several things we might mean by this, including:

  1. An explicit group G given by generators and relations; i.e. G = \langle S \; | \; R \rangle.
  2. A group G given together with an action on a set \Sigma.
  3. A group G not uniquely defined, but described implicitly in terms of its properties (e.g. G is amenable, or left-orderable, or has property (T), or is linear, or is residually p, or is a 3-manifold group, or is finitely presented, or satisfies a law, etc.).

In general, it is hard to learn much about a group from a presentation. However, sometimes one can have some success:

Example: If G is given by a finite presentation G = \langle S \; | \; R \rangle, the deficiency of the presentation is the difference between the number of generators and the number of relators; i.e. |S| - |R|. The deficiency of G is the maximum of the deficiency of all finite presentations. In practice, it is very difficult to determine the deficiency of a group, but trivial to determine the deficiency of a given presentation. The rank of the abelianization of G (i.e. the rank of H_1(G;\mathbb{Z})) is at least as big as the deficiency; hence if the deficiency is positive, G is infinite, and in fact contains a copy of \mathbb{Z}.

Example: Daniel Allcock observed that one can do better when some of the relators R as above are proper powers. Geometrically, a relator of order p counts as only “1/p of a relator” for the purposes of computing the rank of H_1. Explicitly, Allcock shows that if G is a group with a presentation of the form G = \langle a_1, \cdots, a_n \; | \; w_1^{r_1} = \cdots = w_m^{r_m} = 1 \rangle then if H is a normal subgroup of G of index N < \infty and for each index j, one has w_j^k \notin H for 1 \le k \le r_j-1 then the rank of the abelianization of H is at least 1+ N(n-1 - \sum_i \frac {1} {r_i}). If this rank is positive, then H is infinite, and therefore so is G.

Example: A much more subtle example is the famous Golod-Shafarevich inequality. Let G be a finite p-group (i.e. a group in which every element is torsion, with order a power of p). Let n(G) be the minimum number of generators of G, and r(G) the number of relations between these generators in the corresponding free pro-p-group (if R(G) denotes the minimum number of relations defining G as a discrete group then R(G) \ge r(G)). The G-S inequality is the inequality r(G) > n(G)^2/4. In particular, if G is a nontrivial pro-p-group for which n(G)^2/4 \ge r(G) (or n(G)^2/4 \ge R(G) which implies it) then G is infinite. This inequality enabled Golod to give a negative answer to the generalized Burnside’s problem, by showing that for each prime p there is an infinite group G generated by three elements, in which every element has order a power of p.

Example: Marc Lackenby has made very nice use of the Golod-Shafarevich inequality in his work on Kleinian groups with finite non-cyclic subgroups. A Kleinian group is a finitely generated discrete subgroup of the group of isometries of hyperbolic 3-space; such a group is the fundamental group of a hyperbolic 3-orbifold. Marc shows that if a Kleinian group G contains a finite non-cyclic subgroup, then G is finite, or virtually free, or contains a closed surface subgroup. The argument is very interesting and delicate, and I hope to return to it in a later post. But for the moment I just want to remark that the form of the G-S inequality Marc uses is as follows. Let G be a group with a finite presentation G = \langle S \; | \; R \rangle. Let d_p denote the dimension of H_1(G;\mathbb{F}_p) where p is a prime. If d_p^2/4 > d_p - |S| + |R| then G is infinite.

Example: Another way to show a group G is infinite is if the relators are very long. This is the method of small cancellation theory, and can be implemented in many different ways. From the modern perspective, a group presentation satisfies a small cancellation condition if one can build a 2-complex from the presentation which is manifestly non-positively curved in some explicit sense. For example, if G = \langle S \; | \; R \rangle is a symmetrized presentation (i.e. one in which elements of R are cyclically reduced, and R is closed under taking cyclic permutations and inverses), a piece is a word b in the generators if there are distinct relations ba_1, ba_2 in R. If no relation is a product of fewer than p pieces, one says that G satisfies the small cancellation condition C(p). So, for example, if G is C(6), one can build a 2-complex presenting G built from polygons, each of which has at least 6 sides, and is non-positively curved (and therefore G is infinite). 

Example: Instead of showing that a particular group is infinite, one can show that certain groups whose presentations are obtained by a statistical process, are infinite with overwhelming probability. Yann Ollivier wrote an introduction to Gromov’s theory of Random Groups, in which it is made precise what one means by a “random group”, and many important properties of such groups are delineated. There is a parameter in the theory which governs the density of relations added to a generating set to determine the random group. The most striking aspect of the theory (in my opinion) is the existence of a phase transition. Gromov showed that if G is a random group at density d then if d < 1/2, with overwhelming probability, G is infinite, hyperbolic, torsion-free and of geometric dimension 2 (i.e. it is not free, but admits a 2-dimensional K(G,1)). However, if d \ge 1/2, with overwhelming probability, G is either trivial or \mathbb{Z}/2\mathbb{Z}.

Example: A group G which admits a finite dimensional K(G,1) is torsion-free, and therefore either trivial or infinite. This follows from the fact that the K(\mathbb{Z}/p\mathbb{Z},1)‘s are the infinite dimensional Lens spaces, which have nontrivial homology in infinitely many dimensions, together with elementary covering space theory. This example begs the question: how do you tell if a group has a finite dimensional K(G,1)? Well, one way is to exhibit a free, properly discontinuous action of G on a finite dimensional contractible space; of course, given such an action, it is probably easier to directly find elements in G of infinite order. 

Example: A function f:G \to \mathbb{R}^+ is said to be a length function if it satisfies f(\text{id})=0, if it is symmetric (i.e. f(g) = f(g^{-1}) for all g) and if it is subadditive: f(gh) \le f(g) + f(h). A group G is said to be strongly bounded if every length function on G is bounded. The strongly bounded property was introduced by George Bergman in this paper. A countable group is strongly bounded if and only if it is finite (the fact that finite groups are strongly bounded is obvious). Moreover, a group which admits an unbounded length function is evidently infinite. However, it turns out that there are many interesting uncountable but strongly bounded groups! Bergman showed that the group of permutations of any set is strongly bounded. Yves de Cornulier, in an appendix to a paper of mine with Mike Freedman, showed that the same is true for Homeo(S^n), the group of homeomorphisms of an n-sphere.

Example: One of the most spectacular proofs of the finiteness of a (certain class of) group(s) is Margulis’ proof of the normal subgroup theorem, which says that if G is a lattice in a higher rank Lie group, then every normal subgroup H in G is either finite, or of finite index. The proof has three steps: first, one shows that if H is infinite, then G/H is amenable. Second, since G has property (T), the same is true for G/H. Third, an amenable group with property (T) is finite. The second and third steps are not very complicated: a group has property (T) if the trivial representation is isolated in the space of all irreducible unitary representations, in a certain topology. A quotient of a group by a closed normal subgroup certainly has no more unitary representations than the original group itself, so the second step is not hard to show. An amenable group G/H has almost invariant vectors in L^2(G/H); since it has property (T), it has an invariant vector in L^2(G/H); but this implies that G/H is finite. So the hard part is to show that G/H is amenable. This is done using what is now known as boundary theory, and is described in Chapter VI of Margulis’ book.

I would be curious to hear other people’s favorite tricks/techniques to show that a group is or is not infinite.

As an experiment, I plan to spend the next five weeks documenting my current research on this blog. This research comprises several related projects, but most are concerned in one way or another with the general program of studying the geometry of a space by probing it with surfaces. Since I am nominally a topologist, these surfaces are real 2-manifolds, and I am usually interested in working in the homotopy category (or some rational “quotient” of it). I am especially concerned with surfaces with boundary, and even (occasionally) with corners. 

Since it is good to have a “big question” lurking somewhere in the background (for the purposes of motivation and advertising, if nothing else), I should admit from the start that I am interested in Gromov’s well-known question about surface subgroups, which asks:

Question (Gromov): Does every one-ended word-hyperbolic group contain a closed hyperbolic surface subgroup?

I don’t have strong feelings about whether the answer to this question is “yes” or “no”, but I do think the question can be sharpened usefully in many ways, and it is my intention to do so. Gromov’s question is certainly inspired by questions such as Waldhausen’s conjecture and the virtual fibration conjecture in 3-manifold topology, but it is hard to imagine that a proof of one of these conjectures would shed much light on Gromov’s question in general. At least one essential tool in 3-manifold topology — namely Dehn’s lemma — has no meaningful analogue in geometric group theory, and I think it is important to try to imagine different methods of constructing surface groups from “first principles”.

Another long-term project that informs much of my current research is the problem of understanding stable commutator length in free groups. The interested reader can learn something about this from my monograph (which can be downloaded from this page). I hope to explain why this is a fundamental and interesting problem, with rich structure and many potential applications.

Follow

Get every new post delivered to your Inbox.

Join 175 other followers