<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Conjectural_variation</id>
	<title>Conjectural variation - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/w/index.php?action=history&amp;feed=atom&amp;title=Conjectural_variation"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;action=history"/>
	<updated>2026-07-19T05:23:57Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.47.0-wmf.7</generator>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;diff=267020&amp;oldid=prev</id>
		<title>66.74.176.59: sp</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;diff=267020&amp;oldid=prev"/>
		<updated>2014-11-18T08:41:29Z</updated>

		<summary type="html">&lt;p&gt;sp&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw-interface=&quot;&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 10:41, 18 November 2014&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;{{Underlinked|date=September 2013}}&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Hi&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;everybody! My name &lt;/ins&gt;is &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Robyn&lt;/ins&gt;. &amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;It &lt;/ins&gt;is a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;little about myself: I live in Netherlands&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;my city &lt;/ins&gt;of &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Burgh&lt;/ins&gt;-&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Haamstede&lt;/ins&gt;. &amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;It&lt;/ins&gt;&#039;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;s called often Eastern or cultural capital &lt;/ins&gt;of &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;ZE&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I&#039;ve married &lt;/ins&gt;2 &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;years ago&lt;/ins&gt;.&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I have &lt;/ins&gt;2 &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;children &lt;/ins&gt;- a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;son &lt;/ins&gt;(&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Kelsey&lt;/ins&gt;) and the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;daughter &lt;/ins&gt;(&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Kala&lt;/ins&gt;). &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;We &lt;/ins&gt;all &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;like Association football&lt;/ins&gt;.&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/ins&gt;&amp;gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;My web blog &lt;/ins&gt;:: &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[http&lt;/ins&gt;://&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;jatekok&lt;/ins&gt;.&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;jatekok&lt;/ins&gt;.&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;name&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;profile&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;lathorp Choosing &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;right ride for you mountain bike sizing&lt;/ins&gt;.]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;In [[real analysis]]&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;a branch of mathematics, &#039;&#039;&#039;Cantor&#039;s intersection theorem&#039;&#039;&#039;, named after [[Georg Cantor]], gives conditions under which an infinite intersection of nested, non-empty, sets &lt;/del&gt;is &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;non-empty&lt;/del&gt;.&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 1&#039;&#039;&#039;: If &lt;/del&gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt;(X, d)&amp;lt;/math&lt;/del&gt;&amp;gt; is a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;non-trivial&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[complete metric space]] and &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence &lt;/del&gt;of &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;non&lt;/del&gt;-&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;empty, closed sets such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\lim_{n\rightarrow\infty} diam(C_n)=\sup\{d(x,y): x,y\in C_n\}\rightarrow 0&amp;lt;/math&amp;gt;&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Then, there exists an &lt;/del&gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;x\in X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n = \{x\} &amp;lt;/math&amp;gt;.&amp;lt;ref&amp;gt;&quot;Real Analysis,&quot; H.L. Royden, P.M. Fitzpatrick, 4th edition, 2010, page 195&amp;lt;/ref&amp;gt;&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&#039;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;Theorem 2&#039;&#039;&#039;: If &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is a [[compact (mathematics) | compact]] space and &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence &lt;/del&gt;of &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;non-empty, closed sets such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n\neq\varnothing&amp;lt;/math&amp;gt;&lt;/del&gt;.&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Notice the differences and the similarities between the two theorem. In Theorem &lt;/del&gt;2&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;, the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; are only assumed to be closed (and not compact, which is stronger) since given a compact space &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;Y\subset X&amp;lt;/math&amp;gt; a closed subset, &amp;lt;math&amp;gt;Y&amp;lt;/math&amp;gt; is necessarily compact. Also, in Theorem 1 the intersection is exactly 1 point, while in Theorem 2 it could contain many more points. Interestingly, a metric space having the Cantor Intersection property (i.e. the theorem above holds) is necessarily complete (for justification see below). An example of an application of this theorem is the existence of limit points for self-similar contracting fractals&lt;/del&gt;.&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;ref&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Ergodic Theory and Symbolic Dynamics in Hyperbolic Spaces, T. Bedford, M. Keane and C. Series eds., Oxford Univ. Press 1991, page 225&amp;lt;/ref&amp;gt;&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Notice that each of the hypotheses above is essential. If the metric space were not complete, then one could construct a nested sequence of non-empty, compact sets converging to a &quot;hole&quot; in the space, i.e. &amp;lt;math&amp;gt;\mathbb{Q}&amp;lt;/math&amp;gt; with the usual metric and the sequence of sets, &amp;lt;math&amp;gt;C_n = [\sqrt{2}, \sqrt{&lt;/del&gt;2&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;}+1/n]&amp;lt;/math&amp;gt;. If the sets are not closed, then one can construct sequences of nested sets which have empty intersection, i.e. &amp;lt;math&amp;gt;\mathbb{R}&amp;lt;/math&amp;gt; with the collection, &amp;lt;math&amp;gt;C_n = (0,\frac{1}{n}) &amp;lt;/math&amp;gt;. The collections &amp;lt;math&amp;gt;C_n = [n, \infty)&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;C_n = [&lt;/del&gt;-&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\frac{1}{n}, 1+\frac{1}{n}]&amp;lt;/math&amp;gt; illustrate what may happen when the diameters do not tend to zero: the intersection may be empty, as in the first, or may contain more than &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;single point, as in the second.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== Proof ==&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 1&#039;&#039;&#039;:&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Suppose &amp;lt;math&amp;gt;&lt;/del&gt;(&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;X,d&lt;/del&gt;)&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;/math&amp;gt; is a non-trivial, complete metric space &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite family of non-empty closed sets in &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)\rightarrow 0&amp;lt;/math&amp;gt;. Naturally we would like to use &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;completeness so we will construct a Cauchy sequence. Since each of the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; is closed, there exists a &amp;lt;math&amp;gt;y_n&amp;lt;/math&amp;gt; in the interior &lt;/del&gt;(&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;i.e. positive distance to anything outside &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt;&lt;/del&gt;) &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;of &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt;&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;These &amp;lt;math&amp;gt;y_n&amp;lt;/math&amp;gt; form a sequence. Since &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)\rightarrow 0&amp;lt;/math&amp;gt;, then given any positive real value, &amp;lt;math&amp;gt;\epsilon&amp;gt;0&amp;lt;/math&amp;gt;, there exists a large &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt; such that whenever &amp;lt;math&amp;gt;n\geq N&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;diam(C_n)&amp;lt;\epsilon&amp;lt;/math&amp;gt;. Since, &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt;, then given any &amp;lt;math&amp;gt;n,m\geq N&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;y_n,y_m \in C_n&amp;lt;/math&amp;gt; and therefore, &amp;lt;math&amp;gt;d(y_n,y_m)&amp;lt;\epsilon&amp;lt;/math&amp;gt;. Thus, the &amp;lt;math&amp;gt;y_n&amp;lt;/math&amp;gt; form a Cauchy sequence. By the completeness of &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; there is a point &amp;lt;math&amp;gt;x\in X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;y_n\to x&amp;lt;/math&amp;gt;. By the closure of each &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; and since &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is in &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; for &lt;/del&gt;all &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;n\geq N&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;x\in\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt;&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;To see that &amp;lt;math&amp;gt;x&lt;/del&gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;/math&lt;/del&gt;&amp;gt; &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;is alone in &lt;/del&gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt; assume otherwise. Take &amp;lt;math&amp;gt;x&#039;\in\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt; and then consider the distance between &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;x&#039;&amp;lt;/math&amp;gt; this is some value greater than 0 and implies that the &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)\rightarrow d(x,x&#039;)&amp;gt;0&amp;lt;/math&amp;gt;. Contradiction! Thus the claim follows.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 2&#039;&#039;&#039;&lt;/del&gt;:&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Suppose &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is a compact topological space and &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence of non-empty, closed sets such that &amp;lt;math&amp;gt;C_1 \supseteq \cdots C_k \supseteq C_{k+1} \cdots, \, &amp;lt;/math&amp;gt;. Assume, by contradiction, that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n=\varnothing&amp;lt;/math&amp;gt;. Then we will build an open cover of &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; by considering the complement of &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; in &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt;, i.e. &amp;lt;math&amp;gt;U_n=X\setminus C_n,\forall n&amp;lt;/math&amp;gt;. Each &amp;lt;math&amp;gt;U_n&amp;lt;/math&amp;gt; is open since the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; are closed. Notice that &amp;lt;math&amp;gt;\bigcup_{n=1}^\infty U_n = \bigcup_{n=1}^\infty (X\setminus C_n) = X\setminus\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt;, but we assumed that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n=\varnothing&amp;lt;/math&amp;gt; so that means &amp;lt;math&amp;gt;\bigcup_{n=1}^\infty U_n = X&amp;lt;/math&amp;gt;. So, there are infinite many &amp;lt;math&amp;gt;U_n&amp;lt;/math&amp;gt; covering our compact &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt;. That means there exists a large &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt; X\subset\bigcup_{n=1}^N U_n&amp;lt;/math&amp;gt;. Notice, however, that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; implies that &amp;lt;math&amp;gt;X\setminus C_n=U_n\subset U_{n+1}=X\setminus C_{n+1},\forall n&amp;lt;/math&amp;gt;. The only way for the nested and increasing &amp;lt;math&amp;gt;U_n&amp;lt;/math&amp;gt; to cover &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is if there is some index, call it &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;, such that &amp;lt;math&amp;gt;X=U_k&amp;lt;/math&amp;gt;. This implies though that &amp;lt;math&amp;gt;C_k=X\setminus U_k=\varnothing&amp;lt;/math&amp;gt;. This is a contradiction since we assumed that the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; were non-empty. Hence, &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n\neq\varnothing&amp;lt;/math&amp;gt;.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Notice that in regards to the proof of Theorem 2, we don&#039;t need Hausdorffness. At no point in time do we appeal to the nature of points in the space. It is simply a statement about empty or not.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Consider now a metric space &amp;lt;math&amp;gt;(X,d)&amp;lt;/math&amp;gt; (not necessarily complete) in which &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n = x &amp;lt;/math&amp;gt; whenever &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence of non-empty, closed sets such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)=sup\{d(x,y)&lt;/del&gt;: &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;x,y\in X\}\rightarrow 0&amp;lt;/math&amp;gt;. Now, let &amp;lt;math&amp;gt;\{x_k\}&amp;lt;/math&amp;gt; be a Cauchy sequence in &amp;lt;math&amp;gt; X&amp;lt;/math&amp;gt; and take &amp;lt;math&amp;gt;C_n=\overline{\{x_k&lt;/del&gt;:&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;k\geq n\}}&amp;lt;/math&amp;gt;. The bar over the set means that we are taking the closure of the set under it. This guarantees that we are working with closed sets and since they contain the elements of our Cauchy sequence, we know them to be non-empty. In addition, &amp;lt;math&amp;gt;C_n\supset C_{n+1}&amp;lt;/math&amp;gt; and since &amp;lt;math&amp;gt;\forall\epsilon&amp;gt;0,\exists N&amp;lt;/math&amp;gt; such that when &amp;lt;math&amp;gt;n,m\geq N,d(x_n,x_m)&amp;lt;\epsilon&amp;lt;/math&amp;gt;, (note this hold for all indices larger than our large &amp;lt;math&amp;gt;N&amp;lt;&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt;) then &amp;lt;math&amp;gt;diam(C_N)&amp;lt;\epsilon&amp;lt;&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt;&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Hence, &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; satisfies the conditions above and there exists an &amp;lt;math&amp;gt;x\in X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n = x &amp;lt;/math&amp;gt;&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;So, &amp;lt;math&amp;gt;x&amp;lt;&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt; is in the closure of all of the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; and any open ball around &amp;lt;math&amp;gt;x&amp;lt;&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt; has non-empty intersection with &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt;&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Now we will build a sub-sequence of the &amp;lt;math&amp;gt;\{x_n\}&amp;lt;/math&amp;gt;, call it &amp;lt;math&amp;gt;\{x_{n_k}\}&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;d(x,x_{n_k})&amp;lt;\frac{1}{k}&amp;lt;/math&amp;gt;. This implies that &amp;lt;math&amp;gt;\{x_{n_k}\}\to x&amp;lt;/math&amp;gt; and since &amp;lt;math&amp;gt;\{x_k\}&amp;lt;/math&amp;gt; was Cauchy then it too must converge to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;. Since &amp;lt;math&amp;gt;\{x_k\}&amp;lt;/math&amp;gt; was an arbitrary Cauchy sequence, &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is complete.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== References ==&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;{{Reflist}}&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* {{MathWorld | urlname=CantorsIntersectionTheorem | title=Cantor&#039;s Intersection Theorem}}&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* Jonathan Lewin. An interactive introduction to mathematical analysis. Cambridge University Press. ISBN 0-521-01718-1. Section 7.8.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Articles containing proofs]]&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Real analysis]]&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Compactness theorems]]&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Theorems in calculus]&lt;/del&gt;]&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-added&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>66.74.176.59</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;diff=25788&amp;oldid=prev</id>
		<title>131.251.133.28: /* Consistent conjectures */ spelling</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;diff=25788&amp;oldid=prev"/>
		<updated>2013-07-31T15:41:28Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;Consistent conjectures: &lt;/span&gt; spelling&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw-interface=&quot;&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 17:41, 31 July 2013&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Make sure you can hear your breathe &lt;/del&gt;(&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;except &lt;/del&gt;in &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;public places where you may want &lt;/del&gt;to be &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;more discreet&lt;/del&gt;) and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;you can see &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;stomach moving as this will help you to build up a rhythm&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;If you have toe clips on your pedals&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;you&#039;ll need to spend &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;little extra time with &lt;/del&gt;this &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;exercise&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;The downhill bikes have both front &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;rear suspension&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;disc breaks &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;are very strong&lt;/del&gt;. If the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;skin diameter is smaller than a quarter do &lt;/del&gt;not &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;be surprised if you must change them &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;couple &lt;/del&gt;of &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;instances per season &lt;/del&gt;to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;keep &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;bike working reliably&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;There &lt;/del&gt;are &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;many times you will need to grip &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;handle of your bike tightly when you negotiate difficult trails&lt;/del&gt;. &amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;You can choose from many different suspensions on your bike&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;make sure &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;suspension you choose is going &lt;/del&gt;to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;fit &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;type of cycling you intend for it. In fact&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Downhill Mountain biking is &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;most popular form of competition biking. You can spend under $100 for a bargain bike at a department store&lt;/del&gt;, or &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;lay down thousands for &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;professional model&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt; If you liked this article &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;you also &lt;/del&gt;would like to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;acquire more info pertaining &lt;/del&gt;to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[http:&lt;/del&gt;//&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;www&lt;/del&gt;.&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;isaacwkim&lt;/del&gt;.&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;com&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;xe&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;?document_srl=944635 Popular mountain bike sizing&lt;/del&gt;.&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;] please visit &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;web site&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Ten miles back to &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;truck &lt;/del&gt;is a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;long walk when pushing 200 pounds &lt;/del&gt;of &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;meat on a bike&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Titanium &lt;/del&gt;is &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;very light &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;gives you an advantage &lt;/del&gt;and is &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;usually used in racing bicycles&lt;/del&gt;. &amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;It seems there &lt;/del&gt;is &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;still ongoing trail expansion&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;so I predict a great future for the Gold Canyon trails&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;People now prefer to have &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;simplest design &lt;/del&gt;in &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;their bikes as long as it can get &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;job well done&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Buy &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;bike &lt;/del&gt;that &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;has a top quality body made outside of steel&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;aluminum&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;carbon fiber or titanium&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Hence&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;having the bicycle &lt;/del&gt;that &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;suits you perfectly &lt;/del&gt;is &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;much easier now. You might want to pitch &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;tent or you may find &lt;/del&gt;that &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;there are many other options for lodging as you move along &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;trails on your mountain biking trips&lt;/del&gt;. &amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;There are still other types of bikes &lt;/del&gt;that &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;require different types &lt;/del&gt;of &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;tires&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;This article discusses how &lt;/del&gt;to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;go &lt;/del&gt;about &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;buying &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;mountain bike&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Serious head injuries can &lt;/del&gt;be &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;prevented with &lt;/del&gt;a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;helmet &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;today’s styles and designs make them more comfortable to wear&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I should have had &lt;/del&gt;that &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Bicycle repair tool &lt;/del&gt;with &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;me, becuase when I got home &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;lowered &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;seat&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I&#039;ve never been into cycling &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;wanted to give it a try &lt;/del&gt;for &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;exercise&lt;/del&gt;. &amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&amp;lt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;br&lt;/del&gt;&amp;gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;In &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;recent article section&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;you can find &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;list &lt;/del&gt;of &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;biking related articles &lt;/del&gt;with a &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;detailed description present on &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;official website. There is anything from shocks to gears&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;special wheels&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;exclusive take care of bars &lt;/del&gt;that &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;can be immediately switched &lt;/del&gt;to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;match the terrain you&#039;re riding on &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;so substantially much more&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Trying out various sizes &lt;/del&gt;is &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;the first step in choosing the correct folding bike&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Sign up &lt;/del&gt;to &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;get a mountain bike expedition and relive people childhood biking wonder and thrills with a whole new tier&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Part of Park City&#039;s distinction as the International Mountain Bike Association&#039;s first and only gold&lt;/del&gt;-&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;level Ride Center is its abundance of beginner trails&lt;/del&gt;.&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;{{Underlinked|date=September 2013}}&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;In [[real analysis]], a branch of mathematics, &#039;&#039;&#039;Cantor&#039;s intersection theorem&#039;&#039;&#039;, named after [[Georg Cantor]], gives conditions under which an infinite intersection of nested, non-empty, sets is non-empty.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 1&#039;&#039;&#039;: If &amp;lt;math&amp;gt;(X, d)&amp;lt;/math&amp;gt; is a non-trivial, [[complete metric space]] and &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence of non-empty, closed sets such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\lim_{n\rightarrow\infty} diam(C_n)=\sup\{d&lt;/ins&gt;(&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;x,y): x,y\&lt;/ins&gt;in &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;C_n\}\rightarrow 0&amp;lt;/math&amp;gt;. Then, there exists an &amp;lt;math&amp;gt;x\in X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n = \{x\} &amp;lt;/math&amp;gt;.&amp;lt;ref&amp;gt;&quot;Real Analysis,&quot; H.L. Royden, P.M. Fitzpatrick, 4th edition, 2010, page 195&amp;lt;/ref&amp;gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 2&#039;&#039;&#039;: If &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is a [[compact (mathematics) | compact]] space and &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence of non-empty, closed sets such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt;, then &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n\neq\varnothing&amp;lt;/math&amp;gt;.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Notice the differences and the similarities between the two theorem. In Theorem 2, the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; are only assumed &lt;/ins&gt;to be &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;closed (and not compact, which is stronger&lt;/ins&gt;) &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;since given a compact space &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;Y\subset X&amp;lt;/math&amp;gt; a closed subset, &amp;lt;math&amp;gt;Y&amp;lt;/math&amp;gt; is necessarily compact. Also, in Theorem 1 &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;intersection is exactly 1 point, while in Theorem 2 it could contain many more points&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Interestingly&lt;/ins&gt;, a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;metric space having the Cantor Intersection property (i.e. the theorem above holds) is necessarily complete (for justification see below). An example of an application of &lt;/ins&gt;this &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;theorem is the existence of limit points for self-similar contracting fractals&lt;/ins&gt;.&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;ref&amp;gt;Ergodic Theory &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Symbolic Dynamics in Hyperbolic Spaces&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;T. Bedford, M. Keane &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;C. Series eds., Oxford Univ. Press 1991, page 225&amp;lt;/ref&amp;gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Notice that each of the hypotheses above is essential&lt;/ins&gt;. If the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;metric space were &lt;/ins&gt;not &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;complete, then one could construct &lt;/ins&gt;a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;nested sequence &lt;/ins&gt;of &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;non-empty, compact sets converging &lt;/ins&gt;to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;a &quot;hole&quot; in the space, i.e. &amp;lt;math&amp;gt;\mathbb{Q}&amp;lt;/math&amp;gt; with &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;usual metric and the sequence of sets, &amp;lt;math&amp;gt;C_n = [\sqrt{2}, \sqrt{2}+1/n]&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;If the sets &lt;/ins&gt;are &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;not closed, then one can construct sequences of nested sets which have empty intersection, i.e. &amp;lt;math&amp;gt;\mathbb{R}&amp;lt;/math&amp;gt; with &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;collection, &amp;lt;math&amp;gt;C_n = (0,\frac{1}{n}) &amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;The collections &amp;lt;math&amp;gt;C_n = [n, \infty)&lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;/math&lt;/ins&gt;&amp;gt; &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;and &lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;C_n = [-\frac{1}{n}&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;1+\frac{1}{n}]&amp;lt;/math&amp;gt; illustrate what may happen when &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;diameters do not tend &lt;/ins&gt;to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;zero: &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;intersection may be empty&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;as in &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;first&lt;/ins&gt;, or &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;may contain more than &lt;/ins&gt;a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;single point, as in the second&lt;/ins&gt;.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== Proof ==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 1&#039;&#039;&#039;:&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Suppose &amp;lt;math&amp;gt;(X,d)&amp;lt;/math&amp;gt; is a non-trivial, complete metric space and &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite family of non-empty closed sets in &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)\rightarrow 0&amp;lt;/math&amp;gt;. Naturally we &lt;/ins&gt;would like to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;use the completeness so we will construct a Cauchy sequence. Since each of the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; is closed, there exists a &amp;lt;math&amp;gt;y_n&amp;lt;/math&amp;gt; in the interior (i.e. positive distance &lt;/ins&gt;to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;anything outside &amp;lt;math&amp;gt;C_n&amp;lt;&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt;) of &amp;lt;math&amp;gt;C_n&amp;lt;&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;These &amp;lt;math&amp;gt;y_n&amp;lt;/math&amp;gt; form a sequence&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Since &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)\rightarrow 0&amp;lt;/math&amp;gt;, then given any positive real value, &amp;lt;math&amp;gt;\epsilon&amp;gt;0&amp;lt;&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt;, there exists a large &amp;lt;math&amp;gt;N&amp;lt;&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&amp;gt; such that whenever &amp;lt;math&amp;gt;n\geq N&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;diam(C_n)&amp;lt;\epsilon&amp;lt;/math&amp;gt;. Since, &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt;, then given any &amp;lt;math&amp;gt;n,m\geq N&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;y_n,y_m \in C_n&amp;lt;/math&amp;gt; and therefore, &amp;lt;math&amp;gt;d(y_n,y_m)&amp;lt;\epsilon&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Thus, &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;y_n&amp;lt;/math&amp;gt; form a Cauchy sequence&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;By &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;completeness of &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; there &lt;/ins&gt;is a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;point &amp;lt;math&amp;gt;x\in X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;y_n\to x&amp;lt;/math&amp;gt;. By the closure &lt;/ins&gt;of &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;each &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; and since &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is in &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; for all &amp;lt;math&amp;gt;n\geq N&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;x\in\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;To see that &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; &lt;/ins&gt;is &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;alone in &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt; assume otherwise. Take &amp;lt;math&amp;gt;x&#039;\in\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;then consider the distance between &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;x&#039;&amp;lt;/math&amp;gt; this &lt;/ins&gt;is &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;some value greater than 0 and implies that the &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)\rightarrow d(x,x&#039;)&amp;gt;0&amp;lt;/math&amp;gt;. Contradiction! Thus the claim follows&lt;/ins&gt;.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&#039;&#039;&#039;Theorem 2&#039;&#039;&#039;:&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Suppose &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is a compact topological space and &lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\{C_n\}&lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;/math&lt;/ins&gt;&amp;gt; is &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;an infinite sequence of non-empty, closed sets such that &amp;lt;math&amp;gt;C_1 \supseteq \cdots C_k \supseteq C_{k+1} \cdots, \, &amp;lt;/math&amp;gt;. Assume, by contradiction&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n=\varnothing&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Then we will build an open cover of &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; by considering &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;complement of &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; &lt;/ins&gt;in &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt;, i.e. &amp;lt;math&amp;gt;U_n=X\setminus C_n,\forall n&amp;lt;/math&amp;gt;. Each &amp;lt;math&amp;gt;U_n&amp;lt;/math&amp;gt; is open since &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; are closed. Notice that &amp;lt;math&amp;gt;\bigcup_{n=1}^\infty U_n = \bigcup_{n=1}^\infty (X\setminus C_n) = X\setminus\bigcap_{n=1}^\infty C_n&amp;lt;/math&amp;gt;, but we assumed that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n=\varnothing&amp;lt;/math&amp;gt; so that means &amp;lt;math&amp;gt;\bigcup_{n=1}^\infty U_n = X&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;So, there are infinite many &amp;lt;math&amp;gt;U_n&amp;lt;/math&amp;gt; covering our compact &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt;. That means there exists &lt;/ins&gt;a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;large &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt; such &lt;/ins&gt;that &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt; X\subset\bigcup_{n=1}^N U_n&amp;lt;/math&amp;gt;. Notice, however, that &amp;lt;math&amp;gt;C_n\supset C_{n+1}&lt;/ins&gt;,&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\forall n&amp;lt;/math&amp;gt; implies that &amp;lt;math&amp;gt;X\setminus C_n=U_n\subset U_{n+1}=X\setminus C_{n+1}&lt;/ins&gt;,&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\forall n&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;The only way for the nested and increasing &amp;lt;math&amp;gt;U_n&amp;lt;/math&amp;gt; to cover &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; is if there is some index, call it &amp;lt;math&amp;gt;k&amp;lt;/math&amp;gt;&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;such that &amp;lt;math&amp;gt;X=U_k&amp;lt;/math&amp;gt;. This implies though &lt;/ins&gt;that &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;C_k=X\setminus U_k=\varnothing&amp;lt;/math&amp;gt;. This &lt;/ins&gt;is a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;contradiction since we assumed &lt;/ins&gt;that the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; were non-empty&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Hence, &lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\bigcap_{n=1}^\infty C_n\neq\varnothing&lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;/math&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Notice &lt;/ins&gt;that &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;in regards to the proof &lt;/ins&gt;of &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Theorem 2, we don&#039;t need Hausdorffness&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;At no point in time do we appeal &lt;/ins&gt;to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;the nature of points in the space. It is simply a statement &lt;/ins&gt;about &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;empty or not.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Consider now &lt;/ins&gt;a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;metric space &amp;lt;math&amp;gt;(X,d)&amp;lt;/math&amp;gt; (not necessarily complete) in which &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n = x &amp;lt;/math&amp;gt; whenever &amp;lt;math&amp;gt;\{C_n\}&amp;lt;/math&amp;gt; is an infinite sequence of non-empty, closed sets such that &amp;lt;math&amp;gt;C_n\supset C_{n+1},\forall n&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\lim_{n\to\infty} diam(C_n)=sup\{d(x,y): x,y\in X\}\rightarrow 0&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Now, let &amp;lt;math&amp;gt;\{x_k\}&amp;lt;/math&amp;gt; &lt;/ins&gt;be a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Cauchy sequence in &amp;lt;math&amp;gt; X&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;take &amp;lt;math&amp;gt;C_n=\overline{\{x_k:k\geq n\}}&amp;lt;/math&amp;gt;. The bar over the set means that we are taking the closure of the set under it&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;This guarantees &lt;/ins&gt;that &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;we are working &lt;/ins&gt;with &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;closed sets &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;since they contain &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;elements of our Cauchy sequence, we know them to be non-empty&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;In addition, &amp;lt;math&amp;gt;C_n\supset C_{n+1}&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;since &amp;lt;math&amp;gt;\forall\epsilon&amp;gt;0,\exists N&amp;lt;/math&amp;gt; such that when &amp;lt;math&amp;gt;n,m\geq N,d(x_n,x_m)&amp;lt;\epsilon&amp;lt;/math&amp;gt;, (note this hold &lt;/ins&gt;for &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;all indices larger than our large &amp;lt;math&amp;gt;N&amp;lt;/math&amp;gt;) then &amp;lt;math&amp;gt;diam(C_N)&amp;lt;\epsilon&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Hence, &lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;math&lt;/ins&gt;&amp;gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;\{C_n\}&lt;/ins&gt;&amp;lt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;/math&lt;/ins&gt;&amp;gt; &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;satisfies &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;conditions above and there exists an &amp;lt;math&amp;gt;x\in X&amp;lt;/math&amp;gt; such that &amp;lt;math&amp;gt;\bigcap_{n=1}^\infty C_n = x &amp;lt;/math&amp;gt;. So&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; is in &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;closure &lt;/ins&gt;of &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;all of the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt; and any open ball around &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt; has non-empty intersection &lt;/ins&gt;with &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;the &amp;lt;math&amp;gt;C_n&amp;lt;/math&amp;gt;. Now we will build &lt;/ins&gt;a &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;sub-sequence of &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;\{x_n\}&amp;lt;/math&amp;gt;, call it &amp;lt;math&amp;gt;\{x_{n_k}\}&amp;lt;/math&amp;gt;&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;where &amp;lt;math&amp;gt;d(x&lt;/ins&gt;,&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;x_{n_k})&amp;lt;\frac{1}{k}&amp;lt;/math&amp;gt;. This implies &lt;/ins&gt;that &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;math&amp;gt;\{x_{n_k}\}\&lt;/ins&gt;to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;x&amp;lt;/math&amp;gt; &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;since &amp;lt;math&amp;gt;\{x_k\}&amp;lt;/math&amp;gt; was Cauchy then it too must converge to &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Since &amp;lt;math&amp;gt;\{x_k\}&amp;lt;/math&amp;gt; was an arbitrary Cauchy sequence, &amp;lt;math&amp;gt;X&amp;lt;/math&amp;gt; &lt;/ins&gt;is &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;complete.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== References ==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;{{Reflist}}&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* {{MathWorld | urlname=CantorsIntersectionTheorem | title=Cantor&#039;s Intersection Theorem}}&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;* Jonathan Lewin&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;An interactive introduction &lt;/ins&gt;to &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;mathematical analysis. Cambridge University Press&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;ISBN 0-521-01718&lt;/ins&gt;-&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;1. Section 7.8&lt;/ins&gt;.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt; &lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Articles containing proofs]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Real analysis]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Compactness theorems]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;[[Category:Theorems in calculus]]&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>131.251.133.28</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;diff=267019&amp;oldid=prev</id>
		<title>en&gt;Magioladitis: Fix category spacing + general fixes using AWB (8232)</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/w/index.php?title=Conjectural_variation&amp;diff=267019&amp;oldid=prev"/>
		<updated>2012-08-07T08:25:17Z</updated>

		<summary type="html">&lt;p&gt;Fix category spacing + general fixes using &lt;a href=&quot;/w/index.php?title=Testwiki:AWB&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Testwiki:AWB (page does not exist)&quot;&gt;AWB&lt;/a&gt; (8232)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Make sure you can hear your breathe (except in public places where you may want to be more discreet) and you can see the stomach moving as this will help you to build up a rhythm. If you have toe clips on your pedals, you&amp;#039;ll need to spend a little extra time with this exercise. The downhill bikes have both front and rear suspension, disc breaks and are very strong. If the skin diameter is smaller than a quarter do not be surprised if you must change them a couple of instances per season to keep the bike working reliably. There are many times you will need to grip the handle of your bike tightly when you negotiate difficult trails. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;You can choose from many different suspensions on your bike, make sure the suspension you choose is going to fit the type of cycling you intend for it. In fact, Downhill Mountain biking is the most popular form of competition biking. You can spend under $100 for a bargain bike at a department store, or lay down thousands for a professional model.  If you liked this article and you also would like to acquire more info pertaining to [http://www.isaacwkim.com/xe/?document_srl=944635 Popular mountain bike sizing.] please visit the web site. Ten miles back to the truck is a long walk when pushing 200 pounds of meat on a bike. Titanium is very light and gives you an advantage and is usually used in racing bicycles. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;It seems there is still ongoing trail expansion, so I predict a great future for the Gold Canyon trails. People now prefer to have the simplest design in their bikes as long as it can get the job well done. Buy a bike that has a top quality body made outside of steel, aluminum, carbon fiber or titanium. Hence, having the bicycle that suits you perfectly is much easier now. You might want to pitch a tent or you may find that there are many other options for lodging as you move along the trails on your mountain biking trips. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;There are still other types of bikes that require different types of tires. This article discusses how to go about buying a mountain bike. Serious head injuries can be prevented with a helmet and today’s styles and designs make them more comfortable to wear. I should have had that Bicycle repair tool with me, becuase when I got home and lowered the seat. I&amp;#039;ve never been into cycling and wanted to give it a try for exercise. &amp;lt;br&amp;gt;&amp;lt;br&amp;gt;In the recent article section, you can find the list of biking related articles with a detailed description present on the official website. There is anything from shocks to gears, special wheels, exclusive take care of bars that can be immediately switched to match the terrain you&amp;#039;re riding on and so substantially much more. Trying out various sizes is the first step in choosing the correct folding bike. Sign up to get a mountain bike expedition and relive people childhood biking wonder and thrills with a whole new tier. Part of Park City&amp;#039;s distinction as the International Mountain Bike Association&amp;#039;s first and only gold-level Ride Center is its abundance of beginner trails.&lt;/div&gt;</summary>
		<author><name>en&gt;Magioladitis</name></author>
	</entry>
</feed>