<?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/"
	>

<channel>
	<title>neverendingbooks</title>
	<atom:link href="http://www.neverendingbooks.org/index.php/feed" rel="self" type="application/rss+xml" />
	<link>http://www.neverendingbooks.org</link>
	<description>lieven le bruyn&#039;s blog</description>
	<lastBuildDate>Tue, 09 Mar 2010 09:20:39 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Return to LaTeX</title>
		<link>http://www.neverendingbooks.org/index.php/return-to-latex.html</link>
		<comments>http://www.neverendingbooks.org/index.php/return-to-latex.html#comments</comments>
		<pubDate>Fri, 12 Feb 2010 20:20:29 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[iMath]]></category>
		<category><![CDATA[LaTeX]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2965</guid>
		<description><![CDATA[


To most mathematicians, a good LaTeX-frontend (such as TeXShop for Mac-users) is the crucial tool to get the work done. We use it to draft ideas, write papers and courses, or even to take notes during lectures. 

However, after six years of blogging, my own LaTeX-routine became rusty. I rarely open a new tex-document, and [...]]]></description>
			<content:encoded><![CDATA[<p><p></p>

<p><p>
To most mathematicians, a good LaTeX-frontend (such as <a href="http://www.uoregon.edu/~koch/texshop/">TeXShop</a> for Mac-users) is the crucial tool to get the work done. We use it to draft ideas, write papers and courses, or even to take notes during lectures. 
<p>
However, after six years of blogging, my own LaTeX-routine became rusty. I rarely open a new tex-document, and when I do, I’d rather copy-paste the long preamble from an old file than to start from scratch with a minimal list of packages and definitions needed for the job at hand. The few times I put a paper on the arXiv, the resulting text resembles a blog-post more than a mathematical paper, here’s <a href="http://arxiv.org/abs/0803.3601">an example</a>. 
<p>
As I desperately need to get some math-writing done, I need to pull myself away from the lure of an ever-open <a href="http://wordpress.org/">WordPress</a> admin browser-screen and reacquaint myself with the far more efficient LaTeX-environment. 
<p>
Perhaps even my blogging will benefit from the change. Whereas I used to keep on adding to most of my tex-files in order to keep them up-to-date, I rarely edit a blog-post after hitting the ’publish’ button. If I really want to turn some of my better posts into a book, I need them in a format suitable for neverending polishing, without annoying the many RSS-feed aggregators out there. 
<p>
Who better than Terry Tao to teach me a more proficient way of blogging? A few days ago, Terry <a href="http://terrytao.wordpress.com/2010/02/07/an-epsilon-of-room-pages-from-year-three-of-a-mathematical-blog/">announced</a> he will soon have his 5th (!!) book out, after three years of blogging&#8230; 
<p>
How does he manage to do this? Well, as far as I know, Terry blogs in LaTeX and then uses a python-script called <a href="http://lucatrevisan.wordpress.com/latex-to-wordpress/">LaTeX2WP</a> ’a program that converts a LaTeX file into something that is ready to be cut and pasted into WordPress. This way, you can write, and preview, your post in LaTeX, then run LaTeX2WP, and post into WordPress whatever comes out.’ More importantly, one retains a pure-tex-file of the post on which one can keep on editing to get it into a (book)-publishable form, eventually. 
<p>
Nice, but one can do even better, as Eric from <a href="http://curiousreasoning.wordpress.com/tag/latex/">Curious Reasoning</a> worked out. He suggests to install two useful python-packages : <a href="http://www.blackbirdblog.it/programmazione/progetti/28#english">WordPressLib</a> &#8220;with this library you can control remotely a WordPress installation. Use of library is very simple, you can write a small scripts or full applications that allows you to automate publishing of articles on your blog/site powered by WordPress&#8221; and <a href="http://plastex.sourceforge.net/">plasTeX</a> &#8220;plasTeX is a LaTeX document processing framework written entirely in Python. It currently comes bundled with an XHTML renderer (including multiple themes), as well as a way to simply dump the document to a generic form of XML&#8221;. Installation is easy : download and extract the files somewhere, go there and issue a <strong>sudo python setup.py install</strong> to add the packages to your python. 
<p>
Finally, get Eric’s own <a href="http://curiousreasoning.wordpress.com/2010/01/30/overview-of-wplatex-4/">wplatex</a> package and install it as explained there. WpLaTeX has all the features of LaTeX2WP and much more : one can add titles, tags and categories automatically and publish the post from the command-line without ever having to enter the taboo WordPress-admin page! Here’s what I’ve written by now in TeXShop 
<p>
<p align=center> <img src="http://www.neverendingbooks.org/wp-content/uploads/2010/02/Return2Latex.jpg" /> </p>
<p>
I’ve added the screenshot and the script will know where to find it online for the blog-version as well as on my hard-disk for the tex-version. Very handy is the iftex &#8230; fi versus ifblog &#8230; fi alternative which allows you to add pure HTML to get the desired effect, when needed. Remains only to go into Terminal and issue the command 
<p>
wplpost -x http://www.neverendingbooks.org/xmlrpc.php ReturnToLatex.tex 
<p>
(if your blog is on WordPress.com it even suffices to give its name, rather than this work-around for stand-alone wordpress blogs). The script asks for my username and password and will convert the tex-file and post it automatic. </p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/return-to-latex.html/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Where&#8217;s Bourbaki&#8217;s Escorial?</title>
		<link>http://www.neverendingbooks.org/index.php/wheres-bourbakis-escorial.html</link>
		<comments>http://www.neverendingbooks.org/index.php/wheres-bourbakis-escorial.html#comments</comments>
		<pubDate>Mon, 08 Feb 2010 14:30:59 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[Bourbaki]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2565</guid>
		<description><![CDATA[As explained in the bumpy-road-post, Andre Weil and Evelyne Gillet became involved sometime in 1935.
Early 1936, they made a pre-honeymooning trip to Spain and visited El Escorial. Weil was so taken by the place that he planned the next Bourbaki-conference to be held in a nearby college. 

However, the Bourbakis never made it to to [...]]]></description>
			<content:encoded><![CDATA[<p>As explained in the <a href="http://www.neverendingbooks.org/index.php/the-bumpy-road-to-the-first-bourbaki-congress.html">bumpy-road-post</a>, <a href="http://en.wikipedia.org/wiki/André_Weil">Andre Weil</a> and Evelyne Gillet became involved sometime in 1935.
Early 1936, they made a pre-honeymooning trip to Spain and visited <a href="http://en.wikipedia.org/wiki/El_Escorial">El Escorial</a>. Weil was so taken by the place that he planned the next Bourbaki-conference to be held in a nearby college. </p>

<p>However, the Bourbakis never made it to to Spain that summer as the <a href="http://en.wikipedia.org/wiki/Spanish_Civil_War">Spanish civil war</a> broke out July 17th, a few weeks before the intended conference. Still, the second Bourbaki-meeting remains often referred to as the &#8216;Escorial conference&#8217;. Can we GEO-tag the exact location of Bourbaki&#8217;s &#8220;Escorial&#8221;?</p>

<p><a href="http://en.wikipedia.org/wiki/Claude_Chevalley">Claude Chevalley</a> came up with a Plan-B and suggested they would use his parents&#8217; place in <a href="http://www.chancay.org/">Chançay</a> as their venue. Chevalley&#8217;s father was a French diplomat and his house sure did possess a matching &#8216;grandeur&#8217; as can be seen from the famous picture below, taken at the (second) Chançay meeting in 1937 (Weil to the left, Chevalley to the right and Weil&#8217;s sister Simonne standing).</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/chancay2.jpg">
</center></p>

<p>Thanks to the <a href="http://portail.mathdoc.fr/archives-bourbaki/">Bourbaki archives</a> we know that the meeting took place from september 16th to 28th, that each of them had to pay 16 francs for full pension and had to bring along their own sheets and towels.</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/ChancayPrix.jpg" >
</center></p>

<p>But where exactly is this beautiful house? Jacques Borowczyk has written a nice paper <a href="http://academie-de-touraine.ifrance.com/pages/T2007/bourbaki.pdf">Bourbaki et la touraine</a> in which he describes the Bourbaki congresses of 1936 and 1937 at the Chevalley-house in Chançay and further those held in 1956, 1957 and 1959 in &#8216;hôtel de la Brèche&#8217; in Amboise. </p>

<p>Borowczyk places the Chevalley house in the little hamlet of Chançay, called &#8220;La Massoterie&#8221;. The village files assert that in 1931 three people were living at La Massoterie : father Abel Chevalley, who took residence there after his retirement in 1931, his wife Marguerite and their son Claude. But, at the time of the Bourbaki congres in 1936, Marguerite remained the only permanent inhabitant. Sadly,
Abel Chevalley, who together with Marguerite compiled the <a href="http://catalogue.nla.gov.au/Record/3645807?lookfor=subject:%22French%20language%20-%20Dictionaries%20-%20English.%22&amp;offset=6&amp;max=252">The concise Oxford French dictionary</a>, died in 1934.</p>

<p><a href="http://www.neverendingbooks.org/index.php/44-322829n-4-050861e.html">Usually</a> when you know the name of the hamlet, of the village and add just to be certain  &#8216;France&#8217;, <a href="http://maps.google.com/">Google Maps</a> takes you there within metres. So, this was going to be a quick post, for a change&#8230; Well, much to my surprise, typing &#8216;La Massoterie, Chançay, France&#8217; only produced the answer &#8220;We could not understand the location La Massoterie, Chançay, France&#8221;.</p>

<p>Did I spell it wrong? Or, did the name change over times? No, Googling for it <a href="http://www.chancay.org/plan2.htm">the first hit</a> gives you the map of a 10km walk around Chançay passing through la Massoterie!</p>

<p>Now what? Fortunately Borowczyk included in his paper an old map, from Napoleonic times, showing the exact location of La Massoterie (just above the flash-sign), facing the castle of Volmer. If you compare it with the picture below from present day Chançay (via Google earth) it is surprising how many of the landmarks have survived the changes over two centuries.</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/chancaiNapoleon.jpg">
</center></p>

<p><p /></p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/chancaiGoogle.jpg">
</center></p>

<p>It is now easy to pinpoint the exact location and zoom into the Chavalley-house, and, you&#8217;re in for a small surprise : the place is called <a href="http://maps.google.com/maps?f=q&amp;source=s_q&amp;hl=en&amp;geocode=&amp;q=La+Massotterie,+37210+Chan%C3%A7ay,+France&amp;sll=37.0625,-95.677068&amp;sspn=32.38984,63.896484&amp;ie=UTF8&amp;hq=&amp;hnear=La+Massotterie,+37210+Chan%C3%A7ay,+Indre-et-Loire,+Centre,+France&amp;ll=47.459952,0.876809&amp;spn=0.001687,0.0039&amp;t=h&amp;z=18">La Massotterie</a> with 2 t&#8217;s&#8230; </p>

<p>Probably, Googles database is more reliable than the information provided by the village of Chançay, or the paper by Borowczyk as it is the same spelling as on the old Napoleonic map. Anyway, feel free to have a peek at Bourbaki&#8217;s Escorial yourself!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/wheres-bourbakis-escorial.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Lambda-rings for formula-phobics</title>
		<link>http://www.neverendingbooks.org/index.php/lambda-rings-for-formula-phobics.html</link>
		<comments>http://www.neverendingbooks.org/index.php/lambda-rings-for-formula-phobics.html#comments</comments>
		<pubDate>Fri, 05 Feb 2010 19:25:42 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[geometry]]></category>
		<category><![CDATA[numbers]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2853</guid>
		<description><![CDATA[ In 1956, Alexander Grothendieck (middle) introduced -rings in an algebraic-geometric context to be commutative rings A equipped with a bunch of operations  (for all numbers ) satisfying a list of rather obscure identities. From the easier ones, such as 



to those expressing  and  via specific universal polynomials. An attempt to capture [...]]]></description>
			<content:encoded><![CDATA[<p><img src="http://matrix.cmi.ua.ac.be/DATA2/GrothLambda.jpg" style='float:left; margin-right:10px;height:150px;' > In 1956, <a href="http://en.wikipedia.org/wiki/Alexander_Grothendieck">Alexander Grothendieck</a> (middle) introduced <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings in an algebraic-geometric context to be commutative rings A equipped with a bunch of operations <img src='/latexrender/pictures/8ba76a3cdbd7f4a1409b1756cd8ecc47.gif' title='\lambda^i' alt='\lambda^i' align=absmiddle> (for all numbers <img src='/latexrender/pictures/cbbe976ce180bb4a4e9dd9cf0aac3ac2.gif' title='i \in \mathbb{N}_+' alt='i \in \mathbb{N}_+' align=absmiddle>) satisfying a list of rather obscure identities. From the easier ones, such as </p>

<p><img src='/latexrender/pictures/f6fbf7b978dc6e8569b6cf4beb81a686.gif' title='\lambda^0(x)=1, \lambda^1(x)=x, \lambda^n(x+y) = \sum_i \lambda^i(x) \lambda^{n-i}(y)' alt='\lambda^0(x)=1, \lambda^1(x)=x, \lambda^n(x+y) = \sum_i \lambda^i(x) \lambda^{n-i}(y)' align=absmiddle></p>

<p>to those expressing <img src='/latexrender/pictures/d53c72b428d1162d81a2ddcd9351432e.gif' title='\lambda^n(x.y)' alt='\lambda^n(x.y)' align=absmiddle> and <img src='/latexrender/pictures/cd59a09f94bb377ef185221d8befa32f.gif' title='\lambda^m(\lambda^n(x))' alt='\lambda^m(\lambda^n(x))' align=absmiddle> via specific universal polynomials. An attempt to capture the essence of <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings without formulas?</p>

<p>Lenstra&#8217;s <a href="http://www.neverendingbooks.org/index.php/big-witt-vectors-for-everyone-12.html">elegant construction</a> of the 1-power series rings <img src='/latexrender/pictures/f56604bba3385902e4b7bdcd906f5fdb.gif' title='~(\Lambda(A),\boxplus,\boxtimes)' alt='~(\Lambda(A),\boxplus,\boxtimes)' align=absmiddle> requires only one identity to remember</p>

<p><img src='/latexrender/pictures/4aadebc89177466d05df2964bc0e0320.gif' title='~(1-at)^{-1} \boxtimes (1-bt)^{-1} = (1-abt)^{-1}' alt='~(1-at)^{-1} \boxtimes (1-bt)^{-1} = (1-abt)^{-1}' align=absmiddle>.</p>

<p>Still, one can use it to show the existence of ringmorphisms <img src='/latexrender/pictures/de7c76d4cf65251657c0a9dad0938b41.gif' title='\gamma_n~:~\Lambda(A) \rightarrow A' alt='\gamma_n~:~\Lambda(A) \rightarrow A' align=absmiddle>, for all numbers <img src='/latexrender/pictures/075abaebcaea616a367e888f092c4b1e.gif' title='n \in \mathbb{N}_+' alt='n \in \mathbb{N}_+' align=absmiddle>. Consider the formal &#8216;logarithmic derivative&#8217;</p>

<p><img src='/latexrender/pictures/893e2c624871102b998f183f0e362bb7.gif' title='\gamma = \frac{t u(t)&#039;}{u(t)} = \sum_{i=1}^\infty \gamma_i(u(t))t^i~:~\Lambda(A) \rightarrow \Lambda(A)' alt='\gamma = \frac{t u(t)&#039;}{u(t)} = \sum_{i=1}^\infty \gamma_i(u(t))t^i~:~\Lambda(A) \rightarrow \Lambda(A)' align=absmiddle></p>

<p>where <img src='/latexrender/pictures/c8ec84512e21e484ee0168b2297e439d.gif' title='u(t)&#039;' alt='u(t)&#039;' align=absmiddle> is the usual formal derivative of a power series. As this derivative satisfies the chain rule, we have</p>

<p><img src='/latexrender/pictures/d7c942e5c7985720138f04621904b1e9.gif' title='\gamma(u(t) \boxplus v(t)) = \frac{t (u(t)v(t))&#039;}{u(t)v(t)} = \frac{t(u(t)&#039;v(t)+u(t)v(t)&#039;}{u(t)v(t))} = \frac{tu(t)&#039;}{u(t)} + \frac{tv(t)&#039;}{v(t)} = \gamma(u(t)) + \gamma(v(t))' alt='\gamma(u(t) \boxplus v(t)) = \frac{t (u(t)v(t))&#039;}{u(t)v(t)} = \frac{t(u(t)&#039;v(t)+u(t)v(t)&#039;}{u(t)v(t))} = \frac{tu(t)&#039;}{u(t)} + \frac{tv(t)&#039;}{v(t)} = \gamma(u(t)) + \gamma(v(t))' align=absmiddle></p>

<p>and so all the maps <img src='/latexrender/pictures/de7c76d4cf65251657c0a9dad0938b41.gif' title='\gamma_n~:~\Lambda(A) \rightarrow A' alt='\gamma_n~:~\Lambda(A) \rightarrow A' align=absmiddle> are additive. To show that they are also multiplicative, it suffices by functoriality to verify this on the special 1-series <img src='/latexrender/pictures/2cd509aaad7e730a43e77ff7f209ea22.gif' title='~(1-at)^{-1}' alt='~(1-at)^{-1}' align=absmiddle> for all <img src='/latexrender/pictures/026638d7828e8287894f1cccedfaee9c.gif' title='a \in A' alt='a \in A' align=absmiddle>. But,</p>

<p><img src='/latexrender/pictures/ad9c9f330b3997b176c3ccd84f318888.gif' title='\gamma((1-at)^{-1}) = \frac{t \frac{a}{(1-at)^2}}{(1-at)} = \frac{at}{(1-at)} = at + a^2t^2 + a^3t^3+\hdots ' alt='\gamma((1-at)^{-1}) = \frac{t \frac{a}{(1-at)^2}}{(1-at)} = \frac{at}{(1-at)} = at + a^2t^2 + a^3t^3+\hdots ' align=absmiddle></p>

<p>That is, <img src='/latexrender/pictures/ae08c01da0041e74ef82fffb99dbc05f.gif' title='\gamma_n((1-at)^{-1}) = a^n' alt='\gamma_n((1-at)^{-1}) = a^n' align=absmiddle> and Lenstra&#8217;s identity implies that <img src='/latexrender/pictures/848567d83c7daa7c569b2e3050b8f772.gif' title='\gamma_n' alt='\gamma_n' align=absmiddle> is indeed multiplicative! A first attempt :</p>

<p><strong>hassle-free definition 1</strong> : a commutative ring <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> is a <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-ring if and only if there is a ringmorphism <img src='/latexrender/pictures/e910722117381ec268e3ca87ddf46a68.gif' title='s_A~:~A \rightarrow \Lambda(A)' alt='s_A~:~A \rightarrow \Lambda(A)' align=absmiddle> splitting <img src='/latexrender/pictures/d0a2f6a5d05a6359a829e866944d05fc.gif' title='\gamma_1' alt='\gamma_1' align=absmiddle>, that is, such that <img src='/latexrender/pictures/44d04eb47d334c22b3982f6e6a684b06.gif' title='\gamma_1 \circ s_A = id_A' alt='\gamma_1 \circ s_A = id_A' align=absmiddle>. </p>

<p>In particular, a <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-ring comes equipped with a multiplicative set of ring-endomorphisms <img src='/latexrender/pictures/06d97443fd1c6825217d183374e6831b.gif' title='s_n = \gamma_n \circ s_A~:~A \rightarrow A' alt='s_n = \gamma_n \circ s_A~:~A \rightarrow A' align=absmiddle> satisfying <img src='/latexrender/pictures/a9c72b2bc7e582e1ea7357d93adcafcb.gif' title='s_m \circ s_m = s_{mn}' alt='s_m \circ s_m = s_{mn}' align=absmiddle>. One can then define a <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-ringmorphism to be a ringmorphism commuting with these endo-morphisms. </p>

<p>The motivation being that <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings are known to form a subcategory of commutative rings for which the 1-power series functor is the right adjoint to the functor forgetting the <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-structure. In particular, if <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> is a <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-ring, we have a ringmorphism <img src='/latexrender/pictures/fa7fb50b89fc1c24d1a6e6bb71878380.gif' title='A \rightarrow \Lambda(A)' alt='A \rightarrow \Lambda(A)' align=absmiddle> corresponding to the identity morphism. </p>

<p>But then, what is the connection to the usual one involving all the operations <img src='/latexrender/pictures/8ba76a3cdbd7f4a1409b1756cd8ecc47.gif' title='\lambda^i' alt='\lambda^i' align=absmiddle>? Well, one ought to recover those from <img src='/latexrender/pictures/3d22dfca373c75c50438a98c8fec2249.gif' title='s_A(a) = (1-\lambda^1(a)t+\lambda^2(a)t^2-\lambda^3(a)t^3+...)^{-1}' alt='s_A(a) = (1-\lambda^1(a)t+\lambda^2(a)t^2-\lambda^3(a)t^3+...)^{-1}' align=absmiddle>.</p>

<p>For <img src='/latexrender/pictures/f3185cee99f0e4f4ca079ddcc5440d5c.gif' title='s_A' alt='s_A' align=absmiddle> to be a ringmorphism will require identities among the <img src='/latexrender/pictures/8ba76a3cdbd7f4a1409b1756cd8ecc47.gif' title='\lambda^i' alt='\lambda^i' align=absmiddle>. I hope an expert will correct me on this one, but I&#8217;d guess we won&#8217;t yet obtain all identities required. By the very definition of an adjoint we must have that <img src='/latexrender/pictures/f3185cee99f0e4f4ca079ddcc5440d5c.gif' title='s_A' alt='s_A' align=absmiddle> is a morphism of <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings, and, this would require defining  a  <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-ring structure on <img src='/latexrender/pictures/05e53749ca3e0fbdd8ad7b0bb193db2a.gif' title='\Lambda(A)' alt='\Lambda(A)' align=absmiddle>, that is a ringmorphism <img src='/latexrender/pictures/57156a8d68242f4e2e66b53f1f27ba71.gif' title='s_{AH}~:~\Lambda(A) \rightarrow \Lambda(\Lambda(A))' alt='s_{AH}~:~\Lambda(A) \rightarrow \Lambda(\Lambda(A))' align=absmiddle>, the so called Artin-Hasse exponential, to which I&#8217;d like to return later.</p>

<p>For now, we can define a multiplicative set of ring-endomorphisms <img src='/latexrender/pictures/bf4d1c2f8b478b63235860155a19c590.gif' title='f_n~:~\Lambda(A) \rightarrow \Lambda(A)' alt='f_n~:~\Lambda(A) \rightarrow \Lambda(A)' align=absmiddle> from requiring that <img src='/latexrender/pictures/0a99d2c6f3e622a69fc7dd01fe770c47.gif' title='f_n((1-at)^{-1}) = (1-a^nt)^{-1}' alt='f_n((1-at)^{-1}) = (1-a^nt)^{-1}' align=absmiddle> for all <img src='/latexrender/pictures/026638d7828e8287894f1cccedfaee9c.gif' title='a \in A' alt='a \in A' align=absmiddle>. Another try?</p>

<p><strong>hassle-free definition 2</strong> : <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> is a <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-ring if and only if there is splitting <img src='/latexrender/pictures/f3185cee99f0e4f4ca079ddcc5440d5c.gif' title='s_A' alt='s_A' align=absmiddle> to <img src='/latexrender/pictures/d0a2f6a5d05a6359a829e866944d05fc.gif' title='\gamma_1' alt='\gamma_1' align=absmiddle> satisfying the compatibility relations <img src='/latexrender/pictures/7a08885d196ac4af719450afcd76ab50.gif' title='f_n \circ s_A = s_A \circ s_n' alt='f_n \circ s_A = s_A \circ s_n' align=absmiddle>.</p>

<p>But even then, checking that a map <img src='/latexrender/pictures/e910722117381ec268e3ca87ddf46a68.gif' title='s_A~:~A \rightarrow \Lambda(A)' alt='s_A~:~A \rightarrow \Lambda(A)' align=absmiddle> is a ringmorphism is as hard as verifying the lists of identities among the <img src='/latexrender/pictures/8ba76a3cdbd7f4a1409b1756cd8ecc47.gif' title='\lambda^i' alt='\lambda^i' align=absmiddle>. Fortunately, we get such a ringmorphism for free in the important case when A is of &#8216;characteristic zero&#8217;, that is, has no additive torsion. Then, a ringmorphism <img src='/latexrender/pictures/fa7fb50b89fc1c24d1a6e6bb71878380.gif' title='A \rightarrow \Lambda(A)' alt='A \rightarrow \Lambda(A)' align=absmiddle> exists whenever we have a multiplicative set of ring endomorphisms <img src='/latexrender/pictures/7215332a78ca0f504ba78283b7ffb8f4.gif' title='F_n~:~A \rightarrow A' alt='F_n~:~A \rightarrow A' align=absmiddle> for all <img src='/latexrender/pictures/075abaebcaea616a367e888f092c4b1e.gif' title='n \in \mathbb{N}_+' alt='n \in \mathbb{N}_+' align=absmiddle> such that for every prime number <img src='/latexrender/pictures/83878c91171338902e0fe0fb97a8c47a.gif' title='p' alt='p' align=absmiddle> the morphism <img src='/latexrender/pictures/3ef6190c2f19b15f82d699cc8a36334e.gif' title='F_p' alt='F_p' align=absmiddle> is a lift of the Frobenius, that is, <img src='/latexrender/pictures/cbfb24b6490f6c789b9562cbce9f18bf.gif' title='F_p(a) \in a^p + pA' alt='F_p(a) \in a^p + pA' align=absmiddle>. </p>

<p>Perhaps this captures the essence of  <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings best (without the risk of getting an headache) : in characteristic zero, they are the (commutative) rings having a multiplicative set of endomorphisms, generated by lifts of the Frobenius maps.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/lambda-rings-for-formula-phobics.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Seating the first few thousand Knights</title>
		<link>http://www.neverendingbooks.org/index.php/seating-the-first-few-thousand-knights.html</link>
		<comments>http://www.neverendingbooks.org/index.php/seating-the-first-few-thousand-knights.html#comments</comments>
		<pubDate>Wed, 03 Feb 2010 16:31:46 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[games]]></category>
		<category><![CDATA[groups]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2855</guid>
		<description><![CDATA[The odd Knights of the round table-problem asks for a specific one-to-one correspondence between two realizations of &#8216;the&#8217; algebraic closure  of the field of two elements.

The first identifies the multiplicative group of its non-zero elements with the group of all odd complex roots of unity, under complex multiplication. The addition on  is then [...]]]></description>
			<content:encoded><![CDATA[<p>The <a href="http://www.neverendingbooks.org/index.php/the-odd-knights-of-the-round-table.html">odd Knights of the round table</a>-problem asks for a specific one-to-one correspondence between two realizations of &#8216;the&#8217; algebraic closure <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> of the field of two elements.</p>

<p>The first identifies the multiplicative group of its non-zero elements with the group of all odd complex roots of unity, under complex multiplication. The addition on <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> is then recovered by inducing an involution on the odd roots, pairing the one corresponding to x to the one corresponding to x+1. </p>

<p>The second uses Conway&#8217;s &#8217;simplicity rules&#8217; to define an addition and multiplication on the set of all ordinal numbers. Conway proves in <a href="http://en.wikipedia.org/wiki/On_Numbers_and_Games">ONAG</a> that this becomes an algebraically closed field of characteristic two and that <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> is the subfield of all ordinals smaller than <img src='/latexrender/pictures/b1a3c6cb6b78dd510f42f2e3e0f16df3.gif' title='\omega^{\omega^{\omega}}' alt='\omega^{\omega^{\omega}}' align=absmiddle>. The finite ordinals (the natural numbers) form the quadratic closure of <img src='/latexrender/pictures/edbfcbf5afc6604e39e08579f9834b3d.gif' title='\mathbb{F}_2' alt='\mathbb{F}_2' align=absmiddle>.</p>

<p>On the natural numbers the Conway-addition is binary addition without carrying and Conway-multiplication is defined by the properties that two different Fermat-powers <img src='/latexrender/pictures/daa15b7986e877dea83950c951e4a686.gif' title='N=2^{2^i}' alt='N=2^{2^i}' align=absmiddle> multiply as they do in the natural numbers, and, Fermat-powers square to its sesquimultiple, that is <img src='/latexrender/pictures/d3c95dcc4a4c27e17166e04a359c6427.gif' title='N^2=\frac{3}{2}N' alt='N^2=\frac{3}{2}N' align=absmiddle>. Moreover, all natural numbers smaller than <img src='/latexrender/pictures/f27dd546842da54106c4f3d86999284c.gif' title='N=2^{2^{i}}' alt='N=2^{2^{i}}' align=absmiddle> form a finite field <img src='/latexrender/pictures/a4cca970399d373ad75eb4bc7909a605.gif' title='\mathbb{F}_{2^{2^i}}' alt='\mathbb{F}_{2^{2^i}}' align=absmiddle>. Using distributivity, one can write down a multiplication table for all 2-powers. </p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/nim2powers.jpg">
</center></p>

<p>The Knight-seating problems asks for a consistent placing of n-th Knight <img src='/latexrender/pictures/5b79c36811cce62be6a67c41558f6fb9.gif' title='K_n' alt='K_n' align=absmiddle> at an odd root of unity, compatible with the two different realizations of <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle>. Last time, we were able to place the first 15 Knights as below, and asked where you would seat <img src='/latexrender/pictures/59880cf1903f785178279f184df474f8.gif' title='K_{16}' alt='K_{16}' align=absmiddle></p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/Knights16.jpg">
</center></p>

<p><img src='/latexrender/pictures/7ad8d18c08e61abbf269c06a7ea6530a.gif' title='K_4' alt='K_4' align=absmiddle> was placed at <img src='/latexrender/pictures/6d1c5eaac205047e93710d19ddf08120.gif' title='e^{2\pi i/15}' alt='e^{2\pi i/15}' align=absmiddle> as 4 was the smallest number generating the &#8216;Fermat&#8217;-field <img src='/latexrender/pictures/1884f9f307ca7fb08b08e6bc747fa999.gif' title='\mathbb{F}_{2^{2^2}}' alt='\mathbb{F}_{2^{2^2}}' align=absmiddle> (with multiplicative group of order 15) subject to the compatibility relation with the generator 2 of the smaller Fermat-field <img src='/latexrender/pictures/edbfcbf5afc6604e39e08579f9834b3d.gif' title='\mathbb{F}_2' alt='\mathbb{F}_2' align=absmiddle> (with group of order 15) that <img src='/latexrender/pictures/84518b7ebab8b9bc93aae3e2127569a0.gif' title='4^5=2' alt='4^5=2' align=absmiddle>. </p>

<p>To include the next Fermat-field <img src='/latexrender/pictures/e551bb62ca256d1d38e6da75fc437bad.gif' title='\mathbb{F}_{2^{2^3}}' alt='\mathbb{F}_{2^{2^3}}' align=absmiddle> (with multiplicative group of order 255) consistently, we need to find the smallest number n generating the multiplicative group and satisfying the compatibility condition <img src='/latexrender/pictures/827f9e1da8d601f20f5f60e1548c3819.gif' title='n^{17}=4' alt='n^{17}=4' align=absmiddle>. Let&#8217;s first concentrate on finding the smallest generator : as 2 is a generator for 1st Fermat-field <img src='/latexrender/pictures/30c29284c2fa47b5d6cffb121a96e993.gif' title='\mathbb{F}_{2^{2^1}}' alt='\mathbb{F}_{2^{2^1}}' align=absmiddle> and 4 a generator for the 2-nd Fermat-field <img src='/latexrender/pictures/1884f9f307ca7fb08b08e6bc747fa999.gif' title='\mathbb{F}_{2^{2^2}}' alt='\mathbb{F}_{2^{2^2}}' align=absmiddle> a natural conjecture might be that 16 is a generator for the 3-rd Fermat-field <img src='/latexrender/pictures/e551bb62ca256d1d38e6da75fc437bad.gif' title='\mathbb{F}_{2^{2^3}}' alt='\mathbb{F}_{2^{2^3}}' align=absmiddle> and, more generally, that <img src='/latexrender/pictures/88317dd63297f33c1f6bd17592bd2a11.gif' title='2^{2^i}' alt='2^{2^i}' align=absmiddle> would be a generator for the next field <img src='/latexrender/pictures/5bd37a9ed86b99b4b973bb8fcf19c33d.gif' title='\mathbb{F}_{2^{2^{i+1}}}' alt='\mathbb{F}_{2^{2^{i+1}}}' align=absmiddle>.</p>

<p>However, an &#8220;exercise&#8221; in the 1978-paper by Hendrik Lenstra <a href="https://openaccess.leidenuniv.nl/bitstream/1887/2125/1/346_027.pdf">Nim multiplication</a> asks : &#8220;Prove that <img src='/latexrender/pictures/88317dd63297f33c1f6bd17592bd2a11.gif' title='2^{2^i}' alt='2^{2^i}' align=absmiddle> is a primitive root in the field <img src='/latexrender/pictures/5bd37a9ed86b99b4b973bb8fcf19c33d.gif' title='\mathbb{F}_{2^{2^{i+1}}}' alt='\mathbb{F}_{2^{2^{i+1}}}' align=absmiddle> if and only if i=0 or 1.&#8221;</p>

<p>I&#8217;ve struggled with several of the &#8216;exercises&#8217; in Lenstra&#8217;s paper to the extend I feared Alzheimer was setting in, only to find out, after taking pen and paper and spending a considerable amount of time calculating, that they are indeed merely exercises, when looked at properly&#8230; (Spoiler-warning : stop reading now if you want to go through this exercise yourself).</p>

<p>In the picture above I&#8217;ve added in red the number <img src='/latexrender/pictures/8a2c0f64f9acc3ce091753d0c7f839e9.gif' title='x(x+1)=x^2+1' alt='x(x+1)=x^2+1' align=absmiddle> to each of the involutions. Clearly, for each pair these numbers are all distinct and we see that for the indicated pairing they make up all numbers strictly less than 8. </p>

<p>By Conway&#8217;s simplicity rules (or by checking) the pair (16,17) gives the number 8. In other words, the equation
<img src='/latexrender/pictures/8bf4189d2504f08a7de71ac6c3405b2d.gif' title='x^2+x+8' alt='x^2+x+8' align=absmiddle> is an irreducible polynomial over <img src='/latexrender/pictures/8d0c54fdb7a436f4e744ca8925e0314f.gif' title='\mathbb{F}_{16}' alt='\mathbb{F}_{16}' align=absmiddle> having as its roots in <img src='/latexrender/pictures/2678ba1fe770c6cd8247921858a7b05b.gif' title='\mathbb{F}_{256}' alt='\mathbb{F}_{256}' align=absmiddle> the numbers 16 and 17. But then, 16 and 17 are conjugated under the Galois-involution (the Frobenius <img src='/latexrender/pictures/decf7f4e5fa0b71bff32efa9122e14fa.gif' title='y \mapsto y^{16}' alt='y \mapsto y^{16}' align=absmiddle>). That is, we have <img src='/latexrender/pictures/5b267b88323f60cbe84ed4c4ce1d5bec.gif' title='16^{16}=17' alt='16^{16}=17' align=absmiddle> and <img src='/latexrender/pictures/85107e1b7dec3e884e35881c2f6b2b15.gif' title='17^{16}=16' alt='17^{16}=16' align=absmiddle> and hence <img src='/latexrender/pictures/c0623035b781e9f796991fad67c123c7.gif' title='16^{17}=8' alt='16^{17}=8' align=absmiddle>. Now, use the multiplication table in <img src='/latexrender/pictures/8d0c54fdb7a436f4e744ca8925e0314f.gif' title='\mathbb{F}_{16}' alt='\mathbb{F}_{16}' align=absmiddle> given in the previous post (or compute!) to see that 8 is of order 5 (and NOT a generator). As a consequence, the multiplicative order of 16 is 5&#215;17=85 and so 16 cannot be a generator in <img src='/latexrender/pictures/2678ba1fe770c6cd8247921858a7b05b.gif' title='\mathbb{F}_{256}' alt='\mathbb{F}_{256}' align=absmiddle>.
For general i one uses the fact that <img src='/latexrender/pictures/88317dd63297f33c1f6bd17592bd2a11.gif' title='2^{2^i}' alt='2^{2^i}' align=absmiddle> and <img src='/latexrender/pictures/5d96d4ad75f98e4a1918401f07088279.gif' title='2^{2^i}+1' alt='2^{2^i}+1' align=absmiddle> are the roots of the polynomial <img src='/latexrender/pictures/6bad4c1ca5e0db6a87eccb5e8a0f108a.gif' title='x^2+x+\prod_{j&lt;i} 2^{2^j}' alt='x^2+x+\prod_{j&lt;i} 2^{2^j}' align=absmiddle> over <img src='/latexrender/pictures/a4cca970399d373ad75eb4bc7909a605.gif' title='\mathbb{F}_{2^{2^i}}' alt='\mathbb{F}_{2^{2^i}}' align=absmiddle> and argues as before.</p>

<p>Right, but then what is the minimal generator satisfying <img src='/latexrender/pictures/827f9e1da8d601f20f5f60e1548c3819.gif' title='n^{17}=4' alt='n^{17}=4' align=absmiddle>? By computing we see that the pairings of all numbers in the range 16&#8230;31 give us all numbers in the range 8&#8230;15 and by the above argument this implies that the 17-th powers of all numbers smaller than 32 must be different from 4. But then, the smallest candidate is 32 and one verifies that indeed <img src='/latexrender/pictures/7086f12e8400d7783a27734d1c67b201.gif' title='32^{17}=4' alt='32^{17}=4' align=absmiddle> (use the multiplication table given before). </p>

<p>Hence, we must place Knight <img src='/latexrender/pictures/543d0b50ebd6d11b8c4f226100438cea.gif' title='K_{32}' alt='K_{32}' align=absmiddle> at root <img src='/latexrender/pictures/f466d9a6c6a914e325b72d120a9167d5.gif' title='e^{2 \pi i/255}' alt='e^{2 \pi i/255}' align=absmiddle> and place the other Knights prior to the 256-th at the corresponding power of 32. I forgot the argument I used to find-by-hand the requested place for Knight 16, but one can verify that <img src='/latexrender/pictures/07e6a767d1bd5c364ba90e498c9fbe35.gif' title='32^{171}=16' alt='32^{171}=16' align=absmiddle> so we seat <img src='/latexrender/pictures/59880cf1903f785178279f184df474f8.gif' title='K_{16}' alt='K_{16}' align=absmiddle> at root <img src='/latexrender/pictures/0e28bdf1fac26ab393e9ba74f918d837.gif' title='e^{342 \pi i/255}' alt='e^{342 \pi i/255}' align=absmiddle>.</p>

<p>But what about Knight <img src='/latexrender/pictures/a52aeded0aa228e324499e0c0d2b67f5.gif' title='K_{256}' alt='K_{256}' align=absmiddle>? Well, by this time I was quite good at squaring and binary representations of integers, but also rather tired, and decided to leave that task to the computer.</p>

<p>If we denote Nim-addition and multiplication by <img src='/latexrender/pictures/61a41642d26f221806dcbccfcebc2ef8.gif' title='\oplus' alt='\oplus' align=absmiddle> and <img src='/latexrender/pictures/790c76ceb13e928d08edc53d7ac4bb5c.gif' title='\otimes' alt='\otimes' align=absmiddle>, then Conway&#8217;s simplicity results in ONAG establish a field-isomorphism between <img src='/latexrender/pictures/194a80fe87884a2ff332950d1fdc6191.gif' title='~(\mathbb{N},\oplus,\otimes)' alt='~(\mathbb{N},\oplus,\otimes)' align=absmiddle> and the field <img src='/latexrender/pictures/758a34e51ed060ad7e729d506015f1ad.gif' title='\mathbb{F}_2(x_0,x_1,x_2,\hdots )' alt='\mathbb{F}_2(x_0,x_1,x_2,\hdots )' align=absmiddle> where the <img src='/latexrender/pictures/1ba8aaab47179b3d3e24b0ccea9f4e30.gif' title='x_i' alt='x_i' align=absmiddle> satisfy the Artin-Schreier equations</p>

<p><img src='/latexrender/pictures/8396e978c98d98ecb58c390ca8dc6c29.gif' title='x_i^2+x_i+\prod_{j &amp;lt; i} x_j = 0' alt='x_i^2+x_i+\prod_{j &amp;lt; i} x_j = 0' align=absmiddle></p>

<p>and the i-th Fermat-field <img src='/latexrender/pictures/a4cca970399d373ad75eb4bc7909a605.gif' title='\mathbb{F}_{2^{2^i}}' alt='\mathbb{F}_{2^{2^i}}' align=absmiddle> corresponds to <img src='/latexrender/pictures/1fbd2c4283c2d3330fdb04ec3799c83d.gif' title='\mathbb{F}_2(x_0,x_1,\hdots,x_{i-1})' alt='\mathbb{F}_2(x_0,x_1,\hdots,x_{i-1})' align=absmiddle>. The correspondence between numbers and elements from these fields is given by taking <img src='/latexrender/pictures/a96a984ef5347b2341461f666380e42b.gif' title='x_i \mapsto 2^{2^i}' alt='x_i \mapsto 2^{2^i}' align=absmiddle>. But then, wecan write every 2-power as a product of the <img src='/latexrender/pictures/1ba8aaab47179b3d3e24b0ccea9f4e30.gif' title='x_i' alt='x_i' align=absmiddle> and use the binary representation of numbers to perform all Nim-calculations with numbers in these fields.</p>

<p>Therefore, a quick and dirty way (and by no means the most efficient) to do Nim-calculations in the next Fermat-field consisting of all numbers smaller than 65536, is to use <a href="http://www.sagemath.org/">sage</a> and set up the field <img src='/latexrender/pictures/8628ca52fb55efec0769fd5f2c99a1b8.gif' title='\mathbb{F}_2(x_0,x_1,x_2,x_3)' alt='\mathbb{F}_2(x_0,x_1,x_2,x_3)' align=absmiddle> by</p>

<pre>
R.< x,y,z,t > =GF(2)[]
S.< a,b,c,d >=R.quotient((x^2+x+1,y^2+y+x,z^2+z+x*y,t^2+t+x*y*z))
</pre>

<p>To find the smallest number generating the multiplicative group and satisfying the additional compatibility condition <img src='/latexrender/pictures/8f52bc87774141b0d42bb86e50c1919a.gif' title='n^{257}=32' alt='n^{257}=32' align=absmiddle> we have to find the smallest binary number <img src='/latexrender/pictures/525943896f79b80f3330d9ebfb65f082.gif' title='i_1i_2 \hdots i_{16}' alt='i_1i_2 \hdots i_{16}' align=absmiddle> (larger than 255) satisfying</p>

<pre>
(i1*a*b*c*t+i2*b*c*t+i3*a*c*t+i4*c*t+i5*a*b*t+i6*b*t+
i7*a*t+i8*t+i9*a*b*c+i10*b*c+i11*a*c+i12*c+i13*a*b+
i14*b+i15*a+i16)^257=a*c
</pre>

<p>It takes a 2.4GHz 2Gb-RAM MacBook not that long to decide that the requested generator is 1051 (killing another optimistic conjecture that these generators might be 2-powers). So, we seat Knight
<img src='/latexrender/pictures/ab5869795e27e63b5a931e7190b1e525.gif' title='K_{1051}' alt='K_{1051}' align=absmiddle> at root <img src='/latexrender/pictures/d9a779ce28a7c61b12fca58f04bef688.gif' title='e^{2 \pi i/65535}' alt='e^{2 \pi i/65535}' align=absmiddle> and can then arrange seatings for all Knight queued up until we reach the 65536-th! In particular, the first Knight we couldn&#8217;t place before, that is Knight <img src='/latexrender/pictures/a52aeded0aa228e324499e0c0d2b67f5.gif' title='K_{256}' alt='K_{256}' align=absmiddle>, will be seated at root <img src='/latexrender/pictures/d12e914ff64e26451512a6a85ef27540.gif' title='e^{65826 \pi i/65535}' alt='e^{65826 \pi i/65535}' align=absmiddle>.</p>

<p>If you&#8217;re lucky enough to own a computer with more RAM, or have the patience to make the search more efficient and get the seating arrangement for the next Fermat-field, please drop a comment.</p>

<p>I&#8217;ll leave you with another Lenstra-exercise which shouldn&#8217;t be too difficult for you to solve now : &#8220;Prove that <img src='/latexrender/pictures/5e478ba4403c488dff90cf2d27e5c412.gif' title='x^3=2^{2^i}' alt='x^3=2^{2^i}' align=absmiddle> has three solutions in <img src='/latexrender/pictures/9b3ecd4f5f0cc174717f19cec0743fcd.gif' title='\mathbb{N}' alt='\mathbb{N}' align=absmiddle> for each <img src='/latexrender/pictures/6b017035c97c9e68f3da10366d8c207e.gif' title='i \geq 2' alt='i \geq 2' align=absmiddle>.&#8221;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/seating-the-first-few-thousand-knights.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>big Witt vectors for everyone (1/2)</title>
		<link>http://www.neverendingbooks.org/index.php/big-witt-vectors-for-everyone-12.html</link>
		<comments>http://www.neverendingbooks.org/index.php/big-witt-vectors-for-everyone-12.html#comments</comments>
		<pubDate>Tue, 02 Feb 2010 13:00:30 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[geometry]]></category>
		<category><![CDATA[numbers]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2811</guid>
		<description><![CDATA[Next time you visit your math-library, please have a look whether these books are still on the shelves : Michiel Hazewinkel&#8217;s Formal groups and applications, William Fulton&#8217;s and Serge Lange&#8217;s Riemann-Roch algebra and Donald Knutson&#8217;s lambda-rings and the representation theory of the symmetric group.

I wouldn&#8217;t be surprised if one or more of these books are [...]]]></description>
			<content:encoded><![CDATA[<p>Next time you visit your math-library, please have a look whether these books are still on the shelves : <a href="http://homepages.cwi.nl/~mich/">Michiel Hazewinkel</a>&#8217;s <a href="http://books.google.com/books?id=f_s0-lTw7EIC&amp;pg=PR8&amp;lpg=PR8&amp;dq=Formal+groups+and+applications&amp;source=bl&amp;ots=HO1WUf1C8T&amp;sig=6E2h4g8Nc8-WrpZIfgZVzj8ffac&amp;hl=en&amp;ei=5htkS_bqAsfc-QbtytCqBw&amp;sa=X&amp;oi=book_result&amp;ct=result&amp;resnum=1&amp;ved=0CA4Q6AEwAA#v=onepage&amp;q=&amp;f=false">Formal groups and applications</a>, William Fulton&#8217;s and Serge Lange&#8217;s <a href="http://books.google.com/books?id=OD3q3C-Wi-oC&amp;printsec=frontcover&amp;dq=Riemann-Roch+algebra&amp;source=bl&amp;ots=XsbxX6BTOh&amp;sig=Z1-EDxUrxPNRV-2gtiF-An_X_bY&amp;hl=en&amp;ei=NhxkS_vkBYPI-QbOsNSjBw&amp;sa=X&amp;oi=book_result&amp;ct=result&amp;resnum=1&amp;ved=0CAkQ6AEwAA#v=onepage&amp;q=&amp;f=false">Riemann-Roch algebra</a> and Donald Knutson&#8217;s <a href="http://www.flipkart.com/lambda-rings-representation-theory-symmetric/3540061843-abz3f99zlb">lambda-rings and the representation theory of the symmetric group</a>.</p>

<p>I wouldn&#8217;t be surprised if one or more of these books are borrowed out, probably all of them to the same person. I&#8217;m afraid I&#8217;m that person in Antwerp&#8230;</p>

<p>Lately, there&#8217;s been a renewed interest in <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings and the endo-functor W assigning to a commutative algebra its ring of big Witt vectors, following Borger&#8217;s new proposal for a geometry over the absolute point. </p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/Lenstrapic.jpg" style='float:left; margin-right:10px;' >However, as <a href="http://www.math.leidenuniv.nl/~hwl/">Hendrik Lenstra</a> writes in his 2002 course-notes on the subject <a href="http://math.berkeley.edu/~hwl/papers/witt.pdf">Construction of the ring of Witt vectors</a> : &#8220;The literature on the functor W is in a somewhat unsatisfactory state: nobody seems to have any interest in Witt vectors beyond applying them for a purpose, and they are often treated in appendices to papers devoting to something else; also, the construction usually depends on a set of implicit or unintelligible formulae. Apparently, anybody who wishes to understand Witt vectors needs to construct them personally. That is what is now happening to myself.&#8221;</p>

<p>Before doing a series on Borger&#8217;s paper, we&#8217;d better run through Lenstra&#8217;s elegant construction in a couple of posts. Let A be a commutative ring and consider the multiplicative group of all &#8216;one-power series&#8217; over it <img src='/latexrender/pictures/52459f7e0a68f4e61fb742f8cb1a710e.gif' title='\Lambda(A)=1+t A[[t]]' alt='\Lambda(A)=1+t A[[t]]' align=absmiddle>. Our aim is to define a commutative ring structure on <img src='/latexrender/pictures/05e53749ca3e0fbdd8ad7b0bb193db2a.gif' title='\Lambda(A)' alt='\Lambda(A)' align=absmiddle> taking as its ADDITION the MULTIPLICATION of power series. </p>

<p>That is, if <img src='/latexrender/pictures/c573a70c50f20100dc31d18b4cc5b975.gif' title='u(t),v(t) \in \Lambda(A)' alt='u(t),v(t) \in \Lambda(A)' align=absmiddle>, then we define our addition <img src='/latexrender/pictures/f0a5af8668c94a029ace422ef5d728fd.gif' title='u(t) \boxplus v(t) = u(t) \times v(t)' alt='u(t) \boxplus v(t) = u(t) \times v(t)' align=absmiddle>. This may be slightly confusing  as the ZERO-element in <img src='/latexrender/pictures/697410b9bed3303cf0bf955fdcdeb77a.gif' title='\Lambda(A),\boxplus' alt='\Lambda(A),\boxplus' align=absmiddle> will then turn be the constant power series 1&#8230; </p>

<p>We are now going to define a multiplication <img src='/latexrender/pictures/e8803d7fd32bf994a6443ad3219d7443.gif' title='\boxtimes' alt='\boxtimes' align=absmiddle> on <img src='/latexrender/pictures/05e53749ca3e0fbdd8ad7b0bb193db2a.gif' title='\Lambda(A)' alt='\Lambda(A)' align=absmiddle> which is distributively with respect to <img src='/latexrender/pictures/6f05d4c99a26eb9cd141d33e25be9041.gif' title='\boxplus' alt='\boxplus' align=absmiddle> and turns <img src='/latexrender/pictures/05e53749ca3e0fbdd8ad7b0bb193db2a.gif' title='\Lambda(A)' alt='\Lambda(A)' align=absmiddle> into a commutative ring with ONE-element the series <img src='/latexrender/pictures/6de1c29f37ff664d6db01932fd5be9b6.gif' title='~(1-t)^{-1}=1+t+t^2+t^3+\hdots' alt='~(1-t)^{-1}=1+t+t^2+t^3+\hdots' align=absmiddle>. </p>

<p>We will do this inductively, so consider <img src='/latexrender/pictures/4410d7440116c75433e9d12bbce6d0dd.gif' title='\Lambda_n(A)' alt='\Lambda_n(A)' align=absmiddle> the (classes of) one-power series truncated at term n, that is, the kernel of the natural augmentation map between the multiplicative group-units <img src='/latexrender/pictures/44e56a0ed489c1b14d5a7fd48d5b009f.gif' title='~A[t]/(t^{n+1})^* \rightarrow A^*' alt='~A[t]/(t^{n+1})^* \rightarrow A^*' align=absmiddle>. 
Again, taking multiplication in <img src='/latexrender/pictures/069719475f6101cacac1eb7ca27a289b.gif' title='A[t]/(t^{n+1})' alt='A[t]/(t^{n+1})' align=absmiddle> as a new addition rule <img src='/latexrender/pictures/6f05d4c99a26eb9cd141d33e25be9041.gif' title='\boxplus' alt='\boxplus' align=absmiddle>, we see that <img src='/latexrender/pictures/8ee5dd94702dfd79a7760dbe09817e6c.gif' title='~(\Lambda_n(A),\boxplus)' alt='~(\Lambda_n(A),\boxplus)' align=absmiddle> is an Abelian group, whence a <img src='/latexrender/pictures/1458a437b3c6456f9ebf61d46c9ed13e.gif' title='\Z' alt='\Z' align=absmiddle>-module.</p>

<p>For all elements <img src='/latexrender/pictures/026638d7828e8287894f1cccedfaee9c.gif' title='a \in A' alt='a \in A' align=absmiddle> we have a scaling operator <img src='/latexrender/pictures/fb567baccc796eef05f114cca027f997.gif' title='\phi_a' alt='\phi_a' align=absmiddle> (sending <img src='/latexrender/pictures/9c8c3d35d4f4408726e46a2c565fe071.gif' title='t \rightarrow at' alt='t \rightarrow at' align=absmiddle>) which is an A-ring endomorphism of <img src='/latexrender/pictures/069719475f6101cacac1eb7ca27a289b.gif' title='A[t]/(t^{n+1})' alt='A[t]/(t^{n+1})' align=absmiddle>, in particular multiplicative wrt. <img src='/latexrender/pictures/60c13e05d3ec8c10b8564eae7023d9db.gif' title='\times' alt='\times' align=absmiddle>. But then, <img src='/latexrender/pictures/fb567baccc796eef05f114cca027f997.gif' title='\phi_a' alt='\phi_a' align=absmiddle> is an additive endomorphism of <img src='/latexrender/pictures/8ee5dd94702dfd79a7760dbe09817e6c.gif' title='~(\Lambda_n(A),\boxplus)' alt='~(\Lambda_n(A),\boxplus)' align=absmiddle>, so is an element of the endomorphism-RING <img src='/latexrender/pictures/712f4f405997f27f440cf2329cf73991.gif' title='End_{\Z}(\Lambda_n(A))' alt='End_{\Z}(\Lambda_n(A))' align=absmiddle>. Because composition (being the multiplication in this endomorphism ring) of scaling operators is clearly commutative (<img src='/latexrender/pictures/c5b8fecea118ce324d62c2324fac4333.gif' title='\phi_a \circ \phi_b = \phi_{ab}' alt='\phi_a \circ \phi_b = \phi_{ab}' align=absmiddle>) we can define a commutative RING <img src='/latexrender/pictures/3a3ea00cfc35332cedf6e5e9a32e94da.gif' title='E' alt='E' align=absmiddle> being the subring of <img src='/latexrender/pictures/712f4f405997f27f440cf2329cf73991.gif' title='End_{\Z}(\Lambda_n(A))' alt='End_{\Z}(\Lambda_n(A))' align=absmiddle> generated by the operators <img src='/latexrender/pictures/fb567baccc796eef05f114cca027f997.gif' title='\phi_a' alt='\phi_a' align=absmiddle>.</p>

<p>The action turns <img src='/latexrender/pictures/8ee5dd94702dfd79a7760dbe09817e6c.gif' title='~(\Lambda_n(A),\boxplus)' alt='~(\Lambda_n(A),\boxplus)' align=absmiddle> into an E-module and we define an E-module morphism <img src='/latexrender/pictures/73606a84d8c19642851d2e88a347a8c5.gif' title='E \rightarrow \Lambda_n(A)' alt='E \rightarrow \Lambda_n(A)' align=absmiddle> by <img src='/latexrender/pictures/d92a6d4e126dd241aea35f2b245d7c51.gif' title='\phi_a \mapsto \phi_a((1-t)^{-1}) = (1-at)^{-a}' alt='\phi_a \mapsto \phi_a((1-t)^{-1}) = (1-at)^{-a}' align=absmiddle>. </p>

<p>All of this looks pretty harmless, but the upshot is that we have now equipped the image of this E-module morphism, say  <img src='/latexrender/pictures/ff4e875ef264c22b6af19ad3a14bea50.gif' title='L_n(A)' alt='L_n(A)' align=absmiddle> (which is the additive subgroup of <img src='/latexrender/pictures/8ee5dd94702dfd79a7760dbe09817e6c.gif' title='~(\Lambda_n(A),\boxplus)' alt='~(\Lambda_n(A),\boxplus)' align=absmiddle> generated by the elements <img src='/latexrender/pictures/2cd509aaad7e730a43e77ff7f209ea22.gif' title='~(1-at)^{-1}' alt='~(1-at)^{-1}' align=absmiddle>) with a commutative multiplication <img src='/latexrender/pictures/e8803d7fd32bf994a6443ad3219d7443.gif' title='\boxtimes' alt='\boxtimes' align=absmiddle> induced by the rule <img src='/latexrender/pictures/4aadebc89177466d05df2964bc0e0320.gif' title='~(1-at)^{-1} \boxtimes (1-bt)^{-1} = (1-abt)^{-1}' alt='~(1-at)^{-1} \boxtimes (1-bt)^{-1} = (1-abt)^{-1}' align=absmiddle>.</p>

<p>Explicitly, <img src='/latexrender/pictures/ff4e875ef264c22b6af19ad3a14bea50.gif' title='L_n(A)' alt='L_n(A)' align=absmiddle> is the set of one-truncated polynomials <img src='/latexrender/pictures/a0d664fdd9965ace52f10dd8d03aea2d.gif' title='u(t)' alt='u(t)' align=absmiddle> with coefficients in <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> such that one can find elements <img src='/latexrender/pictures/d5fc0f59dcd3f29a550a3a27025aac38.gif' title='a_1,\hdots,a_k \in A' alt='a_1,\hdots,a_k \in A' align=absmiddle> such that <img src='/latexrender/pictures/bcd626534927c5c60c9acedee7dc6930.gif' title='u(t) \equiv (1-a_1t)^{-1} \times \hdots \times (1-a_k)^{-1}~mod~t^{n+1}' alt='u(t) \equiv (1-a_1t)^{-1} \times \hdots \times (1-a_k)^{-1}~mod~t^{n+1}' align=absmiddle>. We multiply <img src='/latexrender/pictures/a0d664fdd9965ace52f10dd8d03aea2d.gif' title='u(t)' alt='u(t)' align=absmiddle> with another such truncated one-polynomial <img src='/latexrender/pictures/273a383345e167ee1791232c40eaf917.gif' title='v(t)' alt='v(t)' align=absmiddle> (taking elements <img src='/latexrender/pictures/8c2654b11d2244b61f06776f651bcd36.gif' title='b_1,b_2,\hdots,b_l \in A' alt='b_1,b_2,\hdots,b_l \in A' align=absmiddle>) via</p>

<p><img src='/latexrender/pictures/17e401b62b533c5f7098f9c48d0fe1d4.gif' title='u(t) \boxtimes v(t) = ((1-a_1t)^{-1} \boxplus \hdots \boxplus (1-a_k)^{-1}) \boxtimes ((1-b_1t)^{-1} \boxplus \hdots \boxplus (1-b_l)^{-1})' alt='u(t) \boxtimes v(t) = ((1-a_1t)^{-1} \boxplus \hdots \boxplus (1-a_k)^{-1}) \boxtimes ((1-b_1t)^{-1} \boxplus \hdots \boxplus (1-b_l)^{-1})' align=absmiddle></p>

<p>and using distributivity and the multiplication rule this gives the element <img src='/latexrender/pictures/3e557dbe5ecf8e453de3d8a3c866f82c.gif' title='\prod_{i,j} (1-a_ib_jt)^{-1}~mod~t^{n+1} \in L_n(A)' alt='\prod_{i,j} (1-a_ib_jt)^{-1}~mod~t^{n+1} \in L_n(A)' align=absmiddle>.
Being a ring-qutient of <img src='/latexrender/pictures/3a3ea00cfc35332cedf6e5e9a32e94da.gif' title='E' alt='E' align=absmiddle> we have that <img src='/latexrender/pictures/693aeadb4ad55baf5a37510ea94350fa.gif' title='~(L_n(A),\boxplus,\boxtimes)' alt='~(L_n(A),\boxplus,\boxtimes)' align=absmiddle> is a commutative ring, and, from the construction it is clear that  <img src='/latexrender/pictures/8d751f9b8b67ade962e0501cc251255e.gif' title='L_n' alt='L_n' align=absmiddle> behaves functorially.</p>

<p>For rings <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> such that <img src='/latexrender/pictures/5bf11dccd6e7a8910289c12b9df46e5b.gif' title='L_n(A)=\Lambda_n(A)' alt='L_n(A)=\Lambda_n(A)' align=absmiddle> we are done, but in general <img src='/latexrender/pictures/ff4e875ef264c22b6af19ad3a14bea50.gif' title='L_n(A)' alt='L_n(A)' align=absmiddle> may be strictly smaller. The idea is to use functoriality and do the relevant calculations in a larger ring <img src='/latexrender/pictures/0829539f10804a325eaceff2c3c43ac1.gif' title='A \subset B' alt='A \subset B' align=absmiddle> where we can multiply the two truncated one-polynomials and observe that the resulting truncated polynomial still has all its coefficients in <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle>.</p>

<p>Here&#8217;s how we would do this over <img src='/latexrender/pictures/1458a437b3c6456f9ebf61d46c9ed13e.gif' title='\Z' alt='\Z' align=absmiddle> : take two irreducible one-polynomials u(t) and v(t) of degrees r resp. s smaller or equal to n. Then over the complex numbers we have
<img src='/latexrender/pictures/c0dfa6730814c6e74e17871eecba57a6.gif' title='u(t)=(1-\alpha_1t) \hdots (1-\alpha_rt)' alt='u(t)=(1-\alpha_1t) \hdots (1-\alpha_rt)' align=absmiddle> and <img src='/latexrender/pictures/83c3f8b04501d47b72edcec018115c9d.gif' title='v(t)=(1-\beta_1) \hdots (1-\beta_st)' alt='v(t)=(1-\beta_1) \hdots (1-\beta_st)' align=absmiddle>. Then, over the field <img src='/latexrender/pictures/9c673a7f1eb6b8687c22dfb9bf94b477.gif' title='K=\mathbb{Q}(\alpha_1,\hdots,\alpha_r,\beta_1,\hdots,\beta_s)' alt='K=\mathbb{Q}(\alpha_1,\hdots,\alpha_r,\beta_1,\hdots,\beta_s)' align=absmiddle> we have that <img src='/latexrender/pictures/c33be29b02c0742dc730dcf1948112bd.gif' title='u(t),v(t) \in L_n(K)' alt='u(t),v(t) \in L_n(K)' align=absmiddle> and hence we can compute their product <img src='/latexrender/pictures/692a60d36fcb36b7060d6367230c6830.gif' title='u(t) \boxtimes v(t)' alt='u(t) \boxtimes v(t)' align=absmiddle> as before to be <img src='/latexrender/pictures/46412a7d4b32d3d8e82b35ef9cba38a3.gif' title='\prod_{i,j}(1-\alpha_i\beta_jt)^{-1}~mod~t^{n+1}' alt='\prod_{i,j}(1-\alpha_i\beta_jt)^{-1}~mod~t^{n+1}' align=absmiddle>. But then, all coefficients of this truncated K-polynomial are invariant under all permutations of the roots <img src='/latexrender/pictures/cd0f1069db14b3485b705eb04d3e58a4.gif' title='\alpha_i' alt='\alpha_i' align=absmiddle> and the roots <img src='/latexrender/pictures/35e985d710477a356d19570d41e41111.gif' title='\beta_j' alt='\beta_j' align=absmiddle> and so is invariant under all elements of the Galois group. But then, these coefficients are algebraic numbers in <img src='/latexrender/pictures/5eac308e29708e918ed13a88a4249b74.gif' title='\mathbb{Q}' alt='\mathbb{Q}' align=absmiddle> whence integers. That is, <img src='/latexrender/pictures/b3d6a8f5f485ccda6d5d67f5850dda75.gif' title='u(t) \boxtimes v(t) \in \Lambda_n(\Z)' alt='u(t) \boxtimes v(t) \in \Lambda_n(\Z)' align=absmiddle>. It should already be clear from this that the rings <img src='/latexrender/pictures/56fd98e54f734fc88bc4ef742d200897.gif' title='\Lambda_n(\Z)' alt='\Lambda_n(\Z)' align=absmiddle> contain a lot of arithmetic information!</p>

<p>For a general commutative ring <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> we will copy this argument by considering a free overring <img src='/latexrender/pictures/0b5c7c91b9c81338b91cea9029ae76c9.gif' title='A^{(\infty)}' alt='A^{(\infty)}' align=absmiddle> (with 1 as one of the base elements) by formally adjoining roots. At level 1, consider <img src='/latexrender/pictures/c799681b2a0fb7c2094ebe82855ed99c.gif' title='M_0' alt='M_0' align=absmiddle> to be the set of all non-constant one-polynomials over <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> and consider the ring</p>

<p><img src='/latexrender/pictures/c6e929599a48704975bfa805ec79901d.gif' title='A^{(1)} = \bigotimes_{f \in M_0} A[X]/(f) = A[X_f, f \in M_0]/(f(X_f) , f \in M_0)' alt='A^{(1)} = \bigotimes_{f \in M_0} A[X]/(f) = A[X_f, f \in M_0]/(f(X_f) , f \in M_0)' align=absmiddle></p>

<p>The idea being that every one-polynomial <img src='/latexrender/pictures/138514e50f3fc8ab80073ef1a189b2b2.gif' title='f \in M_0' alt='f \in M_0' align=absmiddle> now has one root, namely <img src='/latexrender/pictures/b3ef41e570ab5c909e527a85b1dff013.gif' title='\alpha_f = \overline{X_f}' alt='\alpha_f = \overline{X_f}' align=absmiddle> in <img src='/latexrender/pictures/889935cdb8b669969c9aa8cd7edc2cc1.gif' title='A^{(1)}' alt='A^{(1)}' align=absmiddle>. Further, <img src='/latexrender/pictures/889935cdb8b669969c9aa8cd7edc2cc1.gif' title='A^{(1)}' alt='A^{(1)}' align=absmiddle> is a free A-module with basis elements all <img src='/latexrender/pictures/55cda5fe98141c470ff8b478c546dac0.gif' title='\alpha_f^i' alt='\alpha_f^i' align=absmiddle> with <img src='/latexrender/pictures/1a5459c2edc8f1e1bc5a85577a907e39.gif' title='0 \leq i &amp;lt; deg(f)' alt='0 \leq i &amp;lt; deg(f)' align=absmiddle>.</p>

<p>Good! We now have at least one root, but we can continue this process. At level 2, <img src='/latexrender/pictures/0a04315fff14859d66e75bebbaaa6990.gif' title='M_1' alt='M_1' align=absmiddle> will be the set of all non-constant one-polynomials over <img src='/latexrender/pictures/889935cdb8b669969c9aa8cd7edc2cc1.gif' title='A^{(1)}' alt='A^{(1)}' align=absmiddle> and we use them to construct the free overring <img src='/latexrender/pictures/37b291068a3bd7214c432f546c71dd3f.gif' title='A^{(2)}' alt='A^{(2)}' align=absmiddle> (which now has the property that every <img src='/latexrender/pictures/138514e50f3fc8ab80073ef1a189b2b2.gif' title='f \in M_0' alt='f \in M_0' align=absmiddle> has at least two roots in <img src='/latexrender/pictures/37b291068a3bd7214c432f546c71dd3f.gif' title='A^{(2)}' alt='A^{(2)}' align=absmiddle>). And, again, we repeat this process and obtain in succession the rings <img src='/latexrender/pictures/5ea733eca81633dc37274e8ce2c897e1.gif' title='A^{(3)},A^{(4)},\hdots' alt='A^{(3)},A^{(4)},\hdots' align=absmiddle>. Finally, we define <img src='/latexrender/pictures/6eca1aabc691d867aa02e76a6a65e002.gif' title='A^{(\infty)} = \underset{\rightarrow}{lim}~A^{(i)}' alt='A^{(\infty)} = \underset{\rightarrow}{lim}~A^{(i)}' align=absmiddle> having the property that every one-polynomial over A splits entirely in linear factors over <img src='/latexrender/pictures/0b5c7c91b9c81338b91cea9029ae76c9.gif' title='A^{(\infty)}' alt='A^{(\infty)}' align=absmiddle>.</p>

<p>But then, for all <img src='/latexrender/pictures/8f368d95df3d93e659e1e573491181ab.gif' title='u(t),v(t) \in \Lambda_n(A)' alt='u(t),v(t) \in \Lambda_n(A)' align=absmiddle> we can compute <img src='/latexrender/pictures/ffaf73c3bf0f3392fc0e3a3452912d24.gif' title='u(t) \boxtimes v(t) \in \Lambda_n(A^{(\infty)})' alt='u(t) \boxtimes v(t) \in \Lambda_n(A^{(\infty)})' align=absmiddle>. Remains to show that the resulting truncated one-polynomial has all its entries in A. The ring <img src='/latexrender/pictures/9b97b03766173f8d6bce1fb4bac6fdba.gif' title='A^{(\infty)} \otimes_A A^{(\infty)}' alt='A^{(\infty)} \otimes_A A^{(\infty)}' align=absmiddle> contains two copies of <img src='/latexrender/pictures/0b5c7c91b9c81338b91cea9029ae76c9.gif' title='A^{(\infty)}' alt='A^{(\infty)}' align=absmiddle> namely <img src='/latexrender/pictures/a758b05790c12ac4f22b4978f14dca2f.gif' title='A^{(\infty)} \otimes 1' alt='A^{(\infty)} \otimes 1' align=absmiddle> and <img src='/latexrender/pictures/2bdb3ae5c95e4057b477558c1b62760e.gif' title='1 \otimes A^{(\infty)}' alt='1 \otimes A^{(\infty)}' align=absmiddle> and the intersection of these two rings in exactly <img src='/latexrender/pictures/7fc56270e7a70fa81a5935b72eacbe29.gif' title='A' alt='A' align=absmiddle> (here we use the freeness property and the additional fact that 1 is one of the base elements). But then, by functoriality of <img src='/latexrender/pictures/8d751f9b8b67ade962e0501cc251255e.gif' title='L_n' alt='L_n' align=absmiddle>, the element
<img src='/latexrender/pictures/a94d735233fc0c3f8aa8e35a1bfac60a.gif' title='u(t) \boxtimes v(t) \in L_n(A^{(\infty)} \otimes_A A^{(\infty)})' alt='u(t) \boxtimes v(t) \in L_n(A^{(\infty)} \otimes_A A^{(\infty)})' align=absmiddle> lies in the intersection <img src='/latexrender/pictures/4ebfc1810420847d2a490ac84c4bc648.gif' title='\Lambda_n(A^{(\infty)} \otimes 1) \cap \Lambda_n(1 \otimes A^{(\infty)})=\Lambda_n(A)' alt='\Lambda_n(A^{(\infty)} \otimes 1) \cap \Lambda_n(1 \otimes A^{(\infty)})=\Lambda_n(A)' align=absmiddle>. Done!</p>

<p>Hence, we have endo-functors <img src='/latexrender/pictures/bd1ded190ddbc745e60263d037c4cf98.gif' title='\Lambda_n' alt='\Lambda_n' align=absmiddle> in the category of all commutative rings, for every number n. Reviewing the construction of <img src='/latexrender/pictures/8d751f9b8b67ade962e0501cc251255e.gif' title='L_n' alt='L_n' align=absmiddle> one observes that there are natural transformations <img src='/latexrender/pictures/367ed3583dd5236b2e76541f42e891cb.gif' title='L_{n+1} \rightarrow L_n' alt='L_{n+1} \rightarrow L_n' align=absmiddle> and therefore also natural transformations <img src='/latexrender/pictures/b0c048fd48e1b09193fe151e721e41ae.gif' title='\Lambda_{n+1} \rightarrow \Lambda_n' alt='\Lambda_{n+1} \rightarrow \Lambda_n' align=absmiddle>. Taking the inverse limits <img src='/latexrender/pictures/f0e16ede877786fd7412823d2c38b56a.gif' title='\Lambda(A) = \underset{\leftarrow}{lim} \Lambda_n(A)' alt='\Lambda(A) = \underset{\leftarrow}{lim} \Lambda_n(A)' align=absmiddle> we therefore have the &#8216;one-power series&#8217; endo-functor
<img src='/latexrender/pictures/760fbf9e213a772863868c3be5869655.gif' title='\Lambda~:~\wis{comm} \rightarrow \wis{comm}' alt='\Lambda~:~\wis{comm} \rightarrow \wis{comm}' align=absmiddle>
which is &#8216;almost&#8217; the functor W of big Witt vectors. Next time we&#8217;ll take you through the identification using &#8216;ghost variables&#8217; and how the functor <img src='/latexrender/pictures/781ff4289c6cc5fc2973b7a57791e0e2.gif' title='\Lambda' alt='\Lambda' align=absmiddle> can be used to define the category of <img src='/latexrender/pictures/c6a6eb61fd9c6c913da73b3642ca147d.gif' title='\lambda' alt='\lambda' align=absmiddle>-rings.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/big-witt-vectors-for-everyone-12.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>The odd knights of the round table</title>
		<link>http://www.neverendingbooks.org/index.php/the-odd-knights-of-the-round-table.html</link>
		<comments>http://www.neverendingbooks.org/index.php/the-odd-knights-of-the-round-table.html#comments</comments>
		<pubDate>Thu, 28 Jan 2010 20:48:59 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[games]]></category>
		<category><![CDATA[geometry]]></category>
		<category><![CDATA[groups]]></category>
		<category><![CDATA[numbers]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2768</guid>
		<description><![CDATA[Here&#8217;s a tiny problem illustrating our limited knowledge of finite fields : &#8220;Imagine an infinite queue of Knights , waiting to be seated at the unit-circular table. The master of ceremony (that is, you) must give Knights  and  a place at an odd root of unity, say  and , such that the [...]]]></description>
			<content:encoded><![CDATA[<p>Here&#8217;s a tiny problem illustrating our limited knowledge of finite fields : &#8220;Imagine an infinite queue of Knights <img src='/latexrender/pictures/37e20eea5a153f40e0cf71aeb6d95910.gif' title='\{ K_1,K_2,K_3,\hdots \}' alt='\{ K_1,K_2,K_3,\hdots \}' align=absmiddle>, waiting to be seated at the unit-circular table. The master of ceremony (that is, you) must give Knights <img src='/latexrender/pictures/d20ba9d73a17e6cab8c07c651787f6d5.gif' title='K_a' alt='K_a' align=absmiddle> and <img src='/latexrender/pictures/82babf9266d8cb6d7f42fffe47f40df2.gif' title='K_b' alt='K_b' align=absmiddle> a place at an odd root of unity, say <img src='/latexrender/pictures/3281249d97086ed1f496c7d7380609e6.gif' title='\omega_a' alt='\omega_a' align=absmiddle> and <img src='/latexrender/pictures/50b3d5c02e19a2234493aea021f01455.gif' title='\omega_b' alt='\omega_b' align=absmiddle>, such that the seat at the odd root of unity <img src='/latexrender/pictures/e07b2cd0565744e98bff7368c178fda0.gif' title='\omega_a \times \omega_b' alt='\omega_a \times \omega_b' align=absmiddle> must be given to the Knight <img src='/latexrender/pictures/a8eb79de21e58a25494467caceb743da.gif' title='K_{a \otimes b}' alt='K_{a \otimes b}' align=absmiddle>, where <img src='/latexrender/pictures/6652aa6f2c8dc4af25c0e961a8cd7b08.gif' title='a \otimes b' alt='a \otimes b' align=absmiddle> is the Nim-multiplication of <img src='/latexrender/pictures/0cc175b9c0f1b6a831c399e269772661.gif' title='a' alt='a' align=absmiddle> and <img src='/latexrender/pictures/92eb5ffee6ae2fec3ad71c777531578f.gif' title='b' alt='b' align=absmiddle>. Which place would you offer to Knight <img src='/latexrender/pictures/59880cf1903f785178279f184df474f8.gif' title='K_{16}' alt='K_{16}' align=absmiddle>, or Knight <img src='/latexrender/pictures/5b79c36811cce62be6a67c41558f6fb9.gif' title='K_n' alt='K_n' align=absmiddle>,  or, if you&#8217;re into ordinals, Knight <img src='/latexrender/pictures/cde2d469104cc702631cc407def65a9d.gif' title='K_{\omega}' alt='K_{\omega}' align=absmiddle>?&#8221;</p>

<p>What does this have to do with finite fields? Well, consider the simplest of all finite field <img src='/latexrender/pictures/efbfa47668d1174196e6d000fac9bef2.gif' title='\mathbb{F}_2 = \{ 0,1 \}' alt='\mathbb{F}_2 = \{ 0,1 \}' align=absmiddle> and consider its algebraic closure <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle>. Last year, we&#8217;ve run a <a href="http://www.neverendingbooks.org/index.php/on2-transfinite-number-hacking.html">series starting here</a>, identifying the field <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle>, following John H. Conway in <a href="http://en.wikipedia.org/wiki/On_Numbers_and_Games">ONAG</a>, with the set of all ordinals smaller than <img src='/latexrender/pictures/b1a3c6cb6b78dd510f42f2e3e0f16df3.gif' title='\omega^{\omega^{\omega}}' alt='\omega^{\omega^{\omega}}' align=absmiddle>, given the Nim addition and multiplication. I know that ordinal numbers may be intimidating at first, so let&#8217;s just restrict to ordinary natural numbers for now. The Nim-addition of two numbers <img src='/latexrender/pictures/744d1e96604bbfb8948263dad72c4f1e.gif' title='n \oplus m' alt='n \oplus m' align=absmiddle> can be calculated by writing the numbers n and m in binary form and add them without carrying. For example, <img src='/latexrender/pictures/44624957ff4c7281e4baa7d2ad6db675.gif' title='9 \oplus 1 = 1001+1 = 1000 = 8' alt='9 \oplus 1 = 1001+1 = 1000 = 8' align=absmiddle>. Nim-multiplication is slightly more complicated and is best expressed using the so-called Fermat-powers <img src='/latexrender/pictures/b722cdfa4abd88efcfed690bf53d1393.gif' title='F_n = 2^{2^n}' alt='F_n = 2^{2^n}' align=absmiddle>. We then demand that <img src='/latexrender/pictures/cf635531444ec8d32977ab27dde50922.gif' title='F_n \otimes m = F_n \times m' alt='F_n \otimes m = F_n \times m' align=absmiddle> whenever <img src='/latexrender/pictures/288e8f70ae42d0ac7bd8c7409a2f3ae1.gif' title='m &amp;lt; F_n' alt='m &amp;lt; F_n' align=absmiddle> and <img src='/latexrender/pictures/1a12b5b99e21a0f872a22b914f3d775f.gif' title='F_n \otimes F_n = \frac{3}{2}F_n' alt='F_n \otimes F_n = \frac{3}{2}F_n' align=absmiddle>. Distributivity wrt. <img src='/latexrender/pictures/61a41642d26f221806dcbccfcebc2ef8.gif' title='\oplus' alt='\oplus' align=absmiddle> can then be used to calculate arbitrary Nim-products. For example, <img src='/latexrender/pictures/1f749319fafd0d7da2b09d7de96880a3.gif' title='8 \otimes 3 = (4 \otimes 2) \otimes (2 \oplus 1) = (4 \otimes 3) \oplus (4 \otimes 2) = 12 \oplus 8 = 4' alt='8 \otimes 3 = (4 \otimes 2) \otimes (2 \oplus 1) = (4 \otimes 3) \oplus (4 \otimes 2) = 12 \oplus 8 = 4' align=absmiddle>. Conway&#8217;s remarkable result asserts that the ordinal numbers, equipped with Nim addition and multiplication, form an algebraically closed field of characteristic two. The closure <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> is identified with the subfield of all ordinals smaller than <img src='/latexrender/pictures/b1a3c6cb6b78dd510f42f2e3e0f16df3.gif' title='\omega^{\omega^{\omega}}' alt='\omega^{\omega^{\omega}}' align=absmiddle>. For those of you who don&#8217;t feel like going transfinite, the subfield <img src='/latexrender/pictures/194a80fe87884a2ff332950d1fdc6191.gif' title='~(\mathbb{N},\oplus,\otimes)' alt='~(\mathbb{N},\oplus,\otimes)' align=absmiddle> is identified with the quadratic closure of <img src='/latexrender/pictures/edbfcbf5afc6604e39e08579f9834b3d.gif' title='\mathbb{F}_2' alt='\mathbb{F}_2' align=absmiddle>.</p>

<p>The connection between <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> and the odd roots of unity has been advocated by Alain Connes in his talk before a general public at the IHES : “L’ange de la géométrie, le diable de l’algèbre et le corps à un élément” (the angel of geometry, the devil of algebra and the field with one element). He describes its content briefly in this YouTube-video</p>

<p><object width="340" height="209"><param name="movie" value="http://www.youtube.com/v/obEi7BkR3V0&#038;hl=en&#038;fs=1"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube.com/v/obEi7BkR3V0&#038;hl=en&#038;fs=1" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="340" height="209"></embed></object></p>

<p>At first it was unclear to me which &#8216;coupling-problem&#8217; Alain meant, but this has been clarified in his paper together with Caterina Consani <a href="http://arxiv.org/abs/0911.3537">Characteristic one, entropy and the absolute point</a>. The non-zero elements of <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> can be identified with the set of all odd roots of unity. For, if x is such a unit, it belongs to a finite subfield of the form <img src='/latexrender/pictures/30673a0256343a1bd5eb70948dd8c03f.gif' title='\mathbb{F}_{2^n}' alt='\mathbb{F}_{2^n}' align=absmiddle> for some n, and, as the group of units of any finite field is cyclic, x is an element of order <img src='/latexrender/pictures/1bec70272b277c5ff89721f208b44032.gif' title='2^n-1' alt='2^n-1' align=absmiddle>. Hence, <img src='/latexrender/pictures/97747feb4d47aab8b51f9e240b4a9ef8.gif' title='\mathbb{F}_{2^n}- \{ 0 \}' alt='\mathbb{F}_{2^n}- \{ 0 \}' align=absmiddle> can be identified with the set of <img src='/latexrender/pictures/1bec70272b277c5ff89721f208b44032.gif' title='2^n-1' alt='2^n-1' align=absmiddle>-roots of unity, with <img src='/latexrender/pictures/b34d6f5da87bd564a825160d562979ec.gif' title='e^{2 \pi i/n}' alt='e^{2 \pi i/n}' align=absmiddle> corresponding to a generator of the unit-group. So, all elements of <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> correspond to an odd root of unity. The observation that we get indeed all odd roots of unity may take you a couple of seconds<sup>1</sup>.</p>

<p>Assuming we succeed in fixing a one-to-one correspondence between the non-zero elements of <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> and the odd roots of unity <img src='/latexrender/pictures/7eacc646a2198f66d7496131829752ff.gif' title='\mu_{odd}' alt='\mu_{odd}' align=absmiddle> respecting multiplication, how can we recover the addition on <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle>? Well, here&#8217;s Alain&#8217;s coupling function, he ties up an element x of the algebraic closure to the element s(x)=x+1 (and as we are in characteristic two, this is an involution, so also the element tied up to x+1 is s(x+1)=(x+1)+1=x. The clue being that multiplication together with the coupling map s allows us to compute any sum of two elements as <img src='/latexrender/pictures/88824ab524b7220c44c6348fbce6ec67.gif' title='x+y=x \times s(\frac{y}{x}) = x \times (\frac{y}{x}+1)' alt='x+y=x \times s(\frac{y}{x}) = x \times (\frac{y}{x}+1)' align=absmiddle>. 
For example, all information about the finite field <img src='/latexrender/pictures/69ac29a949ca94ef48dd044a8c89d4c1.gif' title='\mathbb{F}_{2^4}' alt='\mathbb{F}_{2^4}' align=absmiddle> is encoded in this identification with the 15-th roots of unity, together with the pairing s depicted as</p>

<p>
<img src="http://matrix.cmi.ua.ac.be/DATA2/16field1.jpg" style="float:center;">
</p>

<p>Okay, we now have two identifications of the algebraic closure <img src='/latexrender/pictures/97221c67dc69b591a40edf3a1e4939bd.gif' title='\overline{\mathbb{F}_2}' alt='\overline{\mathbb{F}_2}' align=absmiddle> : the smaller ordinals equipped with Nim addition and Nim multiplication and the odd roots of unity with complex-multiplication and the Connes-coupling s. The question we started from asks for a general recipe to identify these two approaches. </p>

<p>To those of you who are convinced that finite fields (LOL, even characteristic two!) are objects far too trivial to bother thinking about : as far as I know, NOBODY knows how to do this explicitly, even restricting the ordinals to merely the natural numbers! </p>

<p>Please feel challenged! To get you started, I&#8217;ll show you how to place the first 15 Knights and give you a  procedure (though far from explicit) to continue. Here&#8217;s the Nim-picture compatible with that above </p>

<p>
<img src="http://matrix.cmi.ua.ac.be/DATA2/16field2.jpg" style="float:center;">
</p>

<p>To verify this, and to illustrate the general strategy, I&#8217;d better hand you the Nim-tables of the first 16 numbers. Here they are</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/nimaddition.jpg" style="float:center;"> </p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/nimmultiplication.jpg" style="float:center;"> </p>

<p>It is known that the finite subfields of <img src='/latexrender/pictures/194a80fe87884a2ff332950d1fdc6191.gif' title='~(\mathbb{N},\oplus,\otimes)' alt='~(\mathbb{N},\oplus,\otimes)' align=absmiddle> are precisely the sets of numbers smaller than the Fermat-powers <img src='/latexrender/pictures/f67871cd00ac973d0e2b80db93f3bcd3.gif' title='F_n' alt='F_n' align=absmiddle>. So, the first one is all numbers smaller than <img src='/latexrender/pictures/f97a09b8b498b0ab7f7b4f1e0ab2813b.gif' title='F_1=4' alt='F_1=4' align=absmiddle> (check!). The smallest generator of the multiplicative group (of order 3) is 2, so we take this to correspond to the unit-root <img src='/latexrender/pictures/ac6aacc40f33bdc02c84d9f87275121e.gif' title='e^{2 \pi i/3}' alt='e^{2 \pi i/3}' align=absmiddle>. The next subfield are all numbers smaller than <img src='/latexrender/pictures/7cb88c58a8c572ec4737c600e88abca0.gif' title='F_2 = 16' alt='F_2 = 16' align=absmiddle> and its multiplicative group has order 15. Now, choose the smallest integer k which generates this group, compatible with the condition that <img src='/latexrender/pictures/dda244499649ab90a74c3e1e7120b87d.gif' title='k^{\otimes 5}=2' alt='k^{\otimes 5}=2' align=absmiddle>. Verify that this number is 4 and that this forces the identification and coupling given above. </p>

<p>The next finite subfield would consist of all natural numbers smaller than <img src='/latexrender/pictures/8f5c007c6539f47ff775ed4a1cbe9b42.gif' title='F_3=256' alt='F_3=256' align=absmiddle>. Hence, in this field we are looking for the smallest number k generating the multiplicative group of order 255 satisfying the extra condition that <img src='/latexrender/pictures/9ce52764ce1afaac7ccb6c04b7ddcd0e.gif' title='k^{\otimes 17}=4' alt='k^{\otimes 17}=4' align=absmiddle> which would fix an identification at that level. Then, the next level would be all numbers smaller than <img src='/latexrender/pictures/efb526be0154c6c8061dbaaf00873606.gif' title='F_4=65536' alt='F_4=65536' align=absmiddle> and again we would like to find the smallest number generating the multiplicative group and such that the appropriate power is equal to the aforementioned k, etc. etc.</p>

<p>Can you give explicit (even inductive) formulae to achieve this? I guess even the problem of placing Knight 16 will give you a couple of hours to think about&#8230; (to be continued).</p>
<ol class="footnotes"><li id="footnote_0_2768" class="footnote"> If m is odd, then (2,m)=1 and so 2 is a unit in the finite cyclic group <img src='/latexrender/pictures/242eb5a4e46d4eade45c5f5996ccb87a.gif' title='~(\mathbb{Z}/m\mathbb{Z})^*' alt='~(\mathbb{Z}/m\mathbb{Z})^*' align=absmiddle> whence <img src='/latexrender/pictures/bbfc5668ad84e58a0ae4559ca8aa086e.gif' title='2^n = 1 (mod~m)' alt='2^n = 1 (mod~m)' align=absmiddle>, so the m-roots of unity lie within those of order <img src='/latexrender/pictures/1bec70272b277c5ff89721f208b44032.gif' title='2^n-1' alt='2^n-1' align=absmiddle> </li></ol>]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/the-odd-knights-of-the-round-table.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Olivier Messiaen &amp; Mathieu 12</title>
		<link>http://www.neverendingbooks.org/index.php/olivier-messiaen-mathieu-12.html</link>
		<comments>http://www.neverendingbooks.org/index.php/olivier-messiaen-mathieu-12.html#comments</comments>
		<pubDate>Thu, 31 Dec 2009 10:27:55 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[Bourbaki]]></category>
		<category><![CDATA[general]]></category>
		<category><![CDATA[groups]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2691</guid>
		<description><![CDATA[To mark the end of 2009 and 6 years of blogging, two musical compositions with a mathematical touch to them. I wish you all a better 2010!

Remember from last time that we identified Olivier Messiaen as the &#8216;Monsieur Modulo&#8217; playing the musical organ at the Bourbaki wedding. This was based on the fact that his [...]]]></description>
			<content:encoded><![CDATA[<p>To mark the end of 2009 and <a href="http://www.neverendingbooks.org/index.php/a-blogging-2004.html">6 years</a> of blogging, two musical compositions with a mathematical touch to them. I wish you all a better 2010!</p>

<p>Remember from <a href="http://www.neverendingbooks.org/index.php/seriously-now-where-was-the-bourbaki-wedding.html">last time</a> that we identified <a href="http://en.wikipedia.org/wiki/Olivier_Messiaen">Olivier Messiaen</a> as the &#8216;Monsieur Modulo&#8217; playing the musical organ at the <a href="http://www.neverendingbooks.org/index.php/when-was-the-bourbaki-wedding.html">Bourbaki wedding</a>. This was based on the fact that his “modes à transposition limitée” are really about epimorphisms between modulo rings Z/12Z→Z/3Z and Z/12Z→Z/4Z.</p>

<p>However, Messiaen had more serious mathematical tricks up his sleeve. In two of his compositions he did discover (or at least used) one of the smaller <a href="http://en.wikipedia.org/wiki/Sporadic_group">sporadic groups</a>, the Mathieu group <img src='/latexrender/pictures/878c3a834b9495c23c9b7173ee07b7bd.gif' title='M_{12}' alt='M_{12}' align=absmiddle> of order 95040 on which we have based a whole series of <a href="http://www.neverendingbooks.org/index.php/conways-puzzle-m13.html">Mathieu games</a> two and a half years ago.</p>

<p>Messiaen&#8217;s &#8216;Ile de fey 2&#8242; composition for piano (part of Quatre études de rythme (&#8220;Four studies in rhythm&#8221;), piano (1949–50)) is based on two concurrent permutations. The first is shown below, with the underlying motive rotational permutation shown.</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/messiM12a.jpg">
</center></p>

<p>This gives the permutation (1,7,10,2,6,4,5,9,11,12)(3,8). A second concurrent permutation is based on the permutation (1,6,9,2,7,3,5,4,8,10,11) and both of them generate the Mathieu group <img src='/latexrender/pictures/878c3a834b9495c23c9b7173ee07b7bd.gif' title='M_{12}' alt='M_{12}' align=absmiddle>. This can be seen by realizing the two permutations as the rotational permutations</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/messiM12b.jpg">
</center></p>

<p>and identifying them with the <a href="http://en.wikipedia.org/wiki/Shuffling#Mongean_shuffle">Mongean shuffles</a>  generating <img src='/latexrender/pictures/878c3a834b9495c23c9b7173ee07b7bd.gif' title='M_{12}' alt='M_{12}' align=absmiddle>. See for example, Dave Benson&#8217;s book &#8220;Music: A Mathematical Offering&#8221;, freely available <a href="http://www.maths.abdn.ac.uk/~bensondj/html/music.pdf">online</a>.</p>

<p>Clearly, Messiaen doesn&#8217;t use all of its 95040 permutations in his piece! Here&#8217;s how it sounds. The piece starts 2 minutes into the clip.</p>

<p><center><object width="375" height="304"><param name="movie" value="http://www.youtube.com/v/6UrpeXcrG2c&#038;hl=en_US&#038;fs=1&#038;"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube.com/v/6UrpeXcrG2c&#038;hl=en_US&#038;fs=1&#038;" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="375" height="304"></embed></object></center></p>

<p>The second piece is &#8220;Les Yeux dans les Roues&#8221; (The Eyes in the Wheels), sixth piece from the &#8220;Livre d&#8217;Orgue&#8221; (1950/51).</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/messiM12c.jpg">
</center></p>

<p>According to <a href="http://hauptwerk.blogspot.com/2008/10/olivier-messiaen-les-yeux-dans-les.html">Hauptwerk</a>, the piece consists of a melody/theme in the pedal, accompanied by two fast-paced homorhythmic lines in the manuals. The pedal presents a sons-durées theme which is repeated six times, in different permutations. Initially it is presented in its natural form. Afterwards, it is presented alternatively picking notes from each end of the original form. Similar transformations are applied each time until the sixth, which is the retrograde of the first. The entire twelve-tone analysis (pitch only, not rhythm) of the pedal is shown below:</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/messiM12d.jpg">
</center></p>

<p>That is we get the following five permutations which again generate Mathieu 12 :
<ul>
<li>a=(2,3,5,9,8,10,6,11,4,7,12)</li>
<li>b=(1,2,4,8,9,7,11,3,6,12)(5,10)=e<em>a</li>
<li>c=(1,12,11,9,5,4,6,2,10,7)(3,8)=e</em>d</li>
<li>d=(1,11,10,8,4,5,3,7,2,9,6)</li>
<li>e=(1,12)(2,11)(3,10)(4,9)(5,8)(6,7)</li>
</ul>
Here&#8217;s the piece performed on organ :</p>

<p><object style="display:block; margin:0px auto 10px; text-align:center;" height="304" width="375"><param name="movie" value="http://www.youtube.com/v/rbNKxRims1s&amp;hl=en&amp;fs=1"><param name="allowFullScreen" value="true"><embed src="http://www.youtube.com/v/rbNKxRims1s&amp;hl=en&amp;fs=1" type="application/x-shockwave-flash" allowfullscreen="true" height="304" width="375"></embed></object></p>

<p>Considering the permutations <img src='/latexrender/pictures/530eb0b6cdab8636b3d2c44088374ac8.gif' title='X=d.a^{-1}' alt='X=d.a^{-1}' align=absmiddle> and <img src='/latexrender/pictures/af4fcda29bd838441f8b3b4adcfc4b52.gif' title='Y=(a.d^2.a.d^3)^{-1}' alt='Y=(a.d^2.a.d^3)^{-1}' align=absmiddle> one obtains canonical generators of <img src='/latexrender/pictures/878c3a834b9495c23c9b7173ee07b7bd.gif' title='M_{12}' alt='M_{12}' align=absmiddle>, that is, generators satisfying the defining equations of this sporadic group</p>

<p><img src='/latexrender/pictures/9ba024f6743b35935e7be8ae657f41bb.gif' title='X^2=Y^3=(XY)^{11}=[X,Y]^6=(XYXYXY^{-1})^6=1' alt='X^2=Y^3=(XY)^{11}=[X,Y]^6=(XYXYXY^{-1})^6=1' align=absmiddle></p>

<p>I leave you to work out the corresponding <a href="http://www.neverendingbooks.org/index.php/monsieur-mathieu.html">dessin d&#8217;enfant</a> tonight after a couple of glasses of champagne! It sure has a nice form. Once again, a better 2010!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/olivier-messiaen-mathieu-12.html/feed</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Seriously now, where was the Bourbaki wedding?</title>
		<link>http://www.neverendingbooks.org/index.php/seriously-now-where-was-the-bourbaki-wedding.html</link>
		<comments>http://www.neverendingbooks.org/index.php/seriously-now-where-was-the-bourbaki-wedding.html#comments</comments>
		<pubDate>Wed, 25 Nov 2009 11:15:59 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[Bourbaki]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2569</guid>
		<description><![CDATA[A few days before Halloween, Norbert Dufourcq (who supposedly died on december 17th 1990&#8230;), sent me a comment, filled with useful info, and hinting I did mess up big time in the previous post&#8230;

Norbert Dufourcq, an organist and student of André Marchal, the organist-in-charge at the Saint-Germain-des-Prés church in 1939, the place where I speculated [...]]]></description>
			<content:encoded><![CDATA[<div class='series_toc'><h3>The Bourbaki Code</h3><ol><li><a href='http://www.neverendingbooks.org/index.php/the-wedding-invitation-that-nearly-killed-andre-weil.html' title='The wedding invitation that nearly killed Andre Weil'>The wedding invitation that nearly killed Andre Weil</a></li><li><a href='http://www.neverendingbooks.org/index.php/when-was-the-bourbaki-wedding.html' title='When was the Bourbaki wedding?'>When was the Bourbaki wedding?</a></li><li><a href='http://www.neverendingbooks.org/index.php/where-is-the-royal-poldavian-academy.html' title='Where is the Royal Poldavian Academy?'>Where is the Royal Poldavian Academy?</a></li><li><a href='http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html' title='Where was the Bourbaki wedding?'>Where was the Bourbaki wedding?</a></li><li>Seriously now, where was the Bourbaki wedding?</li></ol></div> <div><p>A few days before Halloween, <a href="http://fr.wikipedia.org/wiki/Norbert_Dufourcq">Norbert Dufourcq</a> (who supposedly died on december 17th 1990&#8230;), sent me a <a href="http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html/comment-page-1#comment-8463">comment</a>, filled with useful info, and hinting I did mess up big time in the <a href="http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html/">previous post</a>&#8230;</p>

<p>Norbert Dufourcq, an organist and student of <a href="http://fr.wikipedia.org/wiki/André_Marchal">André Marchal</a>, the organist-in-charge at the Saint-Germain-des-Prés church in 1939, the place where I <a href="http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html/">speculated</a> the Bourbaki wedding took place, concluded his comment with : </p>

<p><strong>&#8220;P.S. Lieven, you <em>do</em> know about the Schola Cantorum, now, don&#8217;t you?!?&#8221;</strong>.<br />
<br />
 Euh&#8230; actually &#8230; no, I did not &#8230;</p>

<p><img style="float:right; margin-left:10px;" src="http://matrix.cmi.ua.ac.be/DATA2/ScholaCantorum.jpg"><a href="http://en.wikipedia.org/wiki/Schola_Cantorum">La Schola Cantorum</a> is a private music school in Paris. It was founded in 1894 by Charles Bordes, Alexandre Guilmant and Vincent d&#8217;Indy as a counterbalance to the Paris Conservatoire&#8217;s emphasis on opera. Its alumni include many significant figures in 20th century music, such as <a href="http://en.wikipedia.org/wiki/Erik_Satie">Erik Satie</a> and <a href="http://en.wikipedia.org/wiki/Cole_Porter">Cole Porter</a>.</p>

<p><a href="http://www.schola-cantorum.com/">Schola Cantorum</a> is situated 69, rue Saint Jacques, Paris, just around the corner of the <a href="http://www.ens.fr/?lang=fr">Ecole Normal Superieure</a>, home base to the Bourbakis. In fact, closer investigation reveals striking similarities and very close connections between the circle of artists at la Schola and the Bourbaki group.</p>

<p>In december 1934, the exact month the Bourbaki group was formed, a radical reorganisation took place at the Schola, when Nestor Lejeune became the new director. He invited several young musicians, many from the famous Dukas-class, to take up teaching positions at the Schola.</p>

<p>Here&#8217;s a picture of part of the <a href="http://en.wikipedia.org/wiki/File:Classe-dukas.jpg">Dukas class of 1929</a>, several of its members will play a role in the upcoming events : 
from left to right next to the piano : Pierre Maillard-Verger, Elsa Barraine, Yvonne Desportes, Tony Aubin, Pierre Revel, Georges Favre, Paul Dukas, René Duclos, Georges Hugon, Maurice Duruflé. Seated on the right : Claude Arrieu, Olivier Messiaen.</p>

<p><p />
<center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/ClasseDukas.jpg">
</center></p>

<p>The mid-1930s in Paris saw the emergence of two closely-related groups with a membership which overlapped : <a href="http://books.google.com/books?id=UgGBXwpHTe8C&amp;pg=PA142&amp;lpg=PA142&amp;dq=la+spirale+Georges+Migot&amp;source=bl&amp;ots=UgEENf63Am&amp;sig=vU2ac8Lu3Rbtb5zWEDSa7dA9yNY&amp;hl=en&amp;ei=R04ES5qEFs_B-QaLiKXKCg&amp;sa=X&amp;oi=book_result&amp;ct=result&amp;resnum=3&amp;ved=0CBIQ6AEwAg#v=onepage&amp;q=la%20spirale%20Georges%20Migot&amp;f=false">La Spirale</a> and <a href="http://www.britannica.com/EBchecked/topic/303331/La-Jeune-France">La Jeune France</a>. La Spirale was founded in 1935 under the leadership of Georges Migot; its other committee members were Paul Le Flem, his pupil André Jolivet, Edouard Sciortino, Claire Delbos, her husband <a href="http://en.wikipedia.org/wiki/Olivier_Messiaen">Olivier Messiaen</a>, Daniel-Lesur and Jules Le Febvre. The common link between almost all of these musicians was their connection with the Schola Cantorum.</p>

<p><img style="float:left;margin-right:10px;" src="http://matrix.cmi.ua.ac.be/DATA2/JeuneFrance.jpg">On the left : Les Jeunes Musiciens Français : André Jolivet on the Piano. Standing from left to right :
Olivier Messiaen, Yves Baudrier, Daniel-Lesur.</p>

<p>Nigel Simeone wrote <a href="http://www.musicaltimes.co.uk/archive/0203/simeone.html">this</a> about Messiaen and La Jeune France : 
&#8220;The extremely original and independent-minded Messiaen had already shown himself to be a rather unexpected enthusiast for joining groups: in December 1932 he wrote to his friend Claude Arrieu about a letter from another musician, Jacques Porte, outlining plans for a new society to be called Les Jeunes Musiciens Français. 
Messiaen agreed to become its vice-president, but nothing seems to have come of the project. Six months later, in June 1933, he had a frustrating meeting with Roger Désormière on behalf of the composers he described to Arrieu as ‘les quatre’, all of them Dukas pupils: Elsa Barraine, <strong>the recently-deceased Jean Cartan</strong>, Arrieu and Messiaen himself; during the early 1930s Messiaen and Arrieu organised concerts featuring all four composers.&#8221;</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/Cartanfamily.jpg" style="float:right;margin-left:10px;" hspace=10>Finally, we&#8217;re getting a connection with the Bourbaki group! Norbert Dufourcq mentioned it already in his comment &#8220;Messiaen was also a good friend of Jean Cartan (himself a composer, and Henri’s brother)&#8221;. <a href="http://en.wikipedia.org/wiki/Henri_Cartan">Henri Cartan</a> was one of the first Bourbakis and an excellent piano player himself. </p>

<p>The Cartan family picture on the right : standing from left to right, father <a href="http://en.wikipedia.org/wiki/Élie_Cartan">Elie Cartan</a> (one of the few older French mathematicians respected by the Bourbakis), Henri and his mother Marie-Louise. Seated, the younger children, from left to right : Louis, Helene (who later became a mathematician, herself) and the composer Jean Cartan, who sadly died very young from tuberculoses in 1932&#8230; </p>

<p>The december 1934 revolution in French music at the Schola Cantorum, instigated by Messiaen and followers, was the culmination of a process that started a few years before when Jean Cartan was among the circle of revolutionados. Because Messiaen was a fiend of the Cartan family, they surely must have been aware of the events at the Schola (or because it was merely a block away from the ENS), and, the musicians&#8217; revolt may very well have been an example to follow for the first Bourbakis&#8230;(?!)</p>

<p>Anyway, we now know the intended meaning of the line &#8220;with lemmas sung by the Scholia Cartanorum&#8221; on the wedding-invitation. Cartanorum is NOT (as I <a href="http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html">claimed last time</a>) bad Latin for &#8216;Cartesiorum&#8217;, leading to Descartes and the Saint-Germain-des-Pres church, but is in fact passable Latin (plur. gen.) of CARTAN(us), whence the translation &#8220;with lemmas sung by the school of the Cartans&#8221;. There&#8217;s possibly a double pun intended here : first, a reference to (father) <a href="http://www.joensuu.fi/matematiikka/kurssit/complex/luku10.pdf">Cartan&#8217;s lemma</a> and, of course, to La Schola where the musical Cartan-family felt at home.</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/valdeGrace1.jpg" style="float:left;margin-right:10px;" hspace=10> Fine, but does this brings us any closer to the intended place of the Bourbaki-Petard wedding? Well, let&#8217;s reconsider the hidden &#8216;clues&#8217; we discovered last time : the phrase &#8220;They will receive the trivial isomorphism from P. Adic, of the Order of the Diophantines&#8221; might suggest that the church belongs to a a religious order and is perhaps an abbey- or convent-church and the phrase &#8220;the organ will be played by Monsieur Modulo&#8221; requires us to identify this mysterious Mister Modulo, because Norbert Dufourcq rightfully observed : </p>

<p>&#8220;note however that in 1939, it wasn’t as common to have a friend-organist perform at a wedding as it is today: the appointed organists, especially at prestigious Paris positions, were much less likely to accept someone play in their stead.&#8221;</p>

<p>The <a href="http://www.schola-cantorum.com/histoire.php">history</a> of La Schola Cantorum reveals something that might have amused Frank Smithies (<a href="http://www.neverendingbooks.org/index.php/when-was-the-bourbaki-wedding.html">remember</a> he was one of the wedding-invitation-composers) : the Schola is located in the Convent(!) of the Brittish  Benedictines&#8230;</p>

<p>In 1640 some Benedictine monks, on the run after the religious schism in Britain, found safety in Paris under the protection of <a href="http://en.wikipedia.org/wiki/Cardinal_Richelieu">Cardinal Richelieu</a> and <a href="http://en.wikipedia.org/wiki/Anne_of_Austria">Anne of Austria</a> at <a href="http://en.wikipedia.org/wiki/Val-de-Grâce">Val-de-Grace</a>, where the Schola is now housed.</p>

<p>As is the case with most convents, the convent of the Brittish Benedictines did have its own convent church, now called <a href="http://perso.magic.fr/desarbre/pages/page3.html">l&#8217;église royale Notre-Dame du Val-de-Grâce</a> (remember that one of the possible interpretations for &#8220;of the universal variety&#8221; was that the name of the church would be &#8220;Notre-Dame&#8221;&#8230;). </p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/valdeGrace2.jpg" style="float:right;margin-left:10px;" hspace=10> This church is presently used as the concert hall of La Schola and is famous for its &#8230; <a href="http://www.valdegrace.org/pages/page4.html">musical organ</a> : &#8220;In 1853, <a href="http://en.wikipedia.org/wiki/Aristide_Cavaillé-Coll">Aristide Cavaillé-Coll</a> installed a new organ in the Church of Sainte-geneviève which had been restored in its rôle as a place of worship by Prince President Louis-Napoléon. In 1885, upon the decision of President Jules Grévy, this church once again became the Pantheon and, six years later, according to an understanding between the War and Public Works Departments, the organ was transferred to the Val-de-Grâce, under the supervision of the organ builder Merklin. Beforehand, the last time it was heard in the Pantheon must have been for the funeral service of Victor Hugo.
In 1927, a raising was carried out by the builder Paul-Marie Koenig, and the inaugural concert was given by André Marchal and Achille Philippe, the church’s organist. Added to the register of historic monument in 1979, Val-de-Grâce’s “ little great organ ”, as Cavaillé-Coll called it, was restored in 1993 by the organ builders François Delangue and Bernard Hurvy.
The organ of Val-de-Grâce is one the rare parisian surviving witnesses of the art of Aristide Cavaillé-Coll, an instrument that escaped abusive and definitive transformations or modernizations. This explain why, in spite of its relatively modest scale, this organ enjoys quite a reputation, and this, as far as the United States.&#8221;</p>

<p>By why would the Val-de-Grace organiste at the time <a href="http://fr.wikipedia.org/wiki/Achille_Philip">Achille Philip</a>, &#8220;organiste titulaire du Val-de-Grâce de 1903 à 1950 et professeur d&#8217;orgue et d&#8217;harmonie à la Schola Cantorum de 1904 à 1950&#8243;, be called &#8216;Mister Modulo&#8217; in the wedding-invitations line &#8220;L&#8217;orgue sera tenu par Monsieur Modulo&#8221;???</p>

<p>Again, the late Norbert Dufourcq comes to our rescue, proposing a good candidate for &#8216;Monsieur Modulo&#8217; : &#8220;As for “modulo”, note that the organist at Notre-Dame at that time, Léonce de Saint-Martin, was also the composer of a “Suite Cyclique”, though I admit that this is just wordplay: there is nothing “modular” about this work. Maybe a more serious candidate would be <a href="http://en.wikipedia.org/wiki/Olivier_Messiaen">Olivier Messiaen</a> (who was organist at the Église de la Trinité): his “modes à transposition limitée” are really about Z/12Z→Z/3Z and Z/12Z→Z/4Z. &#8220;</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/messi.jpg" style="float:left;margin-right:10px;" hspace=10> Messiaen&#8217;s <a href="http://en.wikipedia.org/wiki/Modes_of_limited_transposition">&#8216;Modes of limited transposition&#8217;</a> were compiled in his book &#8216;Technique de mon langage musical&#8217;. This book was published in Paris by  Leduc, as late as 1944, 5 years after the wedding-invitation. </p>

<p>Still, several earlier works of Messiaen used these schemes, most notably <a href="http://en.wikipedia.org/wiki/La_Nativité_du_Seigneur">La Nativité du Seigneur</a>, composed in 1935 : &#8220;The work is one of the earliest to feature elements that were to become key to Messiaen&#8217;s later compositions, such as the extensive use of the composer&#8217;s own modes of limited transposition, as well as influence from birdsong, and the meters and rhythms of Ancient Greek and traditional Indian music.&#8221;</p>

<p>More details on Messiaen&#8217;s modes and their connection to modular arithmetic can be found in the study <a href="http://www.vjmanzo.com/clients/vincemanzo/scores/Implementing%20Modality%20in%20Algorithmic%20Composition.pdf">Implementing Modality in Algorithmic Composition</a> by Vincent Joseph Manzo.</p>

<p>Hence, Messiaen is a suitable candidate for the title &#8216;Monsieur Modulo&#8217;, but would he be able to play the Val-de-Grace organ while not being the resident organist? </p>

<p>Remember, the Val-de-Grace church was the concert hall of La Schola, and its musical organ the instrument of choice for the relevant courses. Now &#8230; Olivier Messiaen <a href="http://www.encyclopedia.com/topic/Olivier_Messiaen.aspx">taught</a> at the Schola Cantorum and the École Normale de Musique  from 1936 till 1939. So, at the <a href="http://www.neverendingbooks.org/index.php/when-was-the-bourbaki-wedding.html">time of the Bourbaki-Petard wedding</a> he would certainly be allowed to play the  Cavaillé-Coll organ.</p>

<p>Perhaps we got it right, the second time around : <strong>the Bourbaki-Pétard wedding was held on June 3rd 1939 in the church &#8216;l&#8217;église royale Notre-Dame du Val-de-Grâce&#8217; at 12h</strong>?</p>
 <p><a href='http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html' title='Where was the Bourbaki wedding?'>Previous in series</a></p> </div>]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/seriously-now-where-was-the-bourbaki-wedding.html/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Where was the Bourbaki wedding?</title>
		<link>http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html</link>
		<comments>http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html#comments</comments>
		<pubDate>Mon, 26 Oct 2009 19:36:20 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[Bourbaki]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2359</guid>
		<description><![CDATA[I&#8217;m pretty certain I got the intended date &#38; time of the Bourbaki-Pétard wedding right : June 3rd 1939 at 12h. 
Finding the exact location of the wedding-ceremony is an entirely different matter. And, quite probably, we are reading way too much in these pranks of the Weil-clan. 

Still, it&#8217;s fun trying to find an [...]]]></description>
			<content:encoded><![CDATA[<div class='series_toc'><h3>The Bourbaki Code</h3><ol><li><a href='http://www.neverendingbooks.org/index.php/the-wedding-invitation-that-nearly-killed-andre-weil.html' title='The wedding invitation that nearly killed Andre Weil'>The wedding invitation that nearly killed Andre Weil</a></li><li><a href='http://www.neverendingbooks.org/index.php/when-was-the-bourbaki-wedding.html' title='When was the Bourbaki wedding?'>When was the Bourbaki wedding?</a></li><li><a href='http://www.neverendingbooks.org/index.php/where-is-the-royal-poldavian-academy.html' title='Where is the Royal Poldavian Academy?'>Where is the Royal Poldavian Academy?</a></li><li>Where was the Bourbaki wedding?</li><li><a href='http://www.neverendingbooks.org/index.php/seriously-now-where-was-the-bourbaki-wedding.html' title='Seriously now, where was the Bourbaki wedding?'>Seriously now, where was the Bourbaki wedding?</a></li></ol></div> <div><p>I&#8217;m pretty certain I got the intended <a href="http://www.neverendingbooks.org/index.php/when-was-the-bourbaki-wedding.html">date &amp; time</a> of the <a href="http://www.neverendingbooks.org/index.php/the-wedding-invitation-that-nearly-killed-andre-weil.html">Bourbaki-Pétard wedding</a> right : June 3rd 1939 at 12h. 
Finding the exact location of the wedding-ceremony is an entirely different matter. And, quite probably, we are reading way too much in these pranks of the Weil-clan. </p>

<p>Still, it&#8217;s fun trying to find an elegant answer, based on the (intended or imagined) clues in the text and the little we know about the early Bourbaki-days. Here, the translation of the relevant part of the wedding announcement :</p>

<p><strong>
&#8220;They will receive the trivial isomorphism from P. Adic, of the Order of the Diophantines, in the Principal Cohomology of the Universal Variety, on the third of Cartember, year VI, at the usual hour. <br />
The organ will be played by Monsieur Modulo, Assintant Simplex of the Grassmannian (with lemmas sung by the Scholia Cartanorum). The collection will be donated in full to the retirement home for Poor Abstracts. Convergence will be guaranteed.&#8221;</strong></p>

<p><strong>First solution :</strong> Perhaps one might read &#8220;in the Principal Cohomology of the Universal Variety&#8221; as : &#8220;in the Principal Church of the generic type/name&#8221;. In many French cities the main church is the Cathedral and an awful lot of them are called Notre Dame, so it might mean : in the Notre Dame Cathedral. But even then, we have to choose between these two</p>

<p><center>
<img src="http://matrix.cmi.ua.ac.be/DATA2/NDParis.jpg">
<img src="http://matrix.cmi.ua.ac.be/DATA2/NDNanc.jpg">
</center></p>

<p><p />
On the left, the <a href="http://en.wikipedia.org/wiki/Notre_Dame_de_Paris">Notre Dame Cathedral in Paris</a>. On the right the <a href="http://en.wikipedia.org/wiki/Nancy_Cathedral">Cathédrale Notre-Dame-de-l&#8217;Annonciation in Nancy</a>. As the invitation promises guests to be entertained after the ceremony by Monsieur et Madame Bourbaki at their &#8216;Fundamental Domains&#8217;, the choice depends on the location of the Bourbaki-household in June 1939. </p>

<p>&#8216;Bourbaki&#8217; made two applications to become an AMS-member. The first, in 1948, tells us that Bourbaki is a scientific advisor to the Hermann Publishing Co. in Paris since 1934, and, the second in 1950, that he is &#8216;Directeur Libre de Recherches a l&#8217;Université de Nancy&#8217;. 
I couldn&#8217;t find out when exactly Nicolas did change cities, and even Liliane Beaulieu&#8217;s talk <a href="http://www.iecn.u-nancy.fr/Le-Laboratoire-Et-La-Recherche/100ansdemath/IECN2003-031-042.pdf">Bourbaki a Nancy</a> does not provide an answer. </p>

<p><strong>Second solution :</strong> Or, one can read that sentence as a mathematical, perhaps proto-motivic, statement, and, hunt for clues elsewhere in the text. But then, what are these clues?</p>

<ul>
<li>Mass is celebrated by &#8220;P. Adic, of the Order of the Diophantines&#8221;. This suggests that the church itself belongs to a monastic order, and is perhaps a convent-church.  </li>
<li>Hymns are &#8220;sung by the Scholia Cartanorum&#8221;. Scholia Cartanorum is Latin of sorts and refers perhaps to the Paris&#8217; Latin Quarter, <a href="http://en.wikipedia.org/wiki/Latin_Quarter,_Paris">le Quartier Latin</a>.  </li>
<li>The collection is donated to the &#8220;retirement home for Poor Abstracts&#8221;.   Perhaps the church is connected to a saint for the poor. </li>
</ul>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/DescartesTomb.jpg" style="float:right;margin-left:10px;" hspace=10>Let&#8217;s consider &#8220;Scholia Cartanorum&#8221; more closely. It may be Latin, admittedly very bad Latin, for &#8216;the Scholiums of Cartesius&#8217;, that is, &#8216;of <a href="http://en.wikipedia.org/wiki/René_Descartes">Descartes</a>&#8216;. </p>

<p>One of the more famous &#8216;Scholia&#8217; in scientific history is <a href="http://www.isaacnewton.ca/gen_scholium/General_Scholium-Commentary.pdf">Newton&#8217;s general scholium to the Principia</a>, which is a prime example of Descartes-bashing. Newton attacks Descartes on his vortical theory of planetary motion, his aeter to explain gravity, his God-axiom (unlike Descartes, Newton induced God from nature, rather than starting with God as an axiom) and his hypothetico-deductive method. So, there is a link between Descartes and &#8216;Scholium&#8217;, although the genitive form &#8216;Cartesiorum&#8217; might be fairly inappropriate&#8230;</p>

<p>But then, Descartes died on 11 February 1650 in Stockholm (Sweden) where he was buried, so there won&#8217;t be a connection to a French or Parisian church, right? Well, not quite. The fate of Descartes&#8217; remains is a rather <a href="http://groups.google.com/group/humanities.classics/browse_thread/thread/069af5e98f10242d">strange story</a> : &#8220;In 1666, sixteen years after his death, the bones of René Descartes 
were dug up in the middle of the night and transported from Sweden to 
France under the watchful eye of the French Ambassador. This was only 
the beginning of the journey for Descartes&#8217; bones, which, over the 
next 350 years, were fought over, stolen, sold, revered as relics, 
studied by scientists, used in séances, and passed surreptitiously 
from hand to hand. &#8221;  For example, during the French Revolution, his remains were disinterred for burial 
in the Pantheon in Paris among the great French thinkers. But today, his ashes are burried in&#8230;</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/saintgermaindespres.jpg" style="float:left;margin-right:10px;" hspace=10>the abbay church of <a href="http://en.wikipedia.org/wiki/Abbey_of_Saint-Germain-des-Prés">Saint-Germain-des-Prés</a>, located in the Quartier Latin, within walking distance of the Bourbaki-café <a href="http://www.neverendingbooks.org/index.php/the-bumpy-road-to-the-first-bourbaki-congress.html">Capoulade</a> and the <a href="http://en.wikipedia.org/wiki/École_Normale_Supérieure">Ecole Normal Superieure</a>.</p>

<p>Now all the hints fall handsomely in place. St-Germain-des-Prés is the oldest church in Paris. Parts of it date to the 6th century, when a <a href="http://en.wikipedia.org/wiki/Benedictine">Benedictine</a> abbey was founded on the site by Childebert, son of Clovis. Hence the sentence &#8216;in the Principal Cohomology of the Universal Variety&#8217; might simply mean &#8216;in the first church, ever&#8217;. In medieval times, the Left Bank of Paris was prone to flooding from the Seine, so much of the land could not be built upon and the Abbey stood in the middle of fields, or prés in French, thereby explaining its appellation.</p>

<p>The other part of its name, Saint Germain, comes from <a href="http://en.wikipedia.org/wiki/Germain_of_Paris">Saint Germanus of Paris</a>, also known as the &#8216;father of the poor&#8217; (!). His remains were interred in St. Symphorien&#8217;s chapel in the vestibule of St. Vincent&#8217;s church, but in 754, when he was canonized, his relics were solemnly removed into the body of the church, in the presence of Pepin and his son, Charlemagne, then a child of seven, and the church was reconsecrated as Saint-Germain-des-Prés. That is, also the remains of the &#8216;father of the poor&#8217; are buried  in this church.</p>

<p>Here&#8217;s my best guess : <strong>the Bourbaki-Pétard wedding was held on June 3rd 1939 in the church Saint-Germain-des-Prés at 12h</strong>. Genuine aficionados of <a href="http://en.wikipedia.org/wiki/The_Da_Vinci_Code">the Da Vinci code</a> may regret it wasn&#8217;t held in the neighboring <a href="http://en.wikipedia.org/wiki/Church_of_Saint-Sulpice">Saint-Sulpice church</a>, but then, perhaps someone can bend the clues accordingly&#8230;</p>

<p>Remains this problem : who was the organist, Monsieur Modulo?  Suggestions anyone? </p>
 <p><a href='http://www.neverendingbooks.org/index.php/where-is-the-royal-poldavian-academy.html' title='Where is the Royal Poldavian Academy?'>Previous in series</a></p> <p><a href='http://www.neverendingbooks.org/index.php/seriously-now-where-was-the-bourbaki-wedding.html' title='Seriously now, where was the Bourbaki wedding?'>Next in series</a></p></div>]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/where-was-the-bourbaki-wedding.html/feed</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>the bumpy road to the first Bourbaki congress</title>
		<link>http://www.neverendingbooks.org/index.php/the-bumpy-road-to-the-first-bourbaki-congress.html</link>
		<comments>http://www.neverendingbooks.org/index.php/the-bumpy-road-to-the-first-bourbaki-congress.html#comments</comments>
		<pubDate>Thu, 22 Oct 2009 11:44:53 +0000</pubDate>
		<dc:creator>lieven</dc:creator>
				<category><![CDATA[Bourbaki]]></category>

		<guid isPermaLink="false">http://www.neverendingbooks.org/?p=2413</guid>
		<description><![CDATA[Because Mandelbrojt, de Possel and Coulomb all held a position at the University Blaise Pascal of Clermont-Ferrand I assumed that the Bourbaki-group had no problem procuring the universities’ biology-outpost in Besse-en-Chandesse for their first congress in 1935. However, the relevant Bourbaki files tell a different story. As might have been expected, the project suffered from [...]]]></description>
			<content:encoded><![CDATA[<p>Because Mandelbrojt, de Possel and Coulomb all held a position at the University Blaise Pascal of Clermont-Ferrand I <a href="http://www.neverendingbooks.org/index.php/where-is-the-royal-poldavian-academy.html">assumed</a> that the Bourbaki-group had no problem procuring the universities’ biology-outpost in Besse-en-Chandesse for their first congress in 1935. However, the <a href="http://portail.mathdoc.fr/archives-bourbaki/feuilleter.php?chap=1.1.1">relevant Bourbaki files</a> tell a different story. As might have been expected, the project suffered from the &#8216;usual&#8217; inter-departemental fighting, but also from a power-struggle within the group itself.</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/Capoulade.jpg" style="float:left;margin-right:10px;" hspace=10>An excellent account of the first 10 &#8216;proto-Bourbaki&#8217; meetings in the Capoulade-Café, 63 boulevard Saint- Michel, is told magnificently by Liliane Beaulieu in her 1993 paper <a href="http://www.univ-nancy2.fr/poincare/documents/beaulieu93.pdf">A Parisian Café and Ten Proto-Bourbaki Meetings(1934-1935)</a>. Here we will concentrate on the preparations of the Besse congress.</p>

<p>At their very first meeting on december 10th 1934, they already state the importance of the upcoming summer-congress where a precise plan and a distribution of the writing-load for the first volumes will be discussed : &#8220;Aux prochaines grandes vacances aura lieu une réunion pléniere d&#8217;ou sortira un plan définitif tres précis et une répartition du travail de rédaction des différents fascicules&#8221;. The second meeting, on january 14th 1935, decides that the definite list of Bourbaki-members will consist of those (among the nine &#8216;possibles&#8217;  Weil, Delsarte, Mandelbrojt, Cartan, Dubreil, Dieudonné, de Possel, Chevalley and Leroy) present at the congress : &#8220;Il est entendu que la liste définitive, extraite de la précédente, sera composée des noms des membres présents a la réunion pléniere d&#8217;Aout ou Septembre prochain, réunion dans laquelle sera dressé le plan définitif et précis du traité&#8221;.</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/Besse1Small.jpg" style="float:right;margin-left:10px;" hspace=10> On march 25th 1935, the first precise plans are made about the location, the lodgings and the extremely important issue of the meals which will be taken in a nearby Hotel of which &#8220;la cuisine est, parait-il, fort bonne&#8221;.</p>

<p><a href="http://www.gap-system.org/~history/Biographies/Possel.html">René de Possel</a> obtained a mandate to do whatever it took for the group to have their congress in Besse between 12 and 25 July, and, to enquire until what date they could still change their mind.
His <a href="http://www.gap-system.org/~history/Biographies/Possel.html">biography</a> contains the following lines :
&#8220;On many issues de Possel and André Weil were on opposite sides in the arguments. At the first Bourbaki congress in July 1935 de Possel was still an active member of the group and much involved with contributing but, largely due to differences with Weil, he dropped out of the project. De Possel married Yvonne Liberati on 12 August 1935; they had three children, Yann, Maya, and Daphné.&#8221;</p>

<p>By and large, the Bourbaki-differences between de Possel and Weil were of a professional nature. They had different mathematical interests, different mathematical talents, different ambitions, and, a different level of commitment wrt. the work ahead (Weil being the lazier one of the two). Still, it is difficult to understand the group-dynamics of the first generation Bourbakis without mentioning a personal tragedy, often &#8216;forgotten&#8217; (as in the above biography) or given no more than half a sentence, in passing&#8230;</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/EvelineGillet.jpg" style="float:right;margin-left:10px;" hspace=10>Aged 24, René de Possel marries Evelyne Gillet in 1929 and their son, Alain, is born on august 16th 1931. However, the marriage breaks up, one account dates the separation in 1933, another around the time of the Besse conference in 1935.</p>

<p>What is certain is that Evelyne Gillet and André Weil start a relationship no later than the autumn of 1935. At that time, Weil is concocting the Bourbaki Comptes-Rendus note and as the Academy demands a short biography of the author, he has to come up with a first name (at the Besse conference, they only decided on the name &#8216;N. Bourbaki&#8217;). Evelyne chooses Nicolas and is referred to ever after as &#8216;Bourbaki&#8217;s godmother&#8217;. Early 1936, the couple spends a vacation together in Spain.</p>

<p>Early 1937, the official divorce papers come through, allowing Weil and Evelyne to marry on october 30th 1937.  The very same year, René de Possel remarries with Yvonne Liberati. For more information, you can traverse Evelyne&#8217;s genealogy-tree <a href="http://fr.rodovid.org/wk/Personne:165419">here</a>, but bear in mind that not all information is included (for example, Evelyne died on may 24th, 1986).</p>

<p>Contrary to the suggestion made in the biography, there is no evidence that de Possel left the Bourbaki-group as a result of this affaire or because of his arguments with Weil. In fact, at least until the second Chançay-congress in 1938, de Possel was one of the hardest workers in the group, present at all meetings, doing his share of the write-up and even chastising his fellow-Bourbakis for not being as committed to the project as they ought to be, see for example the <a href="http://portail.mathdoc.fr/archives-bourbaki/PDF/delms_008.pdf">7 theses of Chançay document</a>. It was only in the fall of 1941 that de Possel asked to be transferred to the university of Algiers and left the Bourbaki-group.</p>

<p><img src="http://matrix.cmi.ua.ac.be/DATA2/BesseCoupSmall.jpg" style="float:right;margin-left:10px;" hspace=10>
At the meeting of march 25th 1935, de Possel attempts a coup d&#8217;état. He comes up with an entirely new plan for the summer-congress. <a href="http://en.wikipedia.org/wiki/Paul_Valéry">Paul Valéry</a>, the French poet, essayist, and philosopher (in the notules he is described as &#8216;le célebre fantaisiste&#8217;) proposed the Bourbaki-group to use his &#8216;centre universitaire mediterranéen&#8217; (the proto-University of Nice) as their place of venue. They could choose any period between july and october and they wouldn&#8217;t have to pay a thing! de Possel was in contact with Valéry at that time, he was writing a 44 page booklet on game theory <a href="http://www.amazon.fr/théorie-mathématique-jeux-hasard-réflexion/dp/B0017UK8HM">Sur la théorie mathématique des jeux de hasard et de réflexion</a>, with a preface by Paul Valéry, which appeared later in 1937 via Valéry&#8217;s center for mediterranean studies.</p>

<p>There is one small catch though &#8230; Valéry insists that de Possel should be president of the Bourbaki-group during the meeting! Naturally, this wasn&#8217;t received enthusiastically by the others, but they didn&#8217;t rule the plan out, requesting additional information and observing that july and august may be way too hot in Nice.</p>

<p>The next meeting (May 6th 1935), de Possel tries to increase the pressure by asserting that the original Besse-plan is in danger because &#8220;Les naturalistes de Clermond-Ferrand semblent vouloir se servir de ce qui leur appartient&#8221; (the biologists of Clermond-Ferrand want to use their facilities themselves). But the others are not impressed and they give de Possel &#8220;pleins pouvoirs pour réagir avec violence.&#8221;</p>

<p>A fortnight later, Weil demands to know the latest on the Besse-negotiations and de Possel replies &#8220;en principe les biologistes de Clermond-Ferrand pourront y séjourner des le 15 juin, il y a tout lieu de présumer que ces derniers ne seront que trois ou quatre; ils seront donc fort peu génante étant donné le nombre des locaux dont nous pourrons disposer&#8221;, that is, there won&#8217;t  be more than 3 or 4 biologists around, and, there&#8217;s plenty of room for everyone!  </p>

<p>Putsch averted, the Bourbakis can start packing their suitcases, hire a secretary for the meeting, and split the costs among all committee-members. Because even <a href="http://portail.mathdoc.fr/archives-bourbaki/PDF/delbe_001.pdf">this circulaire</a>  is preserved, we now know such trivia as the cost of full-pension in the Besse-Hotel with the excellent kitchen : 25 Ffr/day&#8230;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.neverendingbooks.org/index.php/the-bumpy-road-to-the-first-bourbaki-congress.html/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
