<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for Annoying Precision</title>
	<atom:link href="http://qchu.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://qchu.wordpress.com</link>
	<description>&#34;If people do not believe that mathematics is simple, it is only because they do not realize how complicated life is.&#34; - John von Neumann</description>
	<lastBuildDate>Sun, 05 May 2013 11:14:35 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on The Yoneda lemma I by Le lemme de Yoneda et l&#8217;opération spirituelle &#124; L&#039;horreur islamique</title>
		<link>http://qchu.wordpress.com/2012/04/02/the-yoneda-lemma-i/#comment-3425</link>
		<dc:creator><![CDATA[Le lemme de Yoneda et l&#8217;opération spirituelle &#124; L&#039;horreur islamique]]></dc:creator>
		<pubDate>Sun, 05 May 2013 11:14:35 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=9075#comment-3425</guid>
		<description><![CDATA[[...] Annoying precision [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Annoying precision [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by Qiaochu Yuan</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3407</link>
		<dc:creator><![CDATA[Qiaochu Yuan]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 20:38:28 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3407</guid>
		<description><![CDATA[Wordpress comments have limited nesting depth for some reason. 

Yes, that&#039;s what I had in mind.]]></description>
		<content:encoded><![CDATA[<p>WordPress comments have limited nesting depth for some reason. </p>
<p>Yes, that&#8217;s what I had in mind.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by paterz1</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3406</link>
		<dc:creator><![CDATA[paterz1]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 20:27:28 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3406</guid>
		<description><![CDATA[(....) Guess that button did allow me to reply below your answer.]]></description>
		<content:encoded><![CDATA[<p>(&#8230;.) Guess that button did allow me to reply below your answer.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by paterz1</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3405</link>
		<dc:creator><![CDATA[paterz1]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 20:26:57 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3405</guid>
		<description><![CDATA[Strangely I can&#039;t reply below your answer.

Um is what you said equivalent to if $\mathcal M$ is an irreducible component of $X$, then $\mathcal M = \bigcup (\mathcal M \cap X_i)$, hence $\mathcal M \cap X_i = \mathcal M$ for some $i$, so that $\mathcal M \subseteq X_i$ hence $\mathcal M = X_i$ by maximality? Because you seem to &quot;see it&quot; but I wonder if you had the same details in mind or something even more straight forward.]]></description>
		<content:encoded><![CDATA[<p>Strangely I can&#8217;t reply below your answer.</p>
<p>Um is what you said equivalent to if $\mathcal M$ is an irreducible component of $X$, then $\mathcal M = \bigcup (\mathcal M \cap X_i)$, hence $\mathcal M \cap X_i = \mathcal M$ for some $i$, so that $\mathcal M \subseteq X_i$ hence $\mathcal M = X_i$ by maximality? Because you seem to &#8220;see it&#8221; but I wonder if you had the same details in mind or something even more straight forward.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by Qiaochu Yuan</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3404</link>
		<dc:creator><![CDATA[Qiaochu Yuan]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 20:21:48 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3404</guid>
		<description><![CDATA[I suppose there&#039;s a little more that needs to be said here. I&#039;ve written a Noetherian space $latex X$ as a union of finitely many irreducible components $latex \bigcup X_i$. Now, any other irreducible component must be one of the $latex X_i$ (since it must have non-empty intersection with one of the irreducible components above, and therefore must be identical to it), so any other decomposition of $latex X$ into irreducible components must consist of precisely the same $latex X_i$.]]></description>
		<content:encoded><![CDATA[<p>I suppose there&#8217;s a little more that needs to be said here. I&#8217;ve written a Noetherian space <img src='http://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='X' title='X' class='latex' /> as a union of finitely many irreducible components <img src='http://s0.wp.com/latex.php?latex=%5Cbigcup+X_i&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='&#92;bigcup X_i' title='&#92;bigcup X_i' class='latex' />. Now, any other irreducible component must be one of the <img src='http://s0.wp.com/latex.php?latex=X_i&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='X_i' title='X_i' class='latex' /> (since it must have non-empty intersection with one of the irreducible components above, and therefore must be identical to it), so any other decomposition of <img src='http://s0.wp.com/latex.php?latex=X&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='X' title='X' class='latex' /> into irreducible components must consist of precisely the same <img src='http://s0.wp.com/latex.php?latex=X_i&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='X_i' title='X_i' class='latex' />.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by paterz1</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3403</link>
		<dc:creator><![CDATA[paterz1]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 20:18:03 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3403</guid>
		<description><![CDATA[I think I figured it out, but it doesn&#039;t seem so straightforward... I&#039;ll wait for your answer though.]]></description>
		<content:encoded><![CDATA[<p>I think I figured it out, but it doesn&#8217;t seem so straightforward&#8230; I&#8217;ll wait for your answer though.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by paterz1</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3402</link>
		<dc:creator><![CDATA[paterz1]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 20:06:44 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3402</guid>
		<description><![CDATA[Another issue I&#039;m having... I can&#039;t prove it on my own this time though. 

&quot;It follows that Noetherian spaces have a unique decomposition into finitely many irreducible components. &quot;

Why? You&#039;ve only proven that the space can be written as a union of finitely many irreducible components, you don&#039;t know if there are finitely many irreducible components at all, so we don&#039;t know about uniqueness either... maybe I&#039;m missing something but I don&#039;t see it.]]></description>
		<content:encoded><![CDATA[<p>Another issue I&#8217;m having&#8230; I can&#8217;t prove it on my own this time though. </p>
<p>&#8220;It follows that Noetherian spaces have a unique decomposition into finitely many irreducible components. &#8221;</p>
<p>Why? You&#8217;ve only proven that the space can be written as a union of finitely many irreducible components, you don&#8217;t know if there are finitely many irreducible components at all, so we don&#8217;t know about uniqueness either&#8230; maybe I&#8217;m missing something but I don&#8217;t see it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by paterz1</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3401</link>
		<dc:creator><![CDATA[paterz1]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 19:55:06 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3401</guid>
		<description><![CDATA[Cool! Thanks.]]></description>
		<content:encoded><![CDATA[<p>Cool! Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by Qiaochu Yuan</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3400</link>
		<dc:creator><![CDATA[Qiaochu Yuan]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 19:52:50 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3400</guid>
		<description><![CDATA[You&#039;re right. I don&#039;t need to say anything about emptiness. I think I had in mind extra hypotheses on $latex X_1, X_2$ that are unnecessary.]]></description>
		<content:encoded><![CDATA[<p>You&#8217;re right. I don&#8217;t need to say anything about emptiness. I think I had in mind extra hypotheses on <img src='http://s0.wp.com/latex.php?latex=X_1%2C+X_2&amp;bg=ffffff&amp;fg=333333&amp;s=0' alt='X_1, X_2' title='X_1, X_2' class='latex' /> that are unnecessary.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Irreducible components by paterz1</title>
		<link>http://qchu.wordpress.com/2009/11/29/irreducible-components/#comment-3399</link>
		<dc:creator><![CDATA[paterz1]]></dc:creator>
		<pubDate>Wed, 17 Apr 2013 19:11:10 +0000</pubDate>
		<guid isPermaLink="false">http://qchu.wordpress.com/?p=3561#comment-3399</guid>
		<description><![CDATA[This part : 

&quot;a) It suffices to show that the closure of an irreducible subspace is irreducible. Given S \subset X irreducible write \bar{S} = X_1 \cup X_2 where X_1, X_2 are closed in \bar{S}. Then the restrictions of X_1, X_2 to S are closed in the subspace topology, so S is reducible unless one of X_1, X_2 is disjoint from S. Then the other must contain S, and since it is closed it must be all of \bar{S}, so one of X_1, X_2 is empty. &quot;

feels a little wrong to me (I still agree with the statement though). I don&#039;t understand how you get empty sets in there. My proof goes like this : if \bar{S} = X_1 \cup X_2, then S = (S \cap X_1) \cup (S \cup X_2) where (S \cap X_i) are closed in the subspace topology, hence S \cap X_1 = S or S \cap X_2 = S, i.e. S \subseteq X_1 or S \subseteq X_2. Since X_1 and X_2 are closed in \bar{S}, it means X_1 \cup X_2 = S \subseteq X_1 or X_1 \cup X_2 = S \subseteq X_2, i.e. S = X_1 or S = X_2. I don&#039;t get any empty sets anywhere.

Can you either explain your proof more in detail or agree with my comment? I&#039;m still a little confused with this irreducible component story...]]></description>
		<content:encoded><![CDATA[<p>This part : </p>
<p>&#8220;a) It suffices to show that the closure of an irreducible subspace is irreducible. Given S \subset X irreducible write \bar{S} = X_1 \cup X_2 where X_1, X_2 are closed in \bar{S}. Then the restrictions of X_1, X_2 to S are closed in the subspace topology, so S is reducible unless one of X_1, X_2 is disjoint from S. Then the other must contain S, and since it is closed it must be all of \bar{S}, so one of X_1, X_2 is empty. &#8221;</p>
<p>feels a little wrong to me (I still agree with the statement though). I don&#8217;t understand how you get empty sets in there. My proof goes like this : if \bar{S} = X_1 \cup X_2, then S = (S \cap X_1) \cup (S \cup X_2) where (S \cap X_i) are closed in the subspace topology, hence S \cap X_1 = S or S \cap X_2 = S, i.e. S \subseteq X_1 or S \subseteq X_2. Since X_1 and X_2 are closed in \bar{S}, it means X_1 \cup X_2 = S \subseteq X_1 or X_1 \cup X_2 = S \subseteq X_2, i.e. S = X_1 or S = X_2. I don&#8217;t get any empty sets anywhere.</p>
<p>Can you either explain your proof more in detail or agree with my comment? I&#8217;m still a little confused with this irreducible component story&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>