<?xml version="1.0"?>
<feed xmlns:planet="http://planet.intertwingly.net/" xmlns:indexing="urn:atom-extension:indexing" xmlns="http://www.w3.org/2005/Atom" indexing:index="no">
  <title>Planet Musings</title>
  <updated>2009-01-09T03:23:19-06:00</updated>
  <generator uri="http://github.com/rubys/mars/tree/master">Mars</generator>
  <author>
    <name>Jacques Distler</name>
    <email>distler@golem.ph.utexas.edu</email>
  </author>
  <id>http://golem.ph.utexas.edu/~distler/planet/atom.xml</id>
  <link href="http://golem.ph.utexas.edu/~distler/planet/atom.xml" rel="self" type="application/atom+xml"/>
  <link href="http://golem.ph.utexas.edu/~distler/planet/" rel="alternate" type="application/xhtml+xml"/>

  <entry xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0">
         
    <title>links for 2009-01-09</title>
         
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><ul class="delicious"><li>
                <div class="delicious-link"><a href="http://rivals.yahoo.com/ncaa/basketball/recap?gid=200901070058&amp;prov=ap">Lin leads Harvard to 82-70 upset over No. 17 BC - College Basketball - Rivals.com</a></div>
                <div class="delicious-extended">Score one for the smart kids. Don't talk to me about Maryland.</div>
                <div class="delicious-tags">(tags: <a href="http://delicious.com/orzelc/sports">sports</a> <a href="http://delicious.com/orzelc/basketball">basketball</a>)</div>
            </li><li>
                <div class="delicious-link"><a href="http://michaelnielsen.org/blog/?p=531">Michael Nielsen » Three myths about scientific peer review</a></div>
                <div class="delicious-extended">"The myth that scientists adopted peer review broadly and early in the history of science is surprisingly widely believed, despite being false. It's true that peer review has been used for a long time - a process recognizably similar to the modern system was in use as early as 1731, in the Royal Society of Edinburgh's Medical Essays and Observations. But in most scientific journals, peer review wasn't routine until the middle of the twentieth century"</div>
                <div class="delicious-tags">(tags: <a href="http://delicious.com/orzelc/science">science</a> <a href="http://delicious.com/orzelc/blogs">blogs</a> <a href="http://delicious.com/orzelc/academia">academia</a> <a href="http://delicious.com/orzelc/publishing">publishing</a>)</div>
            </li><li>
                <div class="delicious-link"><a href="http://www.nytimes.com/2009/01/07/dining/07mini.html?_r=2&amp;ref=dining&amp;pagewanted=all">The Minimalist - The Latest Must-Haves for the Pantry - NYTimes.com</a></div>
                <div class="delicious-extended">"[I]f your goal is to cook and cook quickly, to get a satisfying and enjoyable variety of real food on the table as often as possible, a well-stocked pantry and fridge can sustain you. Replenished weekly or even less frequently, with an occasional stop for fresh vegetables, meat, fish and dairy, they are the core supply houses for the home cook. "</div>
                <div class="delicious-tags">(tags: <a href="http://delicious.com/orzelc/food">food</a>)</div>
            </li><li>
                <div class="delicious-link"><a href="http://blog.ruhlman.com/ruhlmancom/2009/01/behind-the-scen.html">ruhlman.com: Behind the Scenes of Iron Chef</a></div>
                <div class="delicious-extended">"Jena Wolfe of The Today Show gives a behind the scenes glimpse of Iron Chef America.  She did her story during one episode I [Michael Ruhlman]  happened to be judging, along with my fellow haircut (who in fact makes a very good literary point in this 3-minute story)."</div>
                <div class="delicious-tags">(tags: <a href="http://delicious.com/orzelc/food">food</a> <a href="http://delicious.com/orzelc/television">television</a> <a href="http://delicious.com/orzelc/video">video</a> <a href="http://delicious.com/orzelc/journalism">journalism</a>)</div>
            </li></ul> <a href="http://scienceblogs.com/principles/2009/01/links_for_20090109.php#commentsArea">Read the comments on this post...</a><img src="http://feeds.feedburner.com/~r/scienceblogs/uncertainprinciples/~4/506994321" height="1" width="1"/></div>
    </summary>
         
    <link href="http://feeds.feedburner.com/~r/scienceblogs/uncertainprinciples/~3/506994321/links_for_20090109.php" rel="alternate"/>
         
    <id>http://scienceblogs.com/principles/2009/01/links_for_20090109.php</id>
         
    <category term=""/>
         
    <published>2009-01-09T04:00:31-05:00</published>
      
    <updated>2009-01-09T04:00:31-05:00</updated>
    <source>
      <title>Uncertain Principles</title>
      <link href="http://scienceblogs.com/principles/" rel="alternate"/>
      <subtitle>Physics, Politics, Pop Culture</subtitle>
      <rights>Copyright 2009</rights>
      <updated>2009-01-09T04:00:31-05:00</updated>
      <generator>http://www.sixapart.com/movabletype/?v=3.35</generator>
      <link href="http://feeds.feedburner.com/scienceblogs/uncertainprinciples" rel="self" type="application/rss+xml"/>
      <id>http://scienceblogs.com/principles/</id>
    </source>
  </entry>

  <entry xmlns:thr="http://purl.org/syndication/thread/1.0" xml:lang="en" xml:base="http://sbseminar.wordpress.com/wp-atom.php">
		
    <author>
			
      <name>Scott Carnahan</name>
						
      <uri>http://math.mit.edu/~carnahan/</uri>
					
    </author>
		
    <title type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">Generalized moonshine I: Genus zero functions</div>
    </title>
		
    <link href="http://sbseminar.wordpress.com/2009/01/08/generalized-moonshine-i-genus-zero-functions/" rel="alternate" type="text/html"/>
		
    <id>http://sbseminar.wordpress.com/?p=1255</id>
		
    <updated>2009-01-09T07:14:39+00:00</updated>
		
    <published>2009-01-09T03:57:59+00:00</published>
		
    <category term="Number theory" scheme="http://sbseminar.wordpress.com/"/>
    <category term="Paper Advertisement" scheme="http://sbseminar.wordpress.com/"/>
    <category term="group theory" scheme="http://sbseminar.wordpress.com/"/>
    <category term="mathematical physics" scheme="http://sbseminar.wordpress.com/"/>
    <category term="representation theory" scheme="http://sbseminar.wordpress.com/"/>		
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">This is a plug for my first arXiv preprint, 0812.3440.  It didn’t really exist as an independent entity until about a month ago, when I got a little frustrated writing a larger paper and decided to package some results separately.  It is the first in a series of n (where n is about [...]</div>
    </summary>
		
    <content type="xhtml" xml:base="http://sbseminar.wordpress.com/2009/01/08/generalized-moonshine-i-genus-zero-functions/"><div xmlns="http://www.w3.org/1999/xhtml"><div class="snap_preview"><br/><p>This is a plug for my first arXiv preprint, <a href="http://arxiv.org/abs/0812.3440">0812.3440</a>.  It didn’t really exist as an independent entity until about a month ago, when I got a little frustrated writing a larger paper and decided to package some results separately.  It is the first in a series of n (where n is about five right now), attacking the generalized moonshine conjecture.  Perhaps the most significant result is that nontrivial replicable functions of finite order with algebraic integer coefficients are genus zero modular functions.  This answers a question that has been floating around the moonshine community for about 30 years.</p>
