{"id":343,"date":"2016-10-15T12:53:30","date_gmt":"2016-10-15T12:53:30","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/jraimbau\/?p=343"},"modified":"2016-11-29T09:53:41","modified_gmt":"2016-11-29T09:53:41","slug":"rank-combinatorial-cost-and-homology-growth-of-higher-rank-lattices-mikls-abert","status":"publish","type":"post","link":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/2016\/10\/15\/rank-combinatorial-cost-and-homology-growth-of-higher-rank-lattices-mikls-abert\/","title":{"rendered":"Rank, combinatorial cost and homology growth of higher-rank lattices (Mikl&oacute;s Ab\u00e9rt)"},"content":{"rendered":"<p>[mathjax]<\/p>\n<h2>Rank gradient<\/h2>\n<p>\n    For any finitely generated group \\( H \\) let \\( d(H) \\) be its rank, the minimal number of elements needed to generate \\( H \\). If \\( H \\) is a finite-index subgroup in a finitely generated group \\( \\Gamma \\) then we have<br \/>\n    \\[<br \/>\n    d(H) \\le |\\Gamma \/ H| (d(\\Gamma) &#8211; 1)<br \/>\n    \\]<br \/>\n    and it is thus natural to define:<br \/>\n    \\[<br \/>\n    r(\\Gamma, H) = \\frac{d(H) &#8211; 1}{|\\Gamma \/ H|}.<br \/>\n    \\]<br \/>\n    If \\( \\Gamma = \\Gamma_0 \\supset \\Gamma_1 \\supset \\cdots \\) is a chain of finite index subgroup then the limit:<br \/>\n    \\[<br \/>\n    \\mathrm{RG}(\\Gamma, \\Gamma_n) = \\lim_{n\\to+\\infty} r(\\Gamma, \\Gamma_n)<br \/>\n    \\]<br \/>\n    exists, and is called the <em>rank gradient<\/em> of \\( (\\Gamma, (\\Gamma_n)) \\).<\/p>\n<blockquote><p>\n      If \\( (\\Gamma_n), (\\Delta_n) \\) are two residual chains in the same group \\( \\Gamma \\) (chains with \\( \\Gamma_n, \\Delta_n \\) normal in \\( \\Gamma \\) and \\( \\bigcup_n \\Gamma_n = \\{ 1 \\} = \\bigcup_n \\Delta_n \\)), then are \\( \\mathrm{RG}(\\Gamma, (\\Gamma_n) \\) and \\( \\mathrm{RG}(\\Gamma, (\\Delta_n)) \\) equal?\n    <\/p><\/blockquote>\n<p><!--more--><\/p>\n<p>    One of the motivations for this is the following problem in 3&#8211;dimensional topology. Let \\( M \\) be a closed hyperbolic 3&#8211;manifold with Heegard genus \\( g(M) \\). Then \\( d(\\pi_1(M)) \\le g(M) \\). The &#8220;rank vs. gradient&#8221; problem was to determine whether equality always holds; Tao Li proved that for any \\( C &gt; 0 \\) there exists an hyperbolic 3&#8211;manifold with \\( g(m) &#8211; d(\\pi_1(M)) \\ge C \\), answering this in the negative. On the other hand the following problem is still open:<\/p>\n<blockquote><p>\n      Is the quotient \\( d(\\pi_1(M)) \/ g(M) \\) bounded on the set of all closed hyperbolic 3&#8211;manifolds?\n    <\/p><\/blockquote>\n<h2>Combinatorial cost<\/h2>\n<p>\n    Let \\( \\Gamma \\) act via \\( \\phi \\) on a set \\( X \\) preserving a probability measure \\( \\mu \\). The associated measured groupoid \\( \\mathcal G \\) is defined as follows: it is the set \\(\\Gamma \\times X \\) with the composition law \\( (g, y) \\cdot (h, x) = (gh, x) \\) if \\( \\phi(h)x = y \\). Let \\( \\tilde \\mu \\) be the product measure on \\( \\Gamma \\times X \\) (where \\( \\Gamma \\) is endowed with the counting measure). Then the <em>cost<\/em> of the action is defined by:<br \/>\n    \\[<br \/>\n    \\mathrm{Cost}(\\phi) = \\inf(\\tilde \\mu(B): \\langle B \\rangle = \\mathcal G).<br \/>\n    \\]<br \/>\n    If \\( \\Gamma_n \\) is any chain of finite-index subgroups then there is a natural action on the space \\( \\underset{\\leftarrow}{\\lim}(\\Gamma\/\\Gamma_n) \\) with the probability measure induced from the uniform measures on the finite sets \\( \\Gamma \/ \\Gamma_n \\) (this can be seen as the boundary of the rooted tree induced by the containment relation among cosets of the \\( \\Gamma_n \\)). <\/p>\n<blockquote><p>\n      <b>Theorem (Ab\u00e9rt&#8211;Nikolov):<\/b> \\( \\mathrm{RG}(\\Gamma, (\\Gamma_n)) = \\mathrm{Cost}( \\underset{\\leftarrow}{\\lim}(\\Gamma\/\\Gamma_n)) &#8211; 1 \\).\n    <\/p><\/blockquote>\n<p>    This follows from the easily seen fact that the cost of the action on \\( \\Gamma\/\\Gamma_n \\) equals \\( r(\\Gamma, \\Gamma_n) + 1\\) and &#8220;continuity&#8221; of the cost, which is the main step in the proof.\n  <\/p>\n<p>\n    In case \\( (\\Gamma_n) \\) is a residual chain the action is essentially free. For those actions Gaboriau asked the following question:<\/p>\n<blockquote><p>\n      <b>Fixed price conjecture:<\/b> Is it true that the cost of an essentially free action depends only on the group acting?\n    <\/p><\/blockquote>\n<p>    Note that since it is possible to construct residual chains in a hyperbolic 3&#8211;manifold group which have rank sublinear in the index, a positive answer to this implies a negative answer to the question on rank vs. genus above.\n  <\/p>\n<h2>Distortion functions<\/h2>\n<p>\n    If \\( \\mathcal G \\) is a groupoid on a set \\( X \\) generated by a subset \\( B \\) then we can form the Cayley graph of \\( \\mathcal G, B \\). If we have two generating sets \\( B, B&#8217; \\) then the bilipschitz constant of the identity map \\( X \\to X \\) between the two Cayley graphs is denoted by \\( d_b(B, B&#8217;) \\in [1, +\\infty] \\).\n  <\/p>\n<p>\n    If \\( \\mathcal G \\) is the groupoid induced by the action of a group \\( \\Gamma \\) on a probability space \\( (X, \\mu) \\) then an obvious generating set for \\( \\mathcal G \\) is \\( S \\times X \\). Let \\( c \\) be the cost of the action and define:<br \/>\n    \\[<br \/>\n    f(\\varepsilon) = \\inf( d_b(X\\times S, B): \\langle B \\rangle = \\mathcal G, \\tilde \\mu(B) \\le c + \\varepsilon)<br \/>\n    \\]<br \/>\n    the <em>distortion function<\/em> of the action. Informally the decay of this as \\( \\varepsilon \\to 0 \\) measures how complicated a near-optimal generating set must be.\n  <\/p>\n<blockquote><p>\n    <b>Theorem (Ab\u00e9rt&#8211;Gelander&#8211;Nikolov):<\/b> Let \\( \\Gamma_0 = \\Gamma \\supset \\Gamma_1 \\supset \\cdots \\) be a chain of subgroups. Let \\( f \\) be the distortion function of the action of \\( \\Gamma \\) on \\( \\underset{\\leftarrow}{\\lim}(\\Gamma \/ \\Gamma_n) \\). If \\( f \\) decays subexponentially at \\( 0 \\) (meaning that \\( \\lim_{\\varepsilon \\to 0} \\log f(\\varepsilon)\/\\varepsilon = +\\infty \\)) then<br \/>\n    \\[<br \/>\n    \\lim_{n \\to +\\infty} \\frac{\\log|H_1(\\Gamma_n; {\\mathbb Z})_{\\mathrm{tors}}|} {|\\Gamma \/ \\Gamma_n|} = 0.<br \/>\n    \\]\n  <\/p><\/blockquote>\n<p>\n    A similar result can also be proved for sequences of subgroups which are not necessarily chains. For this the notion of <em>combinatorial cost<\/em> of a sequence of finite-index subgroups is needed. This is defined for a sequence \\( (G_n) \\) of graphs with uniformly bounded degree; then ait can be applied to a sequence of subgroups \\( \\Gamma_n \\subset \\Gamma \\) via their Schreier graphs. Define:<br \/>\n    \\[<br \/>\n    e((G_n)) = \\lim_{n\\to +\\infty} \\frac{|E(G_n)|}{|V(G_n)|}.<br \/>\n    \\]<br \/>\n    A <em>rewiring<\/em> of the sequence \\( (G_n) \\) is a sequence \\( (H_n) \\) such that \\( V(H_n) = V(G_n) \\) and the bilipschitz distance between \\( G_n \\) and \\( H_n \\) is uniformly bounded; this is denoted by \\( (H_n) \\sim (G_n) \\). The combinatorial cost is then defined by:<br \/>\n    \\[<br \/>\n    \\mathrm{cc}((G_n)) = \\inf_{(H_n) \\sim (G_n)} e((H_n)).<br \/>\n    \\]\n  <\/p>\n<p>\n    A fundamental example of rewiring is as follows. Let \\( G_n \\) be the \\( n \\times n \\) square grid and let \\( K \\ge 1 \\). Let \\( H_n \\) be obtained as follows:<\/p>\n<ul>\n<li>keep all vertical edges; <\/li>\n<li>in each even column of \\( G_n \\) delete every horizontal edge but those on the lines indexed by integers \\( = 0 \\pmod K \\); <\/li>\n<li>on odd columns delete every horizontal edge but those indexed by integers \\( = \\lfloor K\/2 \\rfloor \\pmod K \\) <\/li>\n<\/ul>\n<p>    as illustrated by the following figure:<br \/>\n    <img decoding=\"async\" src=\"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/files\/2016\/10\/aturoataia.png\"><\/p>\n<p>    Then \\( (H_n) \\) is a rewiring of \\( (G_n) \\) (the bi-Lipscitz constants are bounded by \\( K ) \\) and it follows that \\( \\mathrm{cc}((G_n)) = 1 \\).\n  <\/p>\n<h2>Right-angled groups<\/h2>\n<p>\n    A group \\( \\Gamma \\) is called <em>right-angled<\/em> if there exists a finite generating set \\( g_1, \\ldots, g_d \\) such that \\( g_i g_{i+1} = g_{i+1}g_i \\) and each \\( g_i \\) is of infinite order (to avoid the stupid case \\( g_{2i+1} = 1 \\)). There are many interesting examples:<\/p>\n<ul>\n<li>Many lattices in higher rank Lie groups are virtually right-angled; <\/li>\n<li>Right-angled Artin groups with connected graph are right-angles; <\/li>\n<li>On the other hand free groups are not right-angled; <\/li>\n<li>Most lattices in rank 1 Lie groups are not right-angled. <\/li>\n<\/ul>\n<blockquote><p>\n    <b>Theorem (Ab\u00e9rt&#8211;Gelander&#8211;Nikolov):<\/b> If \\( \\Gamma \\) is right-angled, then for any residual chain \\( \\mathrm{RG}(\\Gamma, (\\Gamma_n)) = 0 \\) and the growth of the torsion subgroup of \\( H_1(\\Gamma_n; {\\mathbb Z}) \\) is subexponential.\n  <\/p><\/blockquote>\n<p>\n    As a final remark note that there is no known example of a finitely presented, residually finite group \\( \\Gamma \\) with a residual chain \\( \\Gamma_n \\) satisfying<br \/>\n    \\[<br \/>\n    \\limsup_{n\\to+\\infty} \\frac{\\log|H_1(\\Gamma_n; {\\mathbb Z})_{\\mathrm{tors}}|}{|\\Gamma \/ \\Gamma_n|} &gt; 0<br \/>\n    \\]<br \/>\n    although a conjecture of Bergeron&#8211;Venkatesh asserts that this should be the case for lattices in \\( \\mathrm{PSL}_2({\\mathbb C}) \\).\n  <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[mathjax] Rank gradient For any finitely generated group \\( H \\) let \\( d(H) \\) be its rank, the minimal number of elements needed to generate \\( H \\). If \\( H \\) is a finite-index subgroup in a finitely generated group \\( \\Gamma \\) then we have \\[ d(H) \\le |\\Gamma \/ H| (d(\\Gamma) [&hellip;]<\/p>\n","protected":false},"author":150,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[9,8],"tags":[],"class_list":["post-343","post","type-post","status-publish","format-standard","hentry","category-hausdorff-institute","category-invariants-l2"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/posts\/343","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/users\/150"}],"replies":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/comments?post=343"}],"version-history":[{"count":6,"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/posts\/343\/revisions"}],"predecessor-version":[{"id":398,"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/posts\/343\/revisions\/398"}],"wp:attachment":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/media?parent=343"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/categories?post=343"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/jraimbau\/wp-json\/wp\/v2\/tags?post=343"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}