<?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>Secret Blogging Seminar</title>
	<atom:link href="http://sbseminar.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://sbseminar.wordpress.com</link>
	<description>Representation theory, geometry and whatever else we decide is worth writing about today.</description>
	<lastBuildDate>Wed, 22 May 2013 19:06:02 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='sbseminar.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Secret Blogging Seminar</title>
		<link>http://sbseminar.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://sbseminar.wordpress.com/osd.xml" title="Secret Blogging Seminar" />
	<atom:link rel='hub' href='http://sbseminar.wordpress.com/?pushpress=hub'/>
		<item>
		<title>Conference videos</title>
		<link>http://sbseminar.wordpress.com/2013/04/30/conference-videos/</link>
		<comments>http://sbseminar.wordpress.com/2013/04/30/conference-videos/#comments</comments>
		<pubDate>Wed, 01 May 2013 03:28:31 +0000</pubDate>
		<dc:creator>Ben Webster</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=5073</guid>
		<description><![CDATA[Well, from my perspective at least, the conference was a success.  We all made it through in one piece, and no one got trapped on the subway. If any of you are looking for the videos of the talks, they can be downloaded from this page. That&#8217;s a only a temporary hosting solution, but at [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5073&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>Well, from my perspective at least, the conference was a success.  We all made it through in one piece, and no one got <a href="http://www.youtube.com/watch?v=3VMSGrY-IlU">trapped on the subway</a>.  If any of you are looking for the videos of <a href="http://math.neu.edu/~bwebster/ACRT/schedule.html">the talks</a>, they can be downloaded from <a href="http://packnetwork.com/math/">this page</a>.  That&#8217;s a only a temporary hosting solution, but at least they&#8217;re available for the moment.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/5073/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/5073/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5073&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2013/04/30/conference-videos/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0c43e0f7215504ff9a0a8918a1278dd5?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">bwebste</media:title>
		</media:content>
	</item>
		<item>
		<title>More on shameless promotion</title>
		<link>http://sbseminar.wordpress.com/2013/04/23/more-on-shameless-promotion/</link>
		<comments>http://sbseminar.wordpress.com/2013/04/23/more-on-shameless-promotion/#comments</comments>
		<pubDate>Wed, 24 Apr 2013 04:19:38 +0000</pubDate>
		<dc:creator>Ben Webster</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=4757</guid>
		<description><![CDATA[As those of you who&#8217;ve scrolled down the page know, the conference I mentioned a few months ago (now sadly memorializing the life of Andrei Zelevinsky) is starting tomorrow. Of course, for those of you who don&#8217;t live in the Boston area, coming to conference isn&#8217;t an option unless you were already traveling today, but [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4757&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>As those of you who&#8217;ve scrolled down the page know, the conference I mentioned a few months ago (now sadly memorializing the life of Andrei Zelevinsky) is starting tomorrow. Of course, for those of you who don&#8217;t live in the Boston area, coming to conference isn&#8217;t an option unless you were already traveling today, but I do have a (somewhat belated) announcement. Assuming that the AV gods are kind and everything goes as planned, it should be possible to <a href="http://packnetwork.com/zelevinsky/">watch the talks live</a> (of course, we&#8217;ll also make the videos available after the conference, in case you&#8217;re busy). The schedule <a href="http://www.math.neu.edu/~bwebster/ACRT/schedule.html">is here</a>; the talks start at 10am tomorrow.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/4757/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/4757/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4757&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2013/04/23/more-on-shameless-promotion/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0c43e0f7215504ff9a0a8918a1278dd5?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">bwebste</media:title>
		</media:content>
	</item>
		<item>
		<title>New  open access journal in algebraic geometry</title>
		<link>http://sbseminar.wordpress.com/2013/03/03/new-open-access-journal-in-algebraic-geometry/</link>
		<comments>http://sbseminar.wordpress.com/2013/03/03/new-open-access-journal-in-algebraic-geometry/#comments</comments>
		<pubDate>Mon, 04 Mar 2013 02:00:40 +0000</pubDate>
		<dc:creator>David Speyer</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=5064</guid>
		<description><![CDATA[I just received an e-mail announcing that Compositio has launched an Open Access journal entitled Algebraic Geometry. Their website is live and promises &#8220;Open access implies here that the electronic version of the journal is freely accessible and that there are no article processing charges for authors whatsoever. The printed version of the journal will [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5064&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>I just received an e-mail announcing that <i>Compositio</i> has launched an Open Access journal entitled <i>Algebraic Geometry</i>. Their <a href="http://algebraicgeometry.nl/">website</a> is live and promises &#8220;Open access implies here that the electronic version of the journal is freely accessible and that there are no article processing charges for authors whatsoever. The printed version of the journal will be available at the end of the calendar year against printing costs.&#8221;</p>
<p>The <a href="http://algebraicgeometry.nl/editors.html">editorial board</a> looks great, including L. Caporaso, J. Ellenberg, D. Maulik and R. Pandharipande. They will definitely get my next algebraic geometry paper.</p>
<p>This is really good news. It&#8217;s seemed clear from the debates on journals of the last year that what is needed is for people and institutions of high reputation to commit to running open journals. <i>Compositio</i>, and the editors they have found, are top of the line. From a selfish perspective, what makes me really happy is that I didn&#8217;t wind up on the editorial board. </p>
<p>Good work, and good luck, to <i>Algebraic Geometry</i>.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/5064/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/5064/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5064&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2013/03/03/new-open-access-journal-in-algebraic-geometry/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/870d64be2e41d1495c86ebcac4d51b3c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">davidspeyer</media:title>
		</media:content>
	</item>
		<item>
		<title>UK Parliament seeking feedback on Open Access support</title>
		<link>http://sbseminar.wordpress.com/2013/01/15/uk-parliament-seeking-feedback-on-open-access-support/</link>
		<comments>http://sbseminar.wordpress.com/2013/01/15/uk-parliament-seeking-feedback-on-open-access-support/#comments</comments>
		<pubDate>Tue, 15 Jan 2013 16:40:29 +0000</pubDate>
		<dc:creator>David Speyer</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=5060</guid>
		<description><![CDATA[Last September, the UK parliament earmarked &#163;10 Million pounds from the science budget to support open access scientific publishing. Earlier this week, the UK parliament announced that they are seeking feedback on this policy, including &#8220;how the Government should address the concerns raised by the scientific and publishing communities about the policy&#8221;. Details of how [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5060&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p><a href="http://www.guardian.co.uk/science/2012/sep/07/uk-government-open-access-publishing">Last September</a>, the UK parliament earmarked &pound;10 Million pounds from the science budget to support open access scientific publishing. Earlier this week, the UK parliament announced that they are <a href="http://www.parliament.uk/business/committees/committees-a-z/lords-select/science-and-technology-committee/news/open-access/">seeking feedback</a> on this policy, including &#8220;how the Government should address the concerns raised by the scientific and publishing communities about the policy&#8221;. Details of how to submit comments are <a href="http://www.openscholarship.org/upload/docs/application/pdf/2013-01/guidance_on_submissions.pdf">here</a>.  I don&#8217;t know much about UK politics, so I can&#8217;t give much advice about how to frame your response, but the deadline is this weekend (Jan 18) so it seems important to get the word out.</p>
<p>Note some bizarre statements in the comment submission guidelines: They want submissions in Word or, if Word is not acceptable, another editable electronic format; they specifically state not PDF. (&lt;rant&gt; Why, oh why has the world forgotten RTF? Or plain ASCII? Or HTML? I understand why most people don&#8217;t want to use LaTeX, but the way that the world acts as if Word is the most convenient format drives me nuts. &lt;/rant&gt;) They also say &#8220;[s]ubmisions become the property of the Committee.&#8221; That&#8217;s a bizarrely vague statement from a committee discussion copyright policy. I assume they mean that you are implicitly granting them the right to publish it, but if I were phrasing that I would say &#8220;you retain copyright to your words but grant us permission to retain your file/manuscript and to publish&#8230;&#8221;.</p>
<p>I don&#8217;t think that the points in the  preceding paragraph represent bad intent on the part of the committee, but I do think they show an ignorance of how things are done in the academic world. So let&#8217;s help them out!</p>
<p>Hat tips: I learned about this from this <a href="http://blogs.computerworlduk.com/open-enterprise/2013/01/fighting-for-open-access/index.htm">blogpost</a>, which I learned about from <a href="http://www.scottaaronson.com/blog/?p=1230#comment-61048">this comment</a>. I am not familiar with either Glyn Moody or Alex.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/5060/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/5060/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5060&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2013/01/15/uk-parliament-seeking-feedback-on-open-access-support/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/870d64be2e41d1495c86ebcac4d51b3c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">davidspeyer</media:title>
		</media:content>
	</item>
		<item>
		<title>A calculus free proof of the spectral theorem</title>
		<link>http://sbseminar.wordpress.com/2012/12/03/a-calculus-free-proof-of-the-spectral-theorem/</link>
		<comments>http://sbseminar.wordpress.com/2012/12/03/a-calculus-free-proof-of-the-spectral-theorem/#comments</comments>
		<pubDate>Tue, 04 Dec 2012 03:19:29 +0000</pubDate>
		<dc:creator>David Speyer</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=5049</guid>
		<description><![CDATA[Let be an real symmetric matrix. Let be an eigenvalue and be a corresponding eigenvector. Then But, also We deduce that . And is clearly a positive real, so . This immediately shows that the characteristic polynomial of has only real roots. It is also easy to see that eigenvectors for distinct eigenvalues are orthogonal. [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5049&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>Let <img src='http://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='A' title='A' class='latex' /> be an <img src='http://s0.wp.com/latex.php?latex=n+%5Ctimes+n&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='n &#92;times n' title='n &#92;times n' class='latex' /> real symmetric matrix.  Let <img src='http://s0.wp.com/latex.php?latex=%5Clambda&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;lambda' title='&#92;lambda' class='latex' /> be an eigenvalue and <img src='http://s0.wp.com/latex.php?latex=v&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='v' title='v' class='latex' /> be a corresponding eigenvector. Then </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle%7B%5Cbar%7Bv%7D%5ET+A+v+%3D+%5Cbar%7Bv%7D%5ET+%5Clambda+v+%3D+%5Clambda+%5Cbar%7Bv%7D%5ET+v%7D.&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;displaystyle{&#92;bar{v}^T A v = &#92;bar{v}^T &#92;lambda v = &#92;lambda &#92;bar{v}^T v}.' title='&#92;displaystyle{&#92;bar{v}^T A v = &#92;bar{v}^T &#92;lambda v = &#92;lambda &#92;bar{v}^T v}.' class='latex' /></p>
<p>But, also</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle%7B%5Cbar%7Bv%7D%5ET+A+v+%3D+%28%5Cbar%7B%5Clambda%7D+%5Cbar%7Bv%7D%5ET%29+v+%3D+%5Cbar%7B%5Clambda%7D+%5Cbar%7Bv%7D%5ET+v%7D.&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;displaystyle{&#92;bar{v}^T A v = (&#92;bar{&#92;lambda} &#92;bar{v}^T) v = &#92;bar{&#92;lambda} &#92;bar{v}^T v}.' title='&#92;displaystyle{&#92;bar{v}^T A v = (&#92;bar{&#92;lambda} &#92;bar{v}^T) v = &#92;bar{&#92;lambda} &#92;bar{v}^T v}.' class='latex' /></p>
<p>We deduce that <img src='http://s0.wp.com/latex.php?latex=%5Clambda+%5Cbar%7Bv%7D%5ET+v++%3D+%5Cbar%7B%5Clambda%7D+%5Cbar%7Bv%7D%5ET+v&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;lambda &#92;bar{v}^T v  = &#92;bar{&#92;lambda} &#92;bar{v}^T v' title='&#92;lambda &#92;bar{v}^T v  = &#92;bar{&#92;lambda} &#92;bar{v}^T v' class='latex' />. And <img src='http://s0.wp.com/latex.php?latex=%5Cbar%7Bv%7D%5ET+v&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;bar{v}^T v' title='&#92;bar{v}^T v' class='latex' /> is clearly a positive real, so <img src='http://s0.wp.com/latex.php?latex=%5Clambda+%3D+%5Cbar%7B%5Clambda%7D&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;lambda = &#92;bar{&#92;lambda}' title='&#92;lambda = &#92;bar{&#92;lambda}' class='latex' />.</p>
<p>This immediately shows that the characteristic polynomial of <img src='http://s0.wp.com/latex.php?latex=A&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='A' title='A' class='latex' /> has only real roots. </p>
<p><span id="more-5049"></span></p>
<p>It is also easy to see that eigenvectors for distinct eigenvalues are orthogonal. If <img src='http://s0.wp.com/latex.php?latex=A+v+%3D+%5Clambda+v&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='A v = &#92;lambda v' title='A v = &#92;lambda v' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=A+w+%3D+%5Cmu+w&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='A w = &#92;mu w' title='A w = &#92;mu w' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=w%5ET+A+v&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='w^T A v' title='w^T A v' class='latex' /> is both <img src='http://s0.wp.com/latex.php?latex=%5Clambda+v%5ET+w&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;lambda v^T w' title='&#92;lambda v^T w' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cmu+v%5ET+w&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;mu v^T w' title='&#92;mu v^T w' class='latex' />, so <img src='http://s0.wp.com/latex.php?latex=%28%5Clambda+-+%5Cmu%29+v%5ET+w%3D0&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='(&#92;lambda - &#92;mu) v^T w=0' title='(&#92;lambda - &#92;mu) v^T w=0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=v%5ET+w%3D0&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='v^T w=0' title='v^T w=0' class='latex' />. </p>
<p>The remaining point is to rule out the possibility of nontrivial Jordan blocks or, in the language  of intro linear algebra classes, the possibility that geometric multiplicity is less than algebraic multiplicity. For a class where the Jordan canonical form theorem is proved, this is simple enough. If there is a nontrivial Jordan block, then there is some <img src='http://s0.wp.com/latex.php?latex=v&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='v' title='v' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%28A+-+%5Clambda%29+v+%5Cneq+0&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='(A - &#92;lambda) v &#92;neq 0' title='(A - &#92;lambda) v &#92;neq 0' class='latex' /> but <img src='http://s0.wp.com/latex.php?latex=%28A+-%5Clambda%29%5E2+v%3D0&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='(A -&#92;lambda)^2 v=0' title='(A -&#92;lambda)^2 v=0' class='latex' />. But then </p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle%7B+%28+%28A+-+%5Clambda%29+v%29%5ET+%28A+-+%5Clambda%29+v+%3D+v%5ET+%28A+-+%5Clambda%29%5E2+v+%3D+0+%7D&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;displaystyle{ ( (A - &#92;lambda) v)^T (A - &#92;lambda) v = v^T (A - &#92;lambda)^2 v = 0 }' title='&#92;displaystyle{ ( (A - &#92;lambda) v)^T (A - &#92;lambda) v = v^T (A - &#92;lambda)^2 v = 0 }' class='latex' /><br />
so <img src='http://s0.wp.com/latex.php?latex=%7C%28A-%5Clambda%29v%7C%5E2+%3D0&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='|(A-&#92;lambda)v|^2 =0' title='|(A-&#92;lambda)v|^2 =0' class='latex' />, contradicting that <img src='http://s0.wp.com/latex.php?latex=%28A+-+%5Clambda%29v+%5Cneq+0&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='(A - &#92;lambda)v &#92;neq 0' title='(A - &#92;lambda)v &#92;neq 0' class='latex' />.</p>
<p>However, the Linear Algebra course that <a href="http://www.math.lsa.umich.edu/~speyer/417.html">I am currently teaching</a> doesn&#8217;t do Jordan canonical form. I haven&#8217;t figured out how to show that geometric mult. less than algebraic mult. implies that <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BKer%7D+%5C+%28A-%5Clambda%29%5E2+%5Csupsetneq+%5Cmathrm%7BKer%7D+%5C+%28A+-+%5Clambda%29&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;mathrm{Ker} &#92; (A-&#92;lambda)^2 &#92;supsetneq &#92;mathrm{Ker} &#92; (A - &#92;lambda)' title='&#92;mathrm{Ker} &#92; (A-&#92;lambda)^2 &#92;supsetneq &#92;mathrm{Ker} &#92; (A - &#92;lambda)' class='latex' /> simply enough to fit in a lecture where I also talk about the rest of this stuff.</p>
<p>Nonetheless, I am amazed that every textbook I have seen uses the &quot;optimize a quadratic form on the unit ball&quot; argument rather than this algebraic once. Lots of students don&#039;t remember multivariable calculus well, and existence of maxima of continuous functions on multidimensional bounded domains is complicated. Plus, I find a lot of students have trouble with an inductive process like getting one eigenvector and splitting off an orthogonal complement. </p>
<p>This argument is just shuffling algebra around, combined with the fact that a sum of squares is nonzero. It seems clearly easier to me.</p>
<p>I&#039;m just a little too short on time to present the whole argument this term. I&#039;ll do the two easy parts above and hand wave at the algebraic versus geometric issue. Next time I teach this course, I&#039;ll try to plan my discussion of algebraic multiplicity better so that I get the key lemma in. </p>
<p>I&#039;m excited! I had thought that the spectral theorem would just be way too hard to prove in this class, but I think this will at least do a large part of it.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/5049/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/5049/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=5049&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2012/12/03/a-calculus-free-proof-of-the-spectral-theorem/feed/</wfw:commentRss>
		<slash:comments>15</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/870d64be2e41d1495c86ebcac4d51b3c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">davidspeyer</media:title>
		</media:content>
	</item>
		<item>
		<title>The canonical model structure on Cat</title>
		<link>http://sbseminar.wordpress.com/2012/11/16/the-canonical-model-structure-on-cat/</link>
		<comments>http://sbseminar.wordpress.com/2012/11/16/the-canonical-model-structure-on-cat/#comments</comments>
		<pubDate>Fri, 16 Nov 2012 13:55:03 +0000</pubDate>
		<dc:creator>Chris Schommer-Pries</dc:creator>
				<category><![CDATA[Algebraic Topology]]></category>
		<category><![CDATA[Category Theory]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=4761</guid>
		<description><![CDATA[In this post I want to describe the following result, which I think is pretty neat and should be more widely known: Theorem: On the category of (small) categories there is a unique model structure in which the weak equivalences are the equivalences of categories. This unique model structure is of course the so-called &#8220;canonical&#8221; [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4761&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>In this post I want to describe the following result, which I think is pretty neat and should be more widely known:</p>
<p><strong>Theorem</strong>: On the category of (small) categories there is a unique model structure in which the weak equivalences are the equivalences of categories.</p>
<p><span id="more-4761"></span>This unique model structure is of course the so-called <a href="http://ncatlab.org/nlab/show/canonical+model+structure+on+Cat" target="_blank">&#8220;canonical&#8221; model structure</a> of André Joyal and Myles Tierney. (The fact that it is the unique one with these weak equivalences lends credence, I think, to using the name &#8220;canonical&#8221;). It is proper, cartesian, simplicial, combinatorial, and every object is both fibrant and cofibrant. I first learned of this uniqueness result from Steve Lack&#8217;s comments on <a href="http://mathoverflow.net/questions/18744/is-model-structure-on-catset-unique" target="_blank">this MathOverflow question</a>, though there were some details left to fill in. I hope to do that here.</p>
<p>Below I will give an elementary proof of the above theorem, partly so I have it written down somewhere for future reference. Charles Rezk has a nice <a href="http://www.math.uiuc.edu/~rezk/cat-ho.dvi" target="_blank">write-up</a> of this model structure, and I will start by describing it. It consists of:</p>
<ul>
<li>the <em>canonical cofibrations</em>, which are those functors of categories which are injective on objects,</li>
<li>the <em>canonical acyclic cofibrations</em>, which are those equivalences of categories which are injective on objects (these are necessarily injective on morphisms too),</li>
<li>the <em>canonical acyclic fibrations</em>, which are those equivalences which are surjective on objects, and</li>
<li>the <em>canonical fibrations</em>, which are the &#8220;<a href="http://ncatlab.org/nlab/show/isofibration" target="_blank">iso-fibrations</a>&#8220;. These are the functors <img src='http://s0.wp.com/latex.php?latex=f%3AX+%5Cto+Y&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='f:X &#92;to Y' title='f:X &#92;to Y' class='latex' /> such that for any <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='x &#92;in X' title='x &#92;in X' class='latex' /> and any isomorphism <img src='http://s0.wp.com/latex.php?latex=%5Calpha%3A+f%28x%29+%5Ccong+y&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;alpha: f(x) &#92;cong y' title='&#92;alpha: f(x) &#92;cong y' class='latex' /> in Y, then there exists an isomorphism in X which maps to <img src='http://s0.wp.com/latex.php?latex=%5Calpha&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;alpha' title='&#92;alpha' class='latex' /> under f.</li>
</ul>
<p>Let&#8217;s fix some notation which will be useful later.</p>
<ul>
<li>Let E be the free walking isomorphism. This is the contractible category with two objects. (A category is <em>contractible</em> if it is equivalent to the terminal category pt).</li>
</ul>
<p>There is an equivalence <img src='http://s0.wp.com/latex.php?latex=pt+%5Cto+E&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='pt &#92;to E' title='pt &#92;to E' class='latex' />, which includes the terminal category as one of the objects. The canonical fibrations are precisely those maps which have the right lifting property with respect to this functor.</p>
<p style="text-align:center;"><em>The Proof:</em></p>
<p>Now let us suppose that we have a model category structure on the category of categories in which the weak equivalences are the equivalences of categories. Such a structure consists of certain classes of fibrations and cofibrations. Our goal is to show that these <em>must</em> be the canonical fibrations and canonical cofibrations above.</p>
<p>The proof will use some basic properties about model categories:</p>
<ol>
<li>The cofibrations and acyclic cofibrations are closed under retracts, compositions, and pushouts along arbitrary maps.</li>
<li>The acyclic cofibrations are precisely those cofibrations which are also (weak) equivalences. The acyclic fibrations are also weak equivalences.</li>
<li>The fibrations have the right lifting property with respect to the acyclic cofibrations and the acyclic fibrations have the right lifting property with respect to the cofibrations.</li>
</ol>
<p>It also rests on a</p>
<p><strong>Key Fact</strong>: every equivalence class of objects contains a fibrant representative and a cofibrant representative.</p>
<p>(Recall that an object is cofibrant if the unique map from the initial object (the empty category, in this case) is a cofibration. Dually, and object is fibrant if the unique map to the terminal object is a fibration.)</p>
<p style="text-align:center;"><em>What do these facts tell us? </em></p>
<p><strong>Trivial Lemma</strong>: The inclusion <img src='http://s0.wp.com/latex.php?latex=%5Cemptyset+%5Cto+pt&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;emptyset &#92;to pt' title='&#92;emptyset &#92;to pt' class='latex' /> is a cofibration.</p>
<p>Proof: Since each equivalence class of categories contains a cofibrant representative, we know that there exists <em>some</em> cofibration  <img src='http://s0.wp.com/latex.php?latex=%5Cemptyset+%5Cto+A&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;emptyset &#92;to A' title='&#92;emptyset &#92;to A' class='latex' /> for a non-empty category A. The desired map is a retract of this, hence also a cofibration. ◊</p>
<p>The acyclic fibrations must have the right lifting property with resect to all cofibrations, hence with respect to this map  <img src='http://s0.wp.com/latex.php?latex=%5Cemptyset+%5Cto+pt&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;emptyset &#92;to pt' title='&#92;emptyset &#92;to pt' class='latex' />. This means the acyclic fibrations must be surjective on objects. Since they are equivalences too, this implies the following consequences.</p>
<ol>
<li>the acyclic fibrations are a <em>subset</em> of the canonical acyclic fibrations, hence</li>
<li>the cofibrations <em>contain</em> the canonical cofibrations, hence</li>
<li>the acyclic cofibrations <em>contain</em> the canonical acyclic cofibrations, and hence</li>
<li>the fibrations are a <em>subset</em> of the canonical fibrations.</li>
</ol>
<p>This means we are half-way there. We must rule out the possibility that there could be more cofibrations. (This includes the case there are more acyclic cofibrations).</p>
<p><strong>A Somewhat Less Trivial Lemma</strong>: If the cofibrations contain a map which is not a canonical cofibration (i.e. fails to be injective on objects), then the following map is also a cofibration (hence an acyclic cofibration as it is an equivalence):</p>
<p style="text-align:center;"><img src='http://s0.wp.com/latex.php?latex=E+%5Cto+pt+&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='E &#92;to pt ' title='E &#92;to pt ' class='latex' />.</p>
<p style="text-align:left;">Proof: Suppose that we have a functor <img src='http://s0.wp.com/latex.php?latex=A+%5Cto+B&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='A &#92;to B' title='A &#92;to B' class='latex' /> which is a cofibration but <em>not</em> injective on objects. Then there exists at least one pair of objects in the source category which map to the same object in the target category. Call these objects x and y, and their image p.</p>
<p style="text-align:left;">The cofibrations are closed under pushouts along arbitrary maps and this allows us to alter this map to make a new cofibration. First note that a functor from a category to E is the same as a partition of its objects into two disjoint sets. Thus we may choose a functor <img src='http://s0.wp.com/latex.php?latex=A+%5Cto+E&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='A &#92;to E' title='A &#92;to E' class='latex' /> which separates x and y. We may form the pushout along this map to get a new cofibration:</p>
<p style="text-align:center;"><span style="text-align:center;"><img src='http://s0.wp.com/latex.php?latex=E+%5Cto+E+%5Ccup_%7BA%7D+B+%3D%3A+X&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='E &#92;to E &#92;cup_{A} B =: X' title='E &#92;to E &#92;cup_{A} B =: X' class='latex' />.</span></p>
<p style="text-align:left;">At this point we would like to form a retract onto the desired morphism. The problem is that this might not be possible as the image in X of the non-trivial isomorphism in E might fail to be an identity. If that is the case we will not be able to retract onto the desired map.</p>
<p style="text-align:left;">However cofibrations are also closed under composition. Let <img src='http://s0.wp.com/latex.php?latex=X%5E%5Cdelta&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='X^&#92;delta' title='X^&#92;delta' class='latex' /> be the contractible category with the same objects as X. There is a unique functor</p>
<p style="text-align:center;"><img src='http://s0.wp.com/latex.php?latex=X+%5Cto+X%5E%5Cdelta&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='X &#92;to X^&#92;delta' title='X &#92;to X^&#92;delta' class='latex' /></p>
<p style="text-align:left;">which is the identity on objects. Since it is injective on objects it is a canonical cofibration, hence this map must also be a cofibration. Composing gives us a new cofibration:</p>
<p style="text-align:center;"><img src='http://s0.wp.com/latex.php?latex=E+%5Cto+X%5E%5Cdelta&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='E &#92;to X^&#92;delta' title='E &#92;to X^&#92;delta' class='latex' /></p>
<p style="text-align:left;">and now this retracts onto the desired map. ◊</p>
<p style="text-align:left;">Whew! That was the hardest part of the proof. Glad that&#8217;s over.</p>
<p style="text-align:left;">So we have learned that if the cofibrations contain more than just the canonical cofibrations, then they also contain <img src='http://s0.wp.com/latex.php?latex=E+%5Cto+pt&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='E &#92;to pt' title='E &#92;to pt' class='latex' />, which is then necessarily an acyclic cofibration. This leads us to define the following:</p>
<p style="text-align:left;"><strong>Definition</strong>: A category is <em>gaunt</em> if every isomorphism is an identity.</p>
<p style="text-align:left;">Gaunt categories are what you get when you take category theory and strip away the fleshy meat of topology (in this case 1-types or groupoids).  We also have this:</p>
<p style="text-align:left;"><strong>Another Trivial Lemma</strong>: If the acyclic cofibrations contain the map <img src='http://s0.wp.com/latex.php?latex=E+%5Cto+pt&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='E &#92;to pt' title='E &#92;to pt' class='latex' />, then the fibrant objects are necessarily gaunt.</p>
<p style="text-align:left;">The proof is just unraveling definitions.  We also have a</p>
<p style="text-align:left;"><strong>Trivial Observation</strong>: Not every category is equivalent to a gaunt category (e.g. non-trivial groupoids).</p>
<p style="text-align:left;">But now we see a contradiction emerge. For a model structure, every equivalence class of objects must contain a fibrant representative. If the cofibrations contain more that the canonical cofibrations, then <img src='http://s0.wp.com/latex.php?latex=E+%5Cto+pt&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='E &#92;to pt' title='E &#92;to pt' class='latex' /> is a cofibration and hence  the fibrant objects are gaunt. The equivalence class of, say, a non-trivial groupoid cannot be thus represented. We are thus led to conclude:</p>
<p style="text-align:left;"><strong>Theorem</strong>: There is precisely one model structure on the category of categories in which the weak equivalences are the equivalences of categories. It is the canonical model structure.</p>
<p style="text-align:left;">
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/4761/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/4761/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4761&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2012/11/16/the-canonical-model-structure-on-cat/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/f78a30f131030c136a420f8de37a5ea9?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Chris</media:title>
		</media:content>
	</item>
		<item>
		<title>Shameless conference promotion</title>
		<link>http://sbseminar.wordpress.com/2012/11/14/shameless-conference-promotion/</link>
		<comments>http://sbseminar.wordpress.com/2012/11/14/shameless-conference-promotion/#comments</comments>
		<pubDate>Wed, 14 Nov 2012 15:57:41 +0000</pubDate>
		<dc:creator>Ben Webster</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/2012/11/14/shameless-conference-promotion/</guid>
		<description><![CDATA[So, obviously posting on this blog has ebbed a little (I keep hoping to reverse this trend, but I think we&#8217;ve all found that demands on our time that come before blog posting tend to ratchet upward, not downward).  I assume there are still a few people reading, though, and I wanted to do a [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4758&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>So, obviously posting on this blog has ebbed a little (I keep hoping to reverse this trend, but I think we&#8217;ve all found that demands on our time that come before blog posting tend to ratchet upward, not downward).  I assume there are still a few people reading, though, and I wanted to do a little promotion.  </p>
<p>One of the thing that&#8217;s been demanding my time lately has been conference organization.  We&#8217;re planning a conference at Northeastern next spring in recognition of the 60th birthday of Andrei Zelevinsky, with the exteremely original name of &#8220;<b>Algebra, Combinatorics and Representation Theory&#8221;.</b> I think it&#8217;s going to be great, and I encourage any of you who are able and interested to attend;  we have a really great line-up of speakers.  </p>
<p>For more information, see <a href="http://www.math.neu.edu/~bwebster/ACRT/">our website</a>.  I want to particularly encourage young people to attend; we&#8217;re really hoping (cross your fingers) to have funding for grad students and postdocs.  (Furthermore, it will help us to obtain said funding if young people express an interest in coming.  So, if you would like to come, please <a href="http://www.math.neu.edu/~bwebster/ACRT/registration.html">register</a>).</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/4758/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/4758/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4758&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2012/11/14/shameless-conference-promotion/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/0c43e0f7215504ff9a0a8918a1278dd5?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">bwebste</media:title>
		</media:content>
	</item>
		<item>
		<title>Rant to me about algebra books</title>
		<link>http://sbseminar.wordpress.com/2012/10/25/rant-to-me-about-algebra-books/</link>
		<comments>http://sbseminar.wordpress.com/2012/10/25/rant-to-me-about-algebra-books/#comments</comments>
		<pubDate>Fri, 26 Oct 2012 03:04:51 +0000</pubDate>
		<dc:creator>David Speyer</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=4754</guid>
		<description><![CDATA[Next term, I will be teaching the second semester of graduate algebra here at Michigan. The big mandatory topics are finite groups and Galois theory. There is usually time for a bit more of whatever the instructor wants to fit in. I want to do some representation theory. In my dreams, we&#8217;ll also do a [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4754&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>Next term, I will be teaching the second semester of graduate algebra here at Michigan. The big mandatory topics are finite groups and Galois theory. There is usually time for a bit more of whatever the instructor wants to fit in. I want to do some representation theory. In my dreams, we&#8217;ll also do a bit of playing with number fields, but that might be overly ambitious.</p>
<p>My project for the next few weekends is to skim through as many algebra texts as I can and pick one to use. So I thought I&#8217;d put up a request for your opinions. Below the fold, some of my criteria:</p>
<p><span id="more-4754"></span></p>
<p>The text should cover finite group theory, rep theory, Galois theory and, ideally, some Dedekind domains. Abstract linear algebra, including tensor products, would also be a strong plus, although in theory they&#8217;ve all had that already.</p>
<p>I&#8217;m a dynamic lecturer who is good at generating excitement and drawing connections. (Or so I like to tell myself.) By comparison, I am not as good at presenting technical arguments and definitions. I believe that teachers should choose textbooks which complement their style, so I would prefer a book which is careful and precise at the expense of being duller.</p>
<p>I&#8217;d like a good reference book. These are grad students, or undergrads who are very likely to go to grad school. The textbook should be useful to them beyond the class.</p>
<p>Ideally, I&#8217;d like a book which shows off connections of algebra to the rest of mathematics. All of our grad students take this course (except for those who already know the material), including lots of analysts and geometers. Let&#8217;s convince them algebra is useful and beautiful.</p>
<p>In recent years, the course has been taught from Dummit and Foote, from Artin, and from Lang. I definitely plan to look at these. My favorite algebra text is Jacobson, but I think I have to reject it on the grounds that he doesn&#8217;t do rep theory until the middle of volume 2, after a lot of other intimidating stuff. (I love this book, though, so feel free to talk me into using it.) Please let me know other great options I&#8217;m missing, or what you think of these.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/4754/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/4754/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4754&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2012/10/25/rant-to-me-about-algebra-books/feed/</wfw:commentRss>
		<slash:comments>21</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/870d64be2e41d1495c86ebcac4d51b3c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">davidspeyer</media:title>
		</media:content>
	</item>
		<item>
		<title>What I&#8217;m reading</title>
		<link>http://sbseminar.wordpress.com/2012/10/24/what-im-reading/</link>
		<comments>http://sbseminar.wordpress.com/2012/10/24/what-im-reading/#comments</comments>
		<pubDate>Wed, 24 Oct 2012 18:56:59 +0000</pubDate>
		<dc:creator>David Speyer</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=4748</guid>
		<description><![CDATA[I haven&#8217;t had a long post for a while, but there is lots of great math on the internet. Here are some of the things I&#8217;m trying to find time to read. Integrable systems, toric geometry and Okounkov bodies The answer to a question which many people have asked: What&#8217;s the relationship between integrable systems [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4748&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>I haven&#8217;t had a long post for a while, but there is lots of great math on the internet. Here are some of the things I&#8217;m trying to find time to read.</p>
<p><a href="http://arxiv.org/abs/1205.5249">Integrable systems, toric geometry and Okounkov bodies</a> The answer to a question which many people have asked: What&#8217;s the relationship between integrable systems and torus actions? Allen Knutson has been <a href="http://mathoverflow.net/questions/2203/what-is-the-relationship-between-integrable-systems-and-toric-degenerations">telling people</a> roughly what the picture should be for a while, but the details seemed very hairy; now they are all resolved. That gets us half way to the question I want to know the answer to: &#8220;What is the relation between these integrable systems and cluster algebras?&#8221;</p>
<p><a href="http://arxiv.org/abs/1210.5579">A closed formula for the decomposition of tensor products of Specht modules for the symmetric group</a> A positive formula for stable Kronecker coefficients! (Corollary 4.08) And a proof which relies on the sort of <a href="https://sbseminar.wordpress.com/2009/02/25/delignes-“la-categorie-des-representations-du-groupe-symetrique-s_t-lorsque-t-n’est-pas-un-entier-naturel”/">planar diagram philosophy</a> that people on this blog love. Congratulations to Bowman, de Visscher and Orellana.</p>
<p><a href="http://lesswrong.com/lw/ev3/causal_diagrams_and_causal_models/">Causal diagrams and causal models</a> Not new, but new to me. I had always learned that, if <img src='http://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='X' title='X' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='Y' title='Y' class='latex' /> are correlated, then the only way to tell which one causes which (or whether they are both caused by something else) was by a randomized trial. Not true! You can make this determination in a purely observational manner, by seeing how <img src='http://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='X' title='X' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=Y&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='Y' title='Y' class='latex' /> both correlate with <img src='http://s0.wp.com/latex.php?latex=Z&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='Z' title='Z' class='latex' />. Apparently, this was known since the late 80&#8242;s, but my stats course never covered it. Makes me want to go back and work in algebraic statistics.</p>
<p>And I&#8217;ll take the opportunity to plug a paper of my own which has been a long time coming. <a href="http://arxiv.org/abs/1209.5409">Schubert problems with respect to osculating flags of stable rational curves</a> The Shapiro-Shapiro conjecture, now proved by <a href="http://arxiv.org/abs/math/0512299">Mukhin, Tarasov and Varchenko</a> shows that any <img src='http://s0.wp.com/latex.php?latex=N&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='N' title='N' class='latex' /> distinct points on <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BRP%7D%5E1&amp;bg=ffffff&amp;fg=666666&amp;s=0' alt='&#92;mathbb{RP}^1' title='&#92;mathbb{RP}^1' class='latex' /> give Schubert problems whose solutions are, astonishingly all real. What happens when the points collide? And what does this have to do with the work of <a href="http://arxiv.org/abs/math/0408114">Henriques and Kamnitzer</a>?</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/4748/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/4748/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4748&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2012/10/24/what-im-reading/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/870d64be2e41d1495c86ebcac4d51b3c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">davidspeyer</media:title>
		</media:content>
	</item>
		<item>
		<title>It would be harmful to design all mathematical contests to be proctorable</title>
		<link>http://sbseminar.wordpress.com/2012/09/30/it-would-be-harmful-to-design-all-mathematical-contests-to-be-proctorable/</link>
		<comments>http://sbseminar.wordpress.com/2012/09/30/it-would-be-harmful-to-design-all-mathematical-contests-to-be-proctorable/#comments</comments>
		<pubDate>Sun, 30 Sep 2012 21:54:09 +0000</pubDate>
		<dc:creator>David Speyer</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://sbseminar.wordpress.com/?p=4729</guid>
		<description><![CDATA[This rant is inspired by a debate going on at meta.math.SE. The subject of the debate is what steps the moderators should take to prevent the use of math.SE to cheat in ongoing math competitions. If you have an interest in the subject and an account on meta.math.SE, I encourage you to head over and [&#8230;]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4729&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></description>
				<content:encoded><![CDATA[<p>This rant is inspired by a debate going on at <a href="http://meta.math.stackexchange.com/a/6210/448">meta.math.SE</a>. The subject of the debate is what steps the moderators should take to prevent the use of math.SE to cheat in ongoing math competitions. If you have an interest in the subject and an account on meta.math.SE, I encourage you to head over and participate including, if you are so inclined, voting on the poll questions I just posted.</p>
<p>The particular point I want to address is posters who write that the fault is with contest organizers, for not designing their contests with internet age security in mind. A typical exemplar of this viewpoint <a href="http://meta.math.stackexchange.com/questions/6209/request-for-my-id-to-be-deleted#comment21644_6210">writes</a></p>
<blockquote><p>[Cheating] is a problem with folks using antiquated methods for tests, contests, etc. &#8211; methods that are a poor fit to the current information age. Any problems they encounter should be fixed at the source &#8211; not kludged here. </p></blockquote>
<p>I strongly disagree.</p>
<p><span id="more-4729"></span></p>
<p>How many times in your mathematical career have you heard &#8220;math contests test nothing but speed and trickery, and have nothing to do with deep mathematical ability?&#8221; &#8220;Math contests reward those with strong test taking skills, and discourage those who dislike high pressure gimmicky environments.&#8221; &#8220;Math contests allow no time for contemplation or discussion?&#8221;</p>
<p>I believe that these are all true. This isn&#8217;t a case of sour grapes &#8212; I test very well, think very fast, and enjoyed math competitions greatly. But I have met many colleagues who think more slowly than I do and nonetheless are superb mathematicians. So the problem emerges, how can we design contests which show students that mathematics has room for contemplation, cooperation and insight, not simply rapid tricks?</p>
<p>In answer to this question, contests like the <a href="http://www.usamts.org/">USAMTS</a> and <a href="http://onlinemathopen.netne.net/">OMO</a> were born. These contests ask challenging and intriguing problems, require detailed written answers and give weeks to solve them. I loved the USAMTS when I was in high school; every question was well written and interesting, and I pushed myself to write the best answers I could. The OMO is after my time, but it looks like it was designed with similar love.</p>
<p>Such contests are impossible to secure. You can&#8217;t ask high school students to live under proctored conditions for a week. </p>
<p>Cheating in contests is damaging to everyone who competes. In theory, of course, participants could simply focus on achieving their own personal best, and not think about their own placement. In practice, seeing cheaters prosper produces disillusionment, disgust and a feeling of wasted effort. This true in any field of competition, but it is worse in competitions where there is no absolute gauge of accomplishment, such as these contests. A runner who finishes the SF marathon in <a href="http://devoncrosbyhelms.com/2012/07/the-sf-marathon-race-report.html">2:44:05</a> knows she has a superb race no matter what <a href="http://www.letsrun.com/forum/flat_read.php?thread=4761190&amp;page=0">others may have done</a>; a Math Olympian who sees that someone got 74/75 on the USAMTS has no way of knowing whether his own 72/75 was still a superb performance or not. </p>
<p>If we want there to be contests which reward prolonged thought, we run competitions which can be cheated on. If we want competitors to value their achievements in these contests, we who answer questions on math fora need to be vigilant about shutting cheaters down.</p>
<p>PS A much harder question is how to deal with university courses. Many of the same arguments against high pressure timed exams apply, but part of what universities provide to their students, and to society, is certification of mathematical ability. I am still struggling with these issues.</p>
<br />  <a rel="nofollow" href="http://feeds.wordpress.com/1.0/gocomments/sbseminar.wordpress.com/4729/"><img alt="" border="0" src="http://feeds.wordpress.com/1.0/comments/sbseminar.wordpress.com/4729/" /></a> <img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=sbseminar.wordpress.com&#038;blog=1217555&#038;post=4729&#038;subd=sbseminar&#038;ref=&#038;feed=1" width="1" height="1" />]]></content:encoded>
			<wfw:commentRss>http://sbseminar.wordpress.com/2012/09/30/it-would-be-harmful-to-design-all-mathematical-contests-to-be-proctorable/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
	
		<media:content url="http://2.gravatar.com/avatar/870d64be2e41d1495c86ebcac4d51b3c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">davidspeyer</media:title>
		</media:content>
	</item>
	</channel>
</rss>
