<?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/"
	
	>
<channel>
	<title>Comments on: Most Disturbing Math Theorem Ever</title>
	<atom:link href="http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/</link>
	<description>Dedicated to the mathematical arts.</description>
	<lastBuildDate>Fri, 29 May 2015 09:17:44 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=4.1.41</generator>
	<item>
		<title>By: ricktaylor</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-134</link>
		<dc:creator><![CDATA[ricktaylor]]></dc:creator>
		<pubDate>Tue, 20 Sep 2005 08:23:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-134</guid>
		<description><![CDATA[This bothered me too, but a related fact that bugged me more was that the Cantor set has an uncountable number of connected components, even though you&#039;ve cut out only a countable number of intervals. More generally, it&#039;s curious that the structure of an arbitrary open set in R^1 is relatively simple (an at-most countable union of disjoint open intervals), but closed sets in R^1 can be so complex; even though a closed set is just the compliment of an open set.

--Rick Taylor]]></description>
		<content:encoded><![CDATA[<p>This bothered me too, but a related fact that bugged me more was that the Cantor set has an uncountable number of connected components, even though you&#8217;ve cut out only a countable number of intervals. More generally, it&#8217;s curious that the structure of an arbitrary open set in R^1 is relatively simple (an at-most countable union of disjoint open intervals), but closed sets in R^1 can be so complex; even though a closed set is just the compliment of an open set.</p>
<p>&#8211;Rick Taylor</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Walt</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-126</link>
		<dc:creator><![CDATA[Walt]]></dc:creator>
		<pubDate>Fri, 16 Sep 2005 03:16:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-126</guid>
		<description><![CDATA[Banach-Tarski depends on Axiom of Choice, so it doesn&#039;t count. :-)]]></description>
		<content:encoded><![CDATA[<p>Banach-Tarski depends on Axiom of Choice, so it doesn&#8217;t count. <img src="http://www.arsmathematica.net/wp-includes/images/smilies/icon_smile.gif" alt=":-)" class="wp-smiley" /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: octracker</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-125</link>
		<dc:creator><![CDATA[octracker]]></dc:creator>
		<pubDate>Fri, 16 Sep 2005 02:56:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-125</guid>
		<description><![CDATA[what about banach-tarski?  chop an orange up into tiny bits - rearrange the bits and voila! two identical oranges.]]></description>
		<content:encoded><![CDATA[<p>what about banach-tarski?  chop an orange up into tiny bits &#8211; rearrange the bits and voila! two identical oranges.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: easwaran</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-124</link>
		<dc:creator><![CDATA[easwaran]]></dc:creator>
		<pubDate>Sun, 11 Sep 2005 05:08:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-124</guid>
		<description><![CDATA[The related result that disturbs me more is that the reals are the union of a set of measure 0 with a meager (in the sense of Baire) set.  Just take the countable intersection of dense open sets of arbitrarily small measure containing all the rationals.]]></description>
		<content:encoded><![CDATA[<p>The related result that disturbs me more is that the reals are the union of a set of measure 0 with a meager (in the sense of Baire) set.  Just take the countable intersection of dense open sets of arbitrarily small measure containing all the rationals.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sigfpe</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-123</link>
		<dc:creator><![CDATA[sigfpe]]></dc:creator>
		<pubDate>Sat, 10 Sep 2005 14:41:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-123</guid>
		<description><![CDATA[I agree. This one has always bothered me too. The proof is so short you can just see why it&#039;s true. And yet it&#039;s so counterintuitive.]]></description>
		<content:encoded><![CDATA[<p>I agree. This one has always bothered me too. The proof is so short you can just see why it&#8217;s true. And yet it&#8217;s so counterintuitive.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ComplexZeta</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-122</link>
		<dc:creator><![CDATA[ComplexZeta]]></dc:creator>
		<pubDate>Sat, 10 Sep 2005 06:23:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-122</guid>
		<description><![CDATA[I no longer really find this surprising, but when I first saw it in the study of Lebesgue theory, I found it somewhat pathological. I think I&#039;ll spend some time before I go back to school next week trying to construct a covering of the rationals that excludes some fixed irrational (or, dually, finding an irrational not covered by a given covering of the rationals). That seems like an interesting challenge.]]></description>
		<content:encoded><![CDATA[<p>I no longer really find this surprising, but when I first saw it in the study of Lebesgue theory, I found it somewhat pathological. I think I&#8217;ll spend some time before I go back to school next week trying to construct a covering of the rationals that excludes some fixed irrational (or, dually, finding an irrational not covered by a given covering of the rationals). That seems like an interesting challenge.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: citylight</title>
		<link>http://www.arsmathematica.net/2005/09/09/most-disturbing-math-theorem-ever/#comment-121</link>
		<dc:creator><![CDATA[citylight]]></dc:creator>
		<pubDate>Sat, 10 Sep 2005 05:37:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.arsmathematica.net/?p=131#comment-121</guid>
		<description><![CDATA[Hmm... to me it only feels equivalently &#039;strange&#039; to the fact that the reals have a countable dense subset.

Once you know that it doesn&#039;t seem too surprising, you can just take, say, the union of open balls of radius epsilon/2^(n+1) around the nth rational, right?]]></description>
		<content:encoded><![CDATA[<p>Hmm&#8230; to me it only feels equivalently &#8216;strange&#8217; to the fact that the reals have a countable dense subset.</p>
<p>Once you know that it doesn&#8217;t seem too surprising, you can just take, say, the union of open balls of radius epsilon/2^(n+1) around the nth rational, right?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
