<?xml version="1.0" encoding="UTF-8" standalone="yes"?><oembed><version><![CDATA[1.0]]></version><provider_name><![CDATA[Geometry and the imagination]]></provider_name><provider_url><![CDATA[https://lamington.wordpress.com]]></provider_url><author_name><![CDATA[Danny Calegari]]></author_name><author_url><![CDATA[https://lamington.wordpress.com/author/dannycaltech/]]></author_url><title><![CDATA[Groups with free&nbsp;subgroups]]></title><type><![CDATA[link]]></type><html><![CDATA[<p>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 <em>free groups</em>. Hence, one is interested in the question:</p>
<p><strong>Question</strong>: When does a group contain a (nonabelian) free subgroup?</p>
<p>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.</p>
<p><strong>Example</strong>: If <img src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BP%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathcal{P}" title="&#92;mathcal{P}" class="latex" /> is a property of groups that is inherited by subgroups, then if no free group satisfies <img src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BP%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathcal{P}" title="&#92;mathcal{P}" class="latex" />, no group that satisfies <img src="https://s0.wp.com/latex.php?latex=%5Cmathcal%7BP%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathcal{P}" title="&#92;mathcal{P}" class="latex" /> can contain a free subgroup. An important property of this kind is <em>amenability</em>. A (discrete) group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is <em>amenable</em> if it admits an <em>invariant mean</em>; that is, if there is a linear map <img src="https://s0.wp.com/latex.php?latex=m%3A+L%5E%5Cinfty%28G%29+%5Cto+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m: L^&#92;infty(G) &#92;to &#92;mathbb{R}" title="m: L^&#92;infty(G) &#92;to &#92;mathbb{R}" class="latex" /> (i.e. a way to define the <em>average</em> of a bounded function over <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />) satisfying three basic properties:</p>
<ol>
<li><img src="https://s0.wp.com/latex.php?latex=m%28f%29+%5Cge+0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m(f) &#92;ge 0" title="m(f) &#92;ge 0" class="latex" /> if <img src="https://s0.wp.com/latex.php?latex=f%5Cge+0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="f&#92;ge 0" title="f&#92;ge 0" class="latex" /> (i.e. the average of a non-negative function is non-negative)</li>
<li><img src="https://s0.wp.com/latex.php?latex=m%28%5Cchi_G%29%3D1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m(&#92;chi_G)=1" title="m(&#92;chi_G)=1" class="latex" /> where <img src="https://s0.wp.com/latex.php?latex=%5Cchi_G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;chi_G" title="&#92;chi_G" class="latex" /> is the constant function taking the value <img src="https://s0.wp.com/latex.php?latex=1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1" title="1" class="latex" /> everywhere on <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> (i.e. the average of the constant function <img src="https://s0.wp.com/latex.php?latex=1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1" title="1" class="latex" /> is normalized to be <img src="https://s0.wp.com/latex.php?latex=1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="1" title="1" class="latex" />)</li>
<li><img src="https://s0.wp.com/latex.php?latex=m%28g%5Ccdot+f%29+%3D+m%28f%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m(g&#92;cdot f) = m(f)" title="m(g&#92;cdot f) = m(f)" class="latex" /> for every <img src="https://s0.wp.com/latex.php?latex=%7B%7Dg+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="{}g &#92;in G" title="{}g &#92;in G" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=f+%5Cin+L%5E%5Cinfty%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="f &#92;in L^&#92;infty(G)" title="f &#92;in L^&#92;infty(G)" class="latex" />, where <img src="https://s0.wp.com/latex.php?latex=%28g%5Ccdot+f%29%28x%29+%3D+f%28g%5E%7B-1%7Dx%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="(g&#92;cdot f)(x) = f(g^{-1}x)" title="(g&#92;cdot f)(x) = f(g^{-1}x)" class="latex" /> (i.e. the mean is invariant under the obvious action of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> on <img src="https://s0.wp.com/latex.php?latex=L%5E%5Cinfty%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L^&#92;infty(G)" title="L^&#92;infty(G)" class="latex" />)</li>
</ol>
<p>If <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" /> is a subgroup of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />, there are (many) <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" />-invariant homomorphisms <img src="https://s0.wp.com/latex.php?latex=j%3A+L%5E%5Cinfty%28H%29+%5Cto+L%5E%5Cinfty%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="j: L^&#92;infty(H) &#92;to L^&#92;infty(G)" title="j: L^&#92;infty(H) &#92;to L^&#92;infty(G)" class="latex" /> taking non-negative functions to non-negative functions, and <img src="https://s0.wp.com/latex.php?latex=%5Cchi_H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;chi_H" title="&#92;chi_H" class="latex" /> to <img src="https://s0.wp.com/latex.php?latex=%5Cchi_G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;chi_G" title="&#92;chi_G" class="latex" />; for example, the (left) action of <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" /> on <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> breaks up into a collection of copies of <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" /> acting on itself, right-multiplied by a collection of right coset representatives. After choosing such a choice of representatives <img src="https://s0.wp.com/latex.php?latex=%5Clbrace+g_%5Calpha+%5Crbrace&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;lbrace g_&#92;alpha &#92;rbrace" title="&#92;lbrace g_&#92;alpha &#92;rbrace" class="latex" />, one for each coset <img src="https://s0.wp.com/latex.php?latex=Hg_%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="Hg_&#92;alpha" title="Hg_&#92;alpha" class="latex" />, we can define <img src="https://s0.wp.com/latex.php?latex=j%28f%29%28hg_%5Calpha%29+%3D+f%28h%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="j(f)(hg_&#92;alpha) = f(h)" title="j(f)(hg_&#92;alpha) = f(h)" class="latex" />. Composing with <img src="https://s0.wp.com/latex.php?latex=m&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m" title="m" class="latex" /> shows that every subgroup of an amenable group is amenable (this is harder to see in the &#8220;geometric&#8221; 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.</p>
<p>The usual way to see that a nonabelian free group is not amenable is to observe that it contains enough disjoint &#8220;copies&#8221; of big subsets. For concreteness, let <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> denote the free group on two generators <img src="https://s0.wp.com/latex.php?latex=a%2Cb&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a,b" title="a,b" class="latex" />, and write their inverses as <img src="https://s0.wp.com/latex.php?latex=A%2CB&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A,B" title="A,B" class="latex" />. Let <img src="https://s0.wp.com/latex.php?latex=W_a%2C+W_A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="W_a, W_A" title="W_a, W_A" class="latex" /> denote the set of reduced words that start with either <img src="https://s0.wp.com/latex.php?latex=a&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a" title="a" class="latex" /> or <img src="https://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="A" title="A" class="latex" />, and let <img src="https://s0.wp.com/latex.php?latex=%5Cchi_a%2C%5Cchi_A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;chi_a,&#92;chi_A" title="&#92;chi_a,&#92;chi_A" class="latex" /> denote the indicator functions of <img src="https://s0.wp.com/latex.php?latex=W_a%2CW_A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="W_a,W_A" title="W_a,W_A" class="latex" /> respectively. We suppose that <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> is amenable, and derive a contradiction. Note that <img src="https://s0.wp.com/latex.php?latex=F+%3D+W_a+%5Ccup+aW_A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F = W_a &#92;cup aW_A" title="F = W_a &#92;cup aW_A" class="latex" />, so <img src="https://s0.wp.com/latex.php?latex=m%28%5Cchi_a%29+%2B+m%28%5Cchi_A%29+%5Cge+1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m(&#92;chi_a) + m(&#92;chi_A) &#92;ge 1" title="m(&#92;chi_a) + m(&#92;chi_A) &#92;ge 1" class="latex" />. Let <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> denote the set of reduced words that start with one of the strings <img src="https://s0.wp.com/latex.php?latex=a%2CA%2Cba%2CbA&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="a,A,ba,bA" title="a,A,ba,bA" class="latex" />, and let <img src="https://s0.wp.com/latex.php?latex=%5Cchi_V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;chi_V" title="&#92;chi_V" class="latex" /> denote the indicator function of <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" />. Notice that <img src="https://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V" title="V" class="latex" /> is made of two disjoint copies of each of <img src="https://s0.wp.com/latex.php?latex=W_a%2CW_A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="W_a,W_A" title="W_a,W_A" class="latex" />. So on the one hand, <img src="https://s0.wp.com/latex.php?latex=m%28%5Cchi_V%29+%5Cle+m%28%5Cchi_F%29+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m(&#92;chi_V) &#92;le m(&#92;chi_F) = 1" title="m(&#92;chi_V) &#92;le m(&#92;chi_F) = 1" class="latex" />, but on the other hand, <img src="https://s0.wp.com/latex.php?latex=m%28%5Cchi_V%29+%3D+2+%28m%28%5Cchi_a%29%2Bm%28%5Cchi_A%29%29+%5Cge+2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m(&#92;chi_V) = 2 (m(&#92;chi_a)+m(&#92;chi_A)) &#92;ge 2" title="m(&#92;chi_V) = 2 (m(&#92;chi_a)+m(&#92;chi_A)) &#92;ge 2" class="latex" />.</p>
<p>Conversely, the usual way to show that a group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> <em>is</em> amenable is to use the Folner condition. Suppose that <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is finitely generated by some subset <img src="https://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S" title="S" class="latex" />, and let <img src="https://s0.wp.com/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C" title="C" class="latex" /> denote the Cayley graph of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> (so that <img src="https://s0.wp.com/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C" title="C" class="latex" /> is a homogeneous locally finite graph). Suppose one can find finite subsets <img src="https://s0.wp.com/latex.php?latex=U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U_i" title="U_i" class="latex" /> of vertices so that <img src="https://s0.wp.com/latex.php?latex=%7C%5Cpartial+U_i%7C%2F%7CU_i%7C+%5Cto+0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|&#92;partial U_i|/|U_i| &#92;to 0" title="|&#92;partial U_i|/|U_i| &#92;to 0" class="latex" /> (here <img src="https://s0.wp.com/latex.php?latex=%7CU_i%7C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|U_i|" title="|U_i|" class="latex" /> means the number of vertices in <img src="https://s0.wp.com/latex.php?latex=U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U_i" title="U_i" class="latex" />, and  <img src="https://s0.wp.com/latex.php?latex=%7C%5Cpartial+U_i%7C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|&#92;partial U_i|" title="|&#92;partial U_i|" class="latex" /> means the number of vertices in <img src="https://s0.wp.com/latex.php?latex=U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U_i" title="U_i" class="latex" /> that share an edge with <img src="https://s0.wp.com/latex.php?latex=C+-+U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C - U_i" title="C - U_i" class="latex" />). Since the &#8220;boundary&#8221; of <img src="https://s0.wp.com/latex.php?latex=U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U_i" title="U_i" class="latex" /> is small compared to <img src="https://s0.wp.com/latex.php?latex=U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U_i" title="U_i" class="latex" />, averaging a bounded function over <img src="https://s0.wp.com/latex.php?latex=U_i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U_i" title="U_i" class="latex" /> is an &#8220;almost invariant&#8221; mean; a weak limit (in the dual space to <img src="https://s0.wp.com/latex.php?latex=L%5E%5Cinfty%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L^&#92;infty(G)" title="L^&#92;infty(G)" class="latex" />) is an invariant mean. Examples of amenable groups include</p>
<ol>
<li>Finite groups</li>
<li>Abelian groups</li>
<li>Unions and extensions of amenable groups</li>
<li>Groups of subexponential growth</li>
</ol>
<p>and many others. For instance, virtually solvable groups (i.e. groups containing a solvable subgroup with finite index) are amenable.</p>
<p><strong>Example</strong>: 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 <a href="http://www.ams.org/mathscinet-getitem?mr=0682486">showed</a> that the infinite free Burnside groups are not amenable. These are groups <img src="https://s0.wp.com/latex.php?latex=B%28m%2Cn%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="B(m,n)" title="B(m,n)" class="latex" /> with <img src="https://s0.wp.com/latex.php?latex=m%5Cge+2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="m&#92;ge 2" title="m&#92;ge 2" class="latex" /> generators, and subject only to the relations that the <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />th power of every element is trivial. When <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" /> is odd and at least <img src="https://s0.wp.com/latex.php?latex=665&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="665" title="665" class="latex" />, these groups are infinite and nonamenable. Since they are torsion groups, they do not even contain a copy of <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z}" title="&#92;mathbb{Z}" class="latex" />, let alone a nonabelian free group!</p>
<p><strong>Example</strong>: The Burnside groups are examples of groups that obey a <em>law</em>; i.e. there is a word <img src="https://s0.wp.com/latex.php?latex=w%28x_1%2Cx_2%2C%5Ccdots%2Cx_n%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w(x_1,x_2,&#92;cdots,x_n)" title="w(x_1,x_2,&#92;cdots,x_n)" class="latex" /> in finitely many free variables, such that <img src="https://s0.wp.com/latex.php?latex=w%28g_1%2Cg_2%2C%5Ccdots%2Cg_n%29%3D%5Ctext%7Bid%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w(g_1,g_2,&#92;cdots,g_n)=&#92;text{id}" title="w(g_1,g_2,&#92;cdots,g_n)=&#92;text{id}" class="latex" /> for every choice of <img src="https://s0.wp.com/latex.php?latex=g_1%2C%5Ccdots%2Cg_n+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g_1,&#92;cdots,g_n &#92;in G" title="g_1,&#92;cdots,g_n &#92;in G" class="latex" />. For example, an abelian group satisfies the law <img src="https://s0.wp.com/latex.php?latex=x_1x_2x_1%5E%7B-1%7Dx_2%5E%7B-1%7D%3D%5Ctext%7Bid%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="x_1x_2x_1^{-1}x_2^{-1}=&#92;text{id}" title="x_1x_2x_1^{-1}x_2^{-1}=&#92;text{id}" class="latex" />. 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 <em>Thompson&#8217;s group</em> <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" />, which is the group of orientation-preserving piecewise-linear homeomorphisms of <img src="https://s0.wp.com/latex.php?latex=%5B0%2C1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="[0,1]" title="[0,1]" class="latex" /> with finitely many breakpoints at dyadic rationals (i.e. points of the form <img src="https://s0.wp.com/latex.php?latex=p%2F2%5Eq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p/2^q" title="p/2^q" class="latex" /> for integers <img src="https://s0.wp.com/latex.php?latex=p%2Cq&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="p,q" title="p,q" class="latex" />) and with slopes integral powers of <img src="https://s0.wp.com/latex.php?latex=2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="2" title="2" class="latex" />. To see that this group does not obey a law, one can show (quite easily) that in fact <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> is dense (in the <img src="https://s0.wp.com/latex.php?latex=C%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C^0" title="C^0" class="latex" /> topology) in the group <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BHomeo%7D%5E%2B%28%5B0%2C1%5D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{Homeo}^+([0,1])" title="&#92;text{Homeo}^+([0,1])" class="latex" /> of <em>all</em> 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 <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> that do not satisfy any identity of length shorter than any given constant. On the other hand, a famous theorem of <a href="http://www.ams.org/mathscinet-getitem?mr=0782231">Brin-Squier</a> says that <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> does not contain any nonabelian free subgroup. In fact, the entire group <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BPL%7D%5E%2B%28%5B0%2C1%5D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{PL}^+([0,1])" title="&#92;text{PL}^+([0,1])" class="latex" /> does not contain any nonabelian free subgroup. A short proof of this fact can be found in <a href="http://arxiv.org/abs/math/0607482">my paper</a> as a corollary of the fact that every subgroup <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> of <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BPL%7D%5E%2B%28%5B0%2C1%5D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{PL}^+([0,1])" title="&#92;text{PL}^+([0,1])" class="latex" /> has vanishing stable commutator length; since stable commutator length is nonvanishing in nonabelian free groups, this shows that there are no such subgroups of <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BPL%7D%5E%2B%28%5B0%2C1%5D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{PL}^+([0,1])" title="&#92;text{PL}^+([0,1])" class="latex" />. (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).</p>
<p><strong>Example</strong>: If <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> surjects onto <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" />, and <img src="https://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="H" title="H" class="latex" /> contains a free subgroup <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" />, then there is a section from <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> to <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> (by freeness), and therefore <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> contains a free subgroup.</p>
<p><strong>Example</strong>: The most useful way to show that <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> contains a nonabelian free subgroup is to find a suitable action of <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> on some space <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" />. The following is known as Klein&#8217;s ping-pong lemma. Suppose one can find disjoint subsets <img src="https://s0.wp.com/latex.php?latex=U%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U^&#92;pm" title="U^&#92;pm" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=V%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="V^&#92;pm" title="V^&#92;pm" class="latex" /> of <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" />, and elements <img src="https://s0.wp.com/latex.php?latex=g%2Ch+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g,h &#92;in G" title="g,h &#92;in G" class="latex" /> so that <img src="https://s0.wp.com/latex.php?latex=g%28U%5E%2B+%5Ccup+V%5E%5Cpm%29+%5Csubset+U%5E%2B&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g(U^+ &#92;cup V^&#92;pm) &#92;subset U^+" title="g(U^+ &#92;cup V^&#92;pm) &#92;subset U^+" class="latex" />, <img src="https://s0.wp.com/latex.php?latex=g%5E%7B-1%7D%28U%5E-+%5Ccup+V%5E%5Cpm%29+%5Csubset+U%5E-&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g^{-1}(U^- &#92;cup V^&#92;pm) &#92;subset U^-" title="g^{-1}(U^- &#92;cup V^&#92;pm) &#92;subset U^-" class="latex" />, and similarly interchanging the roles of <img src="https://s0.wp.com/latex.php?latex=U%5E%5Cpm%2C+V%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U^&#92;pm, V^&#92;pm" title="U^&#92;pm, V^&#92;pm" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=g%2Ch&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g,h" title="g,h" class="latex" />. If <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is a reduced word in <img src="https://s0.wp.com/latex.php?latex=g%5E%7B%5Cpm+1%7D%2Ch%5E%7B%5Cpm+1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g^{&#92;pm 1},h^{&#92;pm 1}" title="g^{&#92;pm 1},h^{&#92;pm 1}" class="latex" />, one can follow the trajectory of a point under the orbit of subwords of <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> to verify that <img src="https://s0.wp.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w" title="w" class="latex" /> is nontrivial. The most common way to apply this in practice is when <img src="https://s0.wp.com/latex.php?latex=g%2Ch&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g,h" title="g,h" class="latex" /> act on <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> with <em>source-sink dynamics</em>; i.e. the element <img src="https://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g" title="g" class="latex" /> has two fixed points <img src="https://s0.wp.com/latex.php?latex=u%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="u^&#92;pm" title="u^&#92;pm" class="latex" /> so that every other point converges to <img src="https://s0.wp.com/latex.php?latex=u%5E%2B&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="u^+" title="u^+" class="latex" /> under positive powers of <img src="https://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g" title="g" class="latex" />, and to <img src="https://s0.wp.com/latex.php?latex=u%5E-&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="u^-" title="u^-" class="latex" /> under negative powers of <img src="https://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g" title="g" class="latex" />. Similarly, <img src="https://s0.wp.com/latex.php?latex=h&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="h" title="h" class="latex" /> has two fixed points <img src="https://s0.wp.com/latex.php?latex=v%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="v^&#92;pm" title="v^&#92;pm" class="latex" /> with similar dynamics. If the points <img src="https://s0.wp.com/latex.php?latex=u%5E%5Cpm%2Cv%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="u^&#92;pm,v^&#92;pm" title="u^&#92;pm,v^&#92;pm" class="latex" /> are disjoint, and <img src="https://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="X" title="X" class="latex" /> is compact, one can take any small open neighborhoods <img src="https://s0.wp.com/latex.php?latex=U%5E%5Cpm%2CV%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="U^&#92;pm,V^&#92;pm" title="U^&#92;pm,V^&#92;pm" class="latex" /> of <img src="https://s0.wp.com/latex.php?latex=u%5E%5Cpm%2Cv%5E%5Cpm&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="u^&#92;pm,v^&#92;pm" title="u^&#92;pm,v^&#92;pm" class="latex" />, and then sufficiently large powers of <img src="https://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g" title="g" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=h&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="h" title="h" class="latex" /> will satisfy the hypotheses of ping-pong.</p>
<p><strong>Example</strong>: Every hyperbolic group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> acts on its Gromov boundary <img src="https://s0.wp.com/latex.php?latex=%5Cpartial_%5Cinfty+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;partial_&#92;infty G" title="&#92;partial_&#92;infty G" class="latex" />. This boundary is the set of equivalence classes of quasigeodesic rays in (the Cayley graph of) <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />, 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.</p>
<p>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.</p>
<p><strong>Example</strong>: The <em>Tits alternative</em> says that any linear group <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> (i.e. any subgroup of <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BGL%7D%28n%2C%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{GL}(n,&#92;mathbb{R})" title="&#92;text{GL}(n,&#92;mathbb{R})" class="latex" /> for some <img src="https://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n" title="n" class="latex" />) either contains a nonabelian free subgroup, or is virtually solvable (and therefore amenable). This can be derived from ping-pong, where <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> 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 <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" />). </p>
<p><strong>Example</strong>: There is a Tits alternative for subgroups of other kinds of groups, for example mapping class groups, as shown by <a href="http://www.ams.org/mathscinet-getitem?mr=0745513">Ivanov</a> and <a href="http://www.ams.org/mathscinet-getitem?mr=0800253">McCarthy</a>. 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 &#8220;localized&#8221; 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.</p>
<p><strong>Example</strong>: A similar Tits alternative holds for <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7BOut%7D%28F_n%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{Out}(F_n)" title="&#92;text{Out}(F_n)" class="latex" />. This was shown by Bestvina-Feighn-Handel in <a href="http://arxiv.org/abs/math/9712217">these</a> <a href="http://arxiv.org/abs/math/9712218">three</a> <a href="http://arxiv.org/abs/math/9712219">papers</a> (the third paper shows that solvable subgroups are virtually abelian, thus emphasizing the parallels with mapping class groups).</p>
<p><strong>Example</strong>: If <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> is a finitely generated group of homeomorphisms of <img src="https://s0.wp.com/latex.php?latex=S%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S^1" title="S^1" class="latex" />, then there is a kind of Tits alternative, first proposed by Ghys, and proved by <a href="http://www.ams.org/mathscinet-getitem?mr=1797749">Margulis</a>: either <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> preserves a probability measure on <img src="https://s0.wp.com/latex.php?latex=S%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S^1" title="S^1" class="latex" /> (which might be singular), or it contains a nonabelian free subgroup. To see this, first note that either <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> 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 <img src="https://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="G" title="G" class="latex" /> on a &#8220;smaller&#8221; 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 <img src="https://s0.wp.com/latex.php?latex=I%2CJ&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="I,J" title="I,J" class="latex" /> in <img src="https://s0.wp.com/latex.php?latex=S%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S^1" title="S^1" class="latex" />, there is some <img src="https://s0.wp.com/latex.php?latex=%7B%7Dg+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="{}g &#92;in G" title="{}g &#92;in G" class="latex" /> with <img src="https://s0.wp.com/latex.php?latex=g%28I%29+%5Csubset+J&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g(I) &#92;subset J" title="g(I) &#92;subset J" class="latex" />; 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 <a href="http://arxiv.org/abs/math/9712268">Thurston</a> in the context of uniform foliations of <img src="https://s0.wp.com/latex.php?latex=3&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="3" title="3" class="latex" />-manifolds before Ghys proposed his question.</p>
<p><strong>Example</strong>: If <img src="https://s0.wp.com/latex.php?latex=%5Crho_t&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;rho_t" title="&#92;rho_t" class="latex" /> is an (algebraic) family of representations of a (countable) free group <img src="https://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="F" title="F" class="latex" /> into an algebraic group, then either some element <img src="https://s0.wp.com/latex.php?latex=g+%5Cin+F&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g &#92;in F" title="g &#92;in F" class="latex" /> is in the kernel of every <img src="https://s0.wp.com/latex.php?latex=%5Crho_t&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;rho_t" title="&#92;rho_t" class="latex" />, or the set of faithful representations is &#8220;generic&#8221;, 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).</p>
]]></html></oembed>