<?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[Combable functions]]></title><type><![CDATA[link]]></type><html><![CDATA[<p>The purpose of this post is to discuss my <a href="http://arxiv.org/abs/0805.1755">recent paper</a> with Koji Fujiwara, which will shortly appear in Ergodic Theory and Dynamical Systems, both for its own sake, and in order to motivate some open questions that I find very intriguing. The content of the paper is a mixture of ergodic theory, geometric group theory, and computer science, and was partly inspired by a <a href="http://www.ams.org/mathscinet-getitem?mr=1459300">paper</a> of Jean-Claude Picaud. To state the results of the paper, I must first introduce a few definitions and some background.</p>
<p>Let <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> be a finite directed graph (hereafter a <em>digraph</em>) with an initial vertex, and edges labeled by elements of a finite set <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" /> in such a way that each vertex has at most one outgoing edge with any given label. A finite directed path in <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> starting at the initial vertex determines a word in the alphabet <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" />, by reading the labels on the edges traversed (in order). The set <img src="https://s0.wp.com/latex.php?latex=L+%5Csubset+S%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L &#92;subset S^*" title="L &#92;subset S^*" class="latex" /> of words obtained in this way is an example of what is called a <em>regular language</em>, and is said to be <em>parameterized</em> by <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" />. Note that this is not the most general kind of regular language; in particular, any language <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> of this kind will necessarily be prefix-closed (i.e. if <img src="https://s0.wp.com/latex.php?latex=w+%5Cin+L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w &#92;in L" title="w &#92;in L" class="latex" /> then every prefix 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" /> is also in <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" />). Note also that different digraphs might parameterize the same (prefix-closed) regular language <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" />.</p>
<p>If <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" /> is a set of generators for 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" />, there is an obvious map <img src="https://s0.wp.com/latex.php?latex=L+%5Cto+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L &#92;to G" title="L &#92;to G" class="latex" /> called the <em>evaluation map </em>that takes a word <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 the element 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" /> represented by that word.</p>
<p><strong>Definition:</strong> Let <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" /> be a group, and <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" /> a finite generating set. A <em>combing</em> 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" /> is a (prefix-closed) regular language <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> for which the evaluation map <img src="https://s0.wp.com/latex.php?latex=L+%5Cto+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L &#92;to G" title="L &#92;to G" class="latex" /> is a bijection, and such that every <img src="https://s0.wp.com/latex.php?latex=w+%5Cin+L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w &#92;in L" title="w &#92;in L" class="latex" /> represents a geodesic in <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>The intuition behind this definition is that the set of words in <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> determines a directed spanning tree in the Cayley graph <img src="https://s0.wp.com/latex.php?latex=C_S%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C_S(G)" title="C_S(G)" class="latex" /> starting at <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7Bid%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{id}" title="&#92;text{id}" class="latex" />, and such that every directed path in the tree is a geodesic in <img src="https://s0.wp.com/latex.php?latex=C_S%28G%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C_S(G)" title="C_S(G)" class="latex" />. Note that there are other definitions of combing in the literature; for example, some authors do not require the evaluation map to be a bijection, but only a coarse bijection.</p>
<p>Fundamental to the theory of combings is the following Theorem, which paraphrases one of the main results of <a href="http://www.ams.org/mathscinet-getitem?mr=0758901">this paper</a>:</p>
<p><strong>Theorem:</strong> (Cannon) Let <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" /> be a hyperbolic group, and let <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" /> be a finite generating set. Choose a total order on the elements of <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" />. Then the language <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> of lexicographically first geodesics in <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 combing.</p>
<p>The language <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> described in this theorem is obviously geodesic and prefix-closed, and the evaluation map is bijective; the content of the theorem is that <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> is regular, and parameterized by some finite digraph <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" />. In the sequel, we restrict attention exclusively to hyperbolic groups <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>Given a (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" />, a generating set <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" />, a combing <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" />, one makes the following definition:</p>
<p><strong>Definition:</strong> A function <img src="https://s0.wp.com/latex.php?latex=%5Cphi%3AG+%5Cto+%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi:G &#92;to &#92;mathbb{Z}" title="&#92;phi:G &#92;to &#92;mathbb{Z}" class="latex" /> is <em>weakly combable</em> (with respect to <img src="https://s0.wp.com/latex.php?latex=S%2CL&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S,L" title="S,L" class="latex" />) if there is a digraph <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> parameterizing <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" /> and a function <img src="https://s0.wp.com/latex.php?latex=d%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="d&#92;phi" title="d&#92;phi" class="latex" /> from the vertices of <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> to <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" /> so that for any <img src="https://s0.wp.com/latex.php?latex=w+%5Cin+L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="w &#92;in L" title="w &#92;in L" class="latex" />, corresponding to a path <img src="https://s0.wp.com/latex.php?latex=%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma" title="&#92;gamma" class="latex" /> in <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" />, there is an equality <img src="https://s0.wp.com/latex.php?latex=%5Cphi%28w%29+%3D+%5Csum_i+d%5Cphi%28%5Cgamma%28i%29%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi(w) = &#92;sum_i d&#92;phi(&#92;gamma(i))" title="&#92;phi(w) = &#92;sum_i d&#92;phi(&#92;gamma(i))" class="latex" />.</p>
<p>In other words, a function <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> is weakly combable if it can be obtained by &#8220;integrating&#8221; a function <img src="https://s0.wp.com/latex.php?latex=d%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="d&#92;phi" title="d&#92;phi" class="latex" /> along the paths of a combing. One furthermore says that a function is <em>combable</em> if it changes by a bounded amount under right-multiplication by an element of <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 <em>bicombable</em> if it changes by a bounded amount under either left or right multiplication by an element of <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" />. The property of being (bi-)combable does not depend on the choice of a generating set <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" /> or a combing <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" />.</p>
<p><strong>Example:</strong> Word length (with respect to a given generating set <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" />) is bicombable.</p>
<p><strong>Example:</strong> Let <img src="https://s0.wp.com/latex.php?latex=%5Cphi%3AG+%5Cto+%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi:G &#92;to &#92;mathbb{Z}" title="&#92;phi:G &#92;to &#92;mathbb{Z}" class="latex" /> be a homomorphism. Then <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> is bicombable.</p>
<p><strong>Example:</strong> The Brooks counting quasimorphisms (on a free group) and the Epstein-Fujiwara counting quasimorphisms are bicombable.</p>
<p><strong>Example:</strong> The sum or difference of two (bi-)combable functions is (bi-)combable.</p>
<p>A particularly interesting example is the following:</p>
<p><strong>Example:</strong> Let <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" /> be a finite set which generates <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" /> as a semigroup. Let <img src="https://s0.wp.com/latex.php?latex=%5Cphi_S&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi_S" title="&#92;phi_S" class="latex" /> denote word length with respect to <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 <img src="https://s0.wp.com/latex.php?latex=%5Cphi_%7BS%5E%7B-1%7D%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi_{S^{-1}}" title="&#92;phi_{S^{-1}}" class="latex" /> denote word length with respect to <img src="https://s0.wp.com/latex.php?latex=S%5E%7B-1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S^{-1}" title="S^{-1}" class="latex" /> (which also generates <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" /> as a semigroup). Then the difference <img src="https://s0.wp.com/latex.php?latex=%5Cpsi_S%3A%3D+%5Cphi_S+-+%5Cphi_%7BS%5E%7B-1%7D%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi_S:= &#92;phi_S - &#92;phi_{S^{-1}}" title="&#92;psi_S:= &#92;phi_S - &#92;phi_{S^{-1}}" class="latex" /> is a bicombable quasimorphism.</p>
<p>The main theorem proved in the paper concerns the statistical distribution of values of a bicombable function.</p>
<p><strong>Theorem:</strong> Let <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" /> be a hyperbolic group, and let <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> be a bicombable function 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" />. Let <img src="https://s0.wp.com/latex.php?latex=%5Coverline%7B%5Cphi%7D_n&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;overline{&#92;phi}_n" title="&#92;overline{&#92;phi}_n" class="latex" /> be the value of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> on a random word in <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 length <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" /> (with respect to a certain measure <img src="https://s0.wp.com/latex.php?latex=%5Cwidehat%7B%5Cnu%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;widehat{&#92;nu}" title="&#92;widehat{&#92;nu}" class="latex" /> depending on a choice of generating set). Then there are algebraic numbers <img src="https://s0.wp.com/latex.php?latex=E&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="E" title="E" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;sigma" title="&#92;sigma" class="latex" /> so that as distributions, <img src="https://s0.wp.com/latex.php?latex=n%5E%7B-1%2F2%7D%28%5Coverline%7B%5Cphi%7D_n+-+nE%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n^{-1/2}(&#92;overline{&#92;phi}_n - nE)" title="n^{-1/2}(&#92;overline{&#92;phi}_n - nE)" class="latex" /> converges to a normal distribution with standard deviation <img src="https://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;sigma" title="&#92;sigma" class="latex" />.</p>
<p>One interesting corollary concerns the length of typical words in one generating set versus another. The first thing that every geometric group theorist learns is that if <img src="https://s0.wp.com/latex.php?latex=S_1%2C+S_2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S_1, S_2" title="S_1, S_2" class="latex" /> are two finite generating sets for 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" />, then there is a constant <img src="https://s0.wp.com/latex.php?latex=K&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="K" title="K" class="latex" /> so that every word of length <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" /> in one generating set has length at most <img src="https://s0.wp.com/latex.php?latex=nK&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="nK" title="nK" class="latex" /> and at least <img src="https://s0.wp.com/latex.php?latex=n%2FK&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n/K" title="n/K" class="latex" /> in the other generating set. If one considers an example like <img src="https://s0.wp.com/latex.php?latex=%5Cmathbb%7BZ%7D%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;mathbb{Z}^2" title="&#92;mathbb{Z}^2" class="latex" />, one sees that this is the best possible estimate, even statistically. However, if one restricts attention to a 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" />, then one can do much better for typical words:</p>
<p><strong>Corollary:</strong> Let <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" /> be hyperbolic, and let <img src="https://s0.wp.com/latex.php?latex=S_1%2CS_2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S_1,S_2" title="S_1,S_2" class="latex" /> be two finite generating sets. There is an algebraic number <img src="https://s0.wp.com/latex.php?latex=%5Clambda_%7B1%2C2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;lambda_{1,2}" title="&#92;lambda_{1,2}" class="latex" /> so that almost all words of length <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" /> with respect to the <img src="https://s0.wp.com/latex.php?latex=S_1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S_1" title="S_1" class="latex" /> generating set have length almost equal to <img src="https://s0.wp.com/latex.php?latex=n%5Clambda_%7B1%2C2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n&#92;lambda_{1,2}" title="n&#92;lambda_{1,2}" class="latex" /> with respect to the <img src="https://s0.wp.com/latex.php?latex=S_2&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="S_2" title="S_2" class="latex" /> generating set, with error of size <img src="https://s0.wp.com/latex.php?latex=O%28%5Csqrt%7Bn%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="O(&#92;sqrt{n})" title="O(&#92;sqrt{n})" class="latex" />.</p>
<p>Let me indicate very briefly how the proof of the theorem goes.</p>
<p><em>Sketch of Proof:</em> Let <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> be bicombable, and let <img src="https://s0.wp.com/latex.php?latex=d%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="d&#92;phi" title="d&#92;phi" class="latex" /> be a function from the vertices of <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> to <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" />, where <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> is a digraph parameterizing <img src="https://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="L" title="L" class="latex" />. There is a bijection between the set of elements in <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 word length <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" /> and the set of directed paths in <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> of length <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" /> that start at the initial vertex. So to understand the distribution of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" />, we need to understand the behaviour of a typical long path in <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" />.</p>
<p>Define a <em>component</em> of <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> to be a maximal subgraph with the property that there is a directed path (in the component) from any vertex to any other vertex. One can define a new digraph <img src="https://s0.wp.com/latex.php?latex=C%28%5CGamma%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C(&#92;Gamma)" title="C(&#92;Gamma)" class="latex" /> without loops, with one vertex for each component of <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" />, in an obvious way. Each component <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" /> determines an adjacency matrix <img src="https://s0.wp.com/latex.php?latex=M_C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="M_C" title="M_C" class="latex" />, with <img src="https://s0.wp.com/latex.php?latex=ij&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="ij" title="ij" class="latex" />-entry equal to <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" /> if there is a directed edge from vertex <img src="https://s0.wp.com/latex.php?latex=i&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="i" title="i" class="latex" /> to vertex <img src="https://s0.wp.com/latex.php?latex=j&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="j" title="j" class="latex" />, and equal to <img src="https://s0.wp.com/latex.php?latex=0&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="0" title="0" class="latex" /> otherwise. A component <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 <em>big</em> if the biggest real eigenvalue <img src="https://s0.wp.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;lambda" title="&#92;lambda" class="latex" /> of <img src="https://s0.wp.com/latex.php?latex=M_C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="M_C" title="M_C" class="latex" /> is at least as big as the biggest real eigenvalue of the matrices associated to every other component. A random long walk in <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> will spend most of its time entirely in big components, so these are the only components we need to consider to understand the statistical distribution of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" />.</p>
<p>A <a href="http://www.ams.org/mathscinet-getitem?mr=1214072">theorem</a> of Coornaert implies that there are no big components of <img src="https://s0.wp.com/latex.php?latex=C%28%5CGamma%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C(&#92;Gamma)" title="C(&#92;Gamma)" class="latex" /> <em>in series</em>; i.e. there are no directed paths in <img src="https://s0.wp.com/latex.php?latex=C%28%5CGamma%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C(&#92;Gamma)" title="C(&#92;Gamma)" class="latex" /> from one big component to another (one also says that the big components <em>do not communicate</em>). This means that a typical long walk in <img src="https://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;Gamma" title="&#92;Gamma" class="latex" /> is entirely contained in a single big component, except for a (relatively short) path at the start and the end of the walk. So the distribution of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> gets independent contributions, one from each big component.</p>
<p>The contribution from an individual big component is not hard to understand: the central limit theorem for stationary Markov chains says that for 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" /> corresponding to paths that spend almost all their time in a given big component <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" /> there is a central limit theorem  <img src="https://s0.wp.com/latex.php?latex=n%5E%7B-1%2F2%7D%28%5Coverline%7B%5Cphi%7D_n+-+nE_C%29+%5Cto+N%280%2C%5Csigma_C%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n^{-1/2}(&#92;overline{&#92;phi}_n - nE_C) &#92;to N(0,&#92;sigma_C)" title="n^{-1/2}(&#92;overline{&#92;phi}_n - nE_C) &#92;to N(0,&#92;sigma_C)" class="latex" /> where the mean <img src="https://s0.wp.com/latex.php?latex=E_C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="E_C" title="E_C" class="latex" /> and standard deviation <img src="https://s0.wp.com/latex.php?latex=%5Csigma_C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;sigma_C" title="&#92;sigma_C" class="latex" /> depend only on <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" />. The problem is to show that the means and standard deviations associated to different big components are the same. Everything up to this point only depends on weak combability of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" />; to finish the proof one must use bicombability.</p>
<p>It is not hard to show that if <img src="https://s0.wp.com/latex.php?latex=%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma" title="&#92;gamma" class="latex" /> is a typical infinite walk in a component <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" />, then the subpaths of <img src="https://s0.wp.com/latex.php?latex=%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma" title="&#92;gamma" class="latex" /> of length <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" /> are distributed like random walks of length <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" /> in <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" />. What this means is that the mean and standard deviation <img src="https://s0.wp.com/latex.php?latex=E_C%2C%5Csigma_C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="E_C,&#92;sigma_C" title="E_C,&#92;sigma_C" class="latex" /> associated to a big component <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" /> can be recovered from the distribution of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> on a single infinite &#8220;typical&#8221; path in <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" />. Such an infinite path corresponds to an infinite geodesic in <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" />, converging to a definite point in the Gromov boundary <img src="https://s0.wp.com/latex.php?latex=%5Cpartial+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;partial G" title="&#92;partial G" class="latex" />. Another theorem of Coornaert (from the same paper) says that the 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 its boundary <img src="https://s0.wp.com/latex.php?latex=%5Cpartial+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;partial G" title="&#92;partial G" class="latex" /> is ergodic with respect to a certain natural measure called a <em>Patterson-Sullivan measure</em> (see Coornaert&#8217;s paper for details). This means that there are typical infinite geodesics <img src="https://s0.wp.com/latex.php?latex=%5Cgamma%2C%5Cgamma%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma,&#92;gamma&#039;" title="&#92;gamma,&#92;gamma&#039;" class="latex" /> associated to components <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" /> and <img src="https://s0.wp.com/latex.php?latex=C%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="C&#039;" title="C&#039;" class="latex" /> for which some <img src="https://s0.wp.com/latex.php?latex=g+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g &#92;in G" title="g &#92;in G" class="latex" /> takes <img src="https://s0.wp.com/latex.php?latex=%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma" title="&#92;gamma" class="latex" /> to a geodesic <img src="https://s0.wp.com/latex.php?latex=g%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g&#92;gamma" title="g&#92;gamma" class="latex" /> ending at the same point in <img src="https://s0.wp.com/latex.php?latex=%5Cpartial+G&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;partial G" title="&#92;partial G" class="latex" /> as <img src="https://s0.wp.com/latex.php?latex=%5Cgamma%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma&#039;" title="&#92;gamma&#039;" class="latex" />. Bicombability implies that the values of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> on <img src="https://s0.wp.com/latex.php?latex=%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma" title="&#92;gamma" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=g%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g&#92;gamma" title="g&#92;gamma" class="latex" /> differ by a bounded amount. Moreover, since <img src="https://s0.wp.com/latex.php?latex=g%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g&#92;gamma" title="g&#92;gamma" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=%5Cgamma%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma&#039;" title="&#92;gamma&#039;" class="latex" /> are asymptotic to the same point at infinity, combability implies that the values of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> on <img src="https://s0.wp.com/latex.php?latex=g%5Cgamma&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g&#92;gamma" title="g&#92;gamma" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=%5Cgamma%27&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma&#039;" title="&#92;gamma&#039;" class="latex" /> also differ by a bounded amount. This is enough to deduce that <img src="https://s0.wp.com/latex.php?latex=E_C+%3D+E_%7BC%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="E_C = E_{C&#039;}" title="E_C = E_{C&#039;}" class="latex" /> and <img src="https://s0.wp.com/latex.php?latex=%5Csigma_C+%3D+%5Csigma_%7BC%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;sigma_C = &#92;sigma_{C&#039;}" title="&#92;sigma_C = &#92;sigma_{C&#039;}" class="latex" />, and one obtains a (global) central limit theorem for <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" 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" />. qed.</p>
<p>This obviously raises several questions, some of which seem very hard, including:</p>
<p><strong>Question 1:</strong> Let <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> be an arbitrary quasimorphism on a 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" /> (even the case <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 free is interesting). Does <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> satisfy a central limit theorem?</p>
<p><strong>Question 2:</strong> Let <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> be an arbitrary quasimorphism on a 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" />. Does <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> satisfy a central limit theorem with respect to a random walk 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. one considers the distribution of values of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> not on the set of 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" /> of word length <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" />, but on the set of elements obtained by a random walk 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" /> of length <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" />, and lets <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" /> go to infinity)</p>
<p>All bicombable quasimorphisms satisfy an important property which is essential to our proof of the central limit theorem: they are <em>local</em>, which is to say, they are defined as a sum of local contributions. In the continuous world, they are the analogue of the so-called de Rham quasimorphisms on <img src="https://s0.wp.com/latex.php?latex=%5Cpi_1%28M%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;pi_1(M)" title="&#92;pi_1(M)" class="latex" /> where <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" /> is a closed negatively curved Riemannian manifold; such quasimorphisms are defined by choosing a <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" />-form <img src="https://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;alpha" title="&#92;alpha" class="latex" />, and defining <img src="https://s0.wp.com/latex.php?latex=%5Cphi_%5Calpha%28g%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi_&#92;alpha(g)" title="&#92;phi_&#92;alpha(g)" class="latex" /> to be equal to the integral <img src="https://s0.wp.com/latex.php?latex=%5Cint_%7B%5Cgamma_g%7D+%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;int_{&#92;gamma_g} &#92;alpha" title="&#92;int_{&#92;gamma_g} &#92;alpha" class="latex" />, where <img src="https://s0.wp.com/latex.php?latex=%5Cgamma_g&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;gamma_g" title="&#92;gamma_g" class="latex" /> is the closed oriented based geodesic in <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" /> in the homotopy class 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" />. De Rham quasimorphisms, being local, also satisfy a central limit theorem.</p>
<p>This locality manifests itself in another way, in terms of <em>defects</em>. Let <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> be a quasimorphism on a 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" />. Recall that the defect <img src="https://s0.wp.com/latex.php?latex=D%28%5Cphi%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(&#92;phi)" title="D(&#92;phi)" class="latex" /> is the supremum of <img src="https://s0.wp.com/latex.php?latex=%7C%5Cphi%28gh%29+-+%5Cphi%28g%29+-%5Cphi%28h%29%7C&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="|&#92;phi(gh) - &#92;phi(g) -&#92;phi(h)|" title="|&#92;phi(gh) - &#92;phi(g) -&#92;phi(h)|" class="latex" /> over all pairs of 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" />. A quasimorphism is further said to be <em>homogeneous</em> if <img src="https://s0.wp.com/latex.php?latex=%5Cphi%28g%5En%29+%3D+n%5Cphi%28g%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi(g^n) = n&#92;phi(g)" title="&#92;phi(g^n) = n&#92;phi(g)" class="latex" /> for all integers <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" />. If <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> is an arbitrary quasimorphism, one may <em>homogenize</em> it by taking a limit <img src="https://s0.wp.com/latex.php?latex=%5Cpsi%28g%29+%3D+%5Clim_%7Bn+%5Cto+%5Cinfty%7D+%5Cphi%28g%5En%29%2Fn&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi(g) = &#92;lim_{n &#92;to &#92;infty} &#92;phi(g^n)/n" title="&#92;psi(g) = &#92;lim_{n &#92;to &#92;infty} &#92;phi(g^n)/n" class="latex" />; one says that <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> is the homogenization of <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> in this case. Homogenization typically does not preserve defects; however, there is an inequality <img src="https://s0.wp.com/latex.php?latex=D%28%5Cpsi%29+%5Cle+2D%28%5Cphi%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(&#92;psi) &#92;le 2D(&#92;phi)" title="D(&#92;psi) &#92;le 2D(&#92;phi)" class="latex" />. If <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> is local, one expects this inequality to be an equality. For, in a hyperbolic group, the contribution to the defect of a local quasimorphism all arises from the interaction of the suffix of (a geodesic word representing 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" /> with the prefix 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" /> (with notation as above). When one homogenizes, one picks up another contribution to the defect from the interaction of the prefix 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" /> with the suffix 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" />; since these two contributions are essentially independent, one expects that homogenizing a local quasimorphism should exactly double the defect. This is the case for bicombable and de Rham quasimorphisms, and can perhaps be used to <em>define</em> locality for a quasimorphism on an arbitrary group.</p>
<p>This discussion provokes the following key question:</p>
<p><strong>Question 3:</strong> Let <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" /> be a group, and let <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> be a homogeneous quasimorphism. Is there a quasimorphism <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> with homogenization <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" />, satisfying <img src="https://s0.wp.com/latex.php?latex=D%28%5Cpsi%29+%3D+2D%28%5Cphi%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(&#92;psi) = 2D(&#92;phi)" title="D(&#92;psi) = 2D(&#92;phi)" class="latex" />?</p>
<p><strong>Example:</strong> The answer to question 3 is &#8220;yes&#8221; if <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> is the rotation quasimorphism associated to 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 <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" /> by orientation-preserving homeomorphisms (this is nontrivial; see Proposition 4.70 from <a href="http://www.its.caltech.edu/~dannyc/scl/toc.html">my monograph</a>).</p>
<p><strong>Example:</strong> 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" /> be any homologically trivial group <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" />-boundary. Then there is some extremal homogeneous quasimorphism <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> for <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" /> (i.e. a quasimorphism achieving equality <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7Bscl%7D%28C%29+%3D+%5Cpsi%28C%29%2F2D%28%5Cpsi%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{scl}(C) = &#92;psi(C)/2D(&#92;psi)" title="&#92;text{scl}(C) = &#92;psi(C)/2D(&#92;psi)" class="latex" /> under generalized Bavard duality; see <a href="https://lamington.wordpress.com/2009/06/04/quasimorphisms-and-laws/">this post</a>) for which there is <img src="https://s0.wp.com/latex.php?latex=%5Cphi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;phi" title="&#92;phi" class="latex" /> with homogenization <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> satisfying <img src="https://s0.wp.com/latex.php?latex=D%28%5Cpsi%29+%3D+2D%28%5Cphi%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(&#92;psi) = 2D(&#92;phi)" title="D(&#92;psi) = 2D(&#92;phi)" class="latex" />. Consequently, if every point in the boundary of the unit ball in the <img src="https://s0.wp.com/latex.php?latex=%5Ctext%7Bscl%7D&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;text{scl}" title="&#92;text{scl}" class="latex" /> norm is contained in a unique supporting hyperplane, the answer to question 3 is &#8220;yes&#8221; for any quasimorphism 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" />.</p>
<p>Any quasimorphism 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" /> can be pulled back to a quasimorphism on a free group, but this does not seem to make anything easier. In particular, question 3 is completely open (as far as I know) when <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 free group. An interesting test case might be the homogenization of an infinite sum of Brooks functions <img src="https://s0.wp.com/latex.php?latex=%5Csum_w+h_w&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;sum_w h_w" title="&#92;sum_w h_w" class="latex" /> for some infinite non-nested family of words <img src="https://s0.wp.com/latex.php?latex=%5Clbrace+w+%5Crbrace&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;lbrace w &#92;rbrace" title="&#92;lbrace w &#92;rbrace" class="latex" />.  </p>
<p>If the answer to this question is <em>false</em>, and one can find a homogeneous quasimorphism <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> which is not the homogenization of any &#8220;local&#8221; quasimorphism, then perhaps <img src="https://s0.wp.com/latex.php?latex=%5Cpsi&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="&#92;psi" title="&#92;psi" class="latex" /> does not satisfy a central limit theorem. One can try to approach this problem from the other direction:</p>
<p><strong>Question 4:</strong> Given a function <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" /> defined on the ball of radius <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" /> in a 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" />, one defines the defect <img src="https://s0.wp.com/latex.php?latex=D%28f%29&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="D(f)" title="D(f)" class="latex" /> in the usual way, restricted to pairs of elements <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" /> for which <img src="https://s0.wp.com/latex.php?latex=g%2Ch%2Cgh&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="g,h,gh" title="g,h,gh" class="latex" /> are all of length at most <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" />. Under what conditions can <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" /> be extended to a function on the ball of radius <img src="https://s0.wp.com/latex.php?latex=n%2B1&#038;bg=ffffff&#038;fg=000&#038;s=0" alt="n+1" title="n+1" class="latex" /> without increasing the defect?</p>
<p>If one had a good procedure for building a quasimorphism &#8220;by hand&#8221; (so to speak), one could try to build a quasimorphism that failed to satisfy a central limit theorem, or perhaps find reasons why this was impossible.</p>
]]></html></oembed>