<p>Moonshine originated in the 1970s, when some mathematicians noticed apparent numerical coincidences between the theory of modular functions and the theory of finite simple groups.  Most notable was McKay’s observation that 196884=196883+1, where the number on the left is the first nontrivial Fourier coefficient of the modular function j, which classifies complex elliptic curves, and the numbers on the right are the dimensions of the smallest irreducible representations of the largest sporadic finite simple group, called the monster.  Modular functions and finite group theory were two areas of mathematics that were not previously thought to be deeply related, so this came as a bit of a surprise.  Conway and Norton encoded the above equation together with other calculations by Thompson and themselves in the Monstrous Moonshine Conjecture, which was proved by Borcherds around 1992.</p>
<p>I was curious about the use of the word “moonshine” here, so I looked it up in the Oxford English Dictionary.  There are essentially four definitions:</p>
<ol>
<li> Light from the moon, presumably reflected from the sun (1425)</li>
<li> Appearance without substance, foolish talk (1468 - originally “moonshine in the water”)</li>
<li> A base of rosewater and sugar, or a sweet pudding (1558 cookbook!)</li>
<li> Smuggled or illegally distilled alcoholic liquor (1782)</li>
</ol>
<p>The fourth and most recent definition seems to be the most commonly used among people I know.  The second definition is what gets applied to the monster, and as far as I can tell, its use is confined to English people over 60.  It seems to be most popularly known among scientists through a quote by Rutherford concerning the viability of atomic power.</p>
<p>I’ll give a brief explanation of monstrous moonshine, generalized moonshine, and my paper below the fold.  There is a question at the bottom, so if you get tired, you should skip to that.</p>
<p><span id="more-1255"/></p>
<p>The story begins with the classification of <a href="http://en.wikipedia.org/wiki/List_of_finite_simple_groups">finite simple groups</a>.  The use of the word “simple” here is a technical term that doesn’t mean that they are easy to understand.  Rather, they are in some sense atomic, i.e., their internal structure is tightly bound together, and can’t be seen by taking quotients.  The statement of the theorem is that any nontrivial finite simple group is isomorphic to (at least) one of:</p>
<ul>
<li> A finite cyclic group of prime order.</li>
<li> An alternating group <img class="latex" title="A_n" src="http://l.wordpress.com/latex.php?latex=A_n&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="A_n"/> for n at least 5.</li>
<li> A group of Lie type - there are 16 infinite families of these, coming from linear algebra over finite fields.</li>
<li> A sporadic group - there are 26 of these, and most are constructed from symmetries of exceptional combinatorial structures.</li>
</ul>
<p>The classification theorem was announced around 1981, but the consensus seems to be that the proof was finished in 2004 when Aschbacher and Smith published their massive two-volume book on quasi-thin groups.</p>
<p>One of the big mysteries of this classification is how the sporadic groups fit in.  I have heard of some proposals floating around concerning algebraic structures that are in some sense simple almost-groups, and the hope is that one might simplify the proof of the classification by cataloguing these structures in a functorial way and picking out the ones that are actually simple groups.  Unfortunately, I haven’t heard of significant progress in this direction.  Jared Weinstein once asked me if some of them are exceptional algebraic groups over F_1, but I don’t think the question is well-defined yet.</p>
<p>Moonshine concerns the largest of these sporadic groups, called the <a href="http://en.wikipedia.org/wiki/Monster_group">monster</a>.  Fischer and Griess independently conjectured that it existed in 1973, and Griess gave a rather complicated construction in 1980.  Before the monster was constructed, several facts about this group were already established: its order was known, several other sporadic groups were known to be contained as subquotients, and in 1978, Fischer, Livingstone, and Thorne computed the 194 by 194 <a href="http://en.wikipedia.org/wiki/Character_table">character table</a>.  The first few irreducible representations have dimension 1, 196883, 21296876, and 842609326.</p>
<p>On the other side of moonshine lies the theory of modular functions.  I gave an introduction in <a href="http://sbseminar.wordpress.com/2008/07/15/request-modular-forms/">this post</a>.  Essentially, these are holomorphic functions on the complex upper half-plane that are invariant under large discrete subgroups of <img class="latex" title="SL_2(\mathbb{R})" src="http://l.wordpress.com/latex.php?latex=SL_2(%5Cmathbb%7BR%7D)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="SL_2(\mathbb{R})"/>, and they often give nice invariants of diagrams of elliptic curves.  For example, the quotient of the upper half plane by the group <img class="latex" title="\Gamma_0(2) = \{ \binom{ab}{cd} | ad-bc = 1, c \in 2\mathbb{Z} \}" src="http://l.wordpress.com/latex.php?latex=%5CGamma_0(2)+=+%5C%7B+%5Cbinom%7Bab%7D%7Bcd%7D+%7C+ad-bc+=+1,+c+%5Cin+2%5Cmathbb%7BZ%7D+%5C%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\Gamma_0(2) = \{ \binom{ab}{cd} | ad-bc = 1, c \in 2\mathbb{Z} \}"/> classifies ordered pairs <img class="latex" title="(E_1, E_2)" src="http://l.wordpress.com/latex.php?latex=(E_1,+E_2)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(E_1, E_2)"/> of elliptic curves, equipped with a <img class="latex" title="\mathbb{Z}/2\mathbb{Z}" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BZ%7D/2%5Cmathbb%7BZ%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{Z}/2\mathbb{Z}"/>-isogeny (aka double cover homomorphism) between them.  The function <img class="latex" title="\Delta(\tau)/\Delta(2\tau)" src="http://l.wordpress.com/latex.php?latex=%5CDelta(%5Ctau)/%5CDelta(2%5Ctau)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\Delta(\tau)/\Delta(2\tau)"/> is invariant under this group of transformations, and therefore gives an invariant for these pairs.  The normalizer <img class="latex" title="\Gamma_0^+(2)" src="http://l.wordpress.com/latex.php?latex=%5CGamma_0%5E+(2)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\Gamma_0^+(2)"/> in <img class="latex" title="SL_2(\mathbb{R})" src="http://l.wordpress.com/latex.php?latex=SL_2(%5Cmathbb%7BR%7D)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="SL_2(\mathbb{R})"/>, is given by a semidirect product with the Fricke involution <img class="latex" title="\tau \mapsto -1/2\tau" src="http://l.wordpress.com/latex.php?latex=%5Ctau+%5Cmapsto+-1/2%5Ctau&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\tau \mapsto -1/2\tau"/>, and the resulting quotient space classifies unordered pairs of curves related by dual <img class="latex" title="\mathbb{Z}/2\mathbb{Z}" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BZ%7D/2%5Cmathbb%7BZ%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{Z}/2\mathbb{Z}"/>-isogenies.  (Incidentally, this moduli problem comes up in Kapustin-Witten for B,C,F for some reason I cannot understand.)</p>
<p>The most important modular function is Dedekind’s j-function, which classifies elliptic curves.  It is invariant under <img class="latex" title="SL_2(\mathbb{Z})" src="http://l.wordpress.com/latex.php?latex=SL_2(%5Cmathbb%7BZ%7D)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="SL_2(\mathbb{Z})"/>, and in particular, translation by integers, so it has a Fourier expansion.  The easiest way to compute the expansion is to use modular forms of higher weight: <img class="latex" title="j(\tau) = E_4(\tau)^3/\Delta(\tau)" src="http://l.wordpress.com/latex.php?latex=j(%5Ctau)+=+E_4(%5Ctau)%5E3/%5CDelta(%5Ctau)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="j(\tau) = E_4(\tau)^3/\Delta(\tau)"/>.  Writing the Fourier series in terms of <img class="latex" title="q = e^{2 \pi i \tau}" src="http://l.wordpress.com/latex.php?latex=q+=+e%5E%7B2+%5Cpi+i+%5Ctau%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="q = e^{2 \pi i \tau}"/>, we see that the numerator <img class="latex" title="1 + 720q + 146512q^2 + \dots" src="http://l.wordpress.com/latex.php?latex=1+++720q+++146512q%5E2+++%5Cdots&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="1 + 720q + 146512q^2 + \dots"/> has all nonnegative coefficients, since it is the <a href="http://en.wikipedia.org/wiki/Generating_function">generating function</a> for lattice vectors in the product of three copies of the <a href="http://en.wikipedia.org/wiki/E8_lattice#Theta_function">E_8 lattice</a>.  The reciprocal <img class="latex" title="q^{-1} + 24 + 324q + 3200q^2 + \dots" src="http://l.wordpress.com/latex.php?latex=q%5E%7B-1%7D+++24+++324q+++3200q%5E2+++%5Cdots&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="q^{-1} + 24 + 324q + 3200q^2 + \dots"/> of the denominator also has nonnegative coefficients, since it is a shifted generating function for <a href="http://en.wikipedia.org/wiki/Partition_(number_theory)">partitions</a> into 24 buckets.  <img class="latex" title="j(\tau) = q^{-1} + 744 + 196884q + 21493760q^2 + 864299970q^3 + \dots" src="http://l.wordpress.com/latex.php?latex=j(%5Ctau)+=+q%5E%7B-1%7D+++744+++196884q+++21493760q%5E2+++864299970q%5E3+++%5Cdots&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="j(\tau) = q^{-1} + 744 + 196884q + 21493760q^2 + 864299970q^3 + \dots"/> therefore has all nonnegative coefficients, and one might ask if these coefficients count something interesting (other than some combination of buckets and lattices).</p>
<p>McKay’s observation was that these coefficients were relatively straightforward combinations of the dimensions of the irreducible representations of the monster.  196884 = 196883+1, 21493760 = 21296876 + 196883 + 1, and 864299970 = 842609326 + 21296876 + 2*196883 + 2.  This suggests that there is a nice infinite dimensional graded representation of the monster, whose graded dimension is given by the Fourier expansion of j.  The constant term 744 can be safely removed without destroying the invariance of the function. </p>
<p>McKay, Thompson, Conway, and Norton did some additional calculations, looking at the graded traces of nontrivial elements in these representations.  An element in conjugacy class 2A yields a series <img class="latex" title="q^{-1} + 4372q + 96256q^2 + \dots" src="http://l.wordpress.com/latex.php?latex=q%5E%7B-1%7D+++4372q+++96256q%5E2+++%5Cdots&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="q^{-1} + 4372q + 96256q^2 + \dots"/> that coincides with the unique <img class="latex" title="\Gamma_0^+(2)" src="http://l.wordpress.com/latex.php?latex=%5CGamma_0%5E+(2)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\Gamma_0^+(2)"/>-invariant function with a simple pole and no constant term.  Similarly, an element in conjugacy class 2B yields <img class="latex" title="q^{-1} + 276q - 2048q^2 + \dots = \Delta(\tau)/\Delta(2\tau) + 24" src="http://l.wordpress.com/latex.php?latex=q%5E%7B-1%7D+++276q+-+2048q%5E2+++%5Cdots+=+%5CDelta(%5Ctau)/%5CDelta(2%5Ctau)+++24&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="q^{-1} + 276q - 2048q^2 + \dots = \Delta(\tau)/\Delta(2\tau) + 24"/>, which is invariant under <img class="latex" title="\Gamma_0(2)" src="http://l.wordpress.com/latex.php?latex=%5CGamma_0(2)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\Gamma_0(2)"/>.  After looking at all of the elements, Conway and Norton concluded that the series seemed to have some special properties in common:</p>
<ul>
<li>For any element g, the corresponding series is the Fourier expansion of some modular function invariant under a group of <a href="http://en.wikipedia.org/wiki/M%C3%B6bius_transformation">Möbius transformations</a> that contains (and normalizes) <img class="latex" title="\Gamma_0(N)" src="http://l.wordpress.com/latex.php?latex=%5CGamma_0(N)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\Gamma_0(N)"/>, for N a multiple of |g| such that N divides 12|g|.</li>
<li>The modular function is genus zero, i.e., the quotient of the upper half plane by the invariance group is analytically isomorphic to a complex line, possibly missing some points, and the function realizes one such isomorphism.</li>
<li>The series satisfies replication formulas.  This yields a complicated set of recurrence relations between the coefficients.  The precise definition is a bit complicated, but it is given in section 4 of my paper.  Norton showed that replicable functions are uniquely determined by their first 25 coefficients.</li>
</ul>
<p>The monstrous moonshine conjecture asserts that there is a representation of the monster whose graded traces were the functions that they had enumerated, and when Conway and Norton formulated this conjecture, they suggested that replicability could be a key to solving it.  This turned out to be true in the following sense: Using the graded representation of the monster (called the moonshine module) constructed by I. Frenkel, Lepowsky, and Meurman in 1988, Borcherds showed that the traces satisfied a strong form of replication called complete replicability, for which the functions are determined by the first seven coefficients, and he matched these coefficients with those found by Conway and Norton.</p>
<p>This final computational step in Borcherds’s proof was criticized by a few mathematicians as a conceptual gap, and about ten years ago, results of Kozlov, Cummins, and Gannon showed in a noncomputational way that completely replicable functions are either genus zero or have a highly degenerate form.  One is still left with the original question of how non-complete replication fits in to this picture, and it turns out that this is also relevant to moonshine, because there is a generalization of the moonshine conjecture that doesn’t yield completely replicable functions.</p>
<p>Recall from above that the McKay-Thompson series for the conjugacy class 2A is <img class="latex" title="q^{-1} + 4372q + 96256q^2 + 1240002q^3 + \dots" src="http://l.wordpress.com/latex.php?latex=q%5E%7B-1%7D+++4372q+++96256q%5E2+++1240002q%5E3+++%5Cdots&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="q^{-1} + 4372q + 96256q^2 + 1240002q^3 + \dots"/>.  The centralizer of an element in conjugacy class 2A is isomorphic to 2.B, the nontrivial <a href="http://en.wikipedia.org/wiki/Central_extension_(mathematics)#Central_extension">central extension</a> of the baby monster sporadic group.  If we examine the character table for 2.B, we find that the smallest irreducible representations have dimension 1, 4371, 96255, 96256, 1139374.  Much like before, we find that 4372 = 4371+1, 96256=96256 or 96255+1, and 1240002 = 1139374 + 96255 + 4371 + 2.  One might suspect that there is a nice graded representation of 2.B whose dimension is given by the McKay-Thompson series.  If we examine traces of elements in these combinations of representations, we again find that they agree with the lowest order terms in the Fourier expansions of genus zero modular functions.</p>
<p>This sort of moonshine for subgroups of the monster was initiated in Conway and Norton’s 1979 moonshine paper, developed computationally in Queen’s 1980 thesis, and finally codified into a reasonably coherent form by Norton in 1987.  The generalized moonshine conjecture asserts the existence of a function Z that takes a pair of commuting elements of the monster and returns a holomorphic function on the upper half plane, satisfying the following properties:</p>
<ul>
<li>Z is invariant under simultaneous conjugation on the inputs.</li>
<li>Each output function is either a genus zero modular function or constant.</li>
<li>If we fix g and vary h, the Fourier expansions of the functions <img class="latex" title="Z(g,h,\tau)" src="http://l.wordpress.com/latex.php?latex=Z(g,h,%5Ctau)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="Z(g,h,\tau)"/> are characters of a representation of some central extension of the centralizer of g in the monster.</li>
<li>For any <img class="latex" title="\binom{ab}{cd} \in SL_2(\mathbb{Z}), Z(g^a h^c,g^b h^d,\tau) \sim Z(g,h,\frac{a\tau+b}{c\tau+d})" src="http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bab%7D%7Bcd%7D+%5Cin+SL_2(%5Cmathbb%7BZ%7D),+Z(g%5Ea+h%5Ec,g%5Eb+h%5Ed,%5Ctau)+%5Csim+Z(g,h,%5Cfrac%7Ba%5Ctau+b%7D%7Bc%5Ctau+d%7D)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\binom{ab}{cd} \in SL_2(\mathbb{Z}), Z(g^a h^c,g^b h^d,\tau) \sim Z(g,h,\frac{a\tau+b}{c\tau+d})"/>, i.e., they are constant multiples (the ambiguity was later revised to 24th roots of unity).</li>
<li><img class="latex" title="Z(g,h,\tau) = j(\tau)-744" src="http://l.wordpress.com/latex.php?latex=Z(g,h,%5Ctau)+=+j(%5Ctau)-744&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="Z(g,h,\tau) = j(\tau)-744"/> if and only if g=h=1.</li>
</ul>
<p>The last property prevents us from cheating and using trivial representations.  Note that the case g=1 is just the original moonshine conjecture.</p>
<p>Much like the original moonshine conjecture, one of the hard parts here is coming up with a natural graded representation of a large finite group, and it turns out that here, as before, there are techniques motivated by physics that can help.  Moonshine and generalized moonshine have a connection to conformal field theory through vertex operator algebras (but I will have difficulty explaining it precisely, since I don’t know what conformal field theory is).  The moonshine module was originally constructed using the theory of vertex operators (which have their origin in physics in a way that I still don’t understand), and later this construction was refined to give a vertex operator algebra structure.  Vertex operator algebras are said to encode much of a two dimensional conformal field theory, in the sense that the multiplication tells us how certain insertions behave as they approach each other.  If we think of a quantum field as an operator-valued distribution on a manifold, it is not reasonable to define a multiplication everywhere, since distributions like the delta function don’t multiply well, but vertex operator algebras can be viewed as the next best thing.</p>
<p>Here is a vaguely geometric picture: suppose I have a really small disc D, and a vector bundle on it.  D is so small that it is made of two points: the special point, which is closed and makes up the center of the disc, and the generic point, which is dense and open.  In the <a href="http://en.wikipedia.org/wiki/Spectrum_of_a_ring">language of algebraic geometry</a>, D is Spec C[[z]], the closed point is Spec C, and the generic point is Spec C((z)).  The vector bundle has special fiber V for some vector space, which will be our vertex algebra, and generic fiber V((z)), i.e., <a href="http://en.wikipedia.org/wiki/Formal_power_series">formal Laurent series</a> with coefficients in V.  Ordinary algebras have multiplication given by a map <img class="latex" title="V \otimes V \to V" src="http://l.wordpress.com/latex.php?latex=V+%5Cotimes+V+%5Cto+V&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="V \otimes V \to V"/>, but vertex operator algebras have multiplication given by <img class="latex" title="V \otimes V \to V((z))" src="http://l.wordpress.com/latex.php?latex=V+%5Cotimes+V+%5Cto+V((z))&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="V \otimes V \to V((z))"/>, so multiplication takes two sections of the special fiber and produces a section of the generic fiber in a bilinear way.  We also demand that this multiplication is almost commutative and associative, in the sense that multiplying three sections of the special fiber in three different ways (namely (AB)C, B(AC), and A(BC)) yields the same section of the generic fiber of the small polydisc D x D (the condition is actually a bit stronger than that).  There are other axioms that are harder to motivate, coming from an action of the Virasoro algebra (which produces formal coordinate changes on the generic point).</p>
<p>Summing up, the moonshine module has a vertex operator algebra structure, and the monster is the automorphism group of this structure.  Using this fact, together with some infinite-dimensional algebraic manipulations motivated by physics, Borcherds proved the moonshine conjecture.  One might hope that generalized moonshine also can be attacked this way, but the representations of centralizers need a physical interpretation.  This interpretation was produced by Dixon, Ginsparg, and Harvey in 1988, not long after the generalized conjecture was published.  The representations are called twisted Hilbert spaces of an orbifold conformal field theory, and the paper has some nice drawings of elliptic curves as identification spaces of parallelograms, with edges labeled by commuting elements of the monster.  You might ask, what do these pictures have to do with the conjecture?</p>
<p>The answer is that they arise from monodromy along a homology basis of the elliptic curve.  While the partition function of an ordinary 2D conformal field theory will assign a value to any surface in a way that is invariant under conformal symmetries, the partition function of G-orbifold conformal field theory will assign a value to any G-cover of a surface, also in a conformally invariant way.  The case of interest to us is an elliptic curve, for which a G-cover is a complex manifold (not necessarily connected) equipped with a faithful G-action and a map to the curve, such that the preimage of any point is a full G-orbit.  This condition implies the cover is a disjoint union of elliptic curves.  We can classify these G-covers by rigidifying the problem.  We choose an oriented homology basis of the underlying torus, or equivalently, we view the elliptic curve as a quotient of the complex line by a lattice, and choose an oriented basis of the lattice (this is a constraint on the angle between the basis elements).  The G-cover is then uniquely defined by what happens to a fixed preimage of zero as we travel along paths that represent those elements of homology (equivalently, paths to the lattice generators).  This gives us a pair of elements of G, and they must commute, since we can travel along either side of a parallelogram spanned by the lattice generators, and get the same outcome.  This pair of commuting elements is only defined up to conjugation in G, since we can change the choice of preimage of zero.  So far, we have classified G-covers of an elliptic curve equipped with an oriented homology basis.  Elliptic curves equipped with an oriented homology basis are parametrized by points in the complex upper half plane, so if we have a partition function for G-covers of elliptic curves, it is a function that takes monodromy along an oriented bases (given by a conjugacy class of commuting elements of G), and produces a function on the upper half-plane, in a way that is invariant under change of basis.  Aside from the constant multiplier (called a phase anomaly) this is precisely the invariance demanded by the generalized moonshine conjecture.</p>
<p>We still need to understand what twisted Hilbert spaces are in the language of vertex operator algebras.  They are irreducible twisted modules.  For ordinary algebras, a module structure is given by a map <img class="latex" title="V \otimes M \to M" src="http://l.wordpress.com/latex.php?latex=V+%5Cotimes+M+%5Cto+M&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="V \otimes M \to M"/>, and for vertex operator algebras, it is a map <img class="latex" title="V \otimes M \to M((z))" src="http://l.wordpress.com/latex.php?latex=V+%5Cotimes+M+%5Cto+M((z))&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="V \otimes M \to M((z))"/> (and they both need to satisfy some kind of compatibility with multiplication).  Twisted module structures can occur here because the generic point (i.e., the punctured disc) is not simply connected.  In particular, the connected finite (étale) covers of Spec C((z)) have the form Spec C((t)), where t^N = z.  The twisted module structure itself is given by a map <img class="latex" title="V \otimes M \to M((z^{1/N}))" src="http://l.wordpress.com/latex.php?latex=V+%5Cotimes+M+%5Cto+M((z%5E%7B1/N%7D))&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="V \otimes M \to M((z^{1/N}))"/>, and it has to satisfy a compatibility with multiplication in V together with an additional monodromy condition.  The form of this monodromy condition is a source of some debate, since g-twisted modules for some authors are the same as <img class="latex" title="g^{-1}" src="http://l.wordpress.com/latex.php?latex=g%5E%7B-1%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="g^{-1}"/>-twisted modules for others.  If we take the Fourier expansion of <img class="latex" title="Z(g,h,\tau)" src="http://l.wordpress.com/latex.php?latex=Z(g,h,%5Ctau)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="Z(g,h,\tau)"/> to be the trace of h acting on the g-twisted module of the moonshine module, then the generalized moonshine conjecture actually tells us the “correct” definition: If <img class="latex" title="gv = e^{2 \pi i k/N}v" src="http://l.wordpress.com/latex.php?latex=gv+=+e%5E%7B2+%5Cpi+i+k/N%7Dv&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="gv = e^{2 \pi i k/N}v"/>, then the power series vm lies in <img class="latex" title="M z^{k/N + \mathbb{Z}}" src="http://l.wordpress.com/latex.php?latex=M+z%5E%7Bk/N+++%5Cmathbb%7BZ%7D%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="M z^{k/N + \mathbb{Z}}"/>.</p>
<p>The last piece of the connection to physics is the question of why the Fourier expansion of a torus partition function is given by the dimension (or more generally the trace of an automorphism) of a graded vector space.  I cannot articulate a good answer to this now, but I can wave my hands and mumble phrases like “conformal blocks” and “degenerating curves”.  The moduli space of elliptic curves is not compact, but if we add a point at infinity to parametrize a nodal cubic curve, we get a compact space parametrizing “generalized elliptic curves”.  G-covers of the cubic curve are disjoint unions of Néron n-gons, which are just n copies of the projective line arranged in a cycle, intersecting transversely.  Restricting the map to the smooth locus gives a cover of the multiplicative group, such that the degree on each connected component is equal to the order of g (barring phase anomalies).  From a physics standpoint, the normalization map should push together dual irreducible twisted modules on the projective line, and an expansion along the formal deformation should yield characters according to a grading arising from the Virasoro action.</p>
<p>Now that we have objects that we want, we still have the problem of proving the conjecture.  In 1997, Dong, Li, and Mason proved that it holds (up to a constant multiple) for the case that g and h generate a cyclic group.  In particular, they showed that the moonshine module has a unique irreducible g-twisted module for each g, and its graded dimension is some constant multiple of what we expect.  In 2003, Gerald Hoehn showed that it holds when g lies in the conjugacy class 2A.  The rest of the cases are still wide open.</p>
<p>My own involvement in this problem started in 2005, when Borcherds suggested a strategy for solving it that was both brilliant and doomed to failure (for now).  In his proof of the moonshine conjecture, he constructs a Lie algebra with an action of the monster, and forms twisted denominator formulas with respect to that action that yield the complete replicability of characters that he needs.  It turns out that you can construct the monster Lie algebra complete with the monster action by reverse-engineering from the twisted denominator formulas, and you don’t need to bother with the vertex operator algebra or the no-ghost theorem.  The idea was to do the analogous process for all conjugacy classes of pairs of commuting elements of the monster, and here some problems crept up.  No one has classified the conjugacy classes of commuting pairs, and I think there are over 10000 of them.  Also, the character tables of centralizers and their central extensions are not all known.  I’ve heard rumors that these problems are “too hard” for our current technology, although Moore’s law may eventually rectify that.</p>
<p>Despite this, my interest was piqued, and I set about constructing some Lie algebras by other methods.  If I can hammer down the last details, they should appear in some sequels to the current paper, which is centered around the question of what one can do once one has such a Lie algebra.  The answer is that the characters are genus zero functions, and this actually subsumes the genus zero question for replicable functions (I only realized this last month when I tried and failed to prove that one of my hypotheses was equivalent to complete replicability).  The machinery for the proof came about in a rather circuitous way.  Jacob Lurie came by Berkeley to give a talk at the topology seminar in fall 2005, and at tea I asked him if there was an elliptic cohomology analogue of the Atiyah-Segal exponential formula in K-theory.  He said he wasn’t sure, but it reminded him of some work of Rezk on the topological logarithm.  Later, he emailed me with some formulas involving equivariant Hecke operators, along with a lot of other topological information that I won’t explain here.  These equivariant Hecke operators ended up being the key to the genus zero question, but I also needed some ingredients from Kozlov’s master’s thesis and a paper by Cummins and Gannon to put it together with modular equation theory.  Kozlov’s master’s thesis was both really useful and impressively difficult to find, and I only managed to obtain a copy in the summer after I graduated.</p>
<p>The question of the day is: how do (equivariant) Hecke operators arise in (orbifold) conformal field theory?  They came up in Witten’s <a href="http://arxiv.org/abs/0706.3359">recent 3D gravity work</a>, but not in a form that I can understand.</p>
      <a href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/1255/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/1255/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/godelicious/sbseminar.wordpress.com/1255/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/delicious/sbseminar.wordpress.com/1255/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/gostumble/sbseminar.wordpress.com/1255/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/stumble/sbseminar.wordpress.com/1255/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/godigg/sbseminar.wordpress.com/1255/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/digg/sbseminar.wordpress.com/1255/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/goreddit/sbseminar.wordpress.com/1255/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/reddit/sbseminar.wordpress.com/1255/" border="0" alt=""/></a> <img src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&amp;blog=1217555&amp;post=1255&amp;subd=sbseminar&amp;ref=&amp;feed=1" border="0" alt=""/></div></div>
    </content>
		
    <link href="http://sbseminar.wordpress.com/2009/01/08/generalized-moonshine-i-genus-zero-functions/#comments" rel="replies" type="text/html" thr:count="1"/>
		
    <link href="http://sbseminar.wordpress.com/2009/01/08/generalized-moonshine-i-genus-zero-functions/feed/atom/" rel="replies" type="application/atom+xml" thr:count="1"/>
		<thr:total>1</thr:total>
	
    <source>
      <title type="text">Secret Blogging Seminar</title>
      <subtitle type="text">Representation theory, geometry and whatever else we decide is worth writing about today.</subtitle>
      <updated>2009-01-09T07:14:39+00:00</updated>
      <generator uri="http://wordpress.org/" version="MU">WordPress</generator>
      <link href="http://sbseminar.wordpress.com/" rel="alternate" type="text/html"/>
      <id>http://sbseminar.wordpress.com/feed/atom/</id>
      <link href="http://sbseminar.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
    </source>
  </entry>

  <entry xmlns:thr="http://purl.org/syndication/thread/1.0" xml:lang="en" xml:base="http://dorigo.wordpress.com/wp-atom.php">
		
    <author>
			
      <name>dorigo</name>
						
      <uri>http://dorigo.wordpress.com/</uri>
					
    </author>
		
    <title type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">Black holes, the winged seeds of our Universe</div>
    </title>
		
    <link href="http://dorigo.wordpress.com/2009/01/08/black-holes-the-winged-seeds/" rel="alternate" type="text/html"/>
		
    <id>http://dorigo.wordpress.com/?p=1927</id>
		
    <updated>2009-01-09T06:44:11+00:00</updated>
		
    <published>2009-01-08T20:52:31+00:00</published>
		
    <category term="astronomy" scheme="http://dorigo.wordpress.com/"/>
    <category term="cosmology" scheme="http://dorigo.wordpress.com/"/>
    <category term="news" scheme="http://dorigo.wordpress.com/"/>
    <category term="science" scheme="http://dorigo.wordpress.com/"/>
    <category term="black holes" scheme="http://dorigo.wordpress.com/"/>
    <category term="galaxies" scheme="http://dorigo.wordpress.com/"/>
    <category term="universe" scheme="http://dorigo.wordpress.com/"/>		
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">From Percy Bysshe Shelley’s “Ode to the West Wind” (1819), one of my favourite poems:
[...]O thou,
Who chariotest to their dark wintry bed
The winged seeds, where they lie cold and low,
Each like a corpse within its grave, until
Thine azure sister of the Spring shall blow
Her clarion o’er the dreaming earth, and fill
(Driving sweet buds like flocks [...]</div>
    </summary>
		
    <content type="xhtml" xml:base="http://dorigo.wordpress.com/2009/01/08/black-holes-the-winged-seeds/"><div xmlns="http://www.w3.org/1999/xhtml"><div class="snap_preview"><br/><p>From Percy Bysshe Shelley’s “<strong>Ode to the West Wind</strong>” (1819), one of my favourite poems:</p>
<blockquote><p>[...]O thou,<br/>
Who chariotest to their dark wintry bed<br/>
The winged seeds, where they lie cold and low,<br/>
Each like a corpse within its grave, until<br/>
Thine azure sister of the Spring shall blow<br/>
Her clarion o’er the dreaming earth, and fill<br/>
(Driving sweet buds like flocks to feed in air)<br/>
With living hues and odors plain and hill:<br/>
Wild Spirit, which art moving everywhere;<br/>
Destroyer and preserver; hear, oh, hear!</p></blockquote>
<p>The winged seeds -of galaxies, and ultimately of everything that there is to see in our Universe- appear today to be black holes: this is what emerges from the studies of Chris Carilli, of the National Radio Astronomy Observatory (NRAO). In a <a href="http://www.nrao.edu/pr/2009/bhbulge/">press release of January 6th</a>, Carilli explains that the evidence that black holes are antecedent to galaxy formation is piling up.</p>
<p>In a nutshell, there appears to be a constant ratio between the mass of objects like galaxies and giant globular clusters and the black hole they contain at their center. This has been known for a while -I learned it at a <a href="http://dorigo.wordpress.com/2007/03/31/summary-of-the-summary-talks/">intriguing talk by Al Stebbins</a> at the “Outstanding Questions in Cosmology” conference, in March 2007 at the Imperial College of London. But what has been discovered more recently is that the very oldest objects contain more massive black holes than expected, a sign that black holes started growing earlier than their surroundings.</p>
<p>This is incredibly interesting, and I confess I had always suspected it, when looking at the beautiful spiral galaxies, attracted in a giant vortex by their massive center. I think this realization is a true gate to a deeper understanding of our Universe and its formation. A thought today goes to <a href="http://riofriospacetime.blogspot.com/">Louise</a>, who has always held that black holes have a special role in the formation of our Universe.</p>
      <a href="http://feeds.wordpress.com/1.0/gocomments/dorigo.wordpress.com/1927/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/comments/dorigo.wordpress.com/1927/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/godelicious/dorigo.wordpress.com/1927/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/delicious/dorigo.wordpress.com/1927/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/gostumble/dorigo.wordpress.com/1927/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/stumble/dorigo.wordpress.com/1927/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/godigg/dorigo.wordpress.com/1927/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/digg/dorigo.wordpress.com/1927/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/goreddit/dorigo.wordpress.com/1927/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/reddit/dorigo.wordpress.com/1927/" border="0" alt=""/></a> <img src="http://stats.wordpress.com/b.gif?host=dorigo.wordpress.com&amp;blog=74297&amp;post=1927&amp;subd=dorigo&amp;ref=&amp;feed=1" border="0" alt=""/></div></div>
    </content>
		
    <link href="http://dorigo.wordpress.com/2009/01/08/black-holes-the-winged-seeds/#comments" rel="replies" type="text/html" thr:count="4"/>
		
    <link href="http://dorigo.wordpress.com/2009/01/08/black-holes-the-winged-seeds/feed/atom/" rel="replies" type="application/atom+xml" thr:count="4"/>
		<thr:total>4</thr:total>
	
    <source>
      <title type="text">A Quantum Diaries Survivor</title>
      <subtitle type="text">private thoughts of a physicist and chessplayer</subtitle>
      <updated>2009-01-09T06:44:11+00:00</updated>
      <generator uri="http://wordpress.org/" version="MU">WordPress</generator>
      <link href="http://dorigo.wordpress.com/" rel="alternate" type="text/html"/>
      <id>http://dorigo.wordpress.com/feed/atom/</id>
      <link href="http://dorigo.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
    </source>
  </entry>

  <entry xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0">
         
    <title>Cryptographic Padding in RSA</title>
          
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml"><p> Ok, away from politics, and back to the good stuff. When I left off talking about
encryption, we were <a href="http://scienceblogs.com/goodmath/2008/12/public_key_cryptography_using.php">looking at
RSA</a>, as an example of an asymmetric encryption system.</p>

<p> Since it's been a while, I'll start off with a quick review of RSA.</p>

<p> Asymmetric encryption systems like RSA are based on computations that are easy to perform if you know the keys, and incredibly hard to perform if you don't. In the specific case
of RSA, everything is based on a pair of very large prime numbers. If you know those two
primes, and you know the public key, it's really easy to compute the private key. But
if you <em>don't</em> know the two prime numbers, then even given the public key, 
it's incredibly difficult to compute the private key.</p>

<p> To be a bit more specific, in RSA, you get a pair of large prime numbers, P and Q. You
compute from them a <em>totient</em> of their product, which is the number
N=(P-1)×(Q-1). Then you arbitrarily pick a public exponent, E, which is
smaller than N, and which is prime relative to N.  You can then compute
the private key exponent, D. If you know what P and Q are, it's pretty easy to compute
D.</p>

<p> Once you've got D and E, your public key is the pair is (N,E), and the private key is the pair is (N,D).</p>

<p> If you've got a plaintext message M, then encrypting it with the public key
is done by computing M<sup>E</sup> mod N. If you've got a ciphertext C encrypted
with the public key, then decrypting it is done by computing C<sup>D</sup> mod N.</p>

<p> <em>Encrypting</em> a plaintext with the public key is <em>exactly</em> the same process
as <em>decrypting</em> a ciphertext produced with the private key. And vice versa.</p>


 <a href="http://scienceblogs.com/goodmath/2009/01/cryptographic_padding_in_rsa.php">Read the rest of this post...</a> | <a href="http://scienceblogs.com/goodmath/2009/01/cryptographic_padding_in_rsa.php#commentsArea">Read the comments on this post...</a><img src="http://feeds.feedburner.com/~r/scienceblogs/CyKN/~4/506787706" height="1" width="1"/></div>
    </summary>
         
    <link href="http://feeds.feedburner.com/~r/scienceblogs/CyKN/~3/506787706/cryptographic_padding_in_rsa.php" rel="alternate"/>
         
    <id>http://scienceblogs.com/goodmath/2009/01/cryptographic_padding_in_rsa.php</id>
         
    <category term="Encryption"/>
         
         
    <published>2009-01-08T21:52:29-05:00</published>
      
    <updated>2009-01-08T21:52:29-05:00</updated>
    <source>
      <title>Good Math, Bad Math</title>
      <link href="http://scienceblogs.com/goodmath/" rel="alternate"/>
      <subtitle>Finding the fun in good math; Shredding bad math and squashing the crackpots who espouse it.</subtitle>
      <rights>Copyright 2009</rights>
      <updated>2009-01-08T21:52:29-05:00</updated>
      <generator>http://www.sixapart.com/movabletype/?v=3.35</generator>
      <link href="http://feeds.feedburner.com/scienceblogs/CyKN" rel="self" type="application/rss+xml"/>
      <id>http://scienceblogs.com/goodmath/</id>
    </source>
  </entry>

  <entry xmlns:thr="http://purl.org/syndication/thread/1.0" xml:lang="en" xml:base="http://sbseminar.wordpress.com/wp-atom.php">
		
    <author>
			
      <name>davidspeyer</name>
						
      <uri>http://www.math.lsa.umich.edu/~speyer</uri>
					
    </author>
		
    <title type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">What´s up with dee zee bar?</div>
    </title>
		
    <link href="http://sbseminar.wordpress.com/2009/01/08/what%20%CC%81s-up-with-dee-zee-bar/" rel="alternate" type="text/html"/>
		
    <id>http://sbseminar.wordpress.com/?p=1174</id>
		
    <updated>2009-01-09T01:50:17+00:00</updated>
		
    <published>2009-01-09T01:50:17+00:00</published>
		
    <category term="Algebraic Geometry" scheme="http://sbseminar.wordpress.com/"/>		
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">When I first tried to read Griffiths and Harrris’s Principles of Algebraic Geometry, I was baffled by formulas like . The absolute value function wasn’t analytic, so its derivative with respect to  wasn’t defined. And what were all these s I was seeing? What were they, and why didn’t they seem to be equal [...]</div>
    </summary>
		
    <content type="xhtml" xml:base="http://sbseminar.wordpress.com/2009/01/08/what%c2%b4s-up-with-dee-zee-bar/"><div xmlns="http://www.w3.org/1999/xhtml"><div class="snap_preview"><br/><p>When I first tried to read Griffiths and Harrris’s <a href="http://www.amazon.com/Principles-Algebraic-Geometry-Phillip-Griffiths/dp/0471050598/ref=pd_bbs_sr_1?ie=UTF8&amp;s=books&amp;qid=1229604596&amp;sr=8-1"><em>Principles of Algebraic Geometry</em></a>, I was baffled by formulas like <img class="latex" title="(\partial/\partial z)|z| = (-1/2) \bar{z}/|z|" src="http://l.wordpress.com/latex.php?latex=(%5Cpartial/%5Cpartial+z)%7Cz%7C+=+(-1/2)+%5Cbar%7Bz%7D/%7Cz%7C&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(\partial/\partial z)|z| = (-1/2) \bar{z}/|z|"/>. The absolute value function wasn’t analytic, so its derivative with respect to <img class="latex" title="z" src="http://l.wordpress.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z"/> wasn’t<strong> </strong>defined. And what were all these <img class="latex" title="d \bar{z}" src="http://l.wordpress.com/latex.php?latex=d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="d \bar{z}"/><span class="mw-headline">s I was seeing? What were they, and why didn’t they seem to be equal to <img class="latex" title="(\partial \bar{z}/\partial z) dz" src="http://l.wordpress.com/latex.php?latex=(%5Cpartial+%5Cbar%7Bz%7D/%5Cpartial+z)+dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(\partial \bar{z}/\partial z) dz"/></span>?</p>
<p>Maybe I’m the only person who was confused by this. But, if this stuff bothers you too, then this post is for you.</p>
<p>In algebraic geometry, the most important functions are the analytic functions. (In this post, “analytic” means “complex analytic”.) Indeed, much of the progress in algebraic geometry in the last fifty years has been learning how to study the geometry of algebraic varieties using only the algebraic, and hence analytic, functions on those varieties. This is especially necessary to those who want to prove results over fields other than <img class="latex" title="\mathbb{C}" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BC%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{C}"/>.</p>
<p>Before learning these ideas, though, one should probably learn how to study smooth functions on complex varieties. In particular, the deRham theory is much nicer if we allow all smooth functions, rather than restricting to just analytic ones. (To get a few hints of why, remember that a bounded analytic functions is constant, and nonzero analytic functions never have compact support.)</p>
<p>So, algebraic geometers have developed a notation which allows them to work with smooth functions that are not analytic. At the same time, analytic functions do play a special role in the theory, so the notation is particularly adapted to work well with analytic functions. This can be confusing to the beginner (it was for me!) because it is easy to memorize results which hold only in the analytic case and try to apply them in the smooth case.</p>
<p>In the rest of this post, I will explain this notation. I will assume you are familiar with differential forms; if you are not, I recommend <a href="http://www.math.ucla.edu/~tao/preprints/forms.pdf">Terry Tao’s PCM article</a>.</p>
<p><span id="more-1174"/></p>
<p>To start out with, suppose that we have a smooth function from <img class="latex" title="\mathbb{C}" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BC%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{C}"/> to <img class="latex" title="\mathbb{C}" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BC%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{C}"/>. For example: <img class="latex" title="f(x+iy) = (x^2-y^2) + 2xyi" src="http://l.wordpress.com/latex.php?latex=f(x+iy)+=+(x%5E2-y%5E2)+++2xyi&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f(x+iy) = (x^2-y^2) + 2xyi"/>. Then we can take its differential and get a differential form <img class="latex" title="df" src="http://l.wordpress.com/latex.php?latex=df&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df"/>. When we evaluate <img class="latex" title="df" src="http://l.wordpress.com/latex.php?latex=df&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df"/> on a tangent vector <img class="latex" title="v" src="http://l.wordpress.com/latex.php?latex=v&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="v"/>, and at a point <img class="latex" title="z" src="http://l.wordpress.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z"/>, we get a measure of how the function <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/> changes between <img class="latex" title="z" src="http://l.wordpress.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z"/> and <img class="latex" title="z+ \epsilon v" src="http://l.wordpress.com/latex.php?latex=z++%5Cepsilon+v&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z+ \epsilon v"/>, for real <img class="latex" title="\epsilon" src="http://l.wordpress.com/latex.php?latex=%5Cepsilon&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\epsilon"/>. For example, with <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/> as above, we have <img class="latex" title="df = (2x+2yi) dx + (-2 y+2xi) dy" src="http://l.wordpress.com/latex.php?latex=df+=+(2x+2yi)+dx+++(-2+y+2xi)+dy&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df = (2x+2yi) dx + (-2 y+2xi) dy"/>. Of course, <img class="latex" title="df" src="http://l.wordpress.com/latex.php?latex=df&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df"/> is a complex valued one form, because <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/> is a complex valued function, but we can still think of <img class="latex" title="df" src="http://l.wordpress.com/latex.php?latex=df&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df"/> as measuring change along perfectly  ordinary tangent vectors.</p>
<p>We could write <img class="latex" title="df" src="http://l.wordpress.com/latex.php?latex=df&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df"/> as <img class="latex" title="a(x,y) dx + b(x,y) dy" src="http://l.wordpress.com/latex.php?latex=a(x,y)+dx+++b(x,y)+dy&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="a(x,y) dx + b(x,y) dy"/>. However, some experience shows that it is better express one forms in terms of <img class="latex" title="dz" src="http://l.wordpress.com/latex.php?latex=dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dz"/> and <img class="latex" title="d \bar{z}" src="http://l.wordpress.com/latex.php?latex=d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="d \bar{z}"/>. What do these symbols mean? Well, <img class="latex" title="z" src="http://l.wordpress.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z"/> and <img class="latex" title="\bar{z}" src="http://l.wordpress.com/latex.php?latex=%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\bar{z}"/> are complex valued functions on <img class="latex" title="\mathbb{C}" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BC%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{C}"/>, so their differentials are one forms. One can check that their differentials are everywhere linearly independent, so every one form can be written uniquely as a linear combination of <img class="latex" title="dz" src="http://l.wordpress.com/latex.php?latex=dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dz"/> and <img class="latex" title="d \bar{z}" src="http://l.wordpress.com/latex.php?latex=d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="d \bar{z}"/>. For example, the above function <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/> is just <img class="latex" title="z^2" src="http://l.wordpress.com/latex.php?latex=z%5E2&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z^2"/>, so <img class="latex" title="df=2z dz" src="http://l.wordpress.com/latex.php?latex=df=2z+dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df=2z dz"/>. Supposing that I had consisidered <img class="latex" title="g = z \bar{z} = x^2 + y^2" src="http://l.wordpress.com/latex.php?latex=g+=+z+%5Cbar%7Bz%7D+=+x%5E2+++y%5E2&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="g = z \bar{z} = x^2 + y^2"/>. Then <img class="latex" title="dg=\bar{z} dz + z d \bar{z}" src="http://l.wordpress.com/latex.php?latex=dg=%5Cbar%7Bz%7D+dz+++z+d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dg=\bar{z} dz + z d \bar{z}"/>.</p>
<p>This illustrates the general principle: <strong>If <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/> is an analytic function, then <img class="latex" title="df=(df/dz) dz" src="http://l.wordpress.com/latex.php?latex=df=(df/dz)+dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df=(df/dz) dz"/>,</strong> where <img class="latex" title="df/dz" src="http://l.wordpress.com/latex.php?latex=df/dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df/dz"/> is the derivative you learned in your first complex analysis course. The function <img class="latex" title="df/dz" src="http://l.wordpress.com/latex.php?latex=df/dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df/dz"/> will also be analytic. On the other hand, <strong>if <img class="latex" title="g" src="http://l.wordpress.com/latex.php?latex=g&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="g"/> is a smooth, but not analytic function, then <img class="latex" title="dg" src="http://l.wordpress.com/latex.php?latex=dg&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dg"/> will be of the form <img class="latex" title="a dz + b d \bar{z}" src="http://l.wordpress.com/latex.php?latex=a+dz+++b+d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="a dz + b d \bar{z}"/></strong>. Neither <img class="latex" title="a" src="http://l.wordpress.com/latex.php?latex=a&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="a"/> nor <img class="latex" title="b" src="http://l.wordpress.com/latex.php?latex=b&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="b"/> will necessarily be analytic.</p>
<p>In general, <strong>when you are working with analytic functions, </strong><strong>all the rules you learned in single variable calculus work</strong>: the sum rule, the product rule, the chain rule and so forth. On the other hand,<strong> when you are working with smooth but nonanalytic functions, everything works the way you learned in multivariable calculus.</strong>  In particular, this explains my confusion above about why <img class="latex" title="d \bar{z}" src="http://l.wordpress.com/latex.php?latex=d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="d \bar{z}"/> isn’t <img class="latex" title="(\partial \bar{z}/\partial z) dz" src="http://l.wordpress.com/latex.php?latex=(%5Cpartial+%5Cbar%7Bz%7D/%5Cpartial+z)+dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(\partial \bar{z}/\partial z) dz"/>; it’s the same reason that, writing <img class="latex" title="x" src="http://l.wordpress.com/latex.php?latex=x&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="x"/> and <img class="latex" title="y" src="http://l.wordpress.com/latex.php?latex=y&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="y"/> for the coordinates on <img class="latex" title="\mathbb{R}^2" src="http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BR%7D%5E2&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\mathbb{R}^2"/>, the one-form <img class="latex" title="dy" src="http://l.wordpress.com/latex.php?latex=dy&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dy"/> isn’t <img class="latex" title="(\partial y/\partial x) dx" src="http://l.wordpress.com/latex.php?latex=(%5Cpartial+y/%5Cpartial+x)+dx&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(\partial y/\partial x) dx"/>.</p>
<p>One-forms of the form <img class="latex" title="a dz" src="http://l.wordpress.com/latex.php?latex=a+dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="a dz"/> are called <img class="latex" title="(1,0)" src="http://l.wordpress.com/latex.php?latex=(1,0)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(1,0)"/> forms, while one-forms of the form <img class="latex" title="b d \bar{z}" src="http://l.wordpress.com/latex.php?latex=b+d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="b d \bar{z}"/> are called <img class="latex" title="(0,1)" src="http://l.wordpress.com/latex.php?latex=(0,1)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(0,1)"/> forms. More generally, if we are working with functions of <img class="latex" title="n" src="http://l.wordpress.com/latex.php?latex=n&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="n"/> complex variables, we will have <img class="latex" title="(p,q)" src="http://l.wordpress.com/latex.php?latex=(p,q)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(p,q)"/>-forms, for <img class="latex" title="0 \leq p, q \leq n" src="http://l.wordpress.com/latex.php?latex=0+%5Cleq+p,+q+%5Cleq+n&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="0 \leq p, q \leq n"/>. In coordinates, a <img class="latex" title="(p,q)" src="http://l.wordpress.com/latex.php?latex=(p,q)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(p,q)"/>-form is a form then can be written as a sum of terms of the form a smooth function times</p>
<p><img class="latex" title="dz_{i_1} \wedge \cdots \wedge dz_{i_p} \wedge d\bar{z}_{j_1} \wedge \cdots \wedge d \bar{z}_{j_q}" src="http://l.wordpress.com/latex.php?latex=dz_%7Bi_1%7D+%5Cwedge+%5Ccdots+%5Cwedge+dz_%7Bi_p%7D+%5Cwedge+d%5Cbar%7Bz%7D_%7Bj_1%7D+%5Cwedge+%5Ccdots+%5Cwedge+d+%5Cbar%7Bz%7D_%7Bj_q%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dz_{i_1} \wedge \cdots \wedge dz_{i_p} \wedge d\bar{z}_{j_1} \wedge \cdots \wedge d \bar{z}_{j_q}"/>. </p>
<p>More conceptually, a <img class="latex" title="(p,q)" src="http://l.wordpress.com/latex.php?latex=(p,q)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(p,q)"/>-form is a <img class="latex" title="(p+q)" src="http://l.wordpress.com/latex.php?latex=(p+q)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(p+q)"/>-form <img class="latex" title="\eta" src="http://l.wordpress.com/latex.php?latex=%5Ceta&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\eta"/> such that</p>
<p><img class="latex" title="\eta(e^{i \theta} v_1, e^{i \theta} v_2, \ldots, e^{i \theta} v_{p+q}) = e^{i (p-q) \theta} \eta(v_1, v_2, \ldots, v_{p+q})" src="http://l.wordpress.com/latex.php?latex=%5Ceta(e%5E%7Bi+%5Ctheta%7D+v_1,+e%5E%7Bi+%5Ctheta%7D+v_2,+%5Cldots,+e%5E%7Bi+%5Ctheta%7D+v_%7Bp+q%7D)+=+e%5E%7Bi+(p-q)+%5Ctheta%7D+%5Ceta(v_1,+v_2,+%5Cldots,+v_%7Bp+q%7D)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\eta(e^{i \theta} v_1, e^{i \theta} v_2, \ldots, e^{i \theta} v_{p+q}) = e^{i (p-q) \theta} \eta(v_1, v_2, \ldots, v_{p+q})"/>,</p>
<p>for any <img class="latex" title="p+q" src="http://l.wordpress.com/latex.php?latex=p+q&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="p+q"/> vectors <img class="latex" title="v_1" src="http://l.wordpress.com/latex.php?latex=v_1&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="v_1"/>, <img class="latex" title="v_2" src="http://l.wordpress.com/latex.php?latex=v_2&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="v_2"/>, …, <img class="latex" title="v_{p+q}" src="http://l.wordpress.com/latex.php?latex=v_%7Bp+q%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="v_{p+q}"/>. </p>
<p>This seems like a good point to distinguish two concepts which confused me when I was learning this material. A <img class="latex" title="(p,0)" src="http://l.wordpress.com/latex.php?latex=(p,0)&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="(p,0)"/>-form is a sum of terms of the form <strong>a smooth function times <span style="font-weight:normal;"><img class="latex" title="dz_{i_1} \wedge \cdots \wedge dz_{i_p}" src="http://l.wordpress.com/latex.php?latex=dz_%7Bi_1%7D+%5Cwedge+%5Ccdots+%5Cwedge+dz_%7Bi_p%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dz_{i_1} \wedge \cdots \wedge dz_{i_p}"/>. A holomorphic <img class="latex" title="p" src="http://l.wordpress.com/latex.php?latex=p&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="p"/>-form is a sum of terms of the form <strong>an analytic function times </strong><img class="latex" title="dz_{i_1} \wedge \cdots \wedge dz_{i_p}" src="http://l.wordpress.com/latex.php?latex=dz_%7Bi_1%7D+%5Cwedge+%5Ccdots+%5Cwedge+dz_%7Bi_p%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dz_{i_1} \wedge \cdots \wedge dz_{i_p}"/>. Both of them can intuitively be thought of as “a form which is purely holomorphic”, but they make this concept rigorous in different ways.</span></strong></p>
<p>Finally, what is <img class="latex" title="\partial/\partial z" src="http://l.wordpress.com/latex.php?latex=%5Cpartial/%5Cpartial+z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\partial/\partial z"/>? <strong>By definition,</strong></p>
<p><img class="latex" title="df = (\partial f/\partial z) dz + (\partial f/\partial \bar{z}) d \bar{z}" src="http://l.wordpress.com/latex.php?latex=df+=+(%5Cpartial+f/%5Cpartial+z)+dz+++(%5Cpartial+f/%5Cpartial+%5Cbar%7Bz%7D)+d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df = (\partial f/\partial z) dz + (\partial f/\partial \bar{z}) d \bar{z}"/>.</p>
<p>Notice that this equation makes sense: <img class="latex" title="df" src="http://l.wordpress.com/latex.php?latex=df&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="df"/>, <img class="latex" title="dz" src="http://l.wordpress.com/latex.php?latex=dz&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="dz"/> and <img class="latex" title="d \bar{z}" src="http://l.wordpress.com/latex.php?latex=d+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="d \bar{z}"/> are all one forms, whose meaning we know. The expressions  <img class="latex" title="\partial f/\partial z" src="http://l.wordpress.com/latex.php?latex=%5Cpartial+f/%5Cpartial+z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\partial f/\partial z"/> and <img class="latex" title="\partial f/\partial \bar{z}" src="http://l.wordpress.com/latex.php?latex=%5Cpartial+f/%5Cpartial+%5Cbar%7Bz%7D&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\partial f/\partial \bar{z}"/> denote complex-valued  functions of <img class="latex" title="z" src="http://l.wordpress.com/latex.php?latex=z&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="z"/>, which are determined by the above equation.  <strong>When <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/> is analytic, </strong><img class="latex" title="\partial f/\partial z = \lim_{h \to 0} (f(z+h) - f(z))/h" src="http://l.wordpress.com/latex.php?latex=%5Cpartial+f/%5Cpartial+z+=+%5Clim_%7Bh+%5Cto+0%7D+(f(z+h)+-+f(z))/h&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="\partial f/\partial z = \lim_{h \to 0} (f(z+h) - f(z))/h"/>. But, <strong>when <img class="latex" title="f" src="http://l.wordpress.com/latex.php?latex=f&amp;bg=ffffff&amp;fg=000000&amp;s=0" alt="f"/></strong><strong> is smooth</strong>, you pretty much have to fall back on the definition.</p>
<p>If you are still confused by all this notation, I recommend trying to read a book which uses a lot of it, thinking back frequently to the definitions to make sure everything makes sense. Pretty soon, everything will seem obvious and second nature. At that point, you’ll be ready to confuse everyone else!</p>
      <a href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/1174/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/1174/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/godelicious/sbseminar.wordpress.com/1174/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/delicious/sbseminar.wordpress.com/1174/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/gostumble/sbseminar.wordpress.com/1174/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/stumble/sbseminar.wordpress.com/1174/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/godigg/sbseminar.wordpress.com/1174/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/digg/sbseminar.wordpress.com/1174/" border="0" alt=""/></a> <a href="http://feeds.wordpress.com/1.0/goreddit/sbseminar.wordpress.com/1174/" rel="nofollow"><img src="http://feeds.wordpress.com/1.0/reddit/sbseminar.wordpress.com/1174/" border="0" alt=""/></a> <img src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&amp;blog=1217555&amp;post=1174&amp;subd=sbseminar&amp;ref=&amp;feed=1" border="0" alt=""/></div></div>
    </content>
		
    <link href="http://sbseminar.wordpress.com/2009/01/08/what%20%CC%81s-up-with-dee-zee-bar/#comments" rel="replies" type="text/html" thr:count="0"/>
		
    <link href="http://sbseminar.wordpress.com/2009/01/08/what%20%CC%81s-up-with-dee-zee-bar/feed/atom/" rel="replies" type="application/atom+xml" thr:count="0"/>
		<thr:total>0</thr:total>
	
    <source>
      <title type="text">Secret Blogging Seminar</title>
      <subtitle type="text">Representation theory, geometry and whatever else we decide is worth writing about today.</subtitle>
      <updated>2009-01-09T07:14:39+00:00</updated>
      <generator uri="http://wordpress.org/" version="MU">WordPress</generator>
      <link href="http://sbseminar.wordpress.com/" rel="alternate" type="text/html"/>
      <id>http://sbseminar.wordpress.com/feed/atom/</id>
      <link href="http://sbseminar.wordpress.com/feed/atom/" rel="self" type="application/atom+xml"/>
    </source>
  </entry>

  <entry xmlns:thr="http://purl.org/syndication/thread/1.0" xml:lang="en" xml:base="http://blogs.discovermagazine.com/cosmicvariance/wp-atom.php">
		
    <author>
			
      <name>Sean</name>
						
      <uri>http://blogs.discovermagazine.com/cosmicvariance/sean/</uri>
					
    </author>
		
    <title type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">Philosophy in the Streets</div>
    </title>
		
    <link href="http://blogs.discovermagazine.com/cosmicvariance/2009/01/08/philosophy-in-the-streets/" rel="alternate" type="text/html"/>
		
    <id>http://blogs.discovermagazine.com/cosmicvariance/2009/01/08/philosophy-in-the-streets/</id>
		
    <updated>2009-01-09T00:33:24+00:00</updated>
		
    <published>2009-01-09T00:33:24+00:00</published>
		
    <category term="Philosophy" scheme="http://blogs.discovermagazine.com/cosmicvariance"/>		
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">I want to see this for scientists!  Via Crooked Timber, a new film by Astra Taylor:  Examined Life, featuring interviews with various philosophers in everyday surroundings. 
Žižek says “Nature is a big series of unimaginable catastrophes.”  I think he meant “the blogosphere,” not “Nature.”




Do I really want to see this for scientists? [...]</div>
    </summary>
		
    <content type="xhtml" xml:base="http://blogs.discovermagazine.com/cosmicvariance/2009/01/08/philosophy-in-the-streets/"><div xmlns="http://www.w3.org/1999/xhtml"><p>I want to see this for scientists!  Via <a href="http://crookedtimber.org/2009/01/08/talking-heads-2/">Crooked Timber</a>, a new film by Astra Taylor:  <a href="http://www.zeitgeistfilms.com/examinedlife/"><em>Examined Life</em></a>, featuring interviews with various philosophers in everyday surroundings. </p>
<p>Žižek says “Nature is a big series of unimaginable catastrophes.”  I think he meant “the blogosphere,” not “Nature.”</p>
<blockquote><p>


</p></blockquote>
<p>Do I really want to see this for scientists?  They might not make the same impression on film — scientists aren’t trained to connect what they do to the concerns of the wider world (although the connections are there).</p>
<p><a href="http://sharethis.com/item?&amp;wp=2.3.1&amp;publisher=f2caee13-25e2-4fe7-800b-ca9e983c12c3&amp;title=Philosophy+in+the+Streets&amp;url=http://blogs.discovermagazine.com/cosmicvariance/2009/01/08/philosophy-in-the-streets/">ShareThis</a></p></div>
    </content>
	
    <source>
      <title type="text">Cosmic Variance</title>
      <subtitle type="text">Random samplings from a universe of ideas.</subtitle>
      <updated>2009-01-09T00:33:24+00:00</updated>
      <generator uri="http://wordpress.org/" version="2.3.1">WordPress</generator>
      <link href="http://blogs.discovermagazine.com/cosmicvariance" rel="alternate" type="text/html"/>
      <id>http://blogs.discovermagazine.com/cosmicvariance/feed/atom/</id>
      <link href="http://blogs.discovermagazine.com/cosmicvariance/feed/atom/" rel="self" type="application/atom+xml"/>
    </source>
  </entry>

  <entry xmlns:thr="http://purl.org/syndication/thread/1.0" xml:lang="en" xml:base="http://terrytao.wordpress.com/wp-atom.php">
		
    <author>
			
      <name>Terence Tao</name>
						
      <uri>http://www.math.ucla.edu/~tao</uri>
					
    </author>
		
    <title type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">245B, notes 2: Amenability, the ping-pong lemma, and the Banach-Tarski paradox (optional)</div>
    </title>
		
    <link href="http://terrytao.wordpress.com/2009/01/08/245b-notes-2-amenability-the-ping-pong-lemma-and-the-banach-tarski-paradox-optional/" rel="alternate" type="text/html"/>
		
    <id>http://terrytao.wordpress.com/?p=1354</id>
		
    <updated>2009-01-09T00:24:43+00:00</updated>
		
    <published>2009-01-08T17:49:28+00:00</published>
		
    <category term="245B - Real analysis" scheme="http://terrytao.wordpress.com/"/>
    <category term="math.CA" scheme="http://terrytao.wordpress.com/"/>
    <category term="math.GR" scheme="http://terrytao.wordpress.com/"/>
    <category term="math.LO" scheme="http://terrytao.wordpress.com/"/>
    <category term="amenable group" scheme="http://terrytao.wordpress.com/"/>
    <category term="axiom of choice" scheme="http://terrytao.wordpress.com/"/>
    <category term="Banach-Tarski paradox" scheme="http://terrytao.wordpress.com/"/>
    <category term="finitely additive measure" scheme="http://terrytao.wordpress.com/"/>
    <category term="free group" scheme="http://terrytao.wordpress.com/"/>
    <category term="ping-pong lemma" scheme="http://terrytao.wordpress.com/"/>
    <category term="solvable group" scheme="http://terrytao.wordpress.com/"/>		
    <summary type="xhtml"><div xmlns="http://www.w3.org/1999/xhtml">Notational convention: In this post only, I will colour a statement red if it depends on the axiom of choice. 
The famous Banach-Tarski paradox asserts that one can take the unit ball in three dimensions, divide it up into finitely many pieces, and then translate and rotate each piece so that their union is now [...]</div>
    </summary>
		
    <content type="xhtml" xml:base="http://terrytao.wordpress.com/2009/01/08/245b-notes-2-amenability-the-ping-pong-lemma-and-the-banach-tarski-paradox-optional/"><div xmlns="http://www.w3.org/1999/xhtml"><div class="snap_preview"><br/><p><strong>Notational convention:</strong> In this post only, I will colour a statement <span style="color:#ff0000;">red</span> if it depends on the <a href="http://en.wikipedia.org/wiki/Axiom_of_choice"><span style="color:#ff0000;">axiom of choice</span></a>. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p><span style="color:#ff0000;">The famous <a href="http://en.wikipedia.org/wiki/Banach%E2%80%93Tarski_paradox">Banach-Tarski paradox</a> asserts that one can take the unit ball in three dimensions, divide it up into finitely many pieces, and then translate and rotate each piece so that their union is now two disjoint unit balls.  As a consequence of this paradox, it is not possible to create a finitely additive measure on <img class="latex" title="{\Bbb R}^3" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E3&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^3"/> that is both translation and rotation invariant, which can measure every subset of <img class="latex" title="{\Bbb R}^3" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E3&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^3"/>, and which gives the unit ball a non-zero measure.</span><span style="color:#ff0000;"> This paradox helps explain why <a href="http://en.wikipedia.org/wiki/Lebesgue_measure">Lebesgue measure</a> (which is countably additive and both translation and rotation invariant, and gives the unit ball a non-zero measure) cannot measure every set, instead being restricted to measuring sets that are Lebesgue measurable.</span></p>
<p>On the other hand, it is not possible to replicate the Banach-Tarski paradox in one or two dimensions; the unit interval in <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> or unit disk in <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/> cannot be rearranged into two unit intervals or two unit disks using only finitely many pieces, translations, and rotations, <span style="color:#ff0000;">and indeed there do exist non-trivial finitely additive measures on these spaces. </span><span style="color:#ff0000;"> However, it is possible to obtain a Banach-Tarski type paradox in one or two dimensions using <em>countably</em> many such pieces; this rules out the possibility of extending Lebesgue measure to a countably additive translation invariant measure on all subsets of <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> (or any higher-dimensional space).</span></p>
<p>In these notes I would like to establish all of the above results, and tie them in with some important concepts and tools in modern group theory, most notably <a href="http://en.wikipedia.org/wiki/Amenable_group">amenability</a> and the <a href="http://en.wikipedia.org/wiki/Ping-pong_lemma">ping-pong lemma</a>.  This material is not required for the rest of the course, but nevertheless has some independent interest.</p>
<p style="text-align:center;"><span id="more-1354"/>– One-dimensional equidecomposability –</p>
<p>Before we study the three-dimensional situation, let us first review the simpler one-dimensional situation.  To avoid having to say “X can be cut up into finitely many pieces, which can then be moved around to create Y” all the time, let us make a convenient definition:</p>
<blockquote><p><strong>Definition 1.</strong> (Equidecomposability)  Let <img class="latex" title="G = (G,\cdot)" src="http://l.wordpress.com/latex.php?latex=G+=+(G,%5Ccdot)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = (G,\cdot)"/> be a group <a href="http://en.wikipedia.org/wiki/Group_action">acting</a> on a space X, and let A, B be subsets of X.</p>
<ol>
<li>We say that A, B are <em>finitely G-equidecomposable</em> if there exist finite partitions <img class="latex" title="A = \bigcup_{i=1}^n A_i" src="http://l.wordpress.com/latex.php?latex=A+=+%5Cbigcup_%7Bi=1%7D%5En+A_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A = \bigcup_{i=1}^n A_i"/> and <img class="latex" title="B = \bigcup_{i=1}^n B_i" src="http://l.wordpress.com/latex.php?latex=B+=+%5Cbigcup_%7Bi=1%7D%5En+B_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="B = \bigcup_{i=1}^n B_i"/> and group elements <img class="latex" title="g_1,\ldots,g_n \in G" src="http://l.wordpress.com/latex.php?latex=g_1,%5Cldots,g_n+%5Cin+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g_1,\ldots,g_n \in G"/> such that <img class="latex" title="B_i = g_i A_i" src="http://l.wordpress.com/latex.php?latex=B_i+=+g_i+A_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="B_i = g_i A_i"/> for all <img class="latex" title="1 \leq i \leq n" src="http://l.wordpress.com/latex.php?latex=1+%5Cleq+i+%5Cleq+n&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="1 \leq i \leq n"/>.</li>
<li>We say that A, B are <em>countably G-equidecomposable</em> if there exist countable partitions <img class="latex" title="A = \bigcup_{i=1}^\infty A_i" src="http://l.wordpress.com/latex.php?latex=A+=+%5Cbigcup_%7Bi=1%7D%5E%5Cinfty+A_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A = \bigcup_{i=1}^\infty A_i"/> and <img class="latex" title="B = \bigcup_{i=1}^\infty B_i" src="http://l.wordpress.com/latex.php?latex=B+=+%5Cbigcup_%7Bi=1%7D%5E%5Cinfty+B_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="B = \bigcup_{i=1}^\infty B_i"/> and group elements <img class="latex" title="g_1, g_2, \ldots \in G" src="http://l.wordpress.com/latex.php?latex=g_1,+g_2,+%5Cldots+%5Cin+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g_1, g_2, \ldots \in G"/> such that <img class="latex" title="B_i = g_i A_i" src="http://l.wordpress.com/latex.php?latex=B_i+=+g_i+A_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="B_i = g_i A_i"/> for all i.</li>
<li>We say that A is <em>finitely G-paradoxical</em> if it can be partitioned into two subsets, each of which is finitely G-equidecomposable with A.</li>
<li>We say that A is <em>countably G-paradoxical</em> if it can be partitioned into two subsets, each of which is countably G-equidecomposable with A.</li>
</ol>
<p>One can of course make similar definitions when <img class="latex" title="G = (G,+)" src="http://l.wordpress.com/latex.php?latex=G+=+(G,+)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = (G,+)"/> is an additive group rather than a multiplicative one.</p></blockquote>
<p>Clearly, finite G-equidecomposability implies countable G-equidecomposability, but the converse is not true.   Observe that any finitely (resp. countably) additive and G-invariant measure on X that measures every single subset of X, must give either a zero measure or an infinite measure to a finitely (resp. countably) G-paradoxical set.  Thus, paradoxical sets provide significant obstructions to constructing additive measures that can measure all sets.</p>
<p><strong>Example 1.</strong> If <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> acts on itself by translation, then <img class="latex" title="{}[0,2]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B0,2%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[0,2]"/> is finitely <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable  with <img class="latex" title="{}[10,11) \cup [21,22]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B10,11)+%5Ccup+%5B21,22%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[10,11) \cup [21,22]"/>, and <img class="latex" title="{}{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%7D%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}{\Bbb R}"/> is finitely <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable with <img class="latex" title="(-\infty,-10] \cup (10,+\infty)" src="http://l.wordpress.com/latex.php?latex=(-%5Cinfty,-10%5D+%5Ccup+(10,+%5Cinfty)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="(-\infty,-10] \cup (10,+\infty)"/>. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p><strong>Example 2.</strong> If G acts transitively on X, then any two finite subsets of X are finitely <img class="latex" title="G" src="http://l.wordpress.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G"/>-equidecomposable iff they have the same cardinality, and any two countably infinite sets of X are countably <img class="latex" title="G" src="http://l.wordpress.com/latex.php?latex=G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G"/>-equidecomposable.  In particular, any countably infinite subset of X is countably G-paradoxical. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p><strong>Exercise 1.</strong> Show that finite G-equidecomposability and countable G-equidecomposability are both equivalence relations. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p><strong>Exercise 2.</strong> (Banach-Schroder-Bernstein theorem)  Let G act on X, and let A, B be subsets of X.</p>
<ol>
<li>If A is finitely G-equidecomposable with a subset of B, and B is finitely G-equidecomposable with a subset of A, show that A and B are finitely G-equidecomposable with each other.  (Hint: adapt the proof of the <a href="http://en.wikipedia.org/wiki/Schroder-Bernstein_theorem">Schroder-Bernstein theorem</a>.)</li>
<li>If A is finitely G-equidecomposable with a superset of B, and B is finitely G-equidecomposable with a superset of A, show that A and B are finitely G-equidecomposable with each other.  (Hint: use part 1.)</li>
<li>Show that claims 1 and 2 hold when “finitely” is replaced by “countably”. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></li>
</ol>
<p><strong>Exercise 3.</strong> Show that if G acts on X, A is a subset of X which is finitely (resp. countably) G-paradoxical, and <img class="latex" title="x \in X" src="http://l.wordpress.com/latex.php?latex=x+%5Cin+X&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x \in X"/>, then the <em>recurrence set</em> <img class="latex" title="\{ g \in G: gx \in A \}" src="http://l.wordpress.com/latex.php?latex=%5C%7B+g+%5Cin+G:+gx+%5Cin+A+%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\{ g \in G: gx \in A \}"/> is also finitely (resp. countably) G-paradoxical (where G acts on itself by translation). <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p>Let us first establish countable equidecomposability paradoxes in the reals.</p>
<blockquote><p><span style="color:#ff0000;"><strong>Proposition 1.</strong> Let <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> act on itself by translations.  Then <img class="latex" title="{}[0,1]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B0,1%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[0,1]"/> and <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> are countably <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable.</span></p></blockquote>
<p><strong>Proof. </strong> By Exercise 2, it will suffice to show that some set contained in <img class="latex" title="{}[0,1]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B0,1%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[0,1]"/> is countably <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable with <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>.  Consider the space <img class="latex" title="{\Bbb R}/{\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D/%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}/{\Bbb Q}"/> of all cosets <img class="latex" title="x+{\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=x+%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x+{\Bbb Q}"/> of the rationals.  <span style="color:#ff0000;">By the axiom of choice, we can express each such coset as <img class="latex" title="x+{\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=x+%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x+{\Bbb Q}"/> for some <img class="latex" title="x \in [0,1/2]" src="http://l.wordpress.com/latex.php?latex=x+%5Cin+%5B0,1/2%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x \in [0,1/2]"/>, thus we can partition <img class="latex" title="{\Bbb R} = \bigcup_{x \in E} x + {\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D+=+%5Cbigcup_%7Bx+%5Cin+E%7D+x+++%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R} = \bigcup_{x \in E} x + {\Bbb Q}"/> for some <img class="latex" title="E \subset [0,1/2]" src="http://l.wordpress.com/latex.php?latex=E+%5Csubset+%5B0,1/2%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="E \subset [0,1/2]"/>.</span> By Example 2, <img class="latex" title="{\Bbb Q} \cap [0,1/2]" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Q%7D+%5Ccap+%5B0,1/2%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Q} \cap [0,1/2]"/> is countably <img class="latex" title="{\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Q}"/>-equidecomposable with <img class="latex" title="{\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Q}"/>, <span style="color:#ff0000;">which implies that <img class="latex" title="\bigcup_{x \in E} x + ({\Bbb Q} \cap [0,1/2])" src="http://l.wordpress.com/latex.php?latex=%5Cbigcup_%7Bx+%5Cin+E%7D+x+++(%7B%5CBbb+Q%7D+%5Ccap+%5B0,1/2%5D)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\bigcup_{x \in E} x + ({\Bbb Q} \cap [0,1/2])"/> is countably <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable with <img class="latex" title="\bigcup_{x \in E} x + {\Bbb Q}" src="http://l.wordpress.com/latex.php?latex=%5Cbigcup_%7Bx+%5Cin+E%7D+x+++%7B%5CBbb+Q%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\bigcup_{x \in E} x + {\Bbb Q}"/>.  Since latter set is <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> and the former set is contained in [0,1], the claim follows.</span> <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<p><span style="color:#ff0000;">Of course, the same proposition holds if [0,1] is replaced by any other interval.  As a quick consequence of this proposition and Exercise 2, we see that any subset of <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> containing an interval is <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable with <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>.  In particular, we have</span></p>
<blockquote><p><span style="color:#ff0000;"><strong>Corollary 1.</strong> Any subset of <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> containing an interval is countably <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-paradoxical.</span></p></blockquote>
<p><span style="color:#ff0000;">In particular, we see that any countably additive translation-invariant measure that measures every subset of <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>, must assign a zero or infinite measure to any set containing an interval.  In particular, it is not possible to extend Lebesgue measure to measure all subsets of <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>.</span></p>
<p>We now turn from countably paradoxical sets to finitely paradoxical sets.  Here, the situation is quite different: we can rule out many sets from being finitely paradoxical.  The simplest example is that of a finite set:</p>
<blockquote><p><strong>Proposition 2.</strong> If G acts on X, and A is a non-empty finite subset of X, then A is not finitely (or countably) G-paradoxical.</p></blockquote>
<p><strong>Proof.</strong> One easily sees that any two sets that are finitely or countably G-equidecomposable must have the same cardinality. The claim follows. <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<p>Now we consider the integers.</p>
<blockquote><p><strong>Proposition 3. </strong> Let the integers <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/> act on themselves by translation.  Then <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/> is not finitely <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/>-paradoxical.</p></blockquote>
<p><strong>Proof.</strong> The integers are of course infinite, and so Proposition 2 does not apply directly.  However, the key point is that the integers can be efficiently <em>truncated</em> to be finite, and so we will be able to adapt the Proposition 2 argument in our case.</p>
<p>Let’s see how.  Suppose for contradiction that we could partition <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/> into two sets A and B, which are in turn partitioned into finitely many pieces <img class="latex" title="A = \bigcup_{i=1}^n A_i" src="http://l.wordpress.com/latex.php?latex=A+=+%5Cbigcup_%7Bi=1%7D%5En+A_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A = \bigcup_{i=1}^n A_i"/> and <img class="latex" title="B = \bigcup_{j=1}^m B_j" src="http://l.wordpress.com/latex.php?latex=B+=+%5Cbigcup_%7Bj=1%7D%5Em+B_j&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="B = \bigcup_{j=1}^m B_j"/>, such that <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/> can be partitioned as <img class="latex" title="{\Bbb Z} = \bigcup_{i=1}^n A_i + a_i" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D+=+%5Cbigcup_%7Bi=1%7D%5En+A_i+++a_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z} = \bigcup_{i=1}^n A_i + a_i"/> and <img class="latex" title="{\Bbb Z} = \bigcup_{j=1}^m B_j + b_j" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D+=+%5Cbigcup_%7Bj=1%7D%5Em+B_j+++b_j&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z} = \bigcup_{j=1}^m B_j + b_j"/> for some integers <img class="latex" title="a_1, \ldots,a_n,b_1,\ldots,b_m" src="http://l.wordpress.com/latex.php?latex=a_1,+%5Cldots,a_n,b_1,%5Cldots,b_m&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="a_1, \ldots,a_n,b_1,\ldots,b_m"/>.</p>
<p>Now let N be a large integer (much larger than <img class="latex" title="n,m,a_1,\ldots,a_n,b_1,\ldots,b_m" src="http://l.wordpress.com/latex.php?latex=n,m,a_1,%5Cldots,a_n,b_1,%5Cldots,b_m&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="n,m,a_1,\ldots,a_n,b_1,\ldots,b_m"/>).  We truncate <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/> to the interval <img class="latex" title="{}[-N,N] := \{-N,\ldots,N\}" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B-N,N%5D+:=+%5C%7B-N,%5Cldots,N%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[-N,N] := \{-N,\ldots,N\}"/>.  Clearly</p>
<p style="text-align:center;"><img class="latex" title="A \cap [-N,N] = \bigcup_{i=1}^n A_i \cap [-N,N]" src="http://l.wordpress.com/latex.php?latex=A+%5Ccap+%5B-N,N%5D+=+%5Cbigcup_%7Bi=1%7D%5En+A_i+%5Ccap+%5B-N,N%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A \cap [-N,N] = \bigcup_{i=1}^n A_i \cap [-N,N]"/>.  (1)</p>
<p>and</p>
<p style="text-align:center;"><img class="latex" title="{}[-N,N] = \bigcup_{i=1}^n (A_i + a_i) \cap [-N,N]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B-N,N%5D+=+%5Cbigcup_%7Bi=1%7D%5En+(A_i+++a_i)+%5Ccap+%5B-N,N%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[-N,N] = \bigcup_{i=1}^n (A_i + a_i) \cap [-N,N]"/>.  (2)</p>
<p style="text-align:left;">From (2) we see that the set <img class="latex" title="\bigcup_{i=1}^n (A_i \cap [-N,N]) + a_i" src="http://l.wordpress.com/latex.php?latex=%5Cbigcup_%7Bi=1%7D%5En+(A_i+%5Ccap+%5B-N,N%5D)+++a_i&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\bigcup_{i=1}^n (A_i \cap [-N,N]) + a_i"/> differs from <img class="latex" title="{}[-N,N]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B-N,N%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[-N,N]"/> by only O(1) elements, where the bound in the O(1) expression can depend on <img class="latex" title="n,a_1,\ldots,a_n" src="http://l.wordpress.com/latex.php?latex=n,a_1,%5Cldots,a_n&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="n,a_1,\ldots,a_n"/> but does not depend on N.  (The point here is that [-N,N] is “almost” translation-invariant in some sense.) Comparing this with (1) we see that</p>
<p style="text-align:center;"><img class="latex" title="|[-N,N]| \leq |A \cap [-N,N]| + O(1)" src="http://l.wordpress.com/latex.php?latex=%7C%5B-N,N%5D%7C+%5Cleq+%7CA+%5Ccap+%5B-N,N%5D%7C+++O(1)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="|[-N,N]| \leq |A \cap [-N,N]| + O(1)"/>. (3)</p>
<p style="text-align:left;">Similarly with A replaced by B.  Summing, we obtain</p>
<p style="text-align:center;"><img class="latex" title="2 |[-N,N]| \leq |[-N,N]| + O(1)" src="http://l.wordpress.com/latex.php?latex=2+%7C%5B-N,N%5D%7C+%5Cleq+%7C%5B-N,N%5D%7C+++O(1)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="2 |[-N,N]| \leq |[-N,N]| + O(1)"/>, (4)</p>
<p style="text-align:left;">but this is absurd for N sufficiently large, and the claim follows.  <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<p style="text-align:left;"><strong>Exercise 4.</strong> Use the above argument to show that in fact no infinite subset of <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/> is finitely <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/>-paradoxical; combining this with Example 2, we see that the only finitely <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/>-paradoxical set of integers is the empty set. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;">The above argument can be generalised to an important class of groups:</p>
<blockquote>
<p style="text-align:left;"><strong>Definition 2.</strong> (Amenability)  Let <img class="latex" title="G = (G,\cdot)" src="http://l.wordpress.com/latex.php?latex=G+=+(G,%5Ccdot)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = (G,\cdot)"/> be a discrete, at most countable, group.  A <em><a href="http://en.wikipedia.org/wiki/F%C3%B8lner_sequence">Følner sequence</a></em> is a sequence <img class="latex" title="F_1, F_2, F_3, \ldots" src="http://l.wordpress.com/latex.php?latex=F_1,+F_2,+F_3,+%5Cldots&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="F_1, F_2, F_3, \ldots"/> of finite subsets of G with <img class="latex" title="\bigcup_{N=1}^\infty F_N = G" src="http://l.wordpress.com/latex.php?latex=%5Cbigcup_%7BN=1%7D%5E%5Cinfty+F_N+=+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\bigcup_{N=1}^\infty F_N = G"/> with the property that <img class="latex" title="\lim_{N \to \infty} \frac{|g F_N \Delta F_N|}{|F_N|} = 0" src="http://l.wordpress.com/latex.php?latex=%5Clim_%7BN+%5Cto+%5Cinfty%7D+%5Cfrac%7B%7Cg+F_N+%5CDelta+F_N%7C%7D%7B%7CF_N%7C%7D+=+0&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\lim_{N \to \infty} \frac{|g F_N \Delta F_N|}{|F_N|} = 0"/> for all <img class="latex" title="g \in G" src="http://l.wordpress.com/latex.php?latex=g+%5Cin+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g \in G"/>, where <img class="latex" title="\Delta" src="http://l.wordpress.com/latex.php?latex=%5CDelta&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Delta"/> denotes symmetric difference.  A discrete, at most countable, group G is <a href="http://en.wikipedia.org/wiki/Amenable_group">amenable</a> if it contains at least one Følner sequence.  Of course, one can define the same concept for additive groups <img class="latex" title="G = (G,+)" src="http://l.wordpress.com/latex.php?latex=G+=+(G,+)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = (G,+)"/>.</p>
</blockquote>
<p style="text-align:left;"><strong>Remark 1.</strong> One can define amenability for uncountable groups by replacing the notion of a Følner sequence with a Følner <a href="http://en.wikipedia.org/wiki/Net_(mathematics)">net</a>.  Similarly, one can define amenability for <a href="http://en.wikipedia.org/wiki/Locally_compact_space">locally compact</a> <a href="http://en.wikipedia.org/wiki/Hausdorff_space">Hausdorff</a> groups equipped with a <a href="http://en.wikipedia.org/wiki/Haar_measure">Haar measure</a> by using that measure in place of cardinality in the above definition.  However, we will not need these more general notions of amenability here.  The notion of amenability was first introduced (though not by this name, or by this definition) by von Neumann, precisely in order to study these sorts of decomposition paradoxes.  <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><strong>Example 3. </strong> The sequence <img class="latex" title="{}[-N,N]" src="http://l.wordpress.com/latex.php?latex=%7B%7D%5B-N,N%5D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{}[-N,N]"/> for <img class="latex" title="N=1,2,3,\ldots" src="http://l.wordpress.com/latex.php?latex=N=1,2,3,%5Cldots&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="N=1,2,3,\ldots"/> is a Følner sequence for the integers <img class="latex" title="{\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb Z}"/>, which are hence an amenable group. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><strong>Exercise 5.</strong> Show that any abelian discrete group that is at most countable, is amenable. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><strong>Exercise 6.</strong> Show that any amenable discrete group G that is at most countable is not finitely G-paradoxical, when acting on itself.   Combined with Exercise 3, we see that if such a group G acts on a non-empty space X, then X is not finitely G-paradoxical.  <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><strong>Remark 2.</strong> Exercise 6 suggests that an amenable group G hould be able to support a non-trivial finitely additive measure which is invariant under left-translations, and can measure all subsets of G.  <span style="color:#ff0000;">Indeed, one can even create a finitely additive probability measure, for instance by selecting a non-principal <a href="http://terrytao.wordpress.com/2007/06/25/ultrafilters-nonstandard-analysis-and-epsilon-management/" class="snap_noshots">ultrafilter</a> <img class="latex" title="p \in {\beta } {\Bbb N}" src="http://l.wordpress.com/latex.php?latex=p+%5Cin+%7B%5Cbeta+%7D+%7B%5CBbb+N%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="p \in {\beta } {\Bbb N}"/> and a Følner sequence <img class="latex" title="(F_n)_{n=1}^\infty" src="http://l.wordpress.com/latex.php?latex=(F_n)_%7Bn=1%7D%5E%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="(F_n)_{n=1}^\infty"/> and defining <img class="latex" title="\mu(A) := \lim_{n \to p} |A \cap F_n|/|F_n|" src="http://l.wordpress.com/latex.php?latex=%5Cmu(A)+:=+%5Clim_%7Bn+%5Cto+p%7D+%7CA+%5Ccap+F_n%7C/%7CF_n%7C&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\mu(A) := \lim_{n \to p} |A \cap F_n|/|F_n|"/> for all <img class="latex" title="A \in G" src="http://l.wordpress.com/latex.php?latex=A+%5Cin+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A \in G"/>.</span> <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;">The reals <img class="latex" title="{\Bbb R} = ({\Bbb R},+)" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D+=+(%7B%5CBbb+R%7D,+)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R} = ({\Bbb R},+)"/> (which we will give the discrete topology!) are uncountable, and thus not amenable by the narrow definition of Definition 2.  However, observe from Exercise 5 that any <a href="http://en.wikipedia.org/wiki/Finitely_generated_group">finitely generated</a> subgroup of the reals is amenable (or equivalently, that the reals themselves with the discrete topology are amenable, using the Følner net generalisation of Definition 2).  Also, we have the following easy observation:</p>
<p style="text-align:left;"><strong>Exercise 7.</strong> Let G act on X, and let A be a subset of X which is finitely G-paradoxical.  Show that there exists a finitely generated subgroup H of G such that A is finitely H-paradoxical. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;">From this, we see that <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> is not finitely <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-paradoxical.  But we can in fact say much more:</p>
<blockquote>
<p style="text-align:left;"><strong>Proposition 4.</strong> Let A be a non-empty subset of <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>.  Then A is not finitely <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-paradoxical.</p>
</blockquote>
<p style="text-align:left;"><strong>Proof.</strong> Suppose for contradiction that we can partition A into two sets <img class="latex" title="A = A_1 \cup A_2" src="http://l.wordpress.com/latex.php?latex=A+=+A_1+%5Ccup+A_2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A = A_1 \cup A_2"/> which are both finitely <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable with A.  This gives us two maps <img class="latex" title="f_1: A \to A_1" src="http://l.wordpress.com/latex.php?latex=f_1:+A+%5Cto+A_1&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f_1: A \to A_1"/>, <img class="latex" title="f_2: A \to A_2" src="http://l.wordpress.com/latex.php?latex=f_2:+A+%5Cto+A_2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f_2: A \to A_2"/> which are piecewise given by a finite number of translations; thus there exists a finite set <img class="latex" title="g_1,\ldots,g_d \in {\Bbb R}" src="http://l.wordpress.com/latex.php?latex=g_1,%5Cldots,g_d+%5Cin+%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g_1,\ldots,g_d \in {\Bbb R}"/> such that <img class="latex" title="f_i(x) \in x + \{g_1,\ldots,g_d\}" src="http://l.wordpress.com/latex.php?latex=f_i(x)+%5Cin+x+++%5C%7Bg_1,%5Cldots,g_d%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f_i(x) \in x + \{g_1,\ldots,g_d\}"/> for all <img class="latex" title="x \in A" src="http://l.wordpress.com/latex.php?latex=x+%5Cin+A&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x \in A"/> and <img class="latex" title="i=1,2" src="http://l.wordpress.com/latex.php?latex=i=1,2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="i=1,2"/>.</p>
<p style="text-align:left;">For any integer <img class="latex" title="N \geq 1" src="http://l.wordpress.com/latex.php?latex=N+%5Cgeq+1&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="N \geq 1"/>, consider the <img class="latex" title="2^N" src="http://l.wordpress.com/latex.php?latex=2%5EN&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="2^N"/> composition maps <img class="latex" title="f_{i_1} \circ \ldots \circ f_{i_N}: A \to A" src="http://l.wordpress.com/latex.php?latex=f_%7Bi_1%7D+%5Ccirc+%5Cldots+%5Ccirc+f_%7Bi_N%7D:+A+%5Cto+A&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f_{i_1} \circ \ldots \circ f_{i_N}: A \to A"/> for <img class="latex" title="i_1,\ldots,i_N \in \{1,2\}" src="http://l.wordpress.com/latex.php?latex=i_1,%5Cldots,i_N+%5Cin+%5C%7B1,2%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="i_1,\ldots,i_N \in \{1,2\}"/>.  From the disjointness of <img class="latex" title="A_1,A_2" src="http://l.wordpress.com/latex.php?latex=A_1,A_2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="A_1,A_2"/> and an easy induction we see that the ranges of all these maps are disjoint, and so for any <img class="latex" title="x \in A" src="http://l.wordpress.com/latex.php?latex=x+%5Cin+A&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x \in A"/> the <img class="latex" title="2^N" src="http://l.wordpress.com/latex.php?latex=2%5EN&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="2^N"/> quantities <img class="latex" title="f_{i_1} \circ \ldots \circ f_{i_N}(x)" src="http://l.wordpress.com/latex.php?latex=f_%7Bi_1%7D+%5Ccirc+%5Cldots+%5Ccirc+f_%7Bi_N%7D(x)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f_{i_1} \circ \ldots \circ f_{i_N}(x)"/> are distinct.  On the other hand, we have</p>
<p style="text-align:center;"><img class="latex" title="f_{i_1} \circ \ldots \circ f_{i_N}(x) \in x + \{g_1,\ldots,g_d\} + \ldots + \{g_1,\ldots,g_d\}" src="http://l.wordpress.com/latex.php?latex=f_%7Bi_1%7D+%5Ccirc+%5Cldots+%5Ccirc+f_%7Bi_N%7D(x)+%5Cin+x+++%5C%7Bg_1,%5Cldots,g_d%5C%7D+++%5Cldots+++%5C%7Bg_1,%5Cldots,g_d%5C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f_{i_1} \circ \ldots \circ f_{i_N}(x) \in x + \{g_1,\ldots,g_d\} + \ldots + \{g_1,\ldots,g_d\}"/>. (5)</p>
<p style="text-align:left;">Simple combinatorics (relying primarily on the abelian nature of <img class="latex" title="({\Bbb R},+)" src="http://l.wordpress.com/latex.php?latex=(%7B%5CBbb+R%7D,+)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="({\Bbb R},+)"/> shows that the number of values on the RHS of (5) is at most <img class="latex" title="N^d" src="http://l.wordpress.com/latex.php?latex=N%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="N^d"/>.  But for sufficiently large N, we have <img class="latex" title="2^N &gt; N^d" src="http://l.wordpress.com/latex.php?latex=2%5EN+%3E+N%5Ed&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="2^N &gt; N^d"/>, giving the desired contradiction. <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<p style="text-align:left;">Let us call a group G <em>supramenable </em>if every non-empty subset of G is not finitely G-paradoxical; thus <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> is supramenable.  From Exercise 3 we see that if a supramenable group acts on any space X, then the only finitely G-paradoxical subset of X is the empty set.</p>
<p style="text-align:left;"><strong>Exercise 8.</strong> We say that a group <img class="latex" title="G = (G,\cdot)" src="http://l.wordpress.com/latex.php?latex=G+=+(G,%5Ccdot)&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = (G,\cdot)"/> has <em>subexponential growth</em> if for any finite subset S of G, we have <img class="latex" title="\lim_{n \to \infty} |S^n|^{1/n} = 1" src="http://l.wordpress.com/latex.php?latex=%5Clim_%7Bn+%5Cto+%5Cinfty%7D+%7CS%5En%7C%5E%7B1/n%7D+=+1&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\lim_{n \to \infty} |S^n|^{1/n} = 1"/>, where <img class="latex" title="S^n = S \cdot \ldots \cdot S" src="http://l.wordpress.com/latex.php?latex=S%5En+=+S+%5Ccdot+%5Cldots+%5Ccdot+S&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="S^n = S \cdot \ldots \cdot S"/> is the set of n-fold products of elements of S.  Show that every group of subexponential growth is supramenable. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><strong>Exercise 9.</strong> Show that every abelian group has subexponential growth (and is thus supramenable.  More generally, show that every <a href="http://en.wikipedia.org/wiki/Nilpotent_group">nilpotent</a> group has subexponential growth and is thus also supramenable. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><strong>Exercise 10.</strong> Show that if two finite unions of intervals in <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/> are finitely <img class="latex" title="{\Bbb R}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}"/>-equidecomposable, then they must have the same length.  (Hint: reduce to the case when both sets consist of a single interval.  First show that the lengths of these intervals cannot differ by more than a factor of two, and then <a href="http://terrytao.wordpress.com/2007/09/05/amplification-arbitrage-and-the-tensor-power-trick/" class="snap_shots">amplify</a> this fact by iteration to conclude the result.) <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:left;"><span style="color:#ff0000;"><strong>Remark 3.</strong> </span><span style="color:#ff0000;"><span style="color:#ff0000;">We</span> already saw that amenable groups G admit finitely additive translation-invariant probability measures that measure all subsets of G (Remark 2 can be extended to the uncountable case); in fact, this turns out to be an equivalent definition of amenability.  It turns out that supramenable groups G enjoy a stronger property, namely that given any non-empty set A on G, there exists a finitely additive translation-invariant measure on G that assigns the measure 1 to A; this is basically a deep result of Tarski.</span> <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p style="text-align:center;">– Two-dimensional equidecomposability –</p>
<p>Now we turn to equidecomposability on the plane <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/>.  The nature of equidecomposability depends on what group G of symmetries we wish to act on the plane.</p>
<p>Suppose first that we only allow ourselves to translate various sets in the planes, but not to rotate them; thus <img class="latex" title="G = {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=G+=+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = {\Bbb R}^2"/>.  As this group is abelian, it is supramenable by Exercise 9, and so any non-empty subset A of the plane will not be finitely <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/>-paradoxical sets; <span style="color:#ff0000;">indeed, by Remark 3, there exists a finitely additive translation-invariant measure that gives A the measure 1.  On the other hand, it is easy to adapt Corollary 1 to see that any subset of the plane containing a ball will be countably <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/>-paradoxical</span>.</p>
<p>Now suppose we allow both translations and rotations, thus G is now the group <img class="latex" title="SO(2) \;times {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5C;times+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \;times {\Bbb R}^2"/> of (orientation-preserving) isometries <img class="latex" title="x \mapsto e^{i\theta} x + v" src="http://l.wordpress.com/latex.php?latex=x+%5Cmapsto+e%5E%7Bi%5Ctheta%7D+x+++v&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="x \mapsto e^{i\theta} x + v"/> for <img class="latex" title="v \in {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=v+%5Cin+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="v \in {\Bbb R}^2"/> and <img class="latex" title="\theta \in {\Bbb R}/2\pi {\Bbb Z}" src="http://l.wordpress.com/latex.php?latex=%5Ctheta+%5Cin+%7B%5CBbb+R%7D/2%5Cpi+%7B%5CBbb+Z%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\theta \in {\Bbb R}/2\pi {\Bbb Z}"/>, where <img class="latex" title="e^{i\theta}" src="http://l.wordpress.com/latex.php?latex=e%5E%7Bi%5Ctheta%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="e^{i\theta}"/> denotes the anti-clockwise rotation by <img class="latex" title="\theta" src="http://l.wordpress.com/latex.php?latex=%5Ctheta&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\theta"/> around the origin.  This group is no longer abelian, or even nilpotent, so Exercise 9 no longer applies.  Indeed, it turns out that G is no longer supramenable.  This is a consequence of the following three lemmas:</p>
<blockquote><p><strong>Lemma 1.</strong> Let G be a group which contains a free semigroup on two generators (in other words, there exist group elements <img class="latex" title="g, h \in G" src="http://l.wordpress.com/latex.php?latex=g,+h+%5Cin+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g, h \in G"/> such that all the words involving g and h (but not <img class="latex" title="g^{-1}" src="http://l.wordpress.com/latex.php?latex=g%5E%7B-1%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g^{-1}"/> or <img class="latex" title="h^{-1}" src="http://l.wordpress.com/latex.php?latex=h%5E%7B-1%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="h^{-1}"/>) are distinct).  Then G contains a non-empty finitely G-paradoxical set.   In other words, G is not supramenable.</p></blockquote>
<p><strong>Proof.</strong> Let S be the semigroup generated by g and h (i.e. the set of all words formed by g and h, including the empty word (i.e. group identity).  Observe that gS and hS are disjoint subsets of S that are clearly G-equidecomposable with S.  The claim then follows from Exercise 2.  <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<blockquote><p><strong>Lemma 2.</strong> (Semigroup <a href="http://en.wikipedia.org/wiki/Ping-pong_lemma">ping-pong lemma</a>)  Let G act on a space X, let g, h be elements of G, and suppose that there exists a non-empty subset A of X such that gA and hA are disjoint subsets of A.  Then g, h generate a free semigroup.</p></blockquote>
<p><strong>Proof. </strong> As in the proof of Proposition 4, we see from induction that for two different words w, w’ generated by g, h, the sets wA and w’A are disjoint, and the claim follows. <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<blockquote><p><strong>Lemma 3.</strong> The group <img class="latex" title="G = SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=G+=+SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="G = SO(2) \ltimes {\Bbb R}^2"/> contains a free semigroup on two generators.</p></blockquote>
<p><strong>Proof. </strong> It is convenient to identify <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/> with the complex plane <img class="latex" title="{\Bbb C}" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+C%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb C}"/>.  We set g to be the rotation <img class="latex" title="g x := \omega x" src="http://l.wordpress.com/latex.php?latex=g+x+:=+%5Comega+x&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="g x := \omega x"/> for some <a href="http://en.wikipedia.org/wiki/Transcendental_number">transcendental</a> phase <img class="latex" title="\omega = e^{2\pi i \theta}" src="http://l.wordpress.com/latex.php?latex=%5Comega+=+e%5E%7B2%5Cpi+i+%5Ctheta%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\omega = e^{2\pi i \theta}"/> be such that <img class="latex" title="\omega := e^{2\pi i \theta}" src="http://l.wordpress.com/latex.php?latex=%5Comega+:=+e%5E%7B2%5Cpi+i+%5Ctheta%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\omega := e^{2\pi i \theta}"/> is transcendental (such a phase must exist, since the set of algebraic complex numbers is countable), and let <img class="latex" title="h" src="http://l.wordpress.com/latex.php?latex=h&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="h"/> be the translation <img class="latex" title="hx := x+1" src="http://l.wordpress.com/latex.php?latex=hx+:=+x+1&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="hx := x+1"/>.  Observe that g and h act on the set A of polynomials in <img class="latex" title="\omega" src="http://l.wordpress.com/latex.php?latex=%5Comega&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\omega"/> with non-negative integer coefficients, and that gA and hA are disjoint.  The claim now follows from Lemma 2.  <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<p>Combining Lemma 1 and Lemma 3 to create a countable, finitely paradoxical subset of <img class="latex" title="SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \ltimes {\Bbb R}^2"/>, and then letting that set act on a generic point in the plane (noting that each group element in <img class="latex" title="SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \ltimes {\Bbb R}^2"/> has at most one fixed point), we obtain</p>
<blockquote><p><strong>Corollary 2.</strong> (Sierpinski-Mazurkiewicz paradox) There exist non-empty finitely <img class="latex" title="SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \ltimes {\Bbb R}^2"/>-paradoxical subsets of the plane.</p></blockquote>
<p>We have seen that the group of rigid motions is not supramenable.  Nevertheless, it is still amenable, thanks to the following lemma:</p>
<blockquote><p><strong>Lemma 4.</strong> Suppose one has a <a href="http://en.wikipedia.org/wiki/Short_exact_sequence">short exact sequence</a> <img class="latex" title="0 \to H \to G \to K \to 0" src="http://l.wordpress.com/latex.php?latex=0+%5Cto+H+%5Cto+G+%5Cto+K+%5Cto+0&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="0 \to H \to G \to K \to 0"/> of discrete, at most countable, groups, and suppose one has a choice function <img class="latex" title="\phi: K \to G" src="http://l.wordpress.com/latex.php?latex=%5Cphi:+K+%5Cto+G&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\phi: K \to G"/> that inverts the projection of G to K (<span style="color:#ff0000;">the existence of which is automatic, from the axiom of choice, </span>or if G is finitely generated).  If H and K are amenable, then so is G.</p></blockquote>
<p><strong>Proof. </strong>Let <img class="latex" title="(A_n)_{n=1}^\infty" src="http://l.wordpress.com/latex.php?latex=(A_n)_%7Bn=1%7D%5E%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="(A_n)_{n=1}^\infty"/> and <img class="latex" title="(B_n)_{n=1}^\infty" src="http://l.wordpress.com/latex.php?latex=(B_n)_%7Bn=1%7D%5E%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="(B_n)_{n=1}^\infty"/> be Følner sequences for H and K respectively.  Let <img class="latex" title="f: {\Bbb N} \to {\Bbb N}" src="http://l.wordpress.com/latex.php?latex=f:+%7B%5CBbb+N%7D+%5Cto+%7B%5CBbb+N%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="f: {\Bbb N} \to {\Bbb N}"/> be a rapidly growing function, and let <img class="latex" title="(F_n)_{n=1}^\infty" src="http://l.wordpress.com/latex.php?latex=(F_n)_%7Bn=1%7D%5E%5Cinfty&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="(F_n)_{n=1}^\infty"/> be the set <img class="latex" title="F_n := \bigcup_{x \in B_n} \phi(x) \cdot A_{f(n)}" src="http://l.wordpress.com/latex.php?latex=F_n+:=+%5Cbigcup_%7Bx+%5Cin+B_n%7D+%5Cphi(x)+%5Ccdot+A_%7Bf(n)%7D&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="F_n := \bigcup_{x \in B_n} \phi(x) \cdot A_{f(n)}"/>.  One easily verifies that this is a Følner sequence for G if f is sufficiently rapidly growing.  <img class="latex" title="\Box" src="http://l.wordpress.com/latex.php?latex=%5CBox&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\Box"/></p>
<p><strong>Exercise 11.</strong> Show that any finitely generated <a href="http://en.wikipedia.org/wiki/Solvable_group">solvable</a> group is amenable. <span style="color:#ff0000;">More generally, show that any discrete, at most countable, solvable group is amenable.</span> <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p><strong>Exercise 12.</strong> Show that any finitely generated subgroup of <img class="latex" title="SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \ltimes {\Bbb R}^2"/> is amenable.  (Hint: use the short exact sequence <img class="latex" title="0 \to {\Bbb R}^2 \to SO(2) \ltimes {\Bbb R}^2 \to SO(2) \to 0" src="http://l.wordpress.com/latex.php?latex=0+%5Cto+%7B%5CBbb+R%7D%5E2+%5Cto+SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2+%5Cto+SO(2)+%5Cto+0&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="0 \to {\Bbb R}^2 \to SO(2) \ltimes {\Bbb R}^2 \to SO(2) \to 0"/>, which shows that <img class="latex" title="SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \ltimes {\Bbb R}^2"/> is solvable (in fact it is <a href="http://en.wikipedia.org/wiki/Metabelian">metabelian</a>)).  Conclude that <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/> is not finitely <img class="latex" title="SO(2) \ltimes {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Cltimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \ltimes {\Bbb R}^2"/>-paradoxical. <img class="latex" title="\diamond" src="http://l.wordpress.com/latex.php?latex=%5Cdiamond&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="\diamond"/></p>
<p>Finally, we show a result of Banach.</p>
<blockquote><p><strong>Proposition 5.</strong> The unit disk D in <img class="latex" title="{\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="{\Bbb R}^2"/> is not finitely <img class="latex" title="SO(2) \times {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Ctimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454&amp;s=0" alt="SO(2) \times {\Bbb R}^2"/>-paradoxical.</p></blockquote>
<p><strong>Proof.</strong> If the claim failed, then D would be finitely <img class="latex" title="SO(2) \times {\Bbb R}^2" src="http://l.wordpress.com/latex.php?latex=SO(2)+%5Ctimes+%7B%5CBbb+R%7D%5E2&amp;bg=ffffff&amp;fg=545454