Difference between revisions of "Theorem:Bolzano-Weierstrass"
| Line 1: | Line 1: | ||
| − | + | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | |
| − | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | + | <td><strong>Theorem 1 (Bolzano-Weierstrass):</strong> Let <span class="math-inline"><math>(a_n)</math></span> be a bounded sequence. Then there exists a subsequence of <span class="math-inline"><math>(a_n)</math></span>, call it <span class="math-inline"><math>(a_{n_k})</math></span> that is convergent.</td> |
| − | + | </blockquote> | |
| − | + | <ul> | |
| − | + | <li><strong>Proof 1:</strong> Let <span class="math-inline"><math>(a_n)</math></span> be a bounded sequence, that is the set <span class="math-inline"><math>\{ a_n : n \in \mathbb{N} \}</math></span> is bounded. Suppose that <span class="math-inline"><math>a</math></span> is a lower bound for this set, and <span class="math-inline"><math>b</math></span> is an upper bound for this set, and so <span class="math-inline"><math>a \leq a_n \leq b_n</math></span> for all <span class="math-inline"><math>n \in \mathbb{N}</math></span>. Therefore the set <span class="math-inline"><math>\{ a_n : n \in \mathbb{N} \}</math></span> is contained in the interval <span class="math-inline"><math>I_1 = [a, b]</math></span>.</li> | |
| − | + | </ul> | |
| − | + | <div class="image-container aligncenter"><img src="http://mathonline.wdfiles.com/local--files/the-bolzano-weierstrass-theorem/Screen%20Shot%202014-10-22%20at%2011.36.10%20PM.png" alt="Screen%20Shot%202014-10-22%20at%2011.36.10%20PM.png" class="image" /></div> | |
| − | + | <ul> | |
| − | + | <li>Let's take <span class="math-inline"><math>n_1 = 1</math></span>, i.e., let the first term of the subsequence <span class="math-inline"><math>(a_{n_k})</math></span> be equal to the first term of the parent sequence <span class="math-inline"><math>(a_n)</math></span>.</li> | |
| − | + | </ul> | |
| − | + | <ul> | |
| + | <li>We will now take the interval <span class="math-inline"><math>I_1</math></span> and divide into two subintervals of equal length. We will call these intervals <span class="math-inline"><math>I_1'</math></span> and <span class="math-inline"><math>I_1''</math></span>. We will also divide the set of indices into two sets. Let <span class="math-inline"><math>A_1 := \{ n \in \mathbb{N} : n > n_1, a_n \in I_1' \}</math></span> and let <span class="math-inline"><math>B_1 = \{ n \in \mathbb{N} : n > n_1, a_N \in I_1'' \}</math></span>. We note that <span class="math-inline"><math>A_1</math></span> is the set of indices <span class="math-inline"><math>n</math></span> greater than the first index in our subsequence, <span class="math-inline"><math>n_1</math></span>, such that <span class="math-inline"><math>a_n</math></span> is in the interval <span class="math-inline"><math>I_1'</math></span>. Similarly, <span class="math-inline"><math>B_1</math></span> is the set of indices <span class="math-inline"><math>n</math></span> greater than the first index in our subsequence, <span class="math-inline"><math>n_1</math></span> such that <span class="math-inline"><math>a_N</math></span> is in the interval <span class="math-inline"><math>I_1''</math></span>.</li> | ||
| + | </ul> | ||
| + | <div class="image-container aligncenter"><img src="http://mathonline.wdfiles.com/local--files/the-bolzano-weierstrass-theorem/Screen%20Shot%202014-10-23%20at%2012.00.55%20AM.png" alt="Screen%20Shot%202014-10-23%20at%2012.00.55%20AM.png" class="image" /></div> | ||
| + | <ul> | ||
| + | <li>We note that both of the sets <span class="math-inline"><math>A_1</math></span> and <span class="math-inline"><math>B_1</math></span> cannot be finite since <span class="math-inline"><math>A_1</math></span> and <span class="math-inline"><math>B_1</math></span> contain all of the indices of the sequence <span class="math-inline"><math>(a_n)</math></span> which has infinitely many indices since it is an infinite sequence. If <span class="math-inline"><math>A_1</math></span> is infinite, then we let <span class="math-inline"><math>I_2 = I_1'</math></span>, and we will let <span class="math-inline"><math>n_2</math></span> be the smallest natural number index in the set <span class="math-inline"><math>A_1</math></span>, which we are ensured to have by the Well Ordering Principle. If <span class="math-inline"><math>A_1</math></span> is finite, then <span class="math-inline"><math>B_1</math></span> is infinite and we let <span class="math-inline"><math>I_2 = I_1''</math></span> and we let <span class="math-inline"><math>n_2</math></span> be the smallest natural number index in the set <span class="math-inline"><math>B_1</math></span>, which once again, we are ensured to have by the Well Ordering Principle.</li> | ||
| + | </ul> | ||
| + | <ul> | ||
| + | <li>We will now take the interval <span class="math-inline"><math>I_2</math></span> and subdivide it into two subintervals of equal length, call them <span class="math-inline"><math>I_2'</math></span> and <span class="math-inline"><math>I_2''</math></span>. Once again, we will subdivide the set of indices into two sets. Let <span class="math-inline"><math>A_2 = \{ n \in \mathbb{N} : n > n_2, a_n \in I_2' \}</math></span> and let <span class="math-inline"><math>B_2 = \{ n \in \mathbb{N} : n > n_2, a_n \in I_2'' \}</math></span>.</li> | ||
| + | </ul> | ||
| + | <div class="image-container aligncenter"><img src="http://mathonline.wdfiles.com/local--files/the-bolzano-weierstrass-theorem/Screen%20Shot%202014-10-23%20at%2012.14.38%20AM.png" alt="Screen%20Shot%202014-10-23%20at%2012.14.38%20AM.png" class="image" /></div> | ||
| + | <ul> | ||
| + | <li>Once again, if <span class="math-inline"><math>A_2</math></span> is infinite, then we will let <span class="math-inline"><math>I_3 = I_2'</math></span>, and let <span class="math-inline"><math>n_3</math></span> be the smallest natural number index of <span class="math-inline"><math>A_2</math></span>. If <span class="math-inline"><math>A_2</math></span> is finite, then <span class="math-inline"><math>B_2</math></span> is infinite and let <span class="math-inline"><math>n_3</math></span> be the smallest natural number index of <span class="math-inline"><math>B_2</math></span>.</li> | ||
| + | </ul> | ||
| + | <ul> | ||
| + | <li>We will then take the interval <span class="math-inline"><math>I_3</math></span> and subdivide it into two subintervals of equal length, call them <span class="math-inline"><math>I_3'</math></span> and <span class="math-inline"><math>I_3''</math></span>. We will also subdivide the set of indices into two sets. <span class="math-inline"><math>A_3 = \{ n \in \mathbb{N} : n > n_3, a_n \in I_3' \}</math></span> and <span class="math-inline"><math>B_3 = \{ n \in \mathbb{N} : n > n_3, a_n \in I_3'' \}</math></span></li> | ||
| + | </ul> | ||
| + | <div class="image-container aligncenter"><img src="http://mathonline.wdfiles.com/local--files/the-bolzano-weierstrass-theorem/Screen%20Shot%202014-10-23%20at%2012.23.20%20AM.png" alt="Screen%20Shot%202014-10-23%20at%2012.23.20%20AM.png" class="image" /></div> | ||
| + | <ul> | ||
| + | <li>We will continue this pattern to obtain a sequence of nested intervals <span class="math-inline"><math>I_1 \supseteq I_2 \supseteq ... \supseteq I_k \supseteq ...</math></span>. Furthermore, we will also have a subsequence <span class="math-inline"><math>(a_{n_k})</math></span> of <span class="math-inline"><math>(a_n)</math></span> where <span class="math-inline"><math>a_{n_k} \in I_k</math></span> for every <span class="math-inline"><math>k \in \mathbb{N}</math></span>.</li> | ||
| + | </ul> | ||
| + | <div class="image-container aligncenter"><img src="http://mathonline.wdfiles.com/local--files/the-bolzano-weierstrass-theorem/Screen%20Shot%202014-10-23%20at%2012.30.02%20AM.png" alt="Screen%20Shot%202014-10-23%20at%2012.30.02%20AM.png" class="image" /></div> | ||
| + | <ul> | ||
| + | <li>We also note that the length of any interval <span class="math-inline"><math>I_k</math></span> is precisely equal to <span class="math-inline"><math>\frac{b - a}{2^{k-1}}</math></span>. By the nested intervals theorem there exists a common point <span class="math-inline"><math>\xi \in I_k</math></span> for all <span class="math-inline"><math>k \in \mathbb{N}</math></span>, and so we have that:</li> | ||
| + | </ul> | ||
| + | <div style="text-align: center;"><math>\begin{align} \mid a_{n_k} - \xi \mid \leq \frac{b - a}{2^{k-1}} \end{align}</math></div> | ||
| + | <ul> | ||
| + | <li>Therefore the subsequence <span class="math-inline"><math>(a_{n_k})</math></span> converges to <span class="math-inline"><math>\xi</math></span>. <span class="math-inline"><math>\blacksquare</math></span></li> | ||
| + | </ul> | ||
| + | <ul> | ||
| + | <li><strong>Proof 2:</strong> Let <span class="math-inline"><math>(a_n)</math></span> be a bounded sequence. By the <a href="/the-monotone-subsequence-theorem">The Monotone Subsequence Theorem</a>, every sequence of real numbers has a monotonic subsequence. Let <span class="math-inline"><math>(a_{n_k})</math></span> be this monotonic subsequence. Since <span class="math-inline"><math>(a_n)</math></span> is bounded, it follows that <span class="math-inline"><math>(a_{n_k})</math></span> is also bounded since the values <span class="math-inline"><math>a_{n_k}</math></span> are contained in the sequence <span class="math-inline"><math>(a_n)</math></span>. Since <span class="math-inline"><math>(a_{n_k})</math></span> is both bounded and monotonic, then by <a href="/the-monotone-convergence-theorem">The Monotone Convergence Theorem</a>, <span class="math-inline"><math>(a_{n_k})</math></span> is a convergent subsequence. <span class="math-inline"><math>\blacksquare</math></span></li> | ||
| + | </ul> | ||
| + | <blockquote style="background: white; border: 1px solid black; padding: 1em;"> | ||
| + | <td><strong>Theorem 2:</strong> If <span class="math-inline"><math>(a_n)</math></span> is a bounded sequence such that every convergent subsequence <span class="math-inline"><math>(a_{n_k})</math></span> of <span class="math-inline"><math>(a_n)</math></span> converges to <span class="math-inline"><math>L</math></span> then <span class="math-inline"><math>(a_n)</math></span> converges to <span class="math-inline"><math>L</math></span>.</td> | ||
| + | </blockquote> | ||
| + | <ul> | ||
| + | <li><strong>Proof:</strong> Suppose that <span class="math-inline"><math>A = (a_n)</math></span> does not converge to <span class="math-inline"><math>L</math></span>. Then there exists a subsequence <span class="math-inline"><math>A' = (a_{n_k})</math></span> and an <span class="math-inline"><math>\epsilon_0 > 0</math></span> such that <span class="math-inline"><math>\mid a_{n_k} - L \mid \geq \epsilon_0</math></span> for all <span class="math-inline"><math>k \in \mathbb{N}</math></span>.</li> | ||
| + | </ul> | ||
| + | <ul> | ||
| + | <li>Since <span class="math-inline"><math>A</math></span> is bounded, any subsequence of <span class="math-inline"><math>A</math></span> is also bounded, and so the subsequence <span class="math-inline"><math>A'</math></span> is bounded. Since <span class="math-inline"><math>A'</math></span> is bounded, then by the Bolzano-Weierstrass theorem there exists a convergent subsequence <span class="math-inline"><math>A''</math></span> of <span class="math-inline"><math>A'</math></span>. Since <span class="math-inline"><math>A''</math></span> is a convergent subsequence of <span class="math-inline"><math>A'</math></span>, then it is also a convergent sequence of <span class="math-inline"><math>A</math></span> by transitivity, and by the hypothesis, <span class="math-inline"><math>A''</math></span> converges to <span class="math-inline"><math>L</math></span>.</li> | ||
| + | </ul> | ||
| + | <ul> | ||
| + | <li>But then convergence of <span class="math-inline"><math>A''</math></span> to <span class="math-inline"><math>L</math></span> contradicts the assumption that <span class="math-inline"><math>\mid a_{n_k} - L \mid \geq \epsilon_0</math></span>, and so the assumption that <span class="math-inline"><math>A</math></span> did not converge to <span class="math-inline"><math>L</math></span> was false. Therefore <span class="math-inline"><math>(a_n)</math></span> converges to <span class="math-inline"><math>L</math></span>. <span class="math-inline"><math>\blacksquare</math></span></li> | ||
| + | </ul> | ||
Revision as of 12:19, 8 November 2021
Theorem 1 (Bolzano-Weierstrass): Let be a bounded sequence. Then there exists a subsequence of , call it that is convergent.
- Proof 1: Let be a bounded sequence, that is the set is bounded. Suppose that is a lower bound for this set, and is an upper bound for this set, and so for all . Therefore the set is contained in the interval .
- Let's take , i.e., let the first term of the subsequence be equal to the first term of the parent sequence .
- We will now take the interval and divide into two subintervals of equal length. We will call these intervals and . We will also divide the set of indices into two sets. Let and let . We note that is the set of indices greater than the first index in our subsequence, , such that is in the interval . Similarly, is the set of indices greater than the first index in our subsequence, such that is in the interval .
- We note that both of the sets and cannot be finite since and contain all of the indices of the sequence which has infinitely many indices since it is an infinite sequence. If is infinite, then we let , and we will let be the smallest natural number index in the set , which we are ensured to have by the Well Ordering Principle. If is finite, then is infinite and we let and we let be the smallest natural number index in the set , which once again, we are ensured to have by the Well Ordering Principle.
- We will now take the interval and subdivide it into two subintervals of equal length, call them and . Once again, we will subdivide the set of indices into two sets. Let and let .
- Once again, if is infinite, then we will let , and 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_3} be the smallest natural number index of . If is finite, then is infinite and let be the smallest natural number index of .
- We will then take the interval and subdivide it into two subintervals of equal length, call them and . We will also subdivide the set of indices into two sets. and
- We will continue this pattern to obtain a sequence of nested intervals . Furthermore, we will also have a subsequence of where for every .
- We also note that the length of any interval is precisely equal to . By the nested intervals theorem there exists a common point for all , and so we have that:
- Therefore the subsequence converges to .
- Proof 2: Let be a bounded sequence. By the <a href="/the-monotone-subsequence-theorem">The Monotone Subsequence Theorem</a>, every sequence of real numbers has a monotonic subsequence. Let be this monotonic subsequence. Since is bounded, it follows that is also bounded since the values are contained in the sequence . Since is both bounded and monotonic, then by <a href="/the-monotone-convergence-theorem">The Monotone Convergence Theorem</a>, is a convergent subsequence.
Theorem 2: If 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 (a_n)} is a bounded sequence such that every convergent subsequence 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 (a_{n_k})} 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 (a_n)} converges to 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 L} then 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 (a_n)} converges to 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 L} .
- Proof: Suppose that 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 A = (a_n)} does not converge to 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 L} . Then there exists a subsequence 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 A' = (a_{n_k})} and an 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 \epsilon_0 > 0} such that 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 \mid a_{n_k} - L \mid \geq \epsilon_0} for all 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 k \in \mathbb{N}} .
- Since 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 A} is bounded, any subsequence 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 A} is also bounded, and so the subsequence 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 A'} is bounded. Since 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 A'} is bounded, then by the Bolzano-Weierstrass theorem there exists a convergent subsequence 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 A''} 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 A'} . Since is a convergent subsequence 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 A'} , then it is also a convergent sequence 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 A} by transitivity, and by the hypothesis, 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 A''} converges to 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 L} .
- But then convergence 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 A''} to 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 L} contradicts the assumption that 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 \mid a_{n_k} - L \mid \geq \epsilon_0} , and so the assumption that 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 A} did not converge to 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 L} was false. Therefore 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 (a_n)} converges to 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 L} . 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 \blacksquare}