Difference between revisions of "Compactness in Metric Spaces"
| Line 4: | Line 4: | ||
<p>Furthermore, we said that an open cover (or open covering) is simply a cover that contains only open sets.</p> | <p>Furthermore, we said that an open cover (or open covering) is simply a cover that contains only open sets.</p> | ||
<p>We also said that a subset <span class="math-inline"><math>\mathcal S \subseteq \mathcal F</math></span> is a subcover/subcovering (or open subcover/subcovering if <span class="math-inline"><math>\mathcal F</math></span> is an open covering) if <span class="math-inline"><math>\mathcal S</math></span> is also a cover of <span class="math-inline"><math>S</math></span>, that is:</p> | <p>We also said that a subset <span class="math-inline"><math>\mathcal S \subseteq \mathcal F</math></span> is a subcover/subcovering (or open subcover/subcovering if <span class="math-inline"><math>\mathcal F</math></span> is an open covering) if <span class="math-inline"><math>\mathcal S</math></span> is also a cover of <span class="math-inline"><math>S</math></span>, that is:</p> | ||
| − | + | ||
| − | <div style="text-align: center;"><math>\begin{align} \quad S \subseteq \bigcup_{A \in \mathcal S} A \quad \text{ where } | + | <div style="text-align: center;"><math>\begin{align} \quad S \subseteq \bigcup_{A \in \mathcal{S}} A \quad \text{where} \: \mathcal S \subseteq \mathcal F \end{align}</math></div> |
<p>We can now define the concept of a compact set using the definitions above.</p> | <p>We can now define the concept of a compact set using the definitions above.</p> | ||
<blockquote style="background: white; border: 1px solid black; padding: 1em;"> | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | ||
| Line 19: | Line 19: | ||
<p>Let <span class="math-inline"><math>n^* = \max \{ n_1, n_2, ..., n_p \}</math></span>. Then due to the nesting of the open covering <span class="math-inline"><math>\mathcal F</math></span>, we see that:</p> | <p>Let <span class="math-inline"><math>n^* = \max \{ n_1, n_2, ..., n_p \}</math></span>. Then due to the nesting of the open covering <span class="math-inline"><math>\mathcal F</math></span>, we see that:</p> | ||
<div style="text-align: center;"><math>\begin{align} \quad \bigcup_{k=1}^{p} \left ( 0, 1 - \frac{1}{n_p} \right ) = \left ( 0, 1 - \frac{1}{n^*} \right ) \end{align}</math></div> | <div style="text-align: center;"><math>\begin{align} \quad \bigcup_{k=1}^{p} \left ( 0, 1 - \frac{1}{n_p} \right ) = \left ( 0, 1 - \frac{1}{n^*} \right ) \end{align}</math></div> | ||
| − | <p>But for <span class="math-inline"><math>(0, 1) \subseteq \left ( 0, 1 - \frac{1}{n^*} \right )</math></span> we need <span class="math-inline"><math>1 \leq 1 - \frac{1}{n^*}</math></span>. But <span class="math-inline"><math>n^* \in \mathbb{N}</math></span>, so <span class="math-inline"><math>n^* | + | <p>But for <span class="math-inline"><math>(0, 1) \subseteq \left ( 0, 1 - \frac{1}{n^*} \right )</math></span> we need <span class="math-inline"><math>1 \leq 1 - \frac{1}{n^*}</math></span>. But <span class="math-inline"><math>n^* \in \mathbb{N}</math></span>, so <span class="math-inline"><math>n^* > 0</math></span> and <span class="math-inline"><math>\frac{1}{n^*} > 0</math></span>, so <span class="math-inline"><math>1 - \frac{1}{n^*} < 1</math></span>. Therefore any finite subset <span class="math-inline"><math>\mathcal F^*</math></span> of <span class="math-inline"><math>\mathcal F</math></span> cannot cover <span class="math-inline"><math>S = (0, 1)</math></span>. Hence, <span class="math-inline"><math>(0, 1)</math></span> is not compact.</p> |
Revision as of 15:41, 8 November 2021
Compact Sets in a Metric Space
If is a metric space and then a cover or covering of is a collection of subsets in such that:
Furthermore, we said that an open cover (or open covering) is simply a cover that contains only open sets.
We also said that a subset is a subcover/subcovering (or open subcover/subcovering if is an open covering) if is also a cover of , that is:
We can now define the concept of a compact set using the definitions above.
Definition: Let be a metric space. The subset is said to be Compact if every open covering of has a finite subcovering of .
In general, it may be more difficult to show that a subset of a metric space is compact than to show a subset of a metric space is not compact. So, let's look at an example of a subset of a metric space that is not compact.
Consider the metric space where is the Euclidean metric and consider the set . We claim that this set is not compact. To show that is not compact, we need to find an open covering Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F} of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle S} that does not have a finite subcovering. Consider the following open covering:
Clearly Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F} is an infinite subcovering of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle (0, 1)} and furthermore:
Let Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F^*} be a finite subset of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F} containing Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle p} elements. Then:
Let Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n^* = \max \{ n_1, n_2, ..., n_p \}} . Then due to the nesting of the open covering Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F} , we see that:
But for Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle (0, 1) \subseteq \left ( 0, 1 - \frac{1}{n^*} \right )} we need Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 1 \leq 1 - \frac{1}{n^*}} . But Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n^* \in \mathbb{N}} , so Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle n^* > 0} and Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \frac{1}{n^*} > 0} , so Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle 1 - \frac{1}{n^*} < 1} . Therefore any finite subset Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F^*} of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \mathcal F} cannot cover Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle S = (0, 1)} . Hence, Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle (0, 1)} is not compact.