<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Concrete Nonsense &#187; Algebra</title>
	<atom:link href="http://concretenonsense.wordpress.com/category/algebra/feed/" rel="self" type="application/rss+xml" />
	<link>http://concretenonsense.wordpress.com</link>
	<description>A group blog about mathematics</description>
	<lastBuildDate>Mon, 30 Nov 2009 21:48:46 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<cloud domain='concretenonsense.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://www.gravatar.com/blavatar/2b77f97368a020180b21c93e224b3ae1?s=96&#038;d=http://s.wordpress.com/i/buttonw-com.png</url>
		<title>Concrete Nonsense &#187; Algebra</title>
		<link>http://concretenonsense.wordpress.com</link>
	</image>
			<item>
		<title>A Free Association On Basic Adjoints</title>
		<link>http://concretenonsense.wordpress.com/2009/10/02/a-free-association-on-basic-adjoints/</link>
		<comments>http://concretenonsense.wordpress.com/2009/10/02/a-free-association-on-basic-adjoints/#comments</comments>
		<pubDate>Fri, 02 Oct 2009 23:52:10 +0000</pubDate>
		<dc:creator>yanzhang</dc:creator>
				<category><![CDATA[Algebra]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=713</guid>
		<description><![CDATA[I&#8217;ve been betraying the title of this blog and doing some abstract nonsense lately, mostly to relearn algebraic geometry for the -th time for some embarrassingly large . With the memory capabilities of a muffin, I am practically starting over each time. Luckily, each adventure feels slightly more beatable (exp points?), since I have a [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=713&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>I&#8217;ve been betraying the title of this blog and doing some abstract nonsense lately, mostly to relearn algebraic geometry for the <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' />-th time for some embarrassingly large <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' />. With the memory capabilities of a muffin, I am practically starting over each time. Luckily, each adventure feels slightly more beatable (exp points?), since I have a few more examples I can use for myself. Masnevets and I had a good discussion about a few basic examples of adjoint functors (recall the definition <a href="http://http://en.wikipedia.org/wiki/Adjoint_functor" target="_blank">here</a>: basically, we need a pair of functors <img src='http://l.wordpress.com/latex.php?latex=F+%5Ccolon+C+%5Cto+D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F \colon C \to D' title='F \colon C \to D' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=G+%5Ccolon+D+%5Cto+C&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G \colon D \to C' title='G \colon D \to C' class='latex' /> such that we have a natural isomorphism <img src='http://l.wordpress.com/latex.php?latex=%5Chom_D%28X%2C+F%28Y%29%29+%5Ccong+%5Chom_C%28G%28X%29%2C+Y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\hom_D(X, F(Y)) \cong \hom_C(G(X), Y)' title='\hom_D(X, F(Y)) \cong \hom_C(G(X), Y)' class='latex' />), and thus we have a new Concrete Nonsense post.</p>
<p>Before we start, I want to state that I&#8217;m trying something new. This post is <strong>not</strong> intended to be an introduction to adjoints as I originally envisioned &#8211; I realized that there are many better sources for that. Instead, I&#8217;ll try to do a free association that juxtoposes a few elementary concepts. You don&#8217;t even have to know the definitions of adjoints to start seeing what I&#8217;m getting to, since I&#8217;ll be namedropping algebraic structures like Kanye West.</p>
<p>My first introduction to adjoints was from algebraic topology, where you naturally bump into the functors <img src='http://l.wordpress.com/latex.php?latex=%5Cotimes_R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\otimes_R' title='\otimes_R' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Chom%28R%2C+-%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\hom(R, -)' title='\hom(R, -)' class='latex' />. It was unnecessary at the time (for the scope of the course, at least) to know that they were adjoints, but now I know them as the &#8220;tensor-hom adjunction pair&#8221; (saying &#8220;tensor-hom&#8221; a lot helps me remember tensor as the left adjoint and hom as the right). Furthermore,  knowing this relationship allows me to remember some other things &#8211; in particular, knowing the left- and right- exactness of these functors, which I used to always mix up. Left adjoints are always right-exact, and right adjoints are always left-exact. Combined with knowing that tensoring is a left-adjoint, I now know that tensoring is right-exact and adjoints are left-exact.</p>
<p><span id="more-713"></span>I&#8217;ll now make a digression pertaining to something which I believe is important but seldom discussed. By now, some readers are probably complaining that my previous statement doesn&#8217;t make it easier to remember anything, because I have to remember an equally arbitrary fact &#8211; and what if our brains find it more intuitive that &#8220;left adjoints would be left-exact,&#8221; which is wrong? In my experiences, the sets of things that are easy to remember for mathematicians are extremely different from one person to the next. Thus, it may help (especially for &#8220;elementary&#8221; topics such as this one) to just chain lots of little ideas together, so if someone links concepts A, B, and C, and Alice finds it easier to remember B and C from A, she&#8217;ll benefit just as much as Bob, who likes to remember A and C from B (and Chris is sad that nobody likes C except him). As math presentation tends to be fairly &#8220;structured&#8221; &#8211; no surprise, knowing mathematicians &#8211; I wouldn&#8217;t mind seeing more &#8220;free associations&#8221; in print or the blogosphere, because this is the form of communication which reminds me most of chatting about math with other people while drinking coffee in the common room, an experience which has often taught me <strong>a</strong> <strong>lot</strong> more than going to most lectures.</p>
<p>(since this is a free association, before we go back to adjoints, we might as well see another way to remember the exactness assignments from Masnevets. A good &#8220;toy exact sequence&#8221; to use here is <img src='http://l.wordpress.com/latex.php?latex=0+%5Cto+%5Cmathbb%7BZ%7D+%5Cto+%5Cmathbb%7BZ%7D+%5Cto+%5Cmathbb%7BZ%7D%2F2%5Cmathbb%7BZ%7D+%5Cto+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0 \to \mathbb{Z} \to \mathbb{Z} \to \mathbb{Z}/2\mathbb{Z} \to 0' title='0 \to \mathbb{Z} \to \mathbb{Z} \to \mathbb{Z}/2\mathbb{Z} \to 0' class='latex' />, where the second map is multiplication by <img src='http://l.wordpress.com/latex.php?latex=2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='2' title='2' class='latex' /> and the third is taking mods . Tensoring by <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BZ%7D%2F2%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{Z}/2\mathbb{Z}' title='\mathbb{Z}/2\mathbb{Z}' class='latex' /> turns the second map into the zero map, so tensoring is not left-exact and thus must be right-exact.)</p>
<p>Many of you may be surprised by tensor-hom as my first choice of adjoint functors &#8211; that&#8217;s only because I learned that one first (this is a lie, and we&#8217;ll come back to later). There&#8217;s a much easier example using the forgetful functor. Consider the forgetful functor <img src='http://l.wordpress.com/latex.php?latex=G+%5Ccolon+%5Cmathrm%7BGrp%7D+%5Cto+%5Cmathrm%7BSet%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G \colon \mathrm{Grp} \to \mathrm{Set}' title='G \colon \mathrm{Grp} \to \mathrm{Set}' class='latex' />. It happens to be the right adjoint to the functor <img src='http://l.wordpress.com/latex.php?latex=F+%5Ccolon+%5Cmathrm%7BSet%7D+%5Cto+%5Cmathrm%7BGrp%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F \colon \mathrm{Set} \to \mathrm{Grp}' title='F \colon \mathrm{Set} \to \mathrm{Grp}' class='latex' /> that sends a set to a free group generated by the set. The intuition here is this: by the definition of adjunction, we want &#8220;the number of maps out of the image of F&#8221; to be &#8220;the same&#8221; as &#8220;the number of maps into the image of G.&#8221; When <img src='http://l.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> forgets so much structure, we&#8217;ll get lots of maps into the set <img src='http://l.wordpress.com/latex.php?latex=G%28Y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G(Y)' title='G(Y)' class='latex' />. To get lots of maps out of <img src='http://l.wordpress.com/latex.php?latex=F%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(X)' title='F(X)' class='latex' />, we want a lot of freedom on the structure, and hence the free group. Of course, there&#8217;s nothing particularly binding here about groups; we can do this in general to get a &#8220;free functor&#8221; when we have a forgetful functor from a category of other algebraic structures to sets (we can&#8217;t do this *all* the time, but most of the time we are fine. I don&#8217;t understand the conditions here too well, which involves an overloading of the word &#8220;variety,&#8221;  so I won&#8217;t expound).</p>
<p>In fact, let&#8217;s take it a step further. We don&#8217;t only have to forget into sets. We can forget, for example, from abelian groups into groups, or from associative algebras into Lie algebras. What did we forget in these two cases? Commuting relations and the product, respectively. So intuitively, to &#8220;match the complexity&#8221; of the two <img src='http://l.wordpress.com/latex.php?latex=%5Chom&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\hom' title='\hom' class='latex' />&#8217;s, we want to get just as much structure back: we want to make things commute in an arbitrary group; we want to be able to multiply things in a Lie algebra. It was quite a joyful &#8220;but of course&#8221; when I realized that the left adjoints of the two functors above came out to be abelianization and the universal enveloping algebra, respectively.</p>
<p>Finally, in this forgetful context I&#8217;ll return to the actual first example of adjoint functors I&#8217;ve seen (though I definitely did not know it in that context at the time). When we restrict a representation <img src='http://l.wordpress.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' />of <img src='http://l.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' />, or equivalently a <img src='http://l.wordpress.com/latex.php?latex=F%5BG%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F[G]' title='F[G]' class='latex' />-module, to a sub-representation <img src='http://l.wordpress.com/latex.php?latex=%5Cmathrm%7BRes%7D+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathrm{Res} V' title='\mathrm{Res} V' class='latex' /> of <img src='http://l.wordpress.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='H' title='H' class='latex' />, we&#8217;re &#8220;forgetting&#8221; how the other elements of <img src='http://l.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> act on our vector space. So is there a natural way to get them back? For each representation <img src='http://l.wordpress.com/latex.php?latex=W&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='W' title='W' class='latex' /> of of <img src='http://l.wordpress.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='H' title='H' class='latex' /> we <em>can induce</em> the representation <img src='http://l.wordpress.com/latex.php?latex=%5Cmathrm%7BInd%7D+W&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathrm{Ind} W' title='\mathrm{Ind} W' class='latex' />. This ends up being another adjunction pair, of course. Here&#8217;s an immediate consequence: in the case that these groups are finite, note that the dimension of the two <img src='http://l.wordpress.com/latex.php?latex=%5Chom&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\hom' title='\hom' class='latex' />&#8217;s must match; this just gives us <img src='http://l.wordpress.com/latex.php?latex=%5Clangle+%5Cmathrm%7BInd+W%7D%2C+V+%5Crangle+%3D+%5Clangle+W%2C+%5Cmathrm%7BRes%7D+V+%5Crangle&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle \mathrm{Ind W}, V \rangle = \langle W, \mathrm{Res} V \rangle' title='\langle \mathrm{Ind W}, V \rangle = \langle W, \mathrm{Res} V \rangle' class='latex' />, which is the Frobenius reciprocity formula from second-semester abstract algebra.</p>
<p>-Y</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/713/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/713/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/713/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/713/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/713/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/713/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/713/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/713/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/713/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/713/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=713&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/10/02/a-free-association-on-basic-adjoints/feed/</wfw:commentRss>
		<slash:comments>7</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">KR</media:title>
		</media:content>
	</item>
		<item>
		<title>Chern classes and Riemann&#8211;Roch formalism</title>
		<link>http://concretenonsense.wordpress.com/2009/08/03/chern-classes-and-riemann-roch-formalism/</link>
		<comments>http://concretenonsense.wordpress.com/2009/08/03/chern-classes-and-riemann-roch-formalism/#comments</comments>
		<pubDate>Mon, 03 Aug 2009 13:10:22 +0000</pubDate>
		<dc:creator>Steven Sam</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Algebraic Geometry]]></category>
		<category><![CDATA[Chern classes]]></category>
		<category><![CDATA[K-theory]]></category>
		<category><![CDATA[lambda rings]]></category>
		<category><![CDATA[Riemann-Roch]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=544</guid>
		<description><![CDATA[Last time I gave the definition of -rings and tried to motivate them from the perspective of K-theory. I&#8217;d like to continue with how to define abstract Chern classes for -rings and explain Riemann&#8211;Roch formalism. We&#8217;ll assume all -rings R have an augmentation, are equipped with a positive structure, and have an involution. I&#8217;ll once [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=544&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p><a href="http://concretenonsense.wordpress.com/2009/07/23/lambda-rings/">Last time</a> I gave the definition of <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings and tried to motivate them from the perspective of K-theory. I&#8217;d like to continue with how to define abstract Chern classes for <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings and explain Riemann&#8211;Roch formalism. We&#8217;ll assume all <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings R have an augmentation, are equipped with a positive structure, and have an involution. I&#8217;ll once again use K-theory as motivation for the definitions.</p>
<p>In topological K-theory, if we have a space X with a vector bundle E, there exists a map <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+X%27+%5Cto+X&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon X&#039; \to X' title='f \colon X&#039; \to X' class='latex' /> such that the pullback <img src='http://l.wordpress.com/latex.php?latex=f%5E%2AE&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f^*E' title='f^*E' class='latex' /> decomposes into a direct sum of line bundles, and the map on cohomology rings <img src='http://l.wordpress.com/latex.php?latex=f%5E%2A+%5Ccolon+%5Cmathrm%7BH%7D%5E%2A%28X%29+%5Cto+%5Cmathrm%7BH%7D%5E%2A%28X%27%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f^* \colon \mathrm{H}^*(X) \to \mathrm{H}^*(X&#039;)' title='f^* \colon \mathrm{H}^*(X) \to \mathrm{H}^*(X&#039;)' class='latex' /> is injective. The corresponding statement for <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings is that we can embed any <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-ring R into a larger one such that every element can be written as a sum of elements with augmentation <img src='http://l.wordpress.com/latex.php?latex=%5Cpm+1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\pm 1' title='\pm 1' class='latex' />.<br />
<span id="more-544"></span><br />
Let <img src='http://l.wordpress.com/latex.php?latex=A+%3D+%5Cbigoplus_%7Bd+%5Cge+0%7D+A_d&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A = \bigoplus_{d \ge 0} A_d' title='A = \bigoplus_{d \ge 0} A_d' class='latex' /> be a graded ring. We let <img src='http://l.wordpress.com/latex.php?latex=1%2BA%5E%2B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='1+A^+' title='1+A^+' class='latex' /> be the group under multiplication of formal power series of the form <img src='http://l.wordpress.com/latex.php?latex=1+%2B+%5Csum_%7Bn+%5Cge+0%7D+a_n+t%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='1 + \sum_{n \ge 0} a_n t^n' title='1 + \sum_{n \ge 0} a_n t^n' class='latex' /> where <img src='http://l.wordpress.com/latex.php?latex=a_n+%5Cin+A_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a_n \in A_n' title='a_n \in A_n' class='latex' />. A map of Abelian groups <img src='http://l.wordpress.com/latex.php?latex=c_t+%5Ccolon+R+%5Cto+1%2BA%5E%2B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c_t \colon R \to 1+A^+' title='c_t \colon R \to 1+A^+' class='latex' /> (we use addition for R), written <img src='http://l.wordpress.com/latex.php?latex=c_t%28x%29+%3D+%5Csum_i+c%5Ei%28x%29+t%5Ei&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c_t(x) = \sum_i c^i(x) t^i' title='c_t(x) = \sum_i c^i(x) t^i' class='latex' /> is a <strong>Chern class homomorphism</strong> if</p>
<ul>
<li> For each line element u, <img src='http://l.wordpress.com/latex.php?latex=c%5Ei%28u%29+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c^i(u) = 0' title='c^i(u) = 0' class='latex' /> for i&gt;1.</li>
<li> For two line elements u and v, <img src='http://l.wordpress.com/latex.php?latex=c%5E1%28uv%29+%3D+c%5E1%28u%29+%2B+c%5E1%28v%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c^1(uv) = c^1(u) + c^1(v)' title='c^1(uv) = c^1(u) + c^1(v)' class='latex' />.</li>
</ul>
<p>We will also assume that each <img src='http://l.wordpress.com/latex.php?latex=c_t%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c_t(x)' title='c_t(x)' class='latex' /> is a polynomial. Chern class homomorphisms are compatible with the splitting principle in the following way. If we want to split an element X in R, then there exists a <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-ring R&#8217; and a graded ring A&#8217; which extends A, together with a Chern class homomorphism <img src='http://l.wordpress.com/latex.php?latex=c_t+%5Ccolon+R%27+%5Cto+1%2BA%27%5E%2B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c_t \colon R&#039; \to 1+A&#039;^+' title='c_t \colon R&#039; \to 1+A&#039;^+' class='latex' /> which restricts to the one for R. Hence, Chern classes are completely determined by what they do to line elements.</p>
<p>So we get &#8220;factorizations&#8221; <img src='http://l.wordpress.com/latex.php?latex=c_t%28x%29+%3D+%5Cprod_i+%281%2Ba_i+t%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c_t(x) = \prod_i (1+a_i t)' title='c_t(x) = \prod_i (1+a_i t)' class='latex' />. This allows us to define the <strong>Chern character</strong> <img src='http://l.wordpress.com/latex.php?latex=%5Cmathrm%7Bch%7D+%5Ccolon+R+%5Cto+%5Cmathbf%7BQ%7D%5Bt%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathrm{ch} \colon R \to \mathbf{Q}[t]' title='\mathrm{ch} \colon R \to \mathbf{Q}[t]' class='latex' /> via <img src='http://l.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathrm%7Bch%7D%28x%29+%3D+%5Csum_i+%5Cexp%28a_i%29+%3D++%5Csum_i+%5Csum_%7Bn+%5Cge+0%7D+%5Cfrac%7Ba_n%7D%7Bn%21%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\displaystyle \mathrm{ch}(x) = \sum_i \exp(a_i) =  \sum_i \sum_{n \ge 0} \frac{a_n}{n!}' title='\displaystyle \mathrm{ch}(x) = \sum_i \exp(a_i) =  \sum_i \sum_{n \ge 0} \frac{a_n}{n!}' class='latex' /> and the <strong>Todd class</strong> <img src='http://l.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Cmathrm%7Btd%7D%28x%29+%3D+%5Cprod_i+%5Cfrac%7Ba_i%5Cexp%28a_i%29%7D%7B%5Cexp%28a_i%29+-+1%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\displaystyle \mathrm{td}(x) = \prod_i \frac{a_i\exp(a_i)}{\exp(a_i) - 1}' title='\displaystyle \mathrm{td}(x) = \prod_i \frac{a_i\exp(a_i)}{\exp(a_i) - 1}' class='latex' />.</p>
<p>Now we move on to Riemann&#8211;Roch formalism. Let C be a category. A <strong>Riemann&#8211;Roch functor</strong> is a triple <img src='http://l.wordpress.com/latex.php?latex=%28K%2C+%5Crho%2C+A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(K, \rho, A)' title='(K, \rho, A)' class='latex' /> such that</p>
<ul>
<li> For all X in C, we have commutative rings K(X) and A(X). Let UK(X) and UA(X) be the underlying additive groups.</li>
<li> For every morphism <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+X+%5Cto+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon X \to Y' title='f \colon X \to Y' class='latex' />, we have ring homomorphisms (<strong>pullbacks</strong>) <img src='http://l.wordpress.com/latex.php?latex=f%5EK+%5Ccolon+K%28Y%29+%5Cto+K%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f^K \colon K(Y) \to K(X)' title='f^K \colon K(Y) \to K(X)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=f%5EA+%5Ccolon+A%28Y%29+%5Cto+A%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f^A \colon A(Y) \to A(X)' title='f^A \colon A(Y) \to A(X)' class='latex' /> which make K and A into contravariant functors from C to commutative rings.</li>
<li> For every morphism <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+X+%5Cto+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon X \to Y' title='f \colon X \to Y' class='latex' />, we have group homomorphisms (<strong>pushforwards</strong>) <img src='http://l.wordpress.com/latex.php?latex=f_K+%5Ccolon+UK%28X%29+%5Cto+UK%28Y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_K \colon UK(X) \to UK(Y)' title='f_K \colon UK(X) \to UK(Y)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=f_A+%5Ccolon+UA%28X%29+%5Cto+UA%28Y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_A \colon UA(X) \to UA(Y)' title='f_A \colon UA(X) \to UA(Y)' class='latex' /> which make UK and UA into covariant functors from C to Abelian groups.</li>
<li> The <strong>projection formula</strong> <img src='http://l.wordpress.com/latex.php?latex=f_H%28x+%5Ccdot+f%5EH%28y%29%29+%3D+f_H%28x%29+%5Ccdot+y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_H(x \cdot f^H(y)) = f_H(x) \cdot y' title='f_H(x \cdot f^H(y)) = f_H(x) \cdot y' class='latex' /> where <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+X+%5Cto+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon X \to Y' title='f \colon X \to Y' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=x+%5Cin+H%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \in H(X)' title='x \in H(X)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=y+%5Cin+H%28Y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='y \in H(Y)' title='y \in H(Y)' class='latex' /> holds for H=K and H=A.</li>
<li> <img src='http://l.wordpress.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\rho' title='\rho' class='latex' /> is a natural transformation from K to A.</li>
</ul>
<p>The statement that Riemann&#8211;Roch holds for a morphism f in C means that there exists an element <img src='http://l.wordpress.com/latex.php?latex=%5Ctau_f+%5Cin+A%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\tau_f \in A(X)' title='\tau_f \in A(X)' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=%5Crho_Y+f_K%28x%29+%3D+f_A%28%5Ctau_f+%5Ccdot+%5Crho_X%28x%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\rho_Y f_K(x) = f_A(\tau_f \cdot \rho_X(x))' title='\rho_Y f_K(x) = f_A(\tau_f \cdot \rho_X(x))' class='latex' /> for all x in K(X). The element <img src='http://l.wordpress.com/latex.php?latex=%5Ctau_f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\tau_f' title='\tau_f' class='latex' /> measures the failure for <img src='http://l.wordpress.com/latex.php?latex=%5Crho+%5Ccolon+UK+%5Cto+UA&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\rho \colon UK \to UA' title='\rho \colon UK \to UA' class='latex' /> to be a natural transformation of covariant functors.</p>
<p>If Riemann&#8211;Roch holds for two morphisms, then it also holds for their composition.</p>
<p>To bring in <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings, we focus more specifically on <strong>Chern class functors</strong>. This is a Riemann&#8211;Roch functor <img src='http://l.wordpress.com/latex.php?latex=%28K%2C+c%2C+A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(K, c, A)' title='(K, c, A)' class='latex' /> where we further assume that</p>
<ul>
<li> The image of K is the category of <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings with involution.</li>
<li> The image of A is the category of graded rings whose morphisms are degree 0 maps.</li>
<li> For every X in C, <img src='http://l.wordpress.com/latex.php?latex=c+%5Ccolon+K%28X%29+%5Cto+1%2BA%28X%29%5E%2B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c \colon K(X) \to 1+A(X)^+' title='c \colon K(X) \to 1+A(X)^+' class='latex' /> is a Chern class homomorphism.</li>
</ul>
<p>Fix this Chern class functor. Since this post is already getting too technical, let me just mention that one defines what it means for a morphism in C to be an <strong>elementary embedding</strong> and <strong>elementary projection</strong>, and shows that Riemann&#8211;Roch holds for such morphisms. The elements <img src='http://l.wordpress.com/latex.php?latex=%5Ctau_f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\tau_f' title='\tau_f' class='latex' /> in both cases are defined in terms of Todd classes.</p>
<p>Now we relate this to the Grothendieck&#8211;Riemann&#8211;Roch theorem. For this, we fix some Noetherian commutative ring R and let C be the category whose objects are schemes over Spec R that are quasi-projective and connected. The morphisms in our category are those which are projective local complete intersection morphisms: these are all morphisms of the form <img src='http://l.wordpress.com/latex.php?latex=X+%5Cxrightarrow%7Bi%7D+%5Cmathbf%7BP%7D%28E%29+%5Cxrightarrow%7Bp%7D+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X \xrightarrow{i} \mathbf{P}(E) \xrightarrow{p} Y' title='X \xrightarrow{i} \mathbf{P}(E) \xrightarrow{p} Y' class='latex' /> where E is a vector bundle on Y, and <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BP%7D%28E%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{P}(E)' title='\mathbf{P}(E)' class='latex' /> is the corresponding projective bundle, and i is a closed embedding whose image is locally a complete intersection (i.e., there is an open affine cover where in each open affine, the ideal of X is generated by a regular sequence). Here K is the K-theory of algebraic vector bundles over X, and A is a certain associated graded ring of K(X). We have pullbacks of vector bundles which makes K and A into contravariant functors. The pushforward <img src='http://l.wordpress.com/latex.php?latex=f_K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_K' title='f_K' class='latex' /> on K is given by <img src='http://l.wordpress.com/latex.php?latex=f_K+%3D+%5Csum_%7Bi+%5Cge+0%7D+%28-1%29%5Ei+%5Cmathrm%7BR%7D%5Ei+f_%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_K = \sum_{i \ge 0} (-1)^i \mathrm{R}^i f_*' title='f_K = \sum_{i \ge 0} (-1)^i \mathrm{R}^i f_*' class='latex' /> an alternating sum of higher direct images. In this case, i is an elementary embedding, and p is an elementary projection in the language used above.</p>
<p>What comes out of all of this (and the stuff I skipped on elementary embeddings and elementary projections), is that Riemann&#8211;Roch holds for all morphisms in this category, and the element <img src='http://l.wordpress.com/latex.php?latex=%5Ctau_f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\tau_f' title='\tau_f' class='latex' /> can be written as the Todd class <img src='http://l.wordpress.com/latex.php?latex=%5Cmathrm%7Btd%7D%28T_f%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathrm{td}(T_f)' title='\mathrm{td}(T_f)' class='latex' /> where <img src='http://l.wordpress.com/latex.php?latex=T_f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T_f' title='T_f' class='latex' /> is the <strong>virtual tangent bundle</strong> of f defined as<br />
<img src='http://l.wordpress.com/latex.php?latex=T_f+%3D+%5Bi%5E%2A%5Cmathscr%7BT%7D_%7B%5Cmathbf%7BP%7D%28E%29+%2F+Y%7D%5D+-+%5B%5Cmathscr%7BN%7D_%7BX%2C%5Cmathbf%7BP%7D%28E%29%7D%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T_f = [i^*\mathscr{T}_{\mathbf{P}(E) / Y}] - [\mathscr{N}_{X,\mathbf{P}(E)}]' title='T_f = [i^*\mathscr{T}_{\mathbf{P}(E) / Y}] - [\mathscr{N}_{X,\mathbf{P}(E)}]' class='latex' /> using the notation above. here <img src='http://l.wordpress.com/latex.php?latex=%5Cmathscr%7BT%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathscr{T}' title='\mathscr{T}' class='latex' /> denotes the relative tangent bundle, and <img src='http://l.wordpress.com/latex.php?latex=%5Cmathscr%7BN%7D_%7BX%2C%5Cmathbf%7BP%7D%28E%29%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathscr{N}_{X,\mathbf{P}(E)}' title='\mathscr{N}_{X,\mathbf{P}(E)}' class='latex' /> is the normal bundle of X inside of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BP%7D%28E%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{P}(E)' title='\mathbf{P}(E)' class='latex' /> (this is a bundle because X is a local complete intersection).</p>
<p>We&#8217;ll do one last thing: specialize to the case that R=k is a field and we consider only connected nonsingular quasiprojective varieties over k and proper morphisms between them. Given X, we can embed it inside some projective space <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BP%7D%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{P}^n' title='\mathbf{P}^n' class='latex' /> via a map i. A map is proper <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+X+%5Cto+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon X \to Y' title='f \colon X \to Y' class='latex' /> if and only if the graph morphism <img src='http://l.wordpress.com/latex.php?latex=X+%5Cto+%5Cmathbf%7BP%7D%5En+%5Ctimes+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X \to \mathbf{P}^n \times Y' title='X \to \mathbf{P}^n \times Y' class='latex' /> induced by the maps i and f is a closed embedding. Whenever a nonsingular variety is embedded as a closed subvariety of another nonsingular variety, it is automatically a local complete intersection, so we see that this case is really a special case of the preceding paragraph (here E is a trivial rank n+1 vector bundle over Y). Also, on a nonsingular variety, every coherent sheaf has a finite resolution by vector bundles, so K(X) is in fact the Grothendieck group of coherent sheaves (though the multiplication for coherent sheaves which aren&#8217;t vector bundles involves sums and Tor functors). Furthermore, we can let A be the Chow ring functor (which shows that it coincides with the associated graded of K in this case), and our natural transformation <img src='http://l.wordpress.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\rho' title='\rho' class='latex' /> is the usual Chern character ch. We&#8217;ll finish with what Grothendieck&#8211;Riemann&#8211;Roch says in this case:</p>
<p>Let <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+X+%5Cto+Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon X \to Y' title='f \colon X \to Y' class='latex' /> be a proper morphism between nonsingular quasiprojective varieties, and let [F] be an element in K(X). Then</p>
<p><img src='http://l.wordpress.com/latex.php?latex=%5Cmathrm%7Bch%7D%28f_K%28%5BF%5D%29%29+%3D+f_%2A%28%5Cmathrm%7Btd%7D%28%5BT_f%5D%29+%5Ccdot+%5Cmathrm%7Bch%7D%28%5BF%5D%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathrm{ch}(f_K([F])) = f_*(\mathrm{td}([T_f]) \cdot \mathrm{ch}([F]))' title='\mathrm{ch}(f_K([F])) = f_*(\mathrm{td}([T_f]) \cdot \mathrm{ch}([F]))' class='latex' />.</p>
<p>-Steven</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/544/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/544/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/544/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/544/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/544/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/544/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/544/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/544/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/544/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/544/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=544&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/08/03/chern-classes-and-riemann-roch-formalism/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">masnevets</media:title>
		</media:content>
	</item>
		<item>
		<title>Lambda-rings</title>
		<link>http://concretenonsense.wordpress.com/2009/07/23/lambda-rings/</link>
		<comments>http://concretenonsense.wordpress.com/2009/07/23/lambda-rings/#comments</comments>
		<pubDate>Thu, 23 Jul 2009 22:04:02 +0000</pubDate>
		<dc:creator>Steven Sam</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Algebraic Geometry]]></category>
		<category><![CDATA[Combinatorics]]></category>
		<category><![CDATA[lambda rings]]></category>
		<category><![CDATA[K-theory]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=534</guid>
		<description><![CDATA[In this post, I want to discuss Grothendieck&#8217;s -rings and how they provide an abstract setting for Riemann&#8211;Roch formalism. The references I&#8217;ll be using are 

Donald Knutson, Lambda-Rings and the Representation Theory of the Symmetric Group
William Fulton and Serge Lang, Riemann&#8211;Roch Algebra

The definition of a -ring is a bit technical, but it starts with a [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=534&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>In this post, I want to discuss Grothendieck&#8217;s <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings and how they provide an abstract setting for Riemann&#8211;Roch formalism. The references I&#8217;ll be using are </p>
<ul>
<li>Donald Knutson, <i>Lambda-Rings and the Representation Theory of the Symmetric Group</i></li>
<li>William Fulton and Serge Lang, <i>Riemann&#8211;Roch Algebra</i></li>
</ul>
<p>The definition of a <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-ring is a bit technical, but it starts with a commutative ring R together with operations <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5Ei+%5Ccolon+R+%5Cto+R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^i \colon R \to R' title='\lambda^i \colon R \to R' class='latex' /> for all nonnegative integers i such that <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5E0%28r%29+%3D+1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^0(r) = 1' title='\lambda^0(r) = 1' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5E1%28r%29+%3D+r&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^1(r) = r' title='\lambda^1(r) = r' class='latex' /> for all r in R together with some axioms. In particular, we should say what these lambda operations do to sums and products, and we might also want to know what compositions of them look like. To motivate these axioms, we&#8217;ll look at K-theory (where it originates).<br />
<span id="more-534"></span><br />
Let X be a topological space, and consider the set of all vector bundles over X (topological, smooth, holomorphic, whatever you want). We define lambda operations using exterior powers: <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5Ei%28E%29+%3D+%5Cbigwedge%5Ei+E&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^i(E) = \bigwedge^i E' title='\lambda^i(E) = \bigwedge^i E' class='latex' />. Of course, the set of vector bundles on X isn&#8217;t a ring, but the free Abelian group of isomorphism classes of vector bundles is a ring if we use tensor product as the multiplication. But we have to define exterior products on &#8220;negatives&#8221; of isomorphism classes of vector bundles. For actual vector bundles, we have the identity</p>
<p><img src='http://l.wordpress.com/latex.php?latex=%5Cbigwedge%5En%28E+%5Coplus+F%29+%3D+%5Cbigoplus_%7Bi%3D0%7D%5En+%5Cbigwedge%5Ei+E+%5Cotimes+%5Cbigwedge%5E%7Bn-i%7D+F&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\bigwedge^n(E \oplus F) = \bigoplus_{i=0}^n \bigwedge^i E \otimes \bigwedge^{n-i} F' title='\bigwedge^n(E \oplus F) = \bigoplus_{i=0}^n \bigwedge^i E \otimes \bigwedge^{n-i} F' class='latex' />,</p>
<p>so we can use this to extend to &#8220;negatives&#8221; and we make this an axiom for a general <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-ring:</p>
<p>(L1) <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5Ei%28r%2Bs%29+%3D+%5Csum_%7Bj%3D0%7D%5Ei+%5Clambda%5Ej%28r%29+%5Clambda%5E%7Bi-j%7D%28s%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^i(r+s) = \sum_{j=0}^i \lambda^j(r) \lambda^{i-j}(s)' title='\lambda^i(r+s) = \sum_{j=0}^i \lambda^j(r) \lambda^{i-j}(s)' class='latex' /> for all r and s in R.</p>
<p>In fact, the above identity holds if we pass to the Grothendieck group <img src='http://l.wordpress.com/latex.php?latex=K_0%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K_0(X)' title='K_0(X)' class='latex' /> of vector bundles over X (add the relations <img src='http://l.wordpress.com/latex.php?latex=E%27%2BE%27%27+%3D+E&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='E&#039;+E&#039;&#039; = E' title='E&#039;+E&#039;&#039; = E' class='latex' /> whenever we have a short exact sequence of the form <img src='http://l.wordpress.com/latex.php?latex=0+%5Cto+E%27+%5Cto+E+%5Cto+E%27%27+%5Cto+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0 \to E&#039; \to E \to E&#039;&#039; \to 0' title='0 \to E&#039; \to E \to E&#039;&#039; \to 0' class='latex' />) because in general, if E&#8217; is an extension of E and F, then <img src='http://l.wordpress.com/latex.php?latex=%5Cbigwedge%5En+E%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\bigwedge^n E&#039;' title='\bigwedge^n E&#039;' class='latex' /> has a filtration whose associated graded is the direct sum on the RHS above.</p>
<p>What about products? i.e., what should <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%28rs%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda(rs)' title='\lambda(rs)' class='latex' /> be? The exterior power of a tensor product of two vector bundles has a rather complicated expression. Nonetheless, there exist integer valued polynomials <img src='http://l.wordpress.com/latex.php?latex=P_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n' title='P_n' class='latex' /> in 2n variables such that</p>
<p><img src='http://l.wordpress.com/latex.php?latex=%5Cbigwedge%5En%28E+%5Cotimes+F%29+%3D+P_n%28E%2C+%5Cbigwedge%5E2+E%2C+%5Cdots%2C+%5Cbigwedge%5En+E%2C+F%2C+%5Cbigwedge%5E2+F%2C+%5Cdots%2C+%5Cbigwedge%5En+F%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\bigwedge^n(E \otimes F) = P_n(E, \bigwedge^2 E, \dots, \bigwedge^n E, F, \bigwedge^2 F, \dots, \bigwedge^n F)' title='\bigwedge^n(E \otimes F) = P_n(E, \bigwedge^2 E, \dots, \bigwedge^n E, F, \bigwedge^2 F, \dots, \bigwedge^n F)' class='latex' />.</p>
<p>How do we get these polynomials? Let <img src='http://l.wordpress.com/latex.php?latex=X_1%2C+%5Cdots%2C+X_i%2C+%5Cdots%2C+Y_1+%5Cdots%2C+Y_i%2C+%5Cdots&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X_1, \dots, X_i, \dots, Y_1 \dots, Y_i, \dots' title='X_1, \dots, X_i, \dots, Y_1 \dots, Y_i, \dots' class='latex' /> be algebraically independent variables, and let <img src='http://l.wordpress.com/latex.php?latex=E_i%2C+F_i&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='E_i, F_i' title='E_i, F_i' class='latex' /> denote the ith elementary symmetric function in the Xs and Ys, respectively. Then we define the polynomials <img src='http://l.wordpress.com/latex.php?latex=P_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_n' title='P_n' class='latex' /> via the identity</p>
<p><img src='http://l.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Csum_%7Bn+%5Cge+0%7D+P_n%28E_1%2C+%5Cdots%2C+E_n%2C+F_1%2C+%5Cdots%2C+F_n%29+T%5En+%3D+%5Cprod_%7Bi%2Cj+%5Cge+1%7D+%281%2BX_iY_jT%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\displaystyle \sum_{n \ge 0} P_n(E_1, \dots, E_n, F_1, \dots, F_n) T^n = \prod_{i,j \ge 1} (1+X_iY_jT)' title='\displaystyle \sum_{n \ge 0} P_n(E_1, \dots, E_n, F_1, \dots, F_n) T^n = \prod_{i,j \ge 1} (1+X_iY_jT)' class='latex' />.</p>
<p>So we have some complicated family of polynomials, and the axiom</p>
<p>(L2) <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5En%28rs%29+%3D+P_n%28%5Clambda%5E1%28r%29%2C+%5Cdots%2C+%5Clambda%5En%28r%29%2C+%5Clambda%5E1%28s%29%2C+%5Cdots%2C+%5Clambda%5En%28s%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^n(rs) = P_n(\lambda^1(r), \dots, \lambda^n(r), \lambda^1(s), \dots, \lambda^n(s))' title='\lambda^n(rs) = P_n(\lambda^1(r), \dots, \lambda^n(r), \lambda^1(s), \dots, \lambda^n(s))' class='latex' /> for all r and s in R.</p>
<p>There are also some integer-valued polynomials <img src='http://l.wordpress.com/latex.php?latex=P_%7Bnm%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_{nm}' title='P_{nm}' class='latex' /> of degree nm for expressing the compositions <img src='http://l.wordpress.com/latex.php?latex=%5Cbigwedge%5En+%5Cbigwedge%5Em+E&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\bigwedge^n \bigwedge^m E' title='\bigwedge^n \bigwedge^m E' class='latex' />. I won&#8217;t get into that, but this gives the third axiom</p>
<p>(L3) <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5En%28%5Clambda%5Em%28r%29%29+%3D+P_%7Bnm%7D%28%5Clambda%5E1%28r%29%2C+%5Cdots%2C+%5Clambda%5E%7Bnm%7D%28r%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^n(\lambda^m(r)) = P_{nm}(\lambda^1(r), \dots, \lambda^{nm}(r))' title='\lambda^n(\lambda^m(r)) = P_{nm}(\lambda^1(r), \dots, \lambda^{nm}(r))' class='latex' /> for all r in R.</p>
<p>A <b>morphism</b> of <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings is a ring homomorphism which commutes with the lambda-operations.</p>
<p>For a simple combinatorial example, take X to be a point. In this case, vector bundles are just vector spaces, and <img src='http://l.wordpress.com/latex.php?latex=K_0%28X%29+%3D+%5Cmathbf%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K_0(X) = \mathbf{Z}' title='K_0(X) = \mathbf{Z}' class='latex' />. Identifying vector spaces with their dimension, the lambda operations become <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5Ek%28n%29+%3D+%5Cfrac%7Bn%28n-1%29%5Ccdots+%28n-k%2B1%29%7D%7Bk%21%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^k(n) = \frac{n(n-1)\cdots (n-k+1)}{k!}' title='\lambda^k(n) = \frac{n(n-1)\cdots (n-k+1)}{k!}' class='latex' />, which is just the binomial coefficient <img src='http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bn%7D%7Bk%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\binom{n}{k}' title='\binom{n}{k}' class='latex' /> when n is nonnegative. A morphism <img src='http://l.wordpress.com/latex.php?latex=%5Cvarepsilon+%5Ccolon+R+%5Cto+%5Cmathbf%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\varepsilon \colon R \to \mathbf{Z}' title='\varepsilon \colon R \to \mathbf{Z}' class='latex' /> is called an <b>augmentation</b>. For vector bundles, this map is given by sending a vector bundle to its rank and extending linearly to virtual vector bundles. We&#8217;ll assume our <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings are augmented.</p>
<p>We can place some further requirements and operations on our <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings. First, in <img src='http://l.wordpress.com/latex.php?latex=K_0%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K_0(X)' title='K_0(X)' class='latex' />, we naturally have a notion of what it means to be &#8220;positive&#8221;: any class which represents an actual vector bundle. The set of positive elements has the property that it&#8217;s closed under addition and multiplication, and every element of <img src='http://l.wordpress.com/latex.php?latex=K_0%28X%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K_0(X)' title='K_0(X)' class='latex' /> can be expressed as a difference of two positive elements. Furthermore, whenever x is positive, <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5Ei%28x%29+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^i(x) = 0' title='\lambda^i(x) = 0' class='latex' /> for sufficiently large i, and all positive elements of augmentation 1 (line bundles) have multiplicative inverses. We&#8217;ll take all of these features to be an axiom system for a &#8220;positive subset&#8221; of a <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-ring. Motivated by the K-theory, we&#8217;ll call positive elements of augmentation 1 <b>line elements</b>. We&#8217;ll assume that our <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings are equipped with a positive structure.</p>
<p>K-theory also has a nice involution: send a vector bundle to its dual bundle. In general, we&#8217;ll say that <img src='http://l.wordpress.com/latex.php?latex=x+%5Cmapsto+x%5E%5Cvee&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \mapsto x^\vee' title='x \mapsto x^\vee' class='latex' /> is an <b>involution</b> of our <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-ring if it satisfies </p>
<ul>
<li> <img src='http://l.wordpress.com/latex.php?latex=%28x%5E%5Cvee%29%5E%5Cvee+%3D+x&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x^\vee)^\vee = x' title='(x^\vee)^\vee = x' class='latex' /> for all x,</li>
<li> <img src='http://l.wordpress.com/latex.php?latex=%5Cvarepsilon%28x%5E%5Cvee%29+%3D+%5Cvarepsilon%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\varepsilon(x^\vee) = \varepsilon(x)' title='\varepsilon(x^\vee) = \varepsilon(x)' class='latex' /> for all x,</li>
<li> <img src='http://l.wordpress.com/latex.php?latex=u%5E%5Cvee+%3D+u%5E%7B-1%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='u^\vee = u^{-1}' title='u^\vee = u^{-1}' class='latex' /> for all line elements u.</li>
</ul>
<p>We&#8217;ll further assume that our <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings are equipped with an involution.</p>
<p>Another example of <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings comes from representation rings. Given a group G and a representation V, we define <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5Ei%28V%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^i(V)' title='\lambda^i(V)' class='latex' /> to be the representation <img src='http://l.wordpress.com/latex.php?latex=%5Cbigwedge%5Ei+V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\bigwedge^i V' title='\bigwedge^i V' class='latex' /> with the diagonal action of G. The augmentation here sends a representation to its dimension (over the ground field), the positive elements are the representations, and the involution sends a representation to its dual. One particular example is when G is the general linear group <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BGL%7D_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{GL}_n' title='\mathbf{GL}_n' class='latex' /> and we consider only rational representations, so that the representation ring is the ring of symmetric functions in n variables (together with a multiplicative inverse for the product of the n variables). In this case, the lambda operations are plethysm: <img src='http://l.wordpress.com/latex.php?latex=%5Clambda%5En%28p%29+%3D+e_n+%5Ccirc+p&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda^n(p) = e_n \circ p' title='\lambda^n(p) = e_n \circ p' class='latex' /> where <img src='http://l.wordpress.com/latex.php?latex=e_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='e_n' title='e_n' class='latex' /> is the nth elementary symmetric function, and positive means Schur positive. [I first saw <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings in context of symmetric functions, so the definitions seemed a bit mysterious to me.]</p>
<p>In the next post, I&#8217;ll discuss abstract Chern classes in the context of <img src='http://l.wordpress.com/latex.php?latex=%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lambda' title='\lambda' class='latex' />-rings and Riemann&#8211;Roch formalism, and say how this relates to Grothendieck&#8211;Riemann&#8211;Roch for proper maps between nonsingular varieties.</p>
<p>-Steven</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/534/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/534/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/534/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/534/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/534/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/534/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/534/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/534/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/534/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/534/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=534&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/07/23/lambda-rings/feed/</wfw:commentRss>
		<slash:comments>8</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">masnevets</media:title>
		</media:content>
	</item>
		<item>
		<title>A Lie group which isn&#8217;t a matrix group</title>
		<link>http://concretenonsense.wordpress.com/2009/07/10/a-lie-group-which-isnt-a-matrix-group/</link>
		<comments>http://concretenonsense.wordpress.com/2009/07/10/a-lie-group-which-isnt-a-matrix-group/#comments</comments>
		<pubDate>Fri, 10 Jul 2009 16:41:33 +0000</pubDate>
		<dc:creator>Steven Sam</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Geometry & Topology]]></category>
		<category><![CDATA[Lie group]]></category>
		<category><![CDATA[matrix group]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=507</guid>
		<description><![CDATA[In this post, I want to give an example of a Lie group which is not isomorphic to a subgroup of a matrix group. This contrasts with the algebraic picture, where every affine algebraic group can be realized as a subgroup of a matrix group. I&#8217;ll just sketch the details.
The group we&#8217;ll use is the [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=507&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>In this post, I want to give an example of a Lie group which is not isomorphic to a subgroup of a matrix group. This contrasts with the algebraic picture, where every affine algebraic group can be realized as a subgroup of a matrix group. I&#8217;ll just sketch the details.</p>
<p>The group we&#8217;ll use is the universal cover G of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BR%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{SL}_2(\mathbf{R})' title='\mathbf{SL}_2(\mathbf{R})' class='latex' />. One can realize <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BR%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{SL}_2(\mathbf{R})' title='\mathbf{SL}_2(\mathbf{R})' class='latex' /> as a fiber bundle with fiber <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BR%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{R}' title='\mathbf{R}' class='latex' /> over <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BR%7D%5E2+%5Csetminus+%5C%7B%280%2C0%29%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{R}^2 \setminus \{(0,0)\}' title='\mathbf{R}^2 \setminus \{(0,0)\}' class='latex' /> via the map which sends a matrix to its first row, so its fundamental group is <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{Z}' title='\mathbf{Z}' class='latex' />. Similarly, we can use this map to show that <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{SL}_2(\mathbf{C})' title='\mathbf{SL}_2(\mathbf{C})' class='latex' /> is a fiber bundle with fiber <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{C}' title='\mathbf{C}' class='latex' /> over <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BC%7D%5E2+%5Csetminus+%5C%7B%280%2C0%29%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{C}^2 \setminus \{(0,0)\}' title='\mathbf{C}^2 \setminus \{(0,0)\}' class='latex' /> and hence is simply connected.</p>
<p>Now let <img src='http://l.wordpress.com/latex.php?latex=r+%5Ccolon+G+%5Cto+%5Cmathbf%7BGL%7D_n%28%5Cmathbf%7BR%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='r \colon G \to \mathbf{GL}_n(\mathbf{R})' title='r \colon G \to \mathbf{GL}_n(\mathbf{R})' class='latex' /> be any smooth map. It induces a map on Lie algebras <img src='http://l.wordpress.com/latex.php?latex=r_%2A+%5Ccolon+%5Cmathfrak%7Bsl%7D_2%28%5Cmathbf%7BR%7D%29+%5Cto+%5Cmathfrak%7Bgl%7D_n%28%5Cmathbf%7BR%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='r_* \colon \mathfrak{sl}_2(\mathbf{R}) \to \mathfrak{gl}_n(\mathbf{R})' title='r_* \colon \mathfrak{sl}_2(\mathbf{R}) \to \mathfrak{gl}_n(\mathbf{R})' class='latex' />. We can use this to define a map <img src='http://l.wordpress.com/latex.php?latex=f+%5Ccolon+%5Cmathfrak%7Bsl%7D_2%28%5Cmathbf%7BC%7D%29+%5Cto+%5Cmathfrak%7Bgl%7D_n%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f \colon \mathfrak{sl}_2(\mathbf{C}) \to \mathfrak{gl}_n(\mathbf{C})' title='f \colon \mathfrak{sl}_2(\mathbf{C}) \to \mathfrak{gl}_n(\mathbf{C})' class='latex' /> by <img src='http://l.wordpress.com/latex.php?latex=f%28A%2BiB%29+%3D+r_%2A%28A%29+%2B+ir_%2A%28B%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f(A+iB) = r_*(A) + ir_*(B)' title='f(A+iB) = r_*(A) + ir_*(B)' class='latex' />. It&#8217;s straightforward to check that f preserves the Lie bracket. Since <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{SL}_2(\mathbf{C})' title='\mathbf{SL}_2(\mathbf{C})' class='latex' /> is simply connected, f is the derivative of some smooth map <img src='http://l.wordpress.com/latex.php?latex=F+%5Ccolon+%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BC%7D%29+%5Cto+%5Cmathbf%7BGL%7D_n%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F \colon \mathbf{SL}_2(\mathbf{C}) \to \mathbf{GL}_n(\mathbf{C})' title='F \colon \mathbf{SL}_2(\mathbf{C}) \to \mathbf{GL}_n(\mathbf{C})' class='latex' />. </p>
<p>To show that r cannot be injective, we will show that the composition <img src='http://l.wordpress.com/latex.php?latex=G+%5Cxrightarrow%7Br%7D+%5Cmathbf%7BGL%7D_n%28%5Cmathbf%7BR%7D%29+%5Cto+%5Cmathbf%7BGL%7D_n%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G \xrightarrow{r} \mathbf{GL}_n(\mathbf{R}) \to \mathbf{GL}_n(\mathbf{C})' title='G \xrightarrow{r} \mathbf{GL}_n(\mathbf{R}) \to \mathbf{GL}_n(\mathbf{C})' class='latex' /> is not injective, where the second map is the usual inclusion. I claim that this composition is the same map as the composition <img src='http://l.wordpress.com/latex.php?latex=G+%5Cxrightarrow%7B%5Cpi%7D+%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BR%7D%29+%5Cto+%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BC%7D%29+%5Cxrightarrow%7BF%7D+%5Cmathbf%7BGL%7D_n%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G \xrightarrow{\pi} \mathbf{SL}_2(\mathbf{R}) \to \mathbf{SL}_2(\mathbf{C}) \xrightarrow{F} \mathbf{GL}_n(\mathbf{C})' title='G \xrightarrow{\pi} \mathbf{SL}_2(\mathbf{R}) \to \mathbf{SL}_2(\mathbf{C}) \xrightarrow{F} \mathbf{GL}_n(\mathbf{C})' class='latex' />, where <img src='http://l.wordpress.com/latex.php?latex=%5Cpi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\pi' title='\pi' class='latex' /> is the covering space map. By construction, these two compositions induce the same differentials on their Lie algebras. Now using the fact that both G and <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BGL%7D_n%28%5Cmathbf%7BC%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{GL}_n(\mathbf{C})' title='\mathbf{GL}_n(\mathbf{C})' class='latex' /> are connected, this implies that the map on the level of Lie groups must be equal as well. But <img src='http://l.wordpress.com/latex.php?latex=%5Cpi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\pi' title='\pi' class='latex' /> is not injective: we saw above that the fundamental group for <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BSL%7D_2%28%5Cmathbf%7BR%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{SL}_2(\mathbf{R})' title='\mathbf{SL}_2(\mathbf{R})' class='latex' /> is nontrivial, so we are done.</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/507/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/507/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/507/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/507/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/507/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/507/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/507/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/507/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/507/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/507/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=507&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/07/10/a-lie-group-which-isnt-a-matrix-group/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">masnevets</media:title>
		</media:content>
	</item>
		<item>
		<title>Pfaffians and Plücker ideals</title>
		<link>http://concretenonsense.wordpress.com/2009/06/24/pfaffians-and-plucker-ideals/</link>
		<comments>http://concretenonsense.wordpress.com/2009/06/24/pfaffians-and-plucker-ideals/#comments</comments>
		<pubDate>Wed, 24 Jun 2009 21:34:58 +0000</pubDate>
		<dc:creator>Steven Sam</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[commutative algebra]]></category>
		<category><![CDATA[grassmannian]]></category>
		<category><![CDATA[linear algebra]]></category>
		<category><![CDATA[pfaffians]]></category>
		<category><![CDATA[syzygies]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=502</guid>
		<description><![CDATA[In this post, I want to discuss Pfaffians, a topic which I wish I had learned about as an undergraduate. I&#8217;m very interested in syzygies of ideals and such, and every now and then Pfaffians come up, so if only I knew what they were! Now that I know, I want to explain what they [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=502&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>In this post, I want to discuss Pfaffians, a topic which I wish I had learned about as an undergraduate. I&#8217;m very interested in syzygies of ideals and such, and every now and then Pfaffians come up, so if only I knew what they were! Now that I know, I want to explain what they are and how they&#8217;re related to Plücker ideals.</p>
<p>Everything will be over the field K. If an n x n matrix has rank &lt; r, then this can be checked by showing that all of the r x r submatrices of it have determinant 0. In particular, since these r x r minors are polynomials in the entries of the matrix, this says that the set of all matrices of rank &lt; r is an algebraic subset Y of the space of all matrices. That it&#039;s irreducible can be seen by the following argument: let X be the space of n x n matrices, and let Gr(r-1, n) be the Grassmannian of r-1 planes in n-dimensional affine space. Then consider the subset Z of Gr(r-1, n) x X given by <img src='http://l.wordpress.com/latex.php?latex=%5C%7B%28W%2C+f%29+%5Cmid+%5Ctext%7Bimage%7D%28f%29+%5Csubseteq+W+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\{(W, f) \mid \text{image}(f) \subseteq W \}' title='\{(W, f) \mid \text{image}(f) \subseteq W \}' class='latex' />. If R is the tautological subbundle on Gr(r-1, n), then <img src='http://l.wordpress.com/latex.php?latex=Z+%3D+%5Cmathrm%7BHom%7D%28K%5En%2C+R%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z = \mathrm{Hom}(K^n, R)' title='Z = \mathrm{Hom}(K^n, R)' class='latex' />  is a vector bundle over Gr(r-1, n) and hence is irreducible. But the image of Z under the projection <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BGr%7D%28r-1%2C+n%29+%5Ctimes+X+%5Cto+X&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Gr}(r-1, n) \times X \to X' title='\text{Gr}(r-1, n) \times X \to X' class='latex' /> is Y, so Y is also irreducible.</p>
<p>It&#039;s not so clear that the ideal generated by the r x r minors of a generic (= entries are algebraically independent variables over K) n x n matrix is radical, but this turns out to be true (one way to show that this is true is to find an explicit Gröbner basis for it).</p>
<p>But what if we only care about skew-symmetric matrices? To check if a matrix has rank &lt; r, we could do the same as above, but the ideal generated by the r x r minors of a generic skew-symmetric matrix will NOT be radical. One problem already is that the determinant of any skew-symmetric matrix is always a perfect square in the field K, and hence our ideal should contain these square roots, which are called Pfaffians.<br />
<span id="more-502"></span><br />
First I&#8217;d like to prove this last statement. Say M is a skew-symmetric n x n matrix. We want to find a number r such that M can be transformed isometrically into the matrix <img src='http://l.wordpress.com/latex.php?latex=%5Cleft%5B+%5Cbegin%7Bmatrix%7D+0+%26+I_r+%26+0+%5C%5C+-I_r+%26+0+%26+0+%5C%5C+0+%26+0+%26+0+%5Cend%7Bmatrix%7D+%5Cright%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\left[ \begin{matrix} 0 &amp; I_r &amp; 0 \\ -I_r &amp; 0 &amp; 0 \\ 0 &amp; 0 &amp; 0 \end{matrix} \right]' title='\left[ \begin{matrix} 0 &amp; I_r &amp; 0 \\ -I_r &amp; 0 &amp; 0 \\ 0 &amp; 0 &amp; 0 \end{matrix} \right]' class='latex' /> where <img src='http://l.wordpress.com/latex.php?latex=I_r&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_r' title='I_r' class='latex' /> is the r x r identity matrix (r could be 0, in which case these rows don&#8217;t appear), and the bottom row consists of n-2r rows of zeroes. First, M represents a bilinear form <img src='http://l.wordpress.com/latex.php?latex=%5Clangle%5C+%2C%5C+%5Crangle+%5Ccolon+K%5En+%5Ctimes+K%5En+%5Cto+K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle\ ,\ \rangle \colon K^n \times K^n \to K' title='\langle\ ,\ \rangle \colon K^n \times K^n \to K' class='latex' /> given by <img src='http://l.wordpress.com/latex.php?latex=%5Clangle+e_i%2C+e_j+%5Crangle+%3D+m_%7Bi%2Cj%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle e_i, e_j \rangle = m_{i,j}' title='\langle e_i, e_j \rangle = m_{i,j}' class='latex' />, where <img src='http://l.wordpress.com/latex.php?latex=e_1%2C+%5Cdots%2C+e_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='e_1, \dots, e_n' title='e_1, \dots, e_n' class='latex' /> is the standard basis for <img src='http://l.wordpress.com/latex.php?latex=K%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K^n' title='K^n' class='latex' />. The skew-symmetry of M means that this form is skew-symmetric. Let L be the kernel of this form, i.e., the set of all x such that <img src='http://l.wordpress.com/latex.php?latex=%5Clangle+x%2C+y+%5Crangle+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle x, y \rangle = 0' title='\langle x, y \rangle = 0' class='latex' /> for all y. Then the form restricted to any complementary subspace L&#8217; of L inside of <img src='http://l.wordpress.com/latex.php?latex=K%5En&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K^n' title='K^n' class='latex' /> will be nondegenerate. So for any nonzero x in L&#8217;, we can find y in L&#8217; such that <img src='http://l.wordpress.com/latex.php?latex=%5Clangle+x%2C+y+%5Crangle+%3D+1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle x, y \rangle = 1' title='\langle x, y \rangle = 1' class='latex' />. Repeating this on the orthogonal complement of L&#8217; inside of L, we can find a basis <img src='http://l.wordpress.com/latex.php?latex=x_1%2C+%5Cdots%2C+x_r%2C+y_1%2C+%5Cdots%2C+y_r&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_1, \dots, x_r, y_1, \dots, y_r' title='x_1, \dots, x_r, y_1, \dots, y_r' class='latex' /> for L&#8217; such that <img src='http://l.wordpress.com/latex.php?latex=%5Clangle+x_i%2C+x_j+%5Crangle+%3D+%5Clangle+y_i%2C+y_j+%5Crangle+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle x_i, x_j \rangle = \langle y_i, y_j \rangle = 0' title='\langle x_i, x_j \rangle = \langle y_i, y_j \rangle = 0' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Clangle+x_i%2C+y_j+%5Crangle+%3D+%5Cdelta_%7Bij%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle x_i, y_j \rangle = \delta_{ij}' title='\langle x_i, y_j \rangle = \delta_{ij}' class='latex' /> is the Kronecker delta. Representing M in this basis gives the desired form. Note that if B is the matrix whose columns are <img src='http://l.wordpress.com/latex.php?latex=x_1%2C+%5Cdots%2C+x_r%2C+y_1%2C+%5Cdots%2C+y_r&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_1, \dots, x_r, y_1, \dots, y_r' title='x_1, \dots, x_r, y_1, \dots, y_r' class='latex' />, then the matrix representing the bilinear form <img src='http://l.wordpress.com/latex.php?latex=%5Clangle%5C+%2C%5C+%5Crangle&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\langle\ ,\ \rangle' title='\langle\ ,\ \rangle' class='latex' /> with respect to this new basis is <img src='http://l.wordpress.com/latex.php?latex=B%5Et+M+B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B^t M B' title='B^t M B' class='latex' /> instead of <img src='http://l.wordpress.com/latex.php?latex=B%5E%7B-1%7D+M+B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B^{-1} M B' title='B^{-1} M B' class='latex' />.</p>
<p>This says three things: (1) the rank of M is always even, and (2) <img src='http://l.wordpress.com/latex.php?latex=%5Cdet%28B%5Et%29+%5Cdet%28M%29+%5Cdet%28B%29+%3D+%5Cdet%28B%29%5E2+%5Cdet%28M%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\det(B^t) \det(M) \det(B) = \det(B)^2 \det(M)' title='\det(B^t) \det(M) \det(B) = \det(B)^2 \det(M)' class='latex' /> is either 0 or 1, so <img src='http://l.wordpress.com/latex.php?latex=%5Cdet%28M%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\det(M)' title='\det(M)' class='latex' /> is the square of something, which we call the Pfaffian of M, and (3) if we want to test the condition that rank M &lt; r, we need only check if the principal r x r minors (i.e., when the row indices and column indices are the same) are 0. Since these submatrices are themselves skew-symmetric, they also have Pfaffians, so it&#039;s equivalent to check if they are 0.</p>
<p>Do these give polynomial equations? Let M now be a generic skew-symmetric matrix with algebraically independent entries <img src='http://l.wordpress.com/latex.php?latex=x_%7Bij%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_{ij}' title='x_{ij}' class='latex' /> for <img src='http://l.wordpress.com/latex.php?latex=1+%5Cle+i+%3C+j+%5Cle+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='1 \le i &lt; j \le n' title='1 \le i &lt; j \le n' class='latex' />, so that <img src='http://l.wordpress.com/latex.php?latex=x_%7Bji%7D+%3D+-x_%7Bij%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x_{ji} = -x_{ij}' title='x_{ji} = -x_{ij}' class='latex' />, and let K be the function field <img src='http://l.wordpress.com/latex.php?latex=%7B%5Cbf+Q%7D%28x_%7Bij%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\bf Q}(x_{ij})' title='{\bf Q}(x_{ij})' class='latex' />. By the above, the determinant of M is a square of something in <img src='http://l.wordpress.com/latex.php?latex=%7B%5Cbf+Q%7D%28x_%7Bij%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\bf Q}(x_{ij})' title='{\bf Q}(x_{ij})' class='latex' />, which we denote by Pf(M). But the determinant of M is a polynomial in <img src='http://l.wordpress.com/latex.php?latex=%7B%5Cbf+Z%7D%5Bx_%7Bij%7D%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\bf Z}[x_{ij}]' title='{\bf Z}[x_{ij}]' class='latex' />, so by the fact that <img src='http://l.wordpress.com/latex.php?latex=%7B%5Cbf+Z%7D%5Bx_%7Bij%7D%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\bf Z}[x_{ij}]' title='{\bf Z}[x_{ij}]' class='latex' /> is a UFD and Gauss&#039; lemma, this square root actually lives in <img src='http://l.wordpress.com/latex.php?latex=%7B%5Cbf+Z%7D%5Bx_%7Bij%7D%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='{\bf Z}[x_{ij}]' title='{\bf Z}[x_{ij}]' class='latex' />. There&#039;s some ambiguity up to sign regarding which root to take, so we just pick one. So we see that the Pfaffians are polynomials in the entries of M, and hence the locus of skew-symmetric matrices of rank &lt; r is also a subvariety of the space of skew-symmetric matrices. Since the rank of M must always be even, we should assume that r is odd. It turns out that the ideal generated by the Pfaffians of the (r+1) x (r+1) principal minors of M (just call these the (r+1) x (r+1) Pfaffians of M) will be radical.</p>
<p>Now that we&#039;ve done that, how are Pfaffians related to Plücker ideals? First I&#039;ll say what those are: given the Grassmannian Gr(r, n), we can embed it inside of <img src='http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bn%7D%7Br%7D-1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\binom{n}{r}-1' title='\binom{n}{r}-1' class='latex' /> dimensional projective space by representing a subspace by an r x n matrix and then sending it to the <img src='http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bn%7D%7Br%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\binom{n}{r}' title='\binom{n}{r}' class='latex' />-tuple of its r x r minors. The homogeneous ideal which defines the image is a Plücker ideal <img src='http://l.wordpress.com/latex.php?latex=I_%7Br%2Cn%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_{r,n}' title='I_{r,n}' class='latex' />. Of course, we could forget that this ideal is homogeneous, and then it would define a subvariety (the affine cone) of <img src='http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bn%7D%7Br%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\binom{n}{r}' title='\binom{n}{r}' class='latex' /> dimensional affine space. In the case that r=2, the elements of <img src='http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bn%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\binom{n}{2}' title='\binom{n}{2}' class='latex' /> dimensional affine space can be identified with skew-symmetric n x n matrices (there are <img src='http://l.wordpress.com/latex.php?latex=%5Cbinom%7Bn%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\binom{n}{2}' title='\binom{n}{2}' class='latex' /> elements above the diagonal), and the image of the Grassmannian corresponds to those which have rank at most 2 (because they are minors of a 2-dimensional subspaces). Hence the Plücker ideal <img src='http://l.wordpress.com/latex.php?latex=I_%7B2%2Cn%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_{2,n}' title='I_{2,n}' class='latex' /> is generated by the 4 x 4 Pfaffians of a generic n x n skew-symmetric matrix.</p>
<p>Why is this relevant? It&#039;s known how to write down the minimal free resolutions for the Pfaffians of a generic skew-symmetric matrix (you can find this in Section 6.4 of Jerzy Weyman&#039;s book <i>Cohomology of Vector Bundles and Syzygies</i>), so this gives for free the case of the Plücker ideals when r=2. The general case r&gt;2 is not known, however. The case r=3 and n=6 can be done in <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay 2</a> in a few seconds (use the command <tt>res Grassmannian(2,5)</tt>), but I think any larger examples are computationally too expensive. In principal, they can be written down by hand using the techniques of Section 7.3 of the above book. There, the difficulties arise in trying to solve some plethysm problems for the general linear group. So it&#8217;s likely that a closed form solution will never be attainable.</p>
<p>-Steven </p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/502/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/502/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/502/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/502/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/502/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/502/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/502/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/502/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/502/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/502/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=502&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/06/24/pfaffians-and-plucker-ideals/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">masnevets</media:title>
		</media:content>
	</item>
		<item>
		<title>A Useful Symmetric Function Identity</title>
		<link>http://concretenonsense.wordpress.com/2009/04/09/a-useful-symmetric-function-identity/</link>
		<comments>http://concretenonsense.wordpress.com/2009/04/09/a-useful-symmetric-function-identity/#comments</comments>
		<pubDate>Thu, 09 Apr 2009 04:12:23 +0000</pubDate>
		<dc:creator>yanzhang</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Combinatorics]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=439</guid>
		<description><![CDATA[A not often-mentioned skill that I have been trying to develop is the evaluation of the &#8220;usefulness&#8221; of statements. Given my horrible memory and degrading mental RAM, I must prioritize which facts to consciously absorb and which ones to skim, since I&#8217;m sure I forget at least one theorem every time I learn a new [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=439&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>A not often-mentioned skill that I have been trying to develop is the evaluation of the &#8220;usefulness&#8221; of statements. Given my horrible memory and degrading mental RAM, I must prioritize which facts to consciously absorb and which ones to skim, since I&#8217;m sure I forget at least one theorem every time I learn a new one. Luckily, books aid to an extent by labelling the important things &#8220;Theorems&#8221; and &#8220;Lemmas,&#8221; though sometimes the latter are just as important as (if not much more than) the former, and sometimes even more important items appear in the Exercises section. Something about Exercise 7.70 in Richard Stanley&#8217;s <em>Enumerative Combinatorics 2</em> really struck me as &#8220;useful.&#8221; The statement is:</p>
<p style="padding-left:30px;"><img src='http://l.wordpress.com/latex.php?latex=%5Csum_%7B%5Clambda+%5Cvdash+n%7D+H_%5Clambda%5E%7Bk-2%7D+%5Cprod_i%5Ek+s_%5Clambda%28x%5E%7B%28i%29%7D%29+%3D+%5Cfrac%7B1%7D%7Bn%21%7D%5Csum_%7B%5Cprod+w_i+%3D+1%7D+%5Cprod_i%5Ek+p_%7B%5Crho%28w_i%29%7D%28x%5E%7B%28i%29%7D%29%2C&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\sum_{\lambda \vdash n} H_\lambda^{k-2} \prod_i^k s_\lambda(x^{(i)}) = \frac{1}{n!}\sum_{\prod w_i = 1} \prod_i^k p_{\rho(w_i)}(x^{(i)}),' title='\sum_{\lambda \vdash n} H_\lambda^{k-2} \prod_i^k s_\lambda(x^{(i)}) = \frac{1}{n!}\sum_{\prod w_i = 1} \prod_i^k p_{\rho(w_i)}(x^{(i)}),' class='latex' /> where the <img src='http://l.wordpress.com/latex.php?latex=x%5E%7B%28i%29%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x^{(i)}' title='x^{(i)}' class='latex' /> are sets of variables, <img src='http://l.wordpress.com/latex.php?latex=H_%5Clambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='H_\lambda' title='H_\lambda' class='latex' /> the product of the hook-lengths, <img src='http://l.wordpress.com/latex.php?latex=%5Crho%28w%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\rho(w)' title='\rho(w)' class='latex' /> gives the cycle structure, and <img src='http://l.wordpress.com/latex.php?latex=w_i&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w_i' title='w_i' class='latex' /> are permutations of size <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' />.<span id="more-439"></span></p>
<p>Two things make the intuition of &#8220;useful&#8221; more concrete:</p>
<p>One, the statement has a lot of flexibility; By the symmetry of the symmetric group and the fact that cycles are preserved under inverses, you can sum over, say, products of all ordered <img src='http://l.wordpress.com/latex.php?latex=%28k-1%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(k-1)' title='(k-1)' class='latex' />-tuples of <img src='http://l.wordpress.com/latex.php?latex=w_i&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w_i' title='w_i' class='latex' /> by rewriting the sum on the right as over <img src='http://l.wordpress.com/latex.php?latex=w_1+%3D+w_2%5Cldots+w_k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w_1 = w_2\ldots w_k' title='w_1 = w_2\ldots w_k' class='latex' />, for example, or sum over pairs which give the same product, say <img src='http://l.wordpress.com/latex.php?latex=w_1w_2+%3D+w_3w_4&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w_1w_2 = w_3w_4' title='w_1w_2 = w_3w_4' class='latex' />. Furthermore, having the choice over the variables makes a lot of specialization techniques useful. For example, you can &#8220;pick out&#8221; cycles by specializing <img src='http://l.wordpress.com/latex.php?latex=x%5E%7B%28i%29%7D+%3D+%281%2C+%5Czeta%2C+%5Cldots%2C+%5Czeta%5E%7Bn-1%7D%2C+0%2C+0%2C+%5Cldots%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x^{(i)} = (1, \zeta, \ldots, \zeta^{n-1}, 0, 0, \ldots)' title='x^{(i)} = (1, \zeta, \ldots, \zeta^{n-1}, 0, 0, \ldots)' class='latex' />, where <img src='http://l.wordpress.com/latex.php?latex=%5Czeta&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\zeta' title='\zeta' class='latex' /> is an <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' />-th root of unity, because the power sums then give <img src='http://l.wordpress.com/latex.php?latex=p_c%28x%5E%7B%28i%29%7D%29+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='p_c(x^{(i)}) = 0' title='p_c(x^{(i)}) = 0' class='latex' /> unless <img src='http://l.wordpress.com/latex.php?latex=c+%3D+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='c = n' title='c = n' class='latex' />.</p>
<p>Two, the statement has a lot of power; the proof of this fact has a &#8220;Stanley difficulty&#8221; of [3] (out of 5) means it contains some nontrivial usage of the symmetric function machinery already. Thus, by using it we know we are backed with some complex stuff in the background. Note when <img src='http://l.wordpress.com/latex.php?latex=k+%3D+1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k = 1' title='k = 1' class='latex' />, we get the amazing Hook-length formula directly; when <img src='http://l.wordpress.com/latex.php?latex=k+%3D+2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k = 2' title='k = 2' class='latex' />, by observing that summing over <img src='http://l.wordpress.com/latex.php?latex=w_1w_2+%3D+1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w_1w_2 = 1' title='w_1w_2 = 1' class='latex' /> is really summing over a single <img src='http://l.wordpress.com/latex.php?latex=w&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w' title='w' class='latex' /> (a special case of our discussion above on &#8220;flexibility&#8221;), we get the familiar &#8220;inner product&#8221; identity<img src='http://l.wordpress.com/latex.php?latex=%5Csum_%7B%5Clambda+%5Cvdash+n%7D+s_%5Clambda%28x%29+s_%5Clambda%28y%29+%3D+%5Cfrac%7B1%7D%7Bn%21%7D%5Csum_w+p_%7B%5Crho%28w%29%7D%28x%29+p_%7B%5Crho%28w%29%7D%28y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\sum_{\lambda \vdash n} s_\lambda(x) s_\lambda(y) = \frac{1}{n!}\sum_w p_{\rho(w)}(x) p_{\rho(w)}(y)' title='\sum_{\lambda \vdash n} s_\lambda(x) s_\lambda(y) = \frac{1}{n!}\sum_w p_{\rho(w)}(x) p_{\rho(w)}(y)' class='latex' />. These are two nontrivial statements without an obvious connection with each other, a pleasant surprise.</p>
<p>This warm &#8220;finding a hidden gem&#8221; feeling is very nice.</p>
<p>-Y</p>
<p>P.S. Well, there is a third (and less glamorous) cue, which is that at least two problems in the problem sets came with the hint: &#8220;Look at Exercise 7.70.&#8221; The power of hindsight in all its glory, I suppose. However, I liked this statement too much that I needed an excuse to write it down, so shhh.</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/439/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/439/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/439/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/439/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/439/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/439/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/439/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/439/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/439/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/439/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=439&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/04/09/a-useful-symmetric-function-identity/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">KR</media:title>
		</media:content>
	</item>
		<item>
		<title>Lagrange&#8217;s four square theorem</title>
		<link>http://concretenonsense.wordpress.com/2009/02/10/lagranges-four-square-theorem/</link>
		<comments>http://concretenonsense.wordpress.com/2009/02/10/lagranges-four-square-theorem/#comments</comments>
		<pubDate>Tue, 10 Feb 2009 06:35:06 +0000</pubDate>
		<dc:creator>Steven Sam</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[convex geometry]]></category>
		<category><![CDATA[number theory]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=286</guid>
		<description><![CDATA[I wanted to present a proof of Lagrange&#8217;s four square theorem that I had seen a few years ago that I really like. I think there&#8217;s also some approaches using analytic number theory and algebraic number theory, but this one uses convex geometry (!) First, let me state the theorem (my convention here is that [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=286&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>I wanted to present a proof of Lagrange&#8217;s four square theorem that I had seen a few years ago that I really like. I think there&#8217;s also some approaches using analytic number theory and algebraic number theory, but this one uses convex geometry (!) First, let me state the theorem (my convention here is that <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BN%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{N}' title='\mathbf{N}' class='latex' /> denotes the nonnegative integers):</p>
<p><strong>Theorem</strong> (Lagrange). Every nonnegative integer can be written as a sum of four squares, i.e., the function <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BN%7D%5E4+%5Cto+%5Cmathbf%7BN%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{N}^4 \to \mathbf{N}' title='\mathbf{N}^4 \to \mathbf{N}' class='latex' /> given by <img src='http://l.wordpress.com/latex.php?latex=%28x%2Cy%2Cz%2Cw%29+%5Cmapsto+x%5E2+%2B+y%5E2+%2B+z%5E2+%2B+w%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x,y,z,w) \mapsto x^2 + y^2 + z^2 + w^2' title='(x,y,z,w) \mapsto x^2 + y^2 + z^2 + w^2' class='latex' /> is surjective.<br />
<span id="more-286"></span><br />
In order to make this (reasonably) self-contained, let&#8217;s give some definitions we&#8217;ll use.</p>
<p>A <strong>lattice</strong> <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' /> is a discrete subgroup of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{R}^d' title='\mathbf{R}^d' class='latex' /> which spans <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{R}^d' title='\mathbf{R}^d' class='latex' /> in the sense of vector spaces. Basically, a lattice will be some subgroup of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{R}^d' title='\mathbf{R}^d' class='latex' /> which is isomorphic to <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BZ%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{Z}^d' title='\mathbf{Z}^d' class='latex' />. If <img src='http://l.wordpress.com/latex.php?latex=%5C%7Bv_1%2C+%5Cdots%2C+v_d%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\{v_1, \dots, v_d\}' title='\{v_1, \dots, v_d\}' class='latex' /> is a basis for <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' />, define <img src='http://l.wordpress.com/latex.php?latex=%5Cdet+%5CLambda+%3A%3D+%5Cdet+%28v_1+%5Ccdots+v_d%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\det \Lambda := \det (v_1 \cdots v_d)' title='\det \Lambda := \det (v_1 \cdots v_d)' class='latex' /> to be the <strong>determinant</strong> of <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' />. Define the <strong>fundamental parallelepiped</strong> of <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' /> to be the set <img src='http://l.wordpress.com/latex.php?latex=%5C%7B+a_1v_1+%2B+%5Ccdots+%2B+a_dv_d+%5Cmid+0+%5Cle+a_i+%3C+1+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\{ a_1v_1 + \cdots + a_dv_d \mid 0 \le a_i &lt; 1 \}' title='\{ a_1v_1 + \cdots + a_dv_d \mid 0 \le a_i &lt; 1 \}' class='latex' />.</p>
<p>Now we just need some convex geometry. The main tool will be Minkowski&#8217;s theorem. The proof is short, so I&#8217;ll include it.</p>
<p><strong>Lemma</strong> (Blichfeldt). Let <img src='http://l.wordpress.com/latex.php?latex=%5CLambda+%5Csubset+%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda \subset \mathbf{R}^d' title='\Lambda \subset \mathbf{R}^d' class='latex' /> be a lattice and <img src='http://l.wordpress.com/latex.php?latex=X+%5Csubseteq+%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X \subseteq \mathbf{R}^d' title='X \subseteq \mathbf{R}^d' class='latex' /> be a measurable set. If <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7Bvol%7D+X+%3E+%5Cdet+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{vol} X &gt; \det \Lambda' title='\text{vol} X &gt; \det \Lambda' class='latex' />, then there exist distinct <img src='http://l.wordpress.com/latex.php?latex=x%2Cy+%5Cin+X&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x,y \in X' title='x,y \in X' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=x-y+%5Cin+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x-y \in \Lambda' title='x-y \in \Lambda' class='latex' />.</p>
<p><em>Proof</em>. Let <img src='http://l.wordpress.com/latex.php?latex=%5CPi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Pi' title='\Pi' class='latex' /> be the fundamental parallelepiped of <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' />. Then <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BR%7D%5Ed+%3D+%5Ccoprod_%7Bu+%5Cin+%5CLambda%7D+%5CPi+%2B+u&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{R}^d = \coprod_{u \in \Lambda} \Pi + u' title='\mathbf{R}^d = \coprod_{u \in \Lambda} \Pi + u' class='latex' /> (disjoint union), and hence <img src='http://l.wordpress.com/latex.php?latex=X+%3D+%5Ccoprod_%7Bu+%5Cin+%5CLambda%7D+X+%5Ccap+%28%5CPi+%2B+u%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X = \coprod_{u \in \Lambda} X \cap (\Pi + u)' title='X = \coprod_{u \in \Lambda} X \cap (\Pi + u)' class='latex' />. Define <img src='http://l.wordpress.com/latex.php?latex=X_u+%3A%3D+%28X+-+u%29+%5Ccap+%5CPi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X_u := (X - u) \cap \Pi' title='X_u := (X - u) \cap \Pi' class='latex' />. Then</p>
<p><img src='http://l.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Ctext%7Bvol%7D+X+%3D+%5Csum_%7Bu+%5Cin+%5CLambda%7D+%5Ctext%7Bvol%7D+%28X_u+%2B+u%29+%3D+%5Csum_%7Bu+%5Cin+%5CLambda%7D+%5Ctext%7Bvol%7D+X_u+%3E+%5Cdet+%5CLambda+%3D+%5Ctext%7Bvol%7D+%5CPi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\displaystyle \text{vol} X = \sum_{u \in \Lambda} \text{vol} (X_u + u) = \sum_{u \in \Lambda} \text{vol} X_u &gt; \det \Lambda = \text{vol} \Pi' title='\displaystyle \text{vol} X = \sum_{u \in \Lambda} \text{vol} (X_u + u) = \sum_{u \in \Lambda} \text{vol} X_u &gt; \det \Lambda = \text{vol} \Pi' class='latex' />.</p>
<p>Since each <img src='http://l.wordpress.com/latex.php?latex=X_u+%5Csubseteq+%5CPi&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X_u \subseteq \Pi' title='X_u \subseteq \Pi' class='latex' />, there must exist distinct <img src='http://l.wordpress.com/latex.php?latex=u%2C+u%27+%5Cin+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='u, u&#039; \in \Lambda' title='u, u&#039; \in \Lambda' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=X_u+%5Ccap+X_%7Bu%27%7D+%5Cne+%5Cemptyset&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X_u \cap X_{u&#039;} \ne \emptyset' title='X_u \cap X_{u&#039;} \ne \emptyset' class='latex' />. Take <img src='http://l.wordpress.com/latex.php?latex=v+%5Cin+X_u+%5Ccap+X_%7Bu%27%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='v \in X_u \cap X_{u&#039;}' title='v \in X_u \cap X_{u&#039;}' class='latex' /> and set <img src='http://l.wordpress.com/latex.php?latex=x+%3D+v%2Bu&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x = v+u' title='x = v+u' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=y%3Dv%2Bu%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='y=v+u&#039;' title='y=v+u&#039;' class='latex' />. <img src='http://l.wordpress.com/latex.php?latex=%5Cblacksquare&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\blacksquare' title='\blacksquare' class='latex' /></p>
<p><strong>Lemma</strong> (Minkowski). Let <img src='http://l.wordpress.com/latex.php?latex=%5CLambda+%5Csubset+%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda \subset \mathbf{R}^d' title='\Lambda \subset \mathbf{R}^d' class='latex' /> be a lattice and <img src='http://l.wordpress.com/latex.php?latex=K+%5Csubseteq+%5Cmathbf%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K \subseteq \mathbf{R}^d' title='K \subseteq \mathbf{R}^d' class='latex' /> be a centrally symmetric (i.e., <img src='http://l.wordpress.com/latex.php?latex=x+%5Cin+K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x \in K' title='x \in K' class='latex' /> implies <img src='http://l.wordpress.com/latex.php?latex=-x+%5Cin+K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='-x \in K' title='-x \in K' class='latex' />) convex set such that <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7Bvol%7D+K+%3E+2%5Ed+%5Cdet+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{vol} K &gt; 2^d \det \Lambda' title='\text{vol} K &gt; 2^d \det \Lambda' class='latex' />. Then <img src='http://l.wordpress.com/latex.php?latex=K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K' title='K' class='latex' /> contains a nonzero element of <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' />.</p>
<p><em>Proof</em>. Set <img src='http://l.wordpress.com/latex.php?latex=K%27+%3A%3D+%5Cfrac%7B1%7D%7B2%7DK&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K&#039; := \frac{1}{2}K' title='K&#039; := \frac{1}{2}K' class='latex' />, so <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7Bvol%7D+K%27+%3D+%5Cfrac%7B1%7D%7B2%5Ed%7D+%5Ctext%7Bvol%7D+K+%3E+%5Cdet+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{vol} K&#039; = \frac{1}{2^d} \text{vol} K &gt; \det \Lambda' title='\text{vol} K&#039; = \frac{1}{2^d} \text{vol} K &gt; \det \Lambda' class='latex' />. Then there exist distinct <img src='http://l.wordpress.com/latex.php?latex=x%2Cy+%5Cin+K%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x,y \in K&#039;' title='x,y \in K&#039;' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=x-y+%5Cin+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x-y \in \Lambda' title='x-y \in \Lambda' class='latex' />. Since <img src='http://l.wordpress.com/latex.php?latex=-y+%5Cin+K%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='-y \in K&#039;' title='-y \in K&#039;' class='latex' />, we have <img src='http://l.wordpress.com/latex.php?latex=x-y+%5Cin+2K%27+%3D+K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x-y \in 2K&#039; = K' title='x-y \in 2K&#039; = K' class='latex' />. <img src='http://l.wordpress.com/latex.php?latex=%5Cblacksquare&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\blacksquare' title='\blacksquare' class='latex' /></p>
<p>Now we can write down a proof of Lagrange&#8217;s four square theorem.</p>
<p><em>Proof</em>. Pick <img src='http://l.wordpress.com/latex.php?latex=n+%5Cin+%5Cmathbf%7BN%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n \in \mathbf{N}' title='n \in \mathbf{N}' class='latex' />. We break the proof up into three steps.</p>
<p>Step 1: Reduce to the case that <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' /> is prime. The sum of four squares <img src='http://l.wordpress.com/latex.php?latex=a%5E2%2Bb%5E2%2Bc%5E2%2Bd%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a^2+b^2+c^2+d^2' title='a^2+b^2+c^2+d^2' class='latex' /> is the square of the norm of a quaternion <img src='http://l.wordpress.com/latex.php?latex=a%2Bbi%2Bcj%2Bdk&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a+bi+cj+dk' title='a+bi+cj+dk' class='latex' />. Since norm is multiplicative, the product of two sums of four squares is itself a sum of four squares. This can be checked directly, but it&#8217;s not really that interesting.</p>
<p>Step 2: Find <img src='http://l.wordpress.com/latex.php?latex=%5Calpha%2C+%5Cbeta+%5Cin+%5Cmathbf%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha, \beta \in \mathbf{Z}' title='\alpha, \beta \in \mathbf{Z}' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=%5Calpha%5E2+%2B+%5Cbeta%5E2+%2B+1+%5Cequiv+0+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha^2 + \beta^2 + 1 \equiv 0 \pmod n' title='\alpha^2 + \beta^2 + 1 \equiv 0 \pmod n' class='latex' />. If <img src='http://l.wordpress.com/latex.php?latex=n%3D2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n=2' title='n=2' class='latex' />, take <img src='http://l.wordpress.com/latex.php?latex=%5Calpha+%3D+1&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha = 1' title='\alpha = 1' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=%5Cbeta+%3D+0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\beta = 0' title='\beta = 0' class='latex' />. Otherwise, assume <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' /> is odd. Define<br />
<img src='http://l.wordpress.com/latex.php?latex=S+%3A%3D+%5C%7B+%5Calpha%5E2+%5Cpmod+n+%5Cmid+0+%5Cle+%5Calpha+%3C+%5Cfrac%7Bn%7D%7B2%7D+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S := \{ \alpha^2 \pmod n \mid 0 \le \alpha &lt; \frac{n}{2} \}' title='S := \{ \alpha^2 \pmod n \mid 0 \le \alpha &lt; \frac{n}{2} \}' class='latex' />. Choose <img src='http://l.wordpress.com/latex.php?latex=0+%5Cle+%5Calpha%2C+%5Calpha%27+%3C+%5Cfrac%7Bn%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0 \le \alpha, \alpha&#039; &lt; \frac{n}{2}' title='0 \le \alpha, \alpha&#039; &lt; \frac{n}{2}' class='latex' /> with <img src='http://l.wordpress.com/latex.php?latex=%5Calpha%5E2+%5Cequiv+%5Calpha%27%5E2+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha^2 \equiv \alpha&#039;^2 \pmod n' title='\alpha^2 \equiv \alpha&#039;^2 \pmod n' class='latex' />. Then <img src='http://l.wordpress.com/latex.php?latex=%28%5Calpha+%2B+%5Calpha%27%29%28%5Calpha+-+%5Calpha%27%29+%5Cequiv+0+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(\alpha + \alpha&#039;)(\alpha - \alpha&#039;) \equiv 0 \pmod n' title='(\alpha + \alpha&#039;)(\alpha - \alpha&#039;) \equiv 0 \pmod n' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=%5Calpha+%2B+%5Calpha%27+%5Cnot%5Cequiv+0+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha + \alpha&#039; \not\equiv 0 \pmod n' title='\alpha + \alpha&#039; \not\equiv 0 \pmod n' class='latex' /> since <img src='http://l.wordpress.com/latex.php?latex=%5Calpha+%2B+%5Calpha%27+%3C+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha + \alpha&#039; &lt; n' title='\alpha + \alpha&#039; &lt; n' class='latex' />, which implies that <img src='http://l.wordpress.com/latex.php?latex=%5Calpha+-+%5Calpha%27+%5Cequiv+0+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha - \alpha&#039; \equiv 0 \pmod n' title='\alpha - \alpha&#039; \equiv 0 \pmod n' class='latex' />, and hence <img src='http://l.wordpress.com/latex.php?latex=%5Calpha+%3D+%5Calpha%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha = \alpha&#039;' title='\alpha = \alpha&#039;' class='latex' />. So <img src='http://l.wordpress.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' /> has <img src='http://l.wordpress.com/latex.php?latex=%5Cfrac%7Bn%2B1%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\frac{n+1}{2}' title='\frac{n+1}{2}' class='latex' /> elements.</p>
<p>Similarly, define <img src='http://l.wordpress.com/latex.php?latex=S%27+%3A%3D+%5C%7B+-1+-%5Cbeta%5E2+%5Cpmod+n+%5Cmid+0+%5Cle+%5Cbeta+%3C+%5Cfrac%7Bn%7D%7B2%7D+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S&#039; := \{ -1 -\beta^2 \pmod n \mid 0 \le \beta &lt; \frac{n}{2} \}' title='S&#039; := \{ -1 -\beta^2 \pmod n \mid 0 \le \beta &lt; \frac{n}{2} \}' class='latex' />. Pick <img src='http://l.wordpress.com/latex.php?latex=0+%5Cle+%5Cbeta%2C+%5Cbeta%27+%3C+%5Cfrac%7Bn%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0 \le \beta, \beta&#039; &lt; \frac{n}{2}' title='0 \le \beta, \beta&#039; &lt; \frac{n}{2}' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=%5Cbeta%5E2+%5Cequiv+%5Cbeta%27%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\beta^2 \equiv \beta&#039;^2' title='\beta^2 \equiv \beta&#039;^2' class='latex' />. Then as before, <img src='http://l.wordpress.com/latex.php?latex=%5Cbeta+%3D+%5Cbeta%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\beta = \beta&#039;' title='\beta = \beta&#039;' class='latex' />, so <img src='http://l.wordpress.com/latex.php?latex=S%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S&#039;' title='S&#039;' class='latex' /> also has <img src='http://l.wordpress.com/latex.php?latex=%5Cfrac%7Bn%2B1%7D%7B2%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\frac{n+1}{2}' title='\frac{n+1}{2}' class='latex' /> elements. Hence <img src='http://l.wordpress.com/latex.php?latex=S+%5Ccap+S%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S \cap S&#039;' title='S \cap S&#039;' class='latex' /> cannot be empty by the pigeonhole principle, so we can find <img src='http://l.wordpress.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha' title='\alpha' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Cbeta&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\beta' title='\beta' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=%5Calpha%5E2+%5Cequiv+-1+-+%5Cbeta%5E2+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\alpha^2 \equiv -1 - \beta^2 \pmod n' title='\alpha^2 \equiv -1 - \beta^2 \pmod n' class='latex' />.</p>
<p>Step 3: Construct a suitable lattice and centrally symmetric convex body <img src='http://l.wordpress.com/latex.php?latex=K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K' title='K' class='latex' /> such that a lattice point in <img src='http://l.wordpress.com/latex.php?latex=K&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='K' title='K' class='latex' /> will correspond to an expression of <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' /> as a sum of four squares. Define <img src='http://l.wordpress.com/latex.php?latex=%5CLambda+%3A%3D+%5C%7B+a+%5Cin+%5Cmathbf%7BZ%7D%5E4+%5Cmid+a_1+%5Cequiv+%5Calpha+a_3+%2B+%5Cbeta+a_4+%5Cpmod+n%2C%5Cquad+a_2+%5Cequiv+%5Cbeta+a_3+-+%5Calpha+a_4+%5Cpmod+n+%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda := \{ a \in \mathbf{Z}^4 \mid a_1 \equiv \alpha a_3 + \beta a_4 \pmod n,\quad a_2 \equiv \beta a_3 - \alpha a_4 \pmod n \}' title='\Lambda := \{ a \in \mathbf{Z}^4 \mid a_1 \equiv \alpha a_3 + \beta a_4 \pmod n,\quad a_2 \equiv \beta a_3 - \alpha a_4 \pmod n \}' class='latex' />. Being a subgroup of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BZ%7D%5E4&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{Z}^4' title='\mathbf{Z}^4' class='latex' />, it is clear that <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' /> is discrete. Also, the set <img src='http://l.wordpress.com/latex.php?latex=%5C%7B0%2C%5Cdots%2Cn-1%5C%7D%5E2+%5Ctimes+%5C%7B%280%2C0%29%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\{0,\dots,n-1\}^2 \times \{(0,0)\}' title='\{0,\dots,n-1\}^2 \times \{(0,0)\}' class='latex' /> surjects onto <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BZ%7D%5E4+%2F+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{Z}^4 / \Lambda' title='\mathbf{Z}^4 / \Lambda' class='latex' /> under the projection, so <img src='http://l.wordpress.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\Lambda' title='\Lambda' class='latex' /> has finite index in <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BZ%7D%5E4&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{Z}^4' title='\mathbf{Z}^4' class='latex' />, and hence has full rank and <img src='http://l.wordpress.com/latex.php?latex=%5Cdet+%5CLambda+%3D+%5C%23%28%5Cmathbf%7BZ%7D%5E4+%2F+%5CLambda%29+%5Cle+n%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\det \Lambda = \#(\mathbf{Z}^4 / \Lambda) \le n^2' title='\det \Lambda = \#(\mathbf{Z}^4 / \Lambda) \le n^2' class='latex' />. Define <img src='http://l.wordpress.com/latex.php?latex=B+%3A%3D+%5C%7Ba+%5Cin+%5Cmathbf%7BR%7D%5E4+%5Cmid+%5C%7Ca%5C%7C+%3C+%5Csqrt%7B2n%7D%5C%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B := \{a \in \mathbf{R}^4 \mid \|a\| &lt; \sqrt{2n}\}' title='B := \{a \in \mathbf{R}^4 \mid \|a\| &lt; \sqrt{2n}\}' class='latex' />. Since</p>
<p><img src='http://l.wordpress.com/latex.php?latex=%5Cdisplaystyle+%5Ctext%7Bvol%7D+B+%3D+%5Cfrac%7B%5Cpi%5E2%7D%7B2%7D%28%5Csqrt%7B2n%7D%29%5E4+%3D+2%5Cpi%5E2n%5E2+%3E+16n%5E2+%5Cge+2%5E4+%5Cdet+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\displaystyle \text{vol} B = \frac{\pi^2}{2}(\sqrt{2n})^4 = 2\pi^2n^2 &gt; 16n^2 \ge 2^4 \det \Lambda' title='\displaystyle \text{vol} B = \frac{\pi^2}{2}(\sqrt{2n})^4 = 2\pi^2n^2 &gt; 16n^2 \ge 2^4 \det \Lambda' class='latex' />,</p>
<p>we can apply Minkowski&#8217;s theorem to find <img src='http://l.wordpress.com/latex.php?latex=a+%5Cin+%5CLambda&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a \in \Lambda' title='a \in \Lambda' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=0+%3C+%5C%7Ca%5C%7C%5E2+%3C+2n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0 &lt; \|a\|^2 &lt; 2n' title='0 &lt; \|a\|^2 &lt; 2n' class='latex' />. Now <img src='http://l.wordpress.com/latex.php?latex=%5C%7Ca%5C%7C%5E2+%3D+a_1%5E2+%2B+a_2%5E2+%2B+a_3%5E2+%2B+a_4%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\|a\|^2 = a_1^2 + a_2^2 + a_3^2 + a_4^2' title='\|a\|^2 = a_1^2 + a_2^2 + a_3^2 + a_4^2' class='latex' /> implies <img src='http://l.wordpress.com/latex.php?latex=%5C%7Ca%5C%7C%5E2+%5Cequiv+%28%5Calpha+a_3+%2B+%5Cbeta+a_4%29%5E2+%2B+%28%5Cbeta+a_3+-+%5Calpha+a_4%29%5E2+%2B+a_3%5E2+%2B+a_4%5E2+%5Cequiv+0+%5Cpmod+n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\|a\|^2 \equiv (\alpha a_3 + \beta a_4)^2 + (\beta a_3 - \alpha a_4)^2 + a_3^2 + a_4^2 \equiv 0 \pmod n' title='\|a\|^2 \equiv (\alpha a_3 + \beta a_4)^2 + (\beta a_3 - \alpha a_4)^2 + a_3^2 + a_4^2 \equiv 0 \pmod n' class='latex' />, and hence <img src='http://l.wordpress.com/latex.php?latex=a_1%5E2+%2B+a_2%5E2+%2B+a_3%5E2+%2B+a_4%5E2&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='a_1^2 + a_2^2 + a_3^2 + a_4^2' title='a_1^2 + a_2^2 + a_3^2 + a_4^2' class='latex' /> is a multiple of <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' />. From <img src='http://l.wordpress.com/latex.php?latex=0+%3C+%5C%7Ca%5C%7C%5E2+%3C+2n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0 &lt; \|a\|^2 &lt; 2n' title='0 &lt; \|a\|^2 &lt; 2n' class='latex' />, this multiple must be 1. <img src='http://l.wordpress.com/latex.php?latex=%5Cblacksquare&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\blacksquare' title='\blacksquare' class='latex' /></p>
<p>And there you have it!</p>
<p>-Steven</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/286/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/286/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/286/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/286/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/286/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/286/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/286/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/286/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/286/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/286/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=286&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2009/02/10/lagranges-four-square-theorem/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">masnevets</media:title>
		</media:content>
	</item>
		<item>
		<title>Wood, glue, and the Octahedral Axiom</title>
		<link>http://concretenonsense.wordpress.com/2008/12/22/wood-glue-and-the-octahedral-axiom/</link>
		<comments>http://concretenonsense.wordpress.com/2008/12/22/wood-glue-and-the-octahedral-axiom/#comments</comments>
		<pubDate>Mon, 22 Dec 2008 00:31:35 +0000</pubDate>
		<dc:creator>Alexander Ellis</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[arts and crafts]]></category>
		<category><![CDATA[homological algebra]]></category>
		<category><![CDATA[triangulated categories]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=201</guid>
		<description><![CDATA[Arts and crafts and mathematics have met before.  For instance, mathematical knitting isn&#8217;t new.  I&#8217;d like to talk about my humble (read: shoddy) contribution.
An important structure in homological algebra, especially when talking about things up to (co)chain homotopy,  is that of a triangulated category.  If you haven&#8217;t seen triangulated categories before, Wikipedia is [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=201&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>Arts and crafts and mathematics have met before.  For instance, <a href="http://www.toroidalsnark.net/mathknit.html" target="_new">mathematical</a> <a href="http://www.curbly.com/Tadiera/posts/756-Mathematics-and-Knitting" target="_new">knitting</a> <a href="http://www.boingboing.net/2006/12/27/knitting-mathematics.html" target="_new">isn&#8217;t</a> new.  I&#8217;d like to talk about my humble (read: shoddy) contribution.</p>
<p>An important structure in homological algebra, especially when talking about things up to (co)chain homotopy,  is that of a <b>triangulated category</b>.  If you haven&#8217;t seen triangulated categories before, <a href="http://en.wikipedia.org/wiki/Triangulated_category" target="_new">Wikipedia</a> is decent, but Chapter 10 of <a href="http://books.google.com/books?id=flm-dBXfZ_gC" target="_new">Weibel&#8217;s <i>Introduction to Homological Algebra</i></a> is better.  Here, I&#8217;m just going to be concerned with the <b>octahedral axiom</b>, whose statement is notoriously hard to picture.  (Throughout this post, I&#8217;ll be using the formulations and notations of Weibel.)</p>
<p><span id="more-201"></span></p>
<p>Let <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BK%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{K}' title='\mathbf{K}' class='latex' /> be an additive category and let <img src='http://l.wordpress.com/latex.php?latex=T%3A%5Cmathbf%7BK%7D%5Cto%5Cmathbf%7BK%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T:\mathbf{K}\to\mathbf{K}' title='T:\mathbf{K}\to\mathbf{K}' class='latex' /> be an automorphism of this category.  <img src="http://concretenonsense.files.wordpress.com/2008/12/exact_triangle.jpg?w=147&#038;h=87" alt="exact_triangle" title="exact_triangle" width="147" height="87" class="alignright size-full wp-image-210" />A <b>triangle</b> in <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BK%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{K}' title='\mathbf{K}' class='latex' /> is an ordered triple <img src='http://l.wordpress.com/latex.php?latex=%28A%2CB%2CC%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(A,B,C)' title='(A,B,C)' class='latex' /> of objects along with three morphisms: <img src='http://l.wordpress.com/latex.php?latex=u%3AA%5Cto+B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='u:A\to B' title='u:A\to B' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=v%3AB%5Cto+C&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='v:B\to C' title='v:B\to C' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=w%3AC%5Cto+TA&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='w:C\to TA' title='w:C\to TA' class='latex' />.  We write <img src='http://l.wordpress.com/latex.php?latex=%5Clbrace%28A%2CB%2CC%29%2C%28u%2Cv%2Cw%29%5Crbrace&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lbrace(A,B,C),(u,v,w)\rbrace' title='\lbrace(A,B,C),(u,v,w)\rbrace' class='latex' /> for short.  A <b>triangulated cateogry</b> is an additive category <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BK%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{K}' title='\mathbf{K}' class='latex' /> equipped with an automorphism <img src='http://l.wordpress.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' /> and a distinguished family of triangles which are called the <b>exact triangles</b>.  We usually draw an exact triangle as shown in the diagram to the right.  These data must satisfy four axioms, the last and most confusing of which is the following.</p>
<p><b>Octahedral Axiom</b>: Let <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbf%7BK%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbf{K}' title='\mathbf{K}' class='latex' /> be a category equipped with an automorphism <img src='http://l.wordpress.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' />.  Suppose we have three exact triangles: <img src='http://l.wordpress.com/latex.php?latex=%5Clbrace%28A%2CB%2CZ%29%2C%28u%2Cj%2C%5Cpartial%29%5Crbrace&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lbrace(A,B,Z),(u,j,\partial)\rbrace' title='\lbrace(A,B,Z),(u,j,\partial)\rbrace' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=%5Clbrace%28B%2CC%2CX%29%2C%28v%2Cx%2Ci%29%5Crbrace&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lbrace(B,C,X),(v,x,i)\rbrace' title='\lbrace(B,C,X),(v,x,i)\rbrace' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=%5Clbrace%28A%2CC%2CY%29%2C%28vu%2Cy%2C%5Cdelta%29%5Crbrace&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lbrace(A,C,Y),(vu,y,\delta)\rbrace' title='\lbrace(A,C,Y),(vu,y,\delta)\rbrace' class='latex' />.  Then there is a fourth exact triangle <img src='http://l.wordpress.com/latex.php?latex=%5Clbrace%28Z%2CY%2CX%29%2C%28f%2Cg%2C%28Tj%29i%29%5Crbrace&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\lbrace(Z,Y,X),(f,g,(Tj)i)\rbrace' title='\lbrace(Z,Y,X),(f,g,(Tj)i)\rbrace' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=%5Cpartial%3D%5Cdelta+f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\partial=\delta f' title='\partial=\delta f' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=x%3Dgy&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x=gy' title='x=gy' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=yv%3Dfj&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='yv=fj' title='yv=fj' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=u%5Cdelta%3Dig&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='u\delta=ig' title='u\delta=ig' class='latex' />.</p>
<p>This is usually pictured as an octahedron not unlike the image on the right, which I&#8217;ve shamelessly re-LaTexed from a diagram in section 10.2 of Weibel.  (The picture looks better there.)<img src="http://concretenonsense.files.wordpress.com/2008/12/octahedral.jpg?w=500&#038;h=211" alt="octahedral" title="octahedral" width="500" height="211" class="alignnone size-full wp-image-204" />  In this view, the equalities of morphisms in the Axiom take on geometric significance:  the equalities <img src='http://l.wordpress.com/latex.php?latex=%5Cpartial%3D%5Cdelta+f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\partial=\delta f' title='\partial=\delta f' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=x%3Dgy&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='x=gy' title='x=gy' class='latex' /> mean that the four non-exact faces all commute (two did automatically), and the equalities <img src='http://l.wordpress.com/latex.php?latex=yv%3Dfj&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='yv=fj' title='yv=fj' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=u%5Cdelta%3Dig&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='u\delta=ig' title='u\delta=ig' class='latex' /> say that the two shortest paths between <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Y' title='Y' class='latex' /> in either direction agree.  (There is an asymmetry here: the other two pairs of antipodal vertices do not have any such paths to compare.)</p>
<p>There is another common visualization, a planar one involving line segments consisting of two morphisms each.  See Weibel or Wikipedia.</p>
<p>There are a few annoying drawbacks to the octahedral diagram above:</p>
<ul>
<li>At a glance it&#8217;s not immediately clear which triangles commute and which are exact.</li>
<li>At a glance it&#8217;s not immediately clear which three exact triangles were given and which one was implied by the Axiom.</li>
<li>Some arrows involve the objects <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=Z&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z' title='Z' class='latex' />, while some involve <img src='http://l.wordpress.com/latex.php?latex=TA&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TA' title='TA' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=TB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TB' title='TB' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=TZ&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TZ' title='TZ' class='latex' />.  But in the diagram, we only have room for one or the other, so we omit the <img src='http://l.wordpress.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' />.  Since the convention for drawing an exact triangle already takes this into account, this no problem when considering exact triangles; but when we view the commuting triangles, we have to keep in mind this convention of writing <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> in place of <img src='http://l.wordpress.com/latex.php?latex=TB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TB' title='TB' class='latex' />.</li>
</ul>
<p>I like to see things clearly, immediately.  I don&#8217;t to have to think about which triangles commute and which are exact, or whether an arrow is really hitting <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> or <img src='http://l.wordpress.com/latex.php?latex=TB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TB' title='TB' class='latex' />.  All the problems above are fixed by my small pet project for this past weekend.  Check out the eye candy (in the second picture, you can kind of see six of the eight sides):</p>
<p><a href="http://math.columbia.edu/~ellis/on-plaid.jpg" target="_new"><img src="http://concretenonsense.files.wordpress.com/2008/12/on-plaid.jpg?w=500&#038;h=348" alt="on-plaid" title="on-plaid" width="500" height="348" class="alignnone size-full wp-image-203" /></a><a href="http://math.columbia.edu/~ellis/in-mirror.jpg" target="_new"><img src="http://concretenonsense.files.wordpress.com/2008/12/in-mirror.jpg?w=500&#038;h=375" alt="in-mirror" title="in-mirror" width="500" height="375" class="alignnone size-full wp-image-202" /></a></p>
<p>Other than the shoddy workmanship, here are some things to notice about the model and why it improves on the diagram above:</p>
<ul>
<li>It&#8217;s 3D!  You can hold it (but please, be gentle)!</li>
<li>Blue sides are exact triangles; yellow sides are commutative triangles.  The &#8220;output&#8221; exact triangle has been labeled (though not in the pictures above).  So the meanings of the triangles are obvious at a glance.</li>
<li>If a map goes to or from <img src='http://l.wordpress.com/latex.php?latex=TB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TB' title='TB' class='latex' /> instead of <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' />, then the vertex corresponding to <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> is labeled as <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> when part of an exact triangle (following the usual convention), but as <img src='http://l.wordpress.com/latex.php?latex=TB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='TB' title='TB' class='latex' /> on the yellow, commuting faces.  This is my favorite feature of the model.</li>
</ul>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/201/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/201/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/201/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/201/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/201/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/201/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/201/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/201/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/201/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/201/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=201&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2008/12/22/wood-glue-and-the-octahedral-axiom/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">Alex</media:title>
		</media:content>

		<media:content url="http://concretenonsense.files.wordpress.com/2008/12/exact_triangle.jpg" medium="image">
			<media:title type="html">exact_triangle</media:title>
		</media:content>

		<media:content url="http://concretenonsense.files.wordpress.com/2008/12/octahedral.jpg" medium="image">
			<media:title type="html">octahedral</media:title>
		</media:content>

		<media:content url="http://concretenonsense.files.wordpress.com/2008/12/on-plaid.jpg" medium="image">
			<media:title type="html">on-plaid</media:title>
		</media:content>

		<media:content url="http://concretenonsense.files.wordpress.com/2008/12/in-mirror.jpg" medium="image">
			<media:title type="html">in-mirror</media:title>
		</media:content>
	</item>
		<item>
		<title>A Silly Prime Avoidance Lemma</title>
		<link>http://concretenonsense.wordpress.com/2008/11/15/a-silly-prime-avoidance-lemma/</link>
		<comments>http://concretenonsense.wordpress.com/2008/11/15/a-silly-prime-avoidance-lemma/#comments</comments>
		<pubDate>Sat, 15 Nov 2008 22:45:04 +0000</pubDate>
		<dc:creator>Alexander Ellis</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Algebraic Geometry]]></category>
		<category><![CDATA[commutative algebra]]></category>
		<category><![CDATA[finite fields]]></category>
		<category><![CDATA[prime avoidance lemma]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=108</guid>
		<description><![CDATA[The other day I read this post over at Notational Notions.  The main result is the following.
Proposition: Let  be an infinite field and  any -vector space. Then  cannot be written as a union of finitely many proper subspaces.
 can be either finite- or infinite-dimensional in the above.  The very basic [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=108&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>The other day I read <a href="http://lydianrain.wordpress.com/2008/10/12/an-easy-fallacy/" target="_new">this post</a> over at <a href="http://lydianrain.wordpress.com/" target="_new">Notational Notions</a>.  The main result is the following.</p>
<p><strong>Proposition: </strong>Let <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' /> be an infinite field and <img src='http://l.wordpress.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' /> any <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' />-vector space. Then <img src='http://l.wordpress.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' /> cannot be written as a union of finitely many proper subspaces.</p>
<p><img src='http://l.wordpress.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V' title='V' class='latex' /> can be either finite- or infinite-dimensional in the above.  The very basic idea here is that in an algebraic setting, unions of “algebraically nice” subsets need not be “algebraically nice.”  An immediate corollary of this Proposition is the following (somewhat silly) version of the Prime Avoidance Lemma.</p>
<p><strong>Silly Prime Avoidance (SPA) Lemma: </strong>Let <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> be a ring containing an infinite field.  Let <img src='http://l.wordpress.com/latex.php?latex=J%2CI_1%2C%5Cldots%2CI_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J,I_1,\ldots,I_n' title='J,I_1,\ldots,I_n' class='latex' /> be ideals of <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=J%5Csubset%5Cbigcup_jI_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J\subset\bigcup_jI_j' title='J\subset\bigcup_jI_j' class='latex' />.  Then <img src='http://l.wordpress.com/latex.php?latex=J%5Csubset+I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J\subset I_j' title='J\subset I_j' class='latex' /> for some <img src='http://l.wordpress.com/latex.php?latex=j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='j' title='j' class='latex' />.</p>
<p>The goal of this post is to discuss the SPA Lemma and to see what it means in terms of &#8220;geometry over a finite field.&#8221;</p>
<p> </p>
<p><span id="more-108"></span></p>
<p><strong>Proof: </strong>Considering <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> as a <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' />-vector space, every ideal of <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> is a subspace.  Now apply the Proposition with <img src='http://l.wordpress.com/latex.php?latex=V%3DJ&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='V=J' title='V=J' class='latex' />, and the subspaces in question being <img src='http://l.wordpress.com/latex.php?latex=I_j%5Ccap+J&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j\cap J' title='I_j\cap J' class='latex' />.  Since there are finitely many <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' />, we can only have <img src='http://l.wordpress.com/latex.php?latex=J%5Csubset%5Cbigcup_j+I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J\subset\bigcup_j I_j' title='J\subset\bigcup_j I_j' class='latex' /> if <img src='http://l.wordpress.com/latex.php?latex=I_j%5Ccap+J%3DI_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j\cap J=I_j' title='I_j\cap J=I_j' class='latex' /> for some <img src='http://l.wordpress.com/latex.php?latex=j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='j' title='j' class='latex' />.  <strong>Q.E.D.</strong></p>
<p>(Recall that the full Prime Avoidance Lemma allows the following modification of the hypotheses: <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> an arbitrary ring, as long as at most two of the <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' /> are non-prime.  While neither of the two sets of hypotheses are stronger than the other, the “Silly” version seems a bit less “serious” to me.  See Chapter 3 of Eisenbud&#8217;s <em>Commutative Algebra with a View Toward Algebraic Geometry</em> for a thorough discussion.)</p>
<p>Can we relax the condition that <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' /> be infinite?  Certainly not, since if <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' /> is finite, then <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> can be a finite set, which is easy to exhaust by a finite union:  Consider <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BF%7D_2%5Bx%2Cy%5D%2F%28x%5E2%2Cxy%2Cy%5E2%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{F}_2[x,y]/(x^2,xy,y^2)' title='\mathbb{F}_2[x,y]/(x^2,xy,y^2)' class='latex' />.  Then the ideal <img src='http://l.wordpress.com/latex.php?latex=%28x%2Cy%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x,y)' title='(x,y)' class='latex' /> is in the union of the ideals <img src='http://l.wordpress.com/latex.php?latex=%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x)' title='(x)' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=%28y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(y)' title='(y)' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=%28x%2By%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x+y)' title='(x+y)' class='latex' />. but is not contained in any of them individually.  (Note that none of the ideals <img src='http://l.wordpress.com/latex.php?latex=%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x)' title='(x)' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=%28y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(y)' title='(y)' class='latex' />, or <img src='http://l.wordpress.com/latex.php?latex=%28x%2By%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(x+y)' title='(x+y)' class='latex' /> are prime.)  So really, in order to ask whether or not we can strengthen the SPA Lemma, we should address the following problem.</p>
<p><strong>Problem: </strong>Let <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' /> be a finite field and let <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> be a unital <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' />-algebra.  Find an ideals <img src='http://l.wordpress.com/latex.php?latex=J%2CI_1%2C%5Cldots%2CI_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J,I_1,\ldots,I_n' title='J,I_1,\ldots,I_n' class='latex' /> of <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> such that <img src='http://l.wordpress.com/latex.php?latex=J%5Csubset%5Cbigcup_jI_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J\subset\bigcup_jI_j' title='J\subset\bigcup_jI_j' class='latex' /> but <img src='http://l.wordpress.com/latex.php?latex=J&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J' title='J' class='latex' /> not contained in <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' /> for all <img src='http://l.wordpress.com/latex.php?latex=j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='j' title='j' class='latex' />.  Let’s ask that <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> be Noetherian, too.  (<em>Hints</em> (highlight to view): <span style="color:#ffffff;">1. We will need at least three <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' /> which are not prime, by the full Prime Avoidance Lemma.  2. Clearly, <img src='http://l.wordpress.com/latex.php?latex=J&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J' title='J' class='latex' /> cannot be a principal ideal; in particular, <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> cannot be a PID.</span>)</p>
<p>While you think about the Problem, let’s consider what this means for geometry over finite fields.  Let <img src='http://l.wordpress.com/latex.php?latex=R%3Dk%5Bx_1%2C%5Cldots%2Cx_m%5D%2F%28F_1%2C%5Cldots%2CF_k%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R=k[x_1,\ldots,x_m]/(F_1,\ldots,F_k)' title='R=k[x_1,\ldots,x_m]/(F_1,\ldots,F_k)' class='latex' /> be a finitely presented <img src='http://l.wordpress.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='k' title='k' class='latex' />-algebra and <img src='http://l.wordpress.com/latex.php?latex=J%3D%28f_1%2C%5Cldots%2Cf_s%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J=(f_1,\ldots,f_s)' title='J=(f_1,\ldots,f_s)' class='latex' /> an ideal of <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />.  Suppose <img src='http://l.wordpress.com/latex.php?latex=Z_1%2C+%5Cldots%2C+Z_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z_1, \ldots, Z_n' title='Z_1, \ldots, Z_n' class='latex' /> are closed subsets of <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BSpec%7D%28R%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Spec}(R)' title='\text{Spec}(R)' class='latex' /> with corresponding ideals <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' />.  The SPA Lemma says that if on each particular <img src='http://l.wordpress.com/latex.php?latex=Z_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z_j' title='Z_j' class='latex' /> not all the <img src='http://l.wordpress.com/latex.php?latex=f_i&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_i' title='f_i' class='latex' /> vanish, then there is some <img src='http://l.wordpress.com/latex.php?latex=h+%3D+%5Csum+g_jf_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='h = \sum g_jf_j' title='h = \sum g_jf_j' class='latex' /> (with <img src='http://l.wordpress.com/latex.php?latex=g_j%5Cin+R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='g_j\in R' title='g_j\in R' class='latex' />) which vanishes on none of the <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' />.  (When we ask if <img src='http://l.wordpress.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f' title='f' class='latex' /> vanishes at a point of <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BSpec%7D%28R%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Spec}(R)' title='\text{Spec}(R)' class='latex' />, we are asking whether the image of f in the residue field at the corresponding prime is zero; see Chapter 1 of Eisenbud and Harris&#8217;s <em>The Geometry of Schemes</em>.).</p>
<p>What, then, would a solution to the Problem be?  It would be an affine scheme <img src='http://l.wordpress.com/latex.php?latex=X%3D%5Ctext%7BSpec%7D%28R%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='X=\text{Spec}(R)' title='X=\text{Spec}(R)' class='latex' /> (or affine algebraic set, if you don’t like schemes and don’t mind taking R to be nilpotent-free) over <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BF%7D_q&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{F}_q' title='\mathbb{F}_q' class='latex' /> and a finite set of polynomials <img src='http://l.wordpress.com/latex.php?latex=f_1%2C+%5Cldots%2C+f_s&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f_1, \ldots, f_s' title='f_1, \ldots, f_s' class='latex' /> on <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BSpec%7D%28R%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Spec}(R)' title='\text{Spec}(R)' class='latex' />, along with closed subsets <img src='http://l.wordpress.com/latex.php?latex=Z_1%2C+%5Cldots%2C+Z_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z_1, \ldots, Z_n' title='Z_1, \ldots, Z_n' class='latex' /> such that every combination <img src='http://l.wordpress.com/latex.php?latex=%5Csum+f_ig_i&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\sum f_ig_i' title='\sum f_ig_i' class='latex' /> (with <img src='http://l.wordpress.com/latex.php?latex=g_i+%5Cin+R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='g_i \in R' title='g_i \in R' class='latex' />) vanishes on one of the <img src='http://l.wordpress.com/latex.php?latex=Z_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z_j' title='Z_j' class='latex' />.  One consequence of this is that we have no hope of “simultaneously separating” the <img src='http://l.wordpress.com/latex.php?latex=Z_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z_j' title='Z_j' class='latex' /> using a function from the (non-unital) subalgebra <img src='http://l.wordpress.com/latex.php?latex=J+%3D+%28f_1%2C+%5Cldots%2C+f_s%29+%5Csubset+R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J = (f_1, \ldots, f_s) \subset R' title='J = (f_1, \ldots, f_s) \subset R' class='latex' />: i.e., there cannot be a function <img src='http://l.wordpress.com/latex.php?latex=h+%5Cin+J&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='h \in J' title='h \in J' class='latex' /> which takes different values on each of the <img src='http://l.wordpress.com/latex.php?latex=Z_n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Z_n' title='Z_n' class='latex' />.  One possible intuitive explanation for this is that the residue fields are extensions of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BF%7D_q&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{F}_q' title='\mathbb{F}_q' class='latex' />; in nice cases, then, they will all be finite themselves.  And as long as they don’t vary too wildly (e.g., if there is a <img src='http://l.wordpress.com/latex.php?latex=q%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='q&#039;' title='q&#039;' class='latex' /> such that all the residue fields are <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BF%7D_%7Bq%27%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{F}_{q&#039;}' title='\mathbb{F}_{q&#039;}' class='latex' /> at the largest), then the set of possible values of functions is a finite set; by the Pigeonhole Principle, if we choose <img src='http://l.wordpress.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='n' title='n' class='latex' /> too large, then we’ll never separate them all simultaneously.  Our result is stronger: not only will some value repeat, but at least one of the values will always be zero.</p>
<p>Does anyone know a better geometric intuition for this, or a more precise statement of what sort of “non-separation” this entails?  I would love to understand this more clearly.  More generally, I’d like to understand how well we can separated closed subsets of arbitrary schemes.  Anyway, we conclude with a solution to our problem.</p>
<p><strong>Solution: </strong>(Highlight to view.)  <span style="color:#ffffff;">Let <img src='http://l.wordpress.com/latex.php?latex=R+%3D+%5Cmathbb%7BF%7D_2%5Bx%2Cy%5D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R = \mathbb{F}_2[x,y]' title='R = \mathbb{F}_2[x,y]' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=J+%3D+%28x%2Cy%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='J = (x,y)' title='J = (x,y)' class='latex' />.  Let <img src='http://l.wordpress.com/latex.php?latex=I_1%27+%3D+%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_1&#039; = (x)' title='I_1&#039; = (x)' class='latex' />, <img src='http://l.wordpress.com/latex.php?latex=I_2%27+%3D+%28y%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_2&#039; = (y)' title='I_2&#039; = (y)' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=I_3%27+%3D+%28x%2By%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_3&#039; = (x+y)' title='I_3&#039; = (x+y)' class='latex' />; note that these may be prime.  For <img src='http://l.wordpress.com/latex.php?latex=j%3D1%2C2%2C3&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='j=1,2,3' title='j=1,2,3' class='latex' />, let <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' /> be the ideal generated by <img src='http://l.wordpress.com/latex.php?latex=I_j%27&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j&#039;' title='I_j&#039;' class='latex' /> and all polynomials of degree 2 and higher with no linear or constant term.  Since R is Noetherian, these must be finitely generated (even though we don’t need this to be true, it’s nice to know it is).  It is easily verified that this is a solution to the problem. </span></p>
<p><strong>Remark 1: </strong>(Highlight to view.) <span style="color:#ffffff;"> This solution shows that the hypothesis that “no more than two of the <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' /> are non-prime” is sharp.</span></p>
<p><strong>Remark 2: </strong>(Highlight to view.) <span style="color:#ffffff;"> Two easy generalizations of the solution: you can do this over any <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BF%7D_q&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{F}_q' title='\mathbb{F}_q' class='latex' /> and for any number of variables by just adding another ideal of the form <img src='http://l.wordpress.com/latex.php?latex=I_j&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I_j' title='I_j' class='latex' /> for each possible homogeneous linear polynomial.  And the quotient of this by any ideal generated by functions with no linear or constant term will still be an example; in particular, this yields an example of Krull dimension one, e.g. <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BF%7D_2%5Bx%2Cy%5D%2F%28y%5E2-x%5E3%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{F}_2[x,y]/(y^2-x^3)' title='\mathbb{F}_2[x,y]/(y^2-x^3)' class='latex' />.</span></p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/108/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/108/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/108/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/108/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/108/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/108/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/108/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/108/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/108/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/108/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=108&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2008/11/15/a-silly-prime-avoidance-lemma/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">Alex</media:title>
		</media:content>
	</item>
		<item>
		<title>Shoulda Series 2: Resolving Ext</title>
		<link>http://concretenonsense.wordpress.com/2008/09/29/shoulda-series-2-resolving-ext/</link>
		<comments>http://concretenonsense.wordpress.com/2008/09/29/shoulda-series-2-resolving-ext/#comments</comments>
		<pubDate>Mon, 29 Sep 2008 22:27:30 +0000</pubDate>
		<dc:creator>Alexander Ellis</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Shoulda Series]]></category>
		<category><![CDATA[cohomology]]></category>
		<category><![CDATA[derived functors]]></category>
		<category><![CDATA[ext]]></category>
		<category><![CDATA[homological algebra]]></category>
		<category><![CDATA[homology]]></category>
		<category><![CDATA[morita equivalence]]></category>
		<category><![CDATA[tor]]></category>

		<guid isPermaLink="false">http://concretenonsense.wordpress.com/?p=56</guid>
		<description><![CDATA[(Realistically, this post assumes familiarity with derived functors, chain complexes, and their homology.  Ideally, the reader has played around with  and  a bit, as well as a few examples such as singular cohomology, group homology, etc.  A lot of this material is taken from Weibel&#8217;s Introduction to Homological Algebra.)
I&#8217;ve been putting [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=56&subd=concretenonsense&ref=&feed=1" />]]></description>
			<content:encoded><![CDATA[<div class='snap_preview'><br /><p>(Realistically, this post assumes familiarity with derived functors, chain complexes, and their homology.  Ideally, the reader has played around with <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' /> a bit, as well as a few examples such as singular cohomology, group homology, etc.  A lot of this material is taken from <a href="http://books.google.com/books?id=flm-dBXfZ_gC" target="_new">Weibel&#8217;s <em>Introduction to Homological Algebra</em></a>.)</p>
<p>I&#8217;ve been putting a lot of energy into understanding homological algebra recently (following <a href="http://books.google.com/books?id=flm-dBXfZ_gC" target="_new">Weibel&#8217;s book</a>).  And if there&#8217;s one thing you do all the time in homological algebra, it&#8217;s resolve things (a <strong>resolution</strong> of a module <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> by X objects, where X is some adjective, is an exact sequence <img src='http://l.wordpress.com/latex.php?latex=%5Ccdots%5Cto+B_1%5Cto+B_0%5Cto+A%5Cto0&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\cdots\to B_1\to B_0\to A\to0' title='\cdots\to B_1\to B_0\to A\to0' class='latex' /> or <img src='http://l.wordpress.com/latex.php?latex=0%5Cto+A%5Cto+B_0%5Cto+B_1%5Cto%5Ccdots&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='0\to A\to B_0\to B_1\to\cdots' title='0\to A\to B_0\to B_1\to\cdots' class='latex' /> with each <img src='http://l.wordpress.com/latex.php?latex=B_i&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B_i' title='B_i' class='latex' /> an X object).  Resolutions help you to compute <a href="http://en.wikipedia.org/wiki/Derived_functors" target="_new">derived functors</a> (e.g. the cohomology of something), which is a common goal.  So I want to talk about how you can compute the derived functors <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D%5Ei_R%28A%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}^i_R(A,B)' title='\text{Ext}^i_R(A,B)' class='latex' /> by resolving either <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> or <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' />, and why we should care.</p>
<p><span id="more-56"></span></p>
<p>This may or not really count as part of the &#8220;Shoulda Series&#8221; (<a href="http://concretenonsense.wordpress.com/2008/04/27/shoulda-series-1-choosing-bases/" target="_new">1</a>), since I&#8217;m pretty sure someone <em>did</em> tell me this at some point.  But either way, I had to re-discover it for myself &#8220;in practice&#8221; before I &#8220;got it.&#8221;</p>
<p>Throughout, let <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> be a ring with unit (not necessarily commutative, but you can take it to be if you want) and let <img src='http://l.wordpress.com/latex.php?latex=A%2CB%2CC%2C%5Cldots&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A,B,C,\ldots' title='A,B,C,\ldots' class='latex' /> and similar symbols be <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />-modules.  We will use <img src='http://l.wordpress.com/latex.php?latex=P%2CQ%2C%5Cldots&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P,Q,\ldots' title='P,Q,\ldots' class='latex' /> (resp., <img src='http://l.wordpress.com/latex.php?latex=I%2CJ%2C%5Cldots&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I,J,\ldots' title='I,J,\ldots' class='latex' />) for projective (resp., injective) <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />-modules.  (Take all modules to be, say, right.)  The first thing to recall is that for fixed <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' />, the functors <img src='http://l.wordpress.com/latex.php?latex=-%5Cotimes_RB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='-\otimes_RB' title='-\otimes_RB' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=A%5Cotimes_R-&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A\otimes_R-' title='A\otimes_R-' class='latex' /> are right exact, while the functors <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_R%28A%2C-%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_R(A,-)' title='\text{Hom}_R(A,-)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_R%28-%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_R(-,B)' title='\text{Hom}_R(-,B)' class='latex' /> are left exact.  The first three are functors <img src='http://l.wordpress.com/latex.php?latex=R%5Ctext%7B-mod%7D%5Cto+R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R\text{-mod}\to R\text{-mod}' title='R\text{-mod}\to R\text{-mod}' class='latex' />, but the fourth is a functor <img src='http://l.wordpress.com/latex.php?latex=%28R%5Ctext%7B-mod%7D%29%5E%7B%5Ctext%7Bop%7D%7D%5Cto+R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(R\text{-mod})^{\text{op}}\to R\text{-mod}' title='(R\text{-mod})^{\text{op}}\to R\text{-mod}' class='latex' />; this important point will become central in just a bit, so make sure you understand why!  (Basically, a contravariant functor <img src='http://l.wordpress.com/latex.php?latex=F%3A%5Cmathcal%7BC%7D%5Cto%5Cmathcal%7BD%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F:\mathcal{C}\to\mathcal{D}' title='F:\mathcal{C}\to\mathcal{D}' class='latex' /> is the same as a covariant functor <img src='http://l.wordpress.com/latex.php?latex=F%3A%5Cmathcal%7BC%7D%5E%7B%5Ctext%7Bop%7D%7D%5Cto%5Cmathcal%7BD%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F:\mathcal{C}^{\text{op}}\to\mathcal{D}' title='F:\mathcal{C}^{\text{op}}\to\mathcal{D}' class='latex' />.  By <img src='http://l.wordpress.com/latex.php?latex=%5Cmathcal%7BC%7D%5E%7B%5Ctext%7Bop%7D%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathcal{C}^{\text{op}}' title='\mathcal{C}^{\text{op}}' class='latex' />, the <strong>opposite cateogry</strong> of <img src='http://l.wordpress.com/latex.php?latex=%5Cmathcal%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathcal{C}' title='\mathcal{C}' class='latex' />, we simply mean the category obtained from <img src='http://l.wordpress.com/latex.php?latex=%5Cmathcal%7BC%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathcal{C}' title='\mathcal{C}' class='latex' /> by keeping the same objects and reversing all the arrows.)</p>
<p>We may now define the <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' /> functors:</p>
<p><strong>Definition:</strong> Define:<br />
1. <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D%5ER_%2A%28A%2C-%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}^R_*(A,-)' title='\text{Tor}^R_*(A,-)' class='latex' /> to be the left derived functors of <img src='http://l.wordpress.com/latex.php?latex=A%5Cotimes_R-&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A\otimes_R-' title='A\otimes_R-' class='latex' />,<br />
2. <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D%5ER_%2A%28-%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}^R_*(-,B)' title='\text{Tor}^R_*(-,B)' class='latex' /> to be the left derived functors of <img src='http://l.wordpress.com/latex.php?latex=-%5Cotimes_RB&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='-\otimes_RB' title='-\otimes_RB' class='latex' />,<br />
3. <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_R%5E%2A%28A%2C-%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_R^*(A,-)' title='\text{Ext}_R^*(A,-)' class='latex' /> to be the right derived functors of <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_R%28A%2C-%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_R(A,-)' title='\text{Hom}_R(A,-)' class='latex' />, and<br />
4. <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_R%5E%2A%28-%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_R^*(-,B)' title='\text{Ext}_R^*(-,B)' class='latex' /> to be the right derived functors of <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_R%28-%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_R(-,B)' title='\text{Hom}_R(-,B)' class='latex' />.</p>
<p>The good news is:</p>
<p><strong>Theorem:</strong> There are natural isomorphisms <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D%5ER_%2A%28A%2C-%29%28B%29%5Ccong%5Ctext%7BTor%7D%5ER_%2A%28-%2CB%29%28A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}^R_*(A,-)(B)\cong\text{Tor}^R_*(-,B)(A)' title='\text{Tor}^R_*(A,-)(B)\cong\text{Tor}^R_*(-,B)(A)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_R%5E%2A%28A%2C-%29%28B%29%5Ccong%5Ctext%7BExt%7D_R%5E%2A%28-%2CB%29%28A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_R^*(A,-)(B)\cong\text{Ext}_R^*(-,B)(A)' title='\text{Ext}_R^*(A,-)(B)\cong\text{Ext}_R^*(-,B)(A)' class='latex' />.</p>
<p>We denote the common values <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D%5ER_%2A%28A%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}^R_*(A,B)' title='\text{Tor}^R_*(A,B)' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_R%5E%2A%28A%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_R^*(A,B)' title='\text{Ext}_R^*(A,B)' class='latex' />.  The basic idea of the proof of the <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' /> half of this theorem is to take projective resolutions <img src='http://l.wordpress.com/latex.php?latex=P_%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_*' title='P_*' class='latex' /> of <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=Q_%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Q_*' title='Q_*' class='latex' /> of <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' />, take the tensor product bicomplex formed by these two resolutions, and then show that a certain chain complex is acyclic.  (This chain complex is closely related to <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTot%7D%5E%7B%5Coplus%7D%28P_%2A%5Cotimes+Q_%2A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tot}^{\oplus}(P_*\otimes Q_*)' title='\text{Tot}^{\oplus}(P_*\otimes Q_*)' class='latex' />, the total direct sum complex associated to the bicomplex <img src='http://l.wordpress.com/latex.php?latex=P_%2A%5Cotimes+Q_%2A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='P_*\otimes Q_*' title='P_*\otimes Q_*' class='latex' />.)  One then shows that <img src='http://l.wordpress.com/latex.php?latex=H_%2A%28%5Ctext%7BTot%7D%5E%7B%5Coplus%7D%28P_%2A%5Cotimes+Q_%2A%29%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='H_*(\text{Tot}^{\oplus}(P_*\otimes Q_*))' title='H_*(\text{Tot}^{\oplus}(P_*\otimes Q_*))' class='latex' /> is naturally isomorphic to each of the two derived functors.  For <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' /> the proof is similar, using injective resolutions, <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D%28I_%2A%2CJ_%2A%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}(I_*,J_*)' title='\text{Hom}(I_*,J_*)' class='latex' />, and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTot%7D%5E%5Ctimes&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tot}^\times' title='\text{Tot}^\times' class='latex' /> instead.  See Weibel, section 2.7 for the details.</p>
<p>In many situations, our goal is to compute (or at least gain knowledge about) <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' />.  Recall that to compute left derived functors we resolve by projective objects, and to compute right derived functors we resolve by injective objects.  Projective objects in the category <img src='http://l.wordpress.com/latex.php?latex=R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R\text{-mod}' title='R\text{-mod}' class='latex' /> are great: a module <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> is projective if and only if it is a direct summand of a free module.  In particular, all free modules are projective.  In practice, one can often use finite-rank free resolutions, which are comparatively easy to compute with (and can lead to finiteness results on the derived functors, automatically).  One great example of this is the bar resolution (this is the chain complex described <a href="http://en.wikipedia.org/wiki/Group_homology" target="_new">here</a>), whose existence immediately tells you that the group homology <img src='http://l.wordpress.com/latex.php?latex=H_%2A%28G%3BA%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='H_*(G;A)' title='H_*(G;A)' class='latex' /> of a finite group <img src='http://l.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> has finite rank whenever the representation <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> does.</p>
<p>But injective objects are not as nice to work with.  The only decent general fact I am aware of is the following.</p>
<p><strong>Baer&#8217;s Criterion:</strong> Let <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> be an <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />-module.  Then <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> is injective if and only if for every ideal <img src='http://l.wordpress.com/latex.php?latex=I&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='I' title='I' class='latex' /> of <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> and every module homomorphism <img src='http://l.wordpress.com/latex.php?latex=f%3AI%5Cto+A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f:I\to A' title='f:I\to A' class='latex' />, there is a homomorphism <img src='http://l.wordpress.com/latex.php?latex=F%3AR%5Cto+A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F:R\to A' title='F:R\to A' class='latex' /> extending <img src='http://l.wordpress.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='f' title='f' class='latex' />.</p>
<p>This isn&#8217;t bad, but it isn&#8217;t nearly as helpful as in the projective case.  And in fact, most injective modules turn out to be huge and/or nasty in some sense.  So it appears that in general, <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' /> will be harder to compute than <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' />.  This is a real shame, since <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' /> usually has more interesting structure!  (Think of <img src='http://l.wordpress.com/latex.php?latex=Ext&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='Ext' title='Ext' class='latex' /> as cohomology, where there is usually an interesting product, e.g., cup product on the singular cohomology of topological spaces.)</p>
<p>But all is not lost: Remember that the functor <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_R%28-%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_R(-,B)' title='\text{Hom}_R(-,B)' class='latex' /> is contravariant; equivalently, it is a (covariant) functor <img src='http://l.wordpress.com/latex.php?latex=%28R%5Ctext%7B-mod%7D%29%5E%7B%5Ctext%7Bop%7D%7D%5Cto+R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(R\text{-mod})^{\text{op}}\to R\text{-mod}' title='(R\text{-mod})^{\text{op}}\to R\text{-mod}' class='latex' />.  Since the universal property defining projective objects is dual to the universal property defining injective objects, it follows that <strong>the injectives of <img src='http://l.wordpress.com/latex.php?latex=%28R%5Ctext%7B-mod%7D%29%5E%7B%5Ctext%7Bop%7D%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(R\text{-mod})^{\text{op}}' title='(R\text{-mod})^{\text{op}}' class='latex' /> are precisely the projectives of <img src='http://l.wordpress.com/latex.php?latex=R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R\text{-mod}' title='R\text{-mod}' class='latex' />!</strong> So when computing <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_R%5E%2A%28A%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_R^*(A,B)' title='\text{Ext}_R^*(A,B)' class='latex' />, we can either resolve <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> by injective <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />-modules (usually messy and/or difficult) or resolve <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> by projective <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />-modules (usually much nicer).  For instance, the bar resolution mentioned earlier, which is a resolution of the trivial <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BZ%7DG&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{Z}G' title='\mathbb{Z}G' class='latex' />-module <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{Z}' title='\mathbb{Z}' class='latex' /> by free <img src='http://l.wordpress.com/latex.php?latex=%5Cmathbb%7BZ%7DG&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\mathbb{Z}G' title='\mathbb{Z}G' class='latex' />-modules for a group <img src='http://l.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' />, can be used to compute group <strong>co</strong>homology, i.e., the groups <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_%7B%5Cmathbb%7BZ%7DG%7D%5E%2A%28A%2C%5Cmathbb%7BZ%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_{\mathbb{Z}G}^*(A,\mathbb{Z})' title='\text{Ext}_{\mathbb{Z}G}^*(A,\mathbb{Z})' class='latex' />.  Hence as long as we are content to always resolve the first variable, <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D_R%5E%2A%28A%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}_R^*(A,B)' title='\text{Ext}_R^*(A,B)' class='latex' /> is just as easy to compute in general as <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D%5ER_%2A%28A%2CB%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}^R_*(A,B)' title='\text{Tor}^R_*(A,B)' class='latex' />.</p>
<p>Finally, I want to discuss something which puzzles me.  The tensor product functor is left adjoint to the <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}' title='\text{Hom}' class='latex' /> functor; that is, we an isomorphism<br />
<img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_S%28A%5Cotimes_RB%2CC%29%5Ccong%5Ctext%7BHom%7D_R%28A%2C%5Ctext%7BHom%7D_S%28B%2CC%29%29%2C&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_S(A\otimes_RB,C)\cong\text{Hom}_R(A,\text{Hom}_S(B,C)),' title='\text{Hom}_S(A\otimes_RB,C)\cong\text{Hom}_R(A,\text{Hom}_S(B,C)),' class='latex' /><br />
valid whenever <img src='http://l.wordpress.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='A' title='A' class='latex' /> is a right <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' />-module, <img src='http://l.wordpress.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='B' title='B' class='latex' /> is an <img src='http://l.wordpress.com/latex.php?latex=R-S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R-S' title='R-S' class='latex' />-bimodule, and <img src='http://l.wordpress.com/latex.php?latex=C&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='C' title='C' class='latex' /> is a right <img src='http://l.wordpress.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' />-module; this isomorphism is natural in all three modules.  And one can show that this adjunction holds for the corresponding derived functors as well.  So there is a very fundamental symmetry between the bifunctors <img src='http://l.wordpress.com/latex.php?latex=%5Cotimes_R%3A%5Ctext%7Bmod-R%7D%5Ctimes+R%5Ctext%7B-mod%7D%5Cto%5Cmathbb%7BZ%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\otimes_R:\text{mod-R}\times R\text{-mod}\to\mathbb{Z}' title='\otimes_R:\text{mod-R}\times R\text{-mod}\to\mathbb{Z}' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_S%3A%28%5Ctext%7Bmod-%7DS%29%5E%7B%5Ctext%7Bop%7D%7D%5Ctimes%5Ctext%7Bmod-%7DS%5Cto%5Ctext%7Bmod-R%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_S:(\text{mod-}S)^{\text{op}}\times\text{mod-}S\to\text{mod-R}' title='\text{Hom}_S:(\text{mod-}S)^{\text{op}}\times\text{mod-}S\to\text{mod-R}' class='latex' />.  Simplifying to the case where <img src='http://l.wordpress.com/latex.php?latex=R%3DS&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R=S' title='R=S' class='latex' /> is commutative, we have<br />
<img src='http://l.wordpress.com/latex.php?latex=%5Cotimes_R%3AR%5Ctext%7B-mod%7D%5Ctimes+R%5Ctext%7B-mod%7D%5Cto+R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\otimes_R:R\text{-mod}\times R\text{-mod}\to R\text{-mod}' title='\otimes_R:R\text{-mod}\times R\text{-mod}\to R\text{-mod}' class='latex' /><br />
<img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D_R%3A%28R%5Ctext%7B-mod%7D%29%5E%7B%5Ctext%7Bop%7D%7D%5Ctimes+R%5Ctext%7B-mod%7D%5Cto+R%5Ctext%7B-mod%7D.&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}_R:(R\text{-mod})^{\text{op}}\times R\text{-mod}\to R\text{-mod}.' title='\text{Hom}_R:(R\text{-mod})^{\text{op}}\times R\text{-mod}\to R\text{-mod}.' class='latex' /></p>
<p>In this most important of adjunctions, why is there an opposite-category variable in one bifunctor but not in the other?  Life would seem to make more sense if each of the two had one ordinary- and one opposite-category variable.  I suspect that this may have to do with the fact that things are not as symmetric as they seem: even if <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> is commutative so that left and right are equivalent, we are still talking about algebras (rings) and modules, while dually we could also talk about <strong>co</strong>algebras and <strong>co</strong>modules.  See the questions below, and enlighten me, please.</p>
<p><strong>Questions</strong></p>
<p>Here are a few questions which are bothering me, mostly related to the above.  Comments, suggestions, examples, problems, etc. are more than welcome!</p>
<p><strong>1.</strong> Philosphically/fuzzily/whateverly, why is there this weird asymmetry between <img src='http://l.wordpress.com/latex.php?latex=%5Cotimes&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\otimes' title='\otimes' class='latex' />/<img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BHom%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Hom}' title='\text{Hom}' class='latex' />/<img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' />?  Maybe the only answer is that &#8220;there happens to be an interesting adjunction of bifunctors where one side is covariant-covariant and the other side is contravariant-covariant.&#8221;  But this is really unsatisfying.</p>
<p><strong>2.</strong> Is the answer to question 1 related to the fact that we are talking about algebras and modules, rather than coalgebras and comodules?  If this is the case, then what do these bifunctors and adjunctions look like in the case of bialgebras?</p>
<p><strong>3.</strong> Cohomology/<img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BExt%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Ext}' title='\text{Ext}' class='latex' /> has an interesting product structure.  Does homology/<img src='http://l.wordpress.com/latex.php?latex=%5Ctext%7BTor%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\text{Tor}' title='\text{Tor}' class='latex' /> have a coproduct structure?  If so, when is it interesting?</p>
<p><strong>4.</strong> Less related, but recently bothering me: Does anyone know of an example of a non-commutative ring which is Morita equivalent to its opposite?</p>
<p>[<strong>Background for 4:</strong> We say rings <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S' title='S' class='latex' /> are <strong>Morita equivalent</strong> if the categories are <img src='http://l.wordpress.com/latex.php?latex=R%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R\text{-mod}' title='R\text{-mod}' class='latex' /> and <img src='http://l.wordpress.com/latex.php?latex=S%5Ctext%7B-mod%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='S\text{-mod}' title='S\text{-mod}' class='latex' /> of left modules are isomorphic.  So in this case, I am asking for a ring <img src='http://l.wordpress.com/latex.php?latex=R&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='R' title='R' class='latex' /> whose left and right modules agree in some reasonable natural way, but which is not commutative.]</p>
  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/concretenonsense.wordpress.com/56/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/concretenonsense.wordpress.com/56/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godelicious/concretenonsense.wordpress.com/56/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/delicious/concretenonsense.wordpress.com/56/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gostumble/concretenonsense.wordpress.com/56/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/stumble/concretenonsense.wordpress.com/56/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/godigg/concretenonsense.wordpress.com/56/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/digg/concretenonsense.wordpress.com/56/" /></a> <a rel="nofollow" href="http://feeds.wordpress.com/1.0/goreddit/concretenonsense.wordpress.com/56/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/reddit/concretenonsense.wordpress.com/56/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=concretenonsense.wordpress.com&blog=2918042&post=56&subd=concretenonsense&ref=&feed=1" /></div>]]></content:encoded>
			<wfw:commentRss>http://concretenonsense.wordpress.com/2008/09/29/shoulda-series-2-resolving-ext/feed/</wfw:commentRss>
		<slash:comments>18</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">Alex</media:title>
		</media:content>
	</item>
	</channel>
</rss>