Q stringlengths 4 3.96k | A stringlengths 1 3k | Result stringclasses 4
values |
|---|---|---|
Proposition 4.2.3. Suppose \( {U}_{1},{U}_{2},\ldots ,{U}_{n} \) is a finite collection of open sets. Then\n\n\[ \mathop{\bigcap }\limits_{{i = 1}}^{n}{U}_{i} \]\n\n\( \left( {4.2.6}\right) \)\nis open. | Proof. Let \( x \in \mathop{\bigcap }\limits_{{i = 1}}^{n}{U}_{i} \) . Then \( x \in {U}_{i} \) for every \( i = 1,2,\ldots, n \) . For each \( i \) , choose \( {\epsilon }_{i} > 0 \) such that \( \left( {x - {\epsilon }_{i}, x + {\epsilon }_{i}}\right) \subset {U}_{i} \) . Let \( \epsilon \) be the smallest of \( {\ep... | Yes |
Proposition 4.3.1. If \( A \subset \mathbb{R} \), then \( \bar{A} \) is closed. | Proof. Suppose \( x \) is a limit point of \( \bar{A} \). We will show that \( x \) is a limit point of \( A \), and hence \( x \in \bar{A} \). Now for any \( \epsilon > 0 \), there exists \( a \in \bar{A}, a \neq x \), such that\n\n\[ a \in \left( {x - \frac{\epsilon }{2}, x + \frac{\epsilon }{2}}\right) . \]\n\nIf \(... | Yes |
Proposition 4.3.2. A set \( C \subset \mathbb{R} \) is closed if and only if for every convergent sequence \( {\left\{ {a}_{k}\right\} }_{k \in K} \) with \( {a}_{k} \in C \) for all \( k \in K \) , \[ \mathop{\lim }\limits_{{k \rightarrow \infty }}{a}_{k} \in C \] | Proof. Suppose \( C \) is closed and \( {\left\{ {a}_{k}\right\} }_{k \in K} \) is a convergent sequence with \( {a}_{k} \in C \) for all \( k \in K \) . Let \( x = \mathop{\lim }\limits_{{k \rightarrow \infty }}{a}_{k} \) . If \( x = {a}_{k} \) for some integer \( k \), then \( x \in C \) . Otherwise, for every \( \ep... | Yes |
Proposition 4.3.3. Suppose \( A \) is a set and, for each \( \alpha \in A,{C}_{\alpha } \) is a closed set. Then\n\n\[ \mathop{\bigcap }\limits_{{\alpha \in A}}{C}_{\alpha } \]\n\n(4.3.8)\n\nis a closed set. | Proof. Suppose \( x \) is a limit point of \( \mathop{\bigcap }\limits_{{\alpha \in A}}{C}_{\alpha } \) . Then for any \( \epsilon > 0 \), there exists \( y \in \mathop{\bigcap }\limits_{{\alpha \in A}}{C}_{\alpha } \) such that \( y \neq x \) and \( y \in \left( {x - \epsilon, x + \epsilon }\right) \) . But then for a... | Yes |
Proposition 4.3.4. Suppose \( {C}_{1},{C}_{2},\ldots ,{C}_{n} \) is a finite collection of closed sets. Then\n\n\[ \mathop{\bigcup }\limits_{{i = 1}}^{n}{C}_{i} \]\n\n\( \left( {4.3.9}\right) \)\nis closed. | Proof. Suppose \( {\left\{ {a}_{k}\right\} }_{k \in K} \) is a convergent sequence with \( {a}_{k} \in \mathop{\bigcup }\limits_{{i = 1}}^{n}{C}_{i} \) for every \( k \in K \) . Let \( L = \mathop{\lim }\limits_{{k \rightarrow \infty }}{a}_{k} \) . Since \( K \) is an infinite set, there must exist an integer \( m \) a... | Yes |
Proposition 4.3.5. A set \( C \subset \mathbb{R} \) is closed if and only if \( \mathbb{R} \smallsetminus C \) is open. | Proof. Assume \( C \) is closed and let \( U = \mathbb{R} \smallsetminus C \) . If \( C = \mathbb{R} \), then \( U = \varnothing \), which is open; if \( C = \varnothing \), then \( U = \mathbb{R} \), which is open. So we may assume both \( C \) and \( U \) are nonempty. Let \( x \in U \) . Then \( x \) is not a limit ... | Yes |
Proposition 4.4.1. If \( I \) is a closed, bounded interval, then \( I \) is compact. | Proof. Let \( a \leq b \) be finite real numbers and \( I = \left\lbrack {a, b}\right\rbrack \) . Suppose \( \left\{ {{U}_{\alpha } : \alpha \in A}\right\} \) is an open cover of \( I \) . Let \( \mathcal{O} \) be the set of sets \( \left\{ {{U}_{\beta } : \beta \in B}\right\} \) with the properties that \( B \) is a f... | Yes |
Proposition 4.4.2. If \( K \) is a closed, bounded subset of \( \mathbb{R} \), then \( K \) is compact. | Proof. Since \( K \) is bounded, there exist finite real numbers \( a \) and \( b \) such that \( K \subset \left\lbrack {a, b}\right\rbrack \) . Let \( \left\{ {{U}_{\alpha } : \alpha \in A}\right\} \) be an open cover of \( K \) . Let \( V = \mathbb{R} \smallsetminus K \) . Then\n\n\[ \left\{ {{U}_{\alpha } : \alpha ... | Yes |
Proposition 4.4.3. If \( K \subset \mathbb{R} \) is compact, then \( K \) is closed. | Proof. Suppose \( x \) is a limit point of \( K \) and \( x \notin K \) . For \( n = 1,2,3,\ldots \), let\n\n\[ \n{U}_{n} = \left( {-\infty, x - \frac{1}{n}}\right) \cup \left( {x + \frac{1}{n}, + \infty }\right) .\n\]\n\n(4.4.14)\n\nThen\n\n\[ \n\mathop{\bigcup }\limits_{{n = 1}}^{\infty }{U}_{n} = \left( {-\infty, x}... | Yes |
Proposition 4.4.4. If \( K \subset \mathbb{R} \) is compact, then \( K \) is bounded. | Proof. Suppose \( K \) is not bounded. For \( n = 1,2,3,\ldots \), let \( {U}_{n} = \left( {-n, n}\right) \) . Then\n\n\[ \mathop{\bigcup }\limits_{{n = 1}}^{\infty }{U}_{n} = \left( {-\infty ,\infty }\right) \supset K \]\n\n(4.4.18)\n\nBut, for any integer \( N \), there exists \( a \in K \) such that \( \left| a\righ... | Yes |
Proposition 4.4.6. If \( K \subset \mathbb{R} \) is compact and \( {\left\{ {x}_{n}\right\} }_{n \in I} \) is a sequence with \( {x}_{n} \in K \) for every \( n \in I \), then \( {\left\{ {x}_{n}\right\} }_{n \in I} \) has a convergent subsequence \( {\left\{ {x}_{{n}_{k}}\right\} }_{k = 1}^{\infty } \) with\n\n\[ \mat... | Proof. Since \( K \) is bounded, \( {\left\{ {x}_{n}\right\} }_{n \in I} \) has a convergent subsequence \( {\left\{ {x}_{{n}_{k}}\right\} }_{k = 1}^{\infty } \) . Since \( K \) is closed, we must have \( \mathop{\lim }\limits_{{k \rightarrow \infty }}{x}_{{n}_{k}} \in K \) .\n\nQ.E.D. | Yes |
Proposition 4.4.7. Suppose \( K \subset \mathbb{R} \) is such that whenever \( {\left\{ {x}_{n}\right\} }_{n \in I} \) is a sequence with \( {x}_{n} \in K \) for every \( n \in I \), then \( {\left\{ {x}_{n}\right\} }_{n \in I} \) has a subsequence \( {\left\{ {x}_{{n}_{k}}\right\} }_{k = 1}^{\infty } \) with \( \matho... | Proof. Suppose \( K \) is unbounded. Then we may construct a sequence \( {\left\{ {x}_{n}\right\} }_{n = 1}^{\infty } \) such that \( {x}_{n} \in K \) and \( \left| {x}_{n}\right| > n \) for \( n = 1,2,3,\ldots \) Hence the only possible subsequential limits of \( {\left\{ {x}_{n}\right\} }_{n = 1}^{\infty } \) would b... | Yes |
Proposition 5.1.1. Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R} \), and \( a \) is a limit point of \( D \) . If \( f\left( {a - }\right) = f\left( {a + }\right) = L \), then \( \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = L \) . | Proof. Suppose \( {\left\{ {x}_{n}\right\} }_{n = m}^{\infty } \in S\left( {D, a}\right) \) . Let\n\n\[ {J}^{ - } = \left\{ {n : n \in \mathbb{Z},{x}_{n} < a}\right\} \]\n\n\( \left( {5.1.15}\right) \)\n\nand\n\n\[ {J}^{ + } = \left\{ {n : n \in \mathbb{Z},{x}_{n} > a}\right\} . \]\n\n\( \left( {5.1.16}\right) \)\n\nSu... | Yes |
Proposition 5.1.2. Suppose \( D \subset \mathbb{R}, a \) is a limit point of \( D \), and \( f : D \rightarrow \mathbb{R} \) . If \( \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = L \) and \( \alpha \in \mathbb{R} \), then\n\n\[ \mathop{\lim }\limits_{{x \rightarrow a}}{\alpha f}\left( x\right) = {\alpha L... | Proof. Suppose \( {\left\{ {x}_{n}\right\} }_{n \in I} \in S\left( {D, a}\right) \) . Then\n\n\[ \mathop{\lim }\limits_{{n \rightarrow \infty }}{\alpha f}\left( {x}_{n}\right) = \alpha \mathop{\lim }\limits_{{n \rightarrow \infty }}f\left( {x}_{n}\right) = {\alpha L}. \]\n\n\( \left( {5.1.23}\right) \)\n\nHence \( \mat... | Yes |
Proposition 5.1.3. Suppose \( D \subset \mathbb{R}, a \) is a limit point of \( D, f : D \rightarrow \mathbb{R} \), and \( g : D \rightarrow \mathbb{R} \) . If \( \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = L \) and \( \mathop{\lim }\limits_{{x \rightarrow a}}g\left( x\right) = M \), then\n\n\[ \mathop{... | Proof. Suppose \( {\left\{ {x}_{n}\right\} }_{n \in I} \in S\left( {D, a}\right) \) . Then\n\n\[ \mathop{\lim }\limits_{{n \rightarrow \infty }}\left( {f\left( {x}_{n}\right) + g\left( {x}_{n}\right) }\right) = \mathop{\lim }\limits_{{n \rightarrow \infty }}f\left( {x}_{n}\right) + \mathop{\lim }\limits_{{n \rightarrow... | Yes |
Proposition 5.1.5. Suppose \( D \subset \mathbb{R}, a \) is a limit point of \( D, f : D \rightarrow \mathbb{R} \) , \( g : D \rightarrow \mathbb{R} \), and \( g\left( x\right) \neq 0 \) for all \( x \in D \) . If \( \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = L,\mathop{\lim }\limits_{{x \rightarrow a}}... | Exercise 5.1.2. Prove the previous proposition. | No |
Proposition 5.1.7. Suppose \( D \subset \mathbb{R}, E \subset \mathbb{R}, a \) is a limit point of \( D, g : D \rightarrow \mathbb{R} \) , \( f : E \rightarrow \mathbb{R} \), and \( g\left( D\right) \subset E \) . Moreover, suppose \( \lim g\left( x\right) = b \) and, for some \( \epsilon > 0 \) , \( g\left( x\right) \... | Proof. Suppose \( {\left\{ {x}_{n}\right\} }_{n \in I} \in S\left( {D, a}\right) \) . Then \[ \mathop{\lim }\limits_{{n \rightarrow \infty }}g\left( {x}_{n}\right) = b \] Let \( N \in {\mathbb{Z}}^{ + } \) such that \( \left| {{x}_{n} - a}\right| < \epsilon \) whenever \( n > N \) . Then \[ {\left\{ g\left( {x}_{n}\rig... | Yes |
Example 5.1.3. Suppose \( f : \mathbb{R} \rightarrow \mathbb{R} \) is defined by \( f\left( x\right) = x \) for all \( x \in \mathbb{R} \) . If, for any \( a \in \mathbb{R},{\left\{ {x}_{n}\right\} }_{n \in I} \in S\left( {\mathbb{R}, a}\right) \), then | \[ \mathop{\lim }\limits_{{n \rightarrow \infty }}f\left( {x}_{n}\right) = \mathop{\lim }\limits_{{n \rightarrow \infty }}{x}_{n} = a. \] Hence \( \mathop{\lim }\limits_{{x \rightarrow a}}x = a \) . | Yes |
Example 5.1.4. Suppose \( n \in {\mathbb{Z}}^{ + } \) and \( f : \mathbb{R} \rightarrow \mathbb{R} \) is defined by \( f\left( x\right) = {x}^{n} \) . Then | \[ \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = \mathop{\lim }\limits_{{x \rightarrow a}}{x}^{n} = \mathop{\prod }\limits_{{i = 1}}^{n}\mathop{\lim }\limits_{{x \rightarrow a}}x = {a}^{n}. \] | Yes |
Proposition 5.1.8. Suppose \( D \subset \mathbb{R}, a \) is a limit point of \( D \), and \( f : D \rightarrow \mathbb{R} \) . Then \( \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = L \) if and only if for every \( \epsilon > 0 \) there exists a \( \delta > 0 \) such that\n\n\[ \left| {f\left( x\right) - L... | Proof. Suppose \( \mathop{\lim }\limits_{{x \rightarrow a}}f\left( x\right) = L \) . Suppose there exists an \( \epsilon > 0 \) such that for every \( \delta > 0 \) there exists \( x \in \left( {a - \delta, a + \delta }\right) \cap D, x \neq a \), for which \( \left| {f\left( x\right) - L}\right| \geq \epsilon \) . For... | Yes |
Proposition 5.1.9. Suppose \( D \subset \mathbb{R}, a \) is a limit point of \( D, f : D \rightarrow \mathbb{R} \), and \( {S}^{ - }\left( {D, a}\right) \neq \varnothing \) . Then \( \mathop{\lim }\limits_{{x \rightarrow {a}^{ - }}}f\left( x\right) = L \) if and only if for every \( \epsilon > 0 \) there exists a \( \d... | \[ \left| {f\left( x\right) - L}\right| < \epsilon \text{whenever}x \in \left( {a - \delta, a}\right) \cap D\text{.} \] | Yes |
Proposition 5.1.10. Suppose \( D \subset \mathbb{R}, a \) is a limit point of \( D, f : D \rightarrow \mathbb{R} \), and \( {S}^{ + }\left( {D, a}\right) \neq \varnothing \) . Then \( \mathop{\lim }\limits_{{x \rightarrow {a}^{ + }}}f\left( x\right) = L \) if and only if for every \( \epsilon > 0 \) there exists a \( \... | \[ \left| {f\left( x\right) - L}\right| < \epsilon \text{whenever}x \in \left( {a, a + \delta }\right) \cap D\text{.} \] | Yes |
Define \( f : \mathbb{R} \rightarrow \mathbb{R} \) by\n\n\[ f\left( x\right) = \left\{ \begin{array}{ll} 1, & \text{ if }x\text{ is rational,} \\ 0, & \text{ if }x\text{ is irrational. } \end{array}\right.\]\n\nLet \( a \in \mathbb{R} \) . | Since every open interval contains both rational and irrational numbers, for any \( \delta > 0 \) and any choice of \( L \in \mathbb{R} \), there will exist \( x \in \left( {a - \delta, a + \delta }\right) \) , \( x \neq a \), such that\n\n\[ \left| {f\left( x\right) - L}\right| \geq \frac{1}{2} \]\n\nHence \( \mathop{... | Yes |
Define \( f : \mathbb{R} \rightarrow \mathbb{R} \) by\n\n\[ f\left( x\right) = \left\{ \begin{array}{ll} x, & \text{ if }x\text{ is rational,} \\ 0, & \text{ if }x\text{ is irrational. } \end{array}\right. \]\n\nThen \( \mathop{\lim }\limits_{{x \rightarrow 0}}f\left( x\right) = 0 \) | since, given \( \epsilon > 0,\left| {f\left( x\right) }\right| < \epsilon \) provided \( \left| x\right| < \epsilon \) | Yes |
Define \( \varphi : \left\lbrack {0,1}\right\rbrack \rightarrow \left\lbrack {-1,1}\right\rbrack \) by \[ \varphi \left( x\right) = \left\{ \begin{array}{ll} {4x}, & \text{ if }0 \leq x \leq \frac{1}{4} \\ 2 - {4x}, & \text{ if }\frac{1}{4} < x < \frac{3}{4} \\ {4x} - 4, & \text{ if }\frac{3}{4} \leq x \leq 1 \end{arra... | Now let \( D = \mathbb{R} \smallsetminus \{ 0\} \) and define \( \sigma : D \rightarrow \mathbb{R} \) by \[ \sigma \left( x\right) = s\left( \frac{1}{x}\right) . \] See the graph of \( \sigma \) in Figure 5.1.2. Note that for any \( n \in {\mathbb{Z}}^{ + } \), \[ \sigma \left( \left\lbrack {\frac{1}{n + 1},\frac{1}{n}... | Yes |
Example 5.1.8. Let \( s \) be the sawtooth function of the previous example and let \( D = \mathbb{R} \smallsetminus \{ 0\} \) . Define \( \psi : D \rightarrow \mathbb{R} \) by \[ \psi \left( x\right) = {xs}\left( \frac{1}{x}\right) . \] See Figure 5.1.2 for the graph of \( \psi \) . Then for all \( x \in D \) , \[ - \... | and so \( \mathop{\lim }\limits_{{x \rightarrow 0}}\psi \left( x\right) = 0 \) by the squeeze theorem. | No |
Proposition 5.2.1. If \( f \) is monotonic on \( \left( {a, b}\right) \), then \( f\left( {c + }\right) \) and \( f\left( {c - }\right) \) exist for every \( c \in \left( {a, b}\right) \) . | Proof. Suppose \( f \) is nondecreasing on \( \left( {a, b}\right) \) . Let \( c \in \left( {a, b}\right) \) and let\n\n\[ \lambda = \sup \{ f\left( x\right) : a < x < c\} . \]\n\nNote that \( \lambda \leq f\left( c\right) < + \infty \) . Given any \( \epsilon > 0 \), there must exist \( \delta > 0 \) such that\n\n\[ \... | Yes |
Proposition 5.2.2. If \( f \) is nondecreasing on \( \\left( {a, b}\\right) \) and \( a < x < y < b \), then\n\n\[ f\\left( {x + }\\right) \\leq f\\left( {y - }\\right) .\n\] | Proof. By the previous proposition,\n\n\[ f\\left( {x + }\\right) = \\inf \\{ f\\left( t\\right) : x < t < b\\}\n\]\n\nand\n\n\[ f\\left( {y - }\\right) = \\sup \\{ f\\left( t\\right) : a < t < y\\} .\n\]\n\nSince \( f \) is nondecreasing,\n\n\[ \\inf \\{ f\\left( t\\right) : x < t < b\\} = \\inf \\{ f\\left( t\\right)... | Yes |
Define \( f : \mathbb{R} \rightarrow \mathbb{R} \) by\n\n\[ f\left( x\right) = \left\{ \begin{array}{ll} 1, & \text{ if }x\text{ is rational,} \\ 0, & \text{ if }x\text{ is irrational. } \end{array}\right.\n\] | Then, by Example 5.1.5, \( f \) is discontinuous at every \( x \in \mathbb{R} \) . | No |
Proposition 5.4.1. Suppose \( D \subset \mathbb{R},\alpha \in \mathbb{R}, f : D \rightarrow \mathbb{R} \), and \( g : D \rightarrow \mathbb{R} \) . If \( f \) and \( g \) are continuous at \( a \), then \( {\alpha f}, f + g \), and \( {fg} \) are all continuous at \( a \) . Moreover, if \( g\left( x\right) \neq 0 \) fo... | Exercise 5.4.1. Prove the previous proposition. | No |
Proposition 5.4.2. Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R}, f\left( x\right) \geq 0 \) for all \( x \in D \), and \( f \) is continuous at \( a \in D \) . If \( g : D \rightarrow \mathbb{R} \) is defined by \( g\left( x\right) = \sqrt{f\left( x\right) } \), then \( g \) is continuous at \( a \) . | Exercise 5.4.2. Prove the previous proposition. | No |
Proposition 5.4.3. Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R} \), and \( a \in D \) . Then \( f \) is continuous at \( a \) if and only if for every \( \epsilon > 0 \) there exists \( \delta > 0 \) such that\n\n\[ \left| {f\left( x\right) - f\left( a\right) }\right| < \epsilon \text{whenever}x \in \l... | Proof. Suppose \( f \) is continuous at \( a \) . If \( a \) is an isolated point of \( D \), then there exists a \( \delta > 0 \) such that\n\n\[ \left( {a - \delta, a + \delta }\right) \cap D = \{ a\} . \]\n\nThen for any \( \epsilon > 0 \), if \( x \in \left( {a - \delta, a + \delta }\right) \cap D \), then \( x = a... | Yes |
Proposition 5.4.4. Suppose \( D \subset \mathbb{R}, E \subset \mathbb{R}, g : D \rightarrow \mathbb{R}, f : E \rightarrow \mathbb{R}, g\left( D\right) \subset E \) , and \( a \in D \) . If \( g \) is continuous at \( a \) and \( f \) is continuous at \( g\left( a\right) \), then \( f \circ g \) is continuous at \( a \)... | Proof. Let \( {\left\{ {x}_{n}\right\} }_{n \in I} \) be a sequence with \( {x}_{n} \in D \) for every \( n \in I \) and \( \mathop{\lim }\limits_{{n \rightarrow \infty }}{x}_{n} = a \) . Then, since \( g \) is continuous at \( a,{\left\{ g\left( {x}_{n}\right) \right\} }_{n \in I} \) is a sequence with \( g\left( {x}_... | Yes |
Proposition 5.4.5. Suppose \( f \) is monotonic on the interval \( \left( {a, b}\right) \) . Then every discontinuity of \( f \) in \( \left( {a, b}\right) \) is a simple discontinuity. Moreover, if \( E \) is the set of points in \( \left( {a, b}\right) \) at which \( f \) is discontinuous, then either \( E = \varnoth... | Proof. The first statement follows immediately from Proposition 5.2.1. For the second statement, suppose \( f \) is nondecreasing and suppose \( E \) is nonempty. From Exercise 2.1.26 and the the proof of Proposition 5.2.1, it follows that for every \( x \in \left( {a, b}\right) \) ,\n\n\[ f\left( {x - }\right) \leq f\... | Yes |
Proposition 5.4.8. Suppose \( D \subset \mathbb{R} \) and \( f : D \rightarrow \mathbb{R} \). Then \( f \) is continuous on \( D \) if and only if for every open set \( V \subset \mathbb{R},{f}^{-1}\left( V\right) = U \cap D \) for some open set \( U \subset \mathbb{R} \). | Proof. Suppose \( f \) is continuous on \( D \) and \( V \subset \mathbb{R} \) is an open set. If \( V \cap f\left( D\right) = \varnothing \), then \( {f}^{-1}\left( V\right) = \varnothing \), which is open. So suppose \( V \cap f\left( D\right) \neq \varnothing \) and let \( a \in {f}^{-1}\left( V\right) \). Since \( ... | Yes |
Theorem 5.4.9 (Intermediate Value Theorem). Suppose \( a, b \in \mathbb{R}, a < b \), and \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) . If \( f \) is continuous and \( s \in \mathbb{R} \) is such that either \( f\left( a\right) \leq s \leq f\left( b\right) \) or \( f\left( b\right) \leq s \leq f\l... | Proof. Suppose \( f\left( a\right) < f\left( b\right) \) and \( f\left( a\right) < s < f\left( b\right) \) . Let\n\n\[ c = \sup \{ x : x \in \left\lbrack {a, b}\right\rbrack, f\left( x\right) \leq s\} . \]\n\n(5.4.19)\n\nSuppose \( f\left( c\right) < s \) . Then \( c < b \) and, since \( f \) is continuous at \( c \), ... | Yes |
Example 5.4.3. Suppose \( a \in \mathbb{R}, a > 0 \), and consider \( f\left( x\right) = {x}^{n} - a \) where \( n \in \mathbb{Z}, n > 1 \) . Then \( f\left( 0\right) = - a < 0 \) and | \[ f\left( {1 + a}\right) = {\left( 1 + a\right) }^{n} - a \] \[ = 1 + {na} + \mathop{\sum }\limits_{{i = 2}}^{n}\left( \begin{matrix} n \\ i \end{matrix}\right) {a}^{i} - a \] \[ = 1 + \left( {n - 1}\right) a + \mathop{\sum }\limits_{{i = 2}}^{n}\left( \begin{matrix} n \\ i \end{matrix}\right) {a}^{i} > 0, \] where \(... | Yes |
Theorem 5.4.10. Suppose \( D \subset \mathbb{R} \) is compact and \( f : D \rightarrow \mathbb{R} \) is continuous. Then \( f\left( D\right) \) is compact. | Proof. Given a sequence \( {\left\{ {y}_{n}\right\} }_{n \in I} \) in \( f\left( D\right) \), choose a sequence \( {\left\{ {x}_{n}\right\} }_{n \in I} \) such that \( f\left( {x}_{n}\right) = {y}_{n} \). Since \( D \) is compact, \( {\left\{ {x}_{n}\right\} }_{n \in I} \) has a convergent subsequence \( {\left\{ {x}_{... | Yes |
Theorem 5.4.11 (Extreme Value Theorem). Suppose \( D \subset \mathbb{R} \) is compact and \( f : D \rightarrow \mathbb{R} \) is continuous. Then there exists \( a \in D \) such that \( f\left( a\right) \geq f\left( x\right) \) for all \( x \in D \) and there exists \( b \in D \) such that \( f\left( b\right) \leq f\lef... | Proof. Let \( s = \sup f\left( D\right) \) and \( t = \inf f\left( D\right) \) . Then \( s \in f\left( D\right) \), so there exists \( a \in D \) such that \( f\left( a\right) = s \), and \( t \in f\left( D\right) \), so there exists \( b \in D \) such that \( f\left( b\right) = t \) . Q.E.D. | No |
Proposition 5.4.12. Suppose \( D \subset \mathbb{R} \) is compact, \( f : D \rightarrow \mathbb{R} \) is continuous and one-to-one, and \( E = f\left( D\right) \) . Then \( {f}^{-1} : E \rightarrow D \) is continuous. | Proof. Let \( V \subset \mathbb{R} \) be an open set. We need to show that \( f\left( {V \cap D}\right) = U \cap E \) for some open set \( U \subset \mathbb{R} \) . Let \( C = D \cap \left( {\mathbb{R} \smallsetminus V}\right) \) . Then \( C \) is a closed subset of \( D \) , and so is compact. Hence \( f\left( C\right... | Yes |
Define \( f : \left( {0, + \infty }\right) \) by \( f\left( x\right) = \frac{1}{x} \). Given any \( \delta > 0 \), choose \( n \in {\mathbb{Z}}^{ + } \) such that \( \frac{1}{n\left( {n + 1}\right) } < \delta \). Let \( x = \frac{1}{n} \) and \( y = \frac{1}{n + 1} \). Then | \[
\left| {x - y}\right| = \frac{1}{n} - \frac{1}{n + 1} = \frac{1}{n\left( {n + 1}\right) } < \delta .
\]
However,
\[
\left| {f\left( x\right) - f\left( y\right) }\right| = \left| {n - \left( {n + 1}\right) }\right| = 1.
\]
Hence, for example, there does not exist a \( \delta > 0 \) such that
\[
\left| {f\left( x\... | Yes |
Example 5.4.5. Define \( f : \mathbb{R} \rightarrow \mathbb{R} \) by \( f\left( x\right) = {2x} \) . Let \( \epsilon > 0 \) be given. If \( \delta = \frac{\epsilon }{2} \) , then | \[ \left| {f\left( x\right) - f\left( y\right) }\right| = 2\left| {x - y}\right| < \epsilon \] whenever \( \left| {x - y}\right| < \delta \) . Hence \( f \) is uniformly continuous on \( \mathbb{R} \) . | Yes |
Proposition 5.4.13. Suppose \( D \subset \mathbb{R} \) is compact and \( f : D \rightarrow \mathbb{R} \) is continuous. Then \( f \) is uniformly continuous on \( D \) . | Proof. Let \( \epsilon > 0 \) be given. For every \( x \in D \), choose \( {\delta }_{x} \) such that\n\n\[ \left| {f\left( x\right) - f\left( y\right) }\right| < \frac{\epsilon }{2} \]\n\n(5.4.28)\n\nwhenever \( y \in D \) and \( \left| {x - y}\right| < {\delta }_{x} \) . Let\n\n\[ {J}_{x} = \left( {x - \frac{{\delta ... | Yes |
Proposition 6.1.1. Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R} \), and \( a \) is an interior point of \( D \) . Then \( f \) is differentiable at \( a \) if and only if\n\n\[ \mathop{\lim }\limits_{{x \rightarrow a}}\frac{f\left( x\right) - f\left( a\right) }{x - a} \]\n\n\( \left( {6.1.4}\right) \)\... | Proof. Let \( m \in \mathbb{R} \) and let \( L : \mathbb{R} \rightarrow \mathbb{R} \) be the linear function \( L\left( x\right) = {mx} \) . Then\n\n\[ \frac{f\left( x\right) - f\left( a\right) - L\left( {x - a}\right) }{x - a} = \frac{f\left( x\right) - f\left( a\right) - m\left( {x - a}\right) }{x - a} \]\n\n\[ = \fr... | Yes |
Let \( n \in {\mathbb{Z}}^{ + } \) and define \( f : \mathbb{R} \rightarrow \mathbb{R} \) by \( f\left( x\right) = {x}^{n} \) . Then | \[ {f}^{\prime }\left( x\right) = \mathop{\lim }\limits_{{h \rightarrow 0}}\frac{{\left( x + h\right) }^{n} - {x}^{n}}{h} \] \[ = \mathop{\lim }\limits_{{h \rightarrow 0}}\frac{{x}^{n} + n{x}^{n - 1}h + \mathop{\sum }\limits_{{k = 2}}^{n}\left( \begin{array}{l} n \\ k \end{array}\right) {x}^{n - k}{h}^{k} - {x}^{n}}{h}... | Yes |
Define \( f : \mathbb{R} \rightarrow \mathbb{R} \) by \( f\left( x\right) = \left| x\right| \) . Then | \[ \frac{f\left( {0 + h}\right) - f\left( 0\right) }{h} = \frac{\left| h\right| }{h} = \begin{cases} 1, & \text{ if }h > 0, \\ - 1, & \text{ if }h < 0. \end{cases} \] Hence \[ \mathop{\lim }\limits_{{h \rightarrow {0}^{ - }}}\frac{f\left( {0 + h}\right) - f\left( 0\right) }{h} = - 1 \] and \[ \mathop{\lim }\limits_{{h ... | Yes |
Proposition 6.2.1. If \( f \) is differentiable at \( a \), then \( f \) is continuous at \( a \) . | Proof. If \( f \) is differentiable at \( a \), then\n\n\[\n\mathop{\lim }\limits_{{x \rightarrow a}}\left( {f\left( x\right) - f\left( a\right) }\right) = \mathop{\lim }\limits_{{x \rightarrow a}}\left( \frac{f\left( x\right) - f\left( a\right) }{x - a}\right) \left( {x - a}\right) = {f}^{\prime }\left( a\right) \left... | Yes |
Proposition 6.2.2. Suppose \( f \) is differentiable at \( a \) and \( \alpha \in \mathbb{R} \) . Then \( {\alpha f} \) is differentiable at \( a \) and \( {\left( \alpha f\right) }^{\prime }\left( a\right) = \alpha {f}^{\prime }\left( a\right) \) . | Exercise 6.2.5. Prove the previous proposition. | No |
Proposition 6.2.3. Suppose \( f \) and \( g \) are both differentiable at \( a \) . Then \( f + g \) is differentiable at \( a \) and \( {\left( f + g\right) }^{\prime }\left( a\right) = {f}^{\prime }\left( a\right) + {g}^{\prime }\left( a\right) \) . | Exercise 6.2.6. Prove the previous proposition. | No |
Proposition 6.2.4 (Product rule). Suppose \( f \) and \( g \) are both differentiable at \( a \) . Then \( {fg} \) is differentiable at \( a \) and\n\n\[{\left( fg\right) }^{\prime }\left( a\right) = f\left( a\right) {g}^{\prime }\left( a\right) + g\left( a\right) {f}^{\prime }\left( a\right) . | Proof. We have\n\n\[{\left( fg\right) }^{\prime }\left( a\right) = \mathop{\lim }\limits_{{h \rightarrow 0}}\frac{f\left( {a + h}\right) g\left( {a + h}\right) - f\left( a\right) g\left( a\right) }{h}\]\n\n\[= \mathop{\lim }\limits_{{h \rightarrow 0}}\frac{f\left( {a + h}\right) g\left( {a + h}\right) - f\left( a\right... | Yes |
Proposition 6.2.5 (Quotient rule). Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R}, g : D \rightarrow \mathbb{R} \) , \( a \) is in the interior of \( D \), and \( g\left( x\right) \neq 0 \) for all \( x \in D \) . If \( f \) and \( g \) are both differentiable at \( a \), then \( \frac{f}{g} \) is differ... | Proof. We have\n\n\[{\left( \frac{f}{g}\right) }^{\prime }\left( a\right) = \mathop{\lim }\limits_{{h \rightarrow 0}}\frac{\frac{f\left( {a + h}\right) }{g\left( {a + h}\right) } - \frac{f\left( a\right) }{g\left( a\right) }}{h}\]\n\n\[= \mathop{\lim }\limits_{{h \rightarrow 0}}\frac{f\left( {a + h}\right) g\left( a\ri... | Yes |
Proposition 6.2.7. Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R} \) is one-to-one, \( a \) is in the interior of \( D, f\left( a\right) \) is in the interior of \( f\left( D\right) ,{f}^{-1} \) is continuous at \( f\left( a\right) \), and \( f \) is differentiable at \( a \) with \( {f}^{\prime }\left( ... | Proof. Choose \( \delta > 0 \) so that \( \left( {f\left( a\right) - \delta, f\left( a\right) + \delta }\right) \subset f\left( D\right) \) . For \( h \in \left( {-\delta ,\delta }\right) \), let\n\n\[k = {f}^{-1}\left( {f\left( a\right) + h}\right) - a.\]\n\nThen\n\n\[{f}^{-1}\left( {f\left( a\right) + h}\right) = a +... | Yes |
Example 6.2.3. For \( n \in {Z}^{ + } \), define \( f : \lbrack 0, + \infty ) \rightarrow \mathbb{R} \) by \( f\left( x\right) = \sqrt[n]{x} \) . Then \( f \) is the inverse of \( g : \lbrack 0, + \infty ) \rightarrow \mathbb{R} \) defined by \( g\left( x\right) = {x}^{n} \) . Thus, for any \( x \in \left( {0, + \infty... | \[ {f}^{\prime }\left( x\right) = \frac{1}{{g}^{\prime }\left( {f\left( x\right) }\right) } = \frac{1}{n{\left( \sqrt[n]{x}\right) }^{n - 1}} = \frac{1}{n}{x}^{\frac{1}{n} - 1}. \] | Yes |
Proposition 6.3.1. Suppose \( D \subset \mathbb{R}, f : D \rightarrow \mathbb{R} \), and \( a \) is an interior point of \( D \) at which \( f \) has either a local maximum or a local minimum. If \( f \) is differentiable at \( a \), then \( {f}^{\prime }\left( a\right) = 0 \) . | Proof. Suppose \( f \) has a local maximum at \( a \) (a similar argument works if \( f \) has a local minimum at \( a \) ). Choose \( \delta > 0 \) so that \( \left( {a - \delta, a + \delta }\right) \subset D \) and \( f\left( a\right) \geq f\left( x\right) \) for all \( x \in \left( {a - \delta, a + \delta }\right) \... | Yes |
Theorem 6.3.2 (Rolle’s Theorem). Let \( a, b \in \mathbb{R} \) and suppose \( f \) is continuous on \( \left\lbrack {a, b}\right\rbrack \) and differentiable on \( \left( {a, b}\right) \) . If \( f\left( a\right) = f\left( b\right) \), then there exists a point \( c \in \left( {a, b}\right) \) at which \( {f}^{\prime }... | Proof. By the Extreme Value Theorem, we know \( f \) attains a maximum and a minimum value on \( \left\lbrack {a, b}\right\rbrack \) . Let \( m \) be the minimum value and \( M \) the maximum value of \( f \) on \( \left\lbrack {a, b}\right\rbrack \) . If \( m = M = f\left( a\right) = f\left( b\right) \), then \( f\lef... | Yes |
Theorem 6.3.3 (Generalized Mean Value Theorem). Let \( a, b \in \mathbb{R} \) . If \( f \) and \( g \) are continuous on \( \left\lbrack {a, b}\right\rbrack \) and differentiable on \( \left( {a, b}\right) \), then there exists a point \( c \in \left( {a, b}\right) \) at which\n\n\[ \left( {f\left( b\right) - f\left( a... | Proof. Let\n\n\[ h\left( t\right) = \left( {f\left( b\right) - f\left( a\right) }\right) g\left( t\right) - \left( {g\left( b\right) - g\left( a\right) }\right) f\left( t\right) . \]\n\nThen \( h \) is continuous on \( \left\lbrack {a, b}\right\rbrack \) and differentiable on \( \left( {a, b}\right) \) . Moreover,\n\n\... | Yes |
Theorem 6.3.4 (Mean Value Theorem). Let \( a, b \in \mathbb{R} \) . If \( f \) is continuous on \( \left\lbrack {a, b}\right\rbrack \) and differentiable on \( \left( {a, b}\right) \), then there exists a point \( c \in \left( {a, b}\right) \) at which\n\n\[ f\left( b\right) - f\left( a\right) = \left( {b - a}\right) {... | Proof. Apply the previous result with \( g\left( x\right) = x \) .\n\nQ.E.D. | No |
Proposition 6.3.5. If \( f \) is differentiable on \( \left( {a, b}\right) \) and \( {f}^{\prime }\left( x\right) > 0 \) for all \( x \in \left( {a, b}\right) \) , then \( f \) is increasing on \( \left( {a, b}\right) \) . | Proof. Let \( x, y \in \left( {a, b}\right) \) with \( x < y \) . By the Mean Value Theorem, there exists a point \( c \in \left( {x, y}\right) \) such that\n\n\[ f\left( y\right) - f\left( x\right) = \left( {y - x}\right) {f}^{\prime }\left( c\right) . \]\n\nSince \( y - x > 0 \) and \( {f}^{\prime }\left( c\right) > ... | Yes |
Theorem 6.4.1 (Intermediate Value Theorem for Derivatives). Suppose \( f \) is differentiable on an open interval \( I, a, b \in I \), and \( a < b \) . If \( \lambda \in \mathbb{R} \) and either \( {f}^{\prime }\left( a\right) < \lambda < {f}^{\prime }\left( b\right) \) or \( {f}^{\prime }\left( a\right) > \lambda > {... | Proof. Suppose \( {f}^{\prime }\left( a\right) < \lambda < {f}^{\prime }\left( b\right) \) and define \( g : I \rightarrow \mathbb{R} \) by \( g\left( x\right) = f\left( x\right) - {\lambda x} \) . Then \( g \) is differentiable on \( I \), and so continuous on \( \left\lbrack {a, b}\right\rbrack \) . Let \( c \) be a ... | Yes |
Define \( \varphi : \left\lbrack {0,1}\right\rbrack \rightarrow \mathbb{R} \) by \( \varphi \left( x\right) = x\left( {{2x} - 1}\right) \left( {x - 1}\right) \) . Define \( \rho : \mathbb{R} \rightarrow \mathbb{R} \) by \( \rho \left( x\right) = 6{x}^{2} - {6x} + 1 \) . Then | \[ \varphi \left( x\right) = 2{x}^{3} - 3{x}^{2} + x \] so \( {\varphi }^{\prime }\left( x\right) = \rho \left( x\right) \) for all \( x \in \left( {0,1}\right) \) . Next define \( s : \mathbb{R} \rightarrow \mathbb{R} \) by \( s\left( x\right) = \varphi \left( {x-\lfloor x\rfloor }\right) \) . See Figure 6.4.1 for the... | Yes |
Theorem 6.5.1. Suppose \( a, b \in \mathbb{R}, f \) and \( g \) are differentiable on \( \left( {a, b}\right) ,{g}^{\prime }\left( x\right) \neq 0 \) for all \( x \in \left( {a, b}\right) \), and\n\n\[ \mathop{\lim }\limits_{{x \rightarrow {a}^{ + }}}\frac{{f}^{\prime }\left( x\right) }{{g}^{\prime }\left( x\right) } =... | Proof. Given \( \epsilon > 0 \), there exists \( \delta > 0 \) such that\n\n\[ \lambda - \frac{\epsilon }{2} < \frac{{f}^{\prime }\left( x\right) }{{g}^{\prime }\left( x\right) } < \lambda + \frac{\epsilon }{2} \]\n\n(6.5.3)\n\nwhenever \( x \in \left( {a, a + \delta }\right) \) . Now, by the Generalized Mean Value The... | Yes |
Theorem 6.6.1 (Taylor’s Theorem). Suppose \( f \in {C}^{\left( n\right) }\left( {a, b}\right) \) and \( {f}^{\left( n\right) } \) is differentiable on \( \left( {a, b}\right) \) . Let \( \alpha ,\beta \in \left( {a, b}\right) \) with \( \alpha \neq \beta \), and let\n\n\[ P\left( x\right) = f\left( \alpha \right) + {f}... | Proof. First note that \( {P}^{\left( k\right) }\left( \alpha \right) = {f}^{\left( k\right) }\left( \alpha \right) \) for \( k = 0,1,\ldots, n \) . Let\n\n\[ M = \frac{f\left( \beta \right) - P\left( \beta \right) }{{\left( \beta - \alpha \right) }^{n + 1}}. \]\n\n(6.6.3)\n\nThen\n\n\[ f\left( \beta \right) = P\left( ... | Yes |
Example 6.6.1. Let \( f\left( x\right) = \sqrt{x} \) . Then the 4th order Taylor polynomial for \( f \) at \( 1 \) is\n\n\[ P\left( x\right) = 1 + \frac{1}{2}\left( {x - 1}\right) - \frac{1}{8}{\left( x - 1\right) }^{2} + \frac{1}{16}{\left( x - 1\right) }^{3} - \frac{5}{128}{\left( x - 1\right) }^{4}. \] | By Taylor’s theorem, for any \( x > 0 \) there exists \( \gamma \) between 1 and \( x \) such that\n\n\[ \sqrt{x} = P\left( x\right) + \frac{105}{\left( {32}\right) \left( {5!}\right) {\gamma }^{\frac{9}{2}}}{\left( x - 1\right) }^{5} = P\left( x\right) + \frac{7}{{256}{\gamma }^{\frac{9}{2}}}{\left( x - 1\right) }^{5}... | Yes |
Lemma 7.1.1. Suppose \( {P}_{1} = \left\{ {{x}_{0},{x}_{1},\ldots ,{x}_{n}}\right\} \) is a partition of \( \left\lbrack {a, b}\right\rbrack, s \in \left( {a, b}\right) \) , \( s \notin {P}_{1} \), and \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is bounded. If \( {P}_{2} = {P}_{1} \cup \{ s\} \), ... | Proof. Suppose \( {x}_{i - 1} < s < {x}_{i} \) and let\n\n\[ \n{w}_{1} = \inf \left\{ {f\left( x\right) : {x}_{i - 1} \leq x \leq s}\right\} \]\n\n(7.1.6)\n\n\[ \n{W}_{1} = \sup \left\{ {f\left( x\right) : {x}_{i - 1} \leq x \leq s}\right\} \]\n\n(7.1.7)\n\n\[ \n{w}_{2} = \inf \left\{ {f\left( x\right) : s \leq x \leq ... | Yes |
Proposition 7.1.2. Suppose \( {P}_{1} \) and \( {P}_{2} \) are partitions of \( \left\lbrack {a, b}\right\rbrack \), with \( {P}_{2} \) a refinement of \( {P}_{1} \) . If \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is bounded, then \( L\left( {f,{P}_{1}}\right) \leq L\left( {f,{P}_{2}}\right) \) a... | Proof. The proposition follows immediately from repeated use of the previous lemma. | No |
Proposition 7.1.3. Suppose \( {P}_{1} \) and \( {P}_{2} \) are partitions of \( \left\lbrack {a, b}\right\rbrack \) . If \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is bounded, then \( L\left( {f,{P}_{1}}\right) \leq U\left( {f,{P}_{2}}\right) \) . | Proof. The result follows immediately from the definitions if \( {P}_{1} = {P}_{2} \) . Otherwise, let \( P \) be the common refinement of \( {P}_{1} \) and \( {P}_{2} \) . Then\n\n\[ L\left( {f,{P}_{1}}\right) \leq L\left( {f, P}\right) \leq U\left( {f, P}\right) \leq U\left( {f,{P}_{2}}\right) . \]\n\n(7.1.14)\n\nQ.E... | Yes |
Proposition 7.1.4. Suppose \( a < b \) and \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is bounded. Then\n\n\[{\int }_{a}^{b}f \leq {\bar{\int }}_{a}^{b}f\] | Proof. Let \( P \) be a partition of \( \left\lbrack {a, b}\right\rbrack \) . Then for any partition \( Q \) of \( \left\lbrack {a, b}\right\rbrack \), we have \( L\left( {f, Q}\right) \leq U\left( {f, P}\right) \) . Hence \( U\left( {f, P}\right) \) is an upper bound for any lower sum, and so\n\n\[{\int }_{a}^{b}f \le... | Yes |
Define \( f : \left\lbrack {0,1}\right\rbrack \rightarrow \mathbb{R} \) by\n\n\[ f\left( x\right) = \left\{ \begin{array}{ll} 1, & \text{ if }x \in \mathbb{Q}, \\ 0, & \text{ if }x \notin \mathbb{Q}. \end{array}\right. \]\n\nIs \( f \) integrable on \( \left\lbrack {0,1}\right\rbrack \)? | For any partition \( P = \left\{ {{x}_{0},{x}_{1},\ldots ,{x}_{n}}\right\} \), we have\n\n\[ L\left( {f, P}\right) = \mathop{\sum }\limits_{{i = 1}}^{n}0\left( {{x}_{i} - {x}_{i - 1}}\right) = 0 \]\n\nand\n\n\[ U\left( {f, P}\right) = \mathop{\sum }\limits_{{i = 1}}^{n}\left( {{x}_{i} - {x}_{i - 1}}\right) = {x}_{n} - ... | Yes |
Example 7.2.2. Let \( \alpha \in \mathbb{R}, a < b \), and define \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) by \( f\left( x\right) = \alpha \) for all \( x \in \left\lbrack {a, b}\right\rbrack \) . For any partition \( P = \left\{ {{x}_{0},{x}_{1},\ldots ,{x}_{n}}\right\} \), we have | \[ L\left( {f, P}\right) = \mathop{\sum }\limits_{{i = 1}}^{n}\alpha \left( {{x}_{i} - {x}_{i - 1}}\right) = \alpha \left( {{x}_{n} - {x}_{0}}\right) = \alpha \left( {b - a}\right) \] and \[ U\left( {f, P}\right) = \mathop{\sum }\limits_{{i = 1}}^{n}\alpha \left( {{x}_{i} - {x}_{i - 1}}\right) = \alpha \left( {{x}_{n} ... | Yes |
Theorem 7.2.1. Suppose \( a < b \) and \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is bounded. Then \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) if and only if for every \( \epsilon > 0 \) there exists a partition \( P \) of \( \left\lbrack {a, b}\right\rbrack \) such that\n\n\[... | Proof. If \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and \( \epsilon > 0 \), then we may choose partitions \( {P}_{1} \) and \( {P}_{2} \) such that\n\n\[ {\int }_{a}^{b}f - L\left( {f,{P}_{1}}\right) < \frac{\epsilon }{2} \]\n\n\( \left( {7.2.5}\right) \)\n\nand\n\n\[ U\left( {f,{P}_{2}}\right) - ... | Yes |
Example 7.2.3. Suppose \( f : \left\lbrack {0,1}\right\rbrack \rightarrow \mathbb{R} \) is defined by\n\n\[ f\left( x\right) = \left\{ \begin{array}{ll} 0, & \text{ if }x \neq \frac{1}{2} \\ 1, & \text{ if }x = \frac{1}{2} \end{array}\right. \]\n\nIf \( P \) is a partition of \( \left\lbrack {0,1}\right\rbrack \), then... | Given \( \epsilon > 0 \), let\n\n\[ P = \left\{ {0,\frac{1}{2} - \frac{\epsilon }{4},\frac{1}{2} + \frac{\epsilon }{4},1}\right\} \]\n\nThen\n\n\[ U\left( {f, P}\right) = \left( {\frac{1}{2} + \frac{\epsilon }{4}}\right) - \left( {\frac{1}{2} - \frac{\epsilon }{4}}\right) = \frac{\epsilon }{2} < \epsilon .\n\nHence \( ... | Yes |
Proposition 7.3.1. If \( a < b \) and \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is monotonic, then \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) . | Proof. Suppose \( f \) is nondecreasing. Given \( \epsilon > 0 \), let \( n \in {Z}^{ + } \) be large enough\n\nthat\n\[ \frac{\left( {f\left( b\right) - f\left( a\right) }\right) \left( {b - a}\right) }{n} < \epsilon . \]\n\n(7.3.1)\n\nFor \( i = 0,1,\ldots, n \), let\n\[ {x}_{i} = a + \frac{\left( {b - a}\right) i}{n... | Yes |
Proposition 7.3.2. If \( a < b \) and \( f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is continuous, then \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) . | Proof. Given \( \epsilon > 0 \), let\n\n\[ \gamma = \frac{\epsilon }{b - a} \]\n\n\( \left( {7.3.4}\right) \)\n\nSince \( f \) is uniformly continuous on \( \left\lbrack {a, b}\right\rbrack \), we may choose \( \delta > 0 \) such that\n\n\[ \left| {f\left( x\right) - f\left( y\right) }\right| < \gamma \]\n\n\( \left( {... | Yes |
Proposition 7.4.2. Suppose \( f \) and \( g \) are both integrable on \( \left\lbrack {a, b}\right\rbrack \) . Then \( f + g \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and\n\n\[{\int }_{a}^{b}\left( {f + g}\right) = {\int }_{a}^{b}f + {\int }_{a}^{b}g.\] | Proof. Given \( \epsilon > 0 \), let \( {P}_{1} \) and \( {P}_{2} \) be partitions of \( \left\lbrack {a, b}\right\rbrack \) with\n\n\[U\left( {f,{P}_{1}}\right) - L\left( {f,{P}_{1}}\right) < \frac{\epsilon }{2}\]\n\nand\n\n\[U\left( {g,{P}_{2}}\right) - L\left( {g,{P}_{2}}\right) < \frac{\epsilon }{2}.\]\n\nLet \( P ... | Yes |
Proposition 7.4.3. If \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and \( \alpha \in \mathbb{R} \), then \( {\alpha f} \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and\n\n\[{\int }_{a}^{b}{\alpha f} = \alpha {\int }_{a}^{b}f\] | Exercise 7.4.5. Prove the previous proposition. | No |
Proposition 7.4.4. Suppose \( a < b, f : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is bounded, and \( c \in \left( {a, b}\right) \) . Then \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) if and only if \( f \) is integrable on both \( \left\lbrack {a, c}\right\rbrack \) and \( \left\lbr... | Proof. Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) . Given \( \epsilon > 0 \), let \( Q \) be a partition of \( \left\lbrack {a, b}\right\rbrack \) such that\n\n\[ U\left( {f, Q}\right) - L\left( {f, Q}\right) < \epsilon . \]\n\n\( \left( {7.4.13}\right) \)\n\nLet \( P = Q \cup \{ c\} ,{P}_{... | Yes |
Proposition 7.4.5. Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and \( c \in \left( {a, b}\right) \) . Then\n\n\[{\int }_{a}^{b}f = {\int }_{a}^{c}f + {\int }_{c}^{b}f\] | Proof. If \( P \) and \( Q \) are partitions of \( \left\lbrack {a, c}\right\rbrack \) and \( \left\lbrack {c, b}\right\rbrack \), respectively, then\n\n\[U\left( {f, P}\right) + U\left( {f, Q}\right) = U\left( {f, P \cup Q}\right) \geq {\int }_{a}^{b}f.\]\n\n(7.4.21)\n\nThus\n\n\[U\left( {f, P}\right) \geq {\int }_{a}... | Yes |
Proposition 7.4.6. If \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) with \( f\left( x\right) \geq 0 \) for all \( x \in \left\lbrack {a, b}\right\rbrack \) , then \[ {\int }_{a}^{b}f \geq 0 \] | Proof. The result follows from the fact that \( L\left( {f, P}\right) \geq 0 \) for any partition \( P \) of \( \left\lbrack {a, b}\right\rbrack \) . Q.E.D. | Yes |
Proposition 7.4.7. Suppose \( f \) and \( g \) are both integrable on \( \left\lbrack {a, b}\right\rbrack \) . If, for all \( x \in \left\lbrack {a, b}\right\rbrack, f\left( x\right) \leq g\left( x\right) \), then\n\n\[{\int }_{a}^{b}f \leq {\int }_{a}^{b}g.\] | Proof. Since \( g\left( x\right) - f\left( x\right) \geq 0 \) for all \( x \in \left\lbrack {a, b}\right\rbrack \), we have, using Propositions 7.4.2, 7.4.3, and 7.4.6,\n\n\[{\int }_{a}^{b}g - {\int }_{a}^{b}f = {\int }_{a}^{b}\left( {g - f}\right) \geq 0.\]\n\n(7.4.36) | Yes |
Proposition 7.4.8. Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack, m \in \mathbb{R}, M \in \mathbb{R} \), and \( m \leq f\left( x\right) \leq M \) for all \( x \in \left\lbrack {a, b}\right\rbrack \) . Then\n\n\[ m\left( {b - a}\right) \leq {\int }_{a}^{b}f \leq M\left( {b - a}\right) . \] | Proof. It follows from the previous proposition that\n\n\[ m\left( {b - a}\right) = {\int }_{a}^{b}{mdx} \leq {\int }_{a}^{b}f\left( x\right) {dx} \leq {\int }_{a}^{b}{Mdx} = M\left( {b - a}\right) . \]\n\n(7.4.38)\n\nQ.E.D. | Yes |
Proposition 7.4.9. Suppose \( g \) is integrable on \( \left\lbrack {a, b}\right\rbrack, g\left( \left\lbrack {a, b}\right\rbrack \right) \subset \left\lbrack {c, d}\right\rbrack \), and \( f : \left\lbrack {c, d}\right\rbrack \rightarrow \mathbb{R} \) is continuous. If \( h = f \circ g \), then \( h \) is integrable o... | Proof. Let \( \epsilon > 0 \) be given. Let\n\n\[ K > \sup \{ f\left( x\right) : x \in \left\lbrack {c, d}\right\rbrack \} - \inf \{ f\left( x\right) : x \in \left\lbrack {c, d}\right\rbrack \}\]\n\n(7.4.39)\n\nand choose \( \delta > 0 \) so that \( \delta < \epsilon \) and\n\n\[ \left| {f\left( x\right) - f\left( y\ri... | Yes |
Proposition 7.4.10. Suppose \( f \) and \( g \) are both integrable on \( \left\lbrack {a, b}\right\rbrack \) . Then \( {fg} \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) . | Proof. Since \( f \) and \( g \) are both integrable, both \( f + g \) and \( f - g \) are integrable. Hence, by the previous proposition, both \( {\left( f + g\right) }^{2} \) and \( {\left( f - g\right) }^{2} \) are integrable.\n\nThus\n\[ \frac{1}{4}\left( {{\left( f + g\right) }^{2} - {\left( f - g\right) }^{2})}\r... | Yes |
Proposition 7.4.11. Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) . Then \( \left| f\right| \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and\n\n\[ \left| {{\int }_{a}^{b}f}\right| \leq {\int }_{a}^{b}\left| f\right| \] | Proof. The integrability of \( \left| f\right| \) follows from the integrability of \( f \), the continuity of \( g\left( x\right) = \left| x\right| \), and Proposition 7.4.9. For the inequality, note that\n\n\[ - \left| {f\left( x\right) }\right| \leq f\left( x\right) \leq \left| {f\left( x\right) }\right| \]\n\nfor a... | Yes |
Theorem 7.5.1 (Fundamental Theorem of Calculus). Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) . If \( F \) is continuous on \( \left\lbrack {a, b}\right\rbrack \) and differentiable on \( \left( {a, b}\right) \) with \( {F}^{\prime }\left( x\right) = f\left( x\right) \) for all \( x \in \left... | Proof. Given \( \epsilon > 0 \), let \( P = \left\{ {{x}_{0},{x}_{1},\ldots ,{x}_{n}}\right\} \) be a partition of \( \left\lbrack {a, b}\right\rbrack \) for which\n\n\[U\left( {f, P}\right) - L\left( {f, P}\right) < \epsilon .\](7.5.2)\n\nFor \( i = 1,2,\ldots, n \), let \( {t}_{i} \in \left( {{x}_{i - 1},{x}_{i}}\rig... | Yes |
Proposition 7.5.2 (Integration by parts). Suppose \( f \) and \( g \) are integrable on \( \left\lbrack {a, b}\right\rbrack \) . If \( F \) and \( G \) are continuous on \( \left\lbrack {a, b}\right\rbrack \) and differentiable on \( \left( {a, b}\right) \) with \( {F}^{\prime }\left( x\right) = f\left( x\right) \) and... | Proof. By the Fundamental Theorem of Calculus,\n\n\[ \n{\int }_{a}^{b}\left( {F\left( x\right) g\left( x\right) + f\left( x\right) G\left( x\right) }\right) {dx} = F\left( b\right) G\left( b\right) - F\left( a\right) G\left( a\right) .\n\] | Yes |
Proposition 7.5.3. Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and \( F : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is defined by\n\n\[ F\left( x\right) = {\int }_{a}^{x}f\left( t\right) {dt} \]\n\nThen \( F \) is uniformly continuous on \( \left\lbrack {a, b}\right\rbrack \... | Proof. Let \( \epsilon > 0 \) be given and let \( M > 0 \) be such that \( \left| {f\left( x\right) }\right| \leq M \) for all \( x \in \left\lbrack {a, b}\right\rbrack \) . Then for any \( x, y \in \left\lbrack {a, b}\right\rbrack \) with \( x < y \) and \( y - x < \frac{\epsilon }{M} \) ,\n\n\[ \left| {F\left( y\righ... | Yes |
Theorem 7.5.4. Suppose \( f \) is integrable on \( \left\lbrack {a, b}\right\rbrack \) and continuous at \( u \in \left( {a, b}\right) \) . If \( F : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) is defined by\n\n\[ F\left( x\right) = {\int }_{a}^{x}f\left( t\right) {dt} \]\n\nthen \( F \) is differentiabl... | Proof. Let \( \epsilon > 0 \) be given and choose \( \delta > 0 \) such that \( \left| {f\left( x\right) - f\left( u\right) }\right| < \epsilon \) whenever \( \left| {x - u}\right| < \delta \) . Then if \( 0 < h < \delta \), we have\n\n\[ \left| {\frac{F\left( {u + h}\right) - F\left( u\right) }{h} - f\left( u\right) }... | Yes |
Proposition 7.5.5. If \( a < b \) and \( f \) is continuous on \( \left\lbrack {a, b}\right\rbrack \), then there exists a function \( F : \left\lbrack {a, b}\right\rbrack \rightarrow \mathbb{R} \) which is continuous on \( \left\lbrack {a, b}\right\rbrack \) with \( {F}^{\prime }\left( x\right) = f\left( x\right) \) f... | Proof. Let\n\n\[ F\left( x\right) = {\int }_{a}^{x}f\left( t\right) {dt}. \]\n\n(7.5.16)\n\nQ.E.D. | Yes |
Proposition 7.5.6 (Integration by substitution). Suppose \( I \) is an open interval, \( \varphi : I \rightarrow \mathbb{R}, a < b,\left\lbrack {a, b}\right\rbrack \subset I \), and \( {\varphi }^{\prime } \) is continuous on \( \left\lbrack {a, b}\right\rbrack \) . If \( f : \varphi \left( \left\lbrack {a, b}\right\rb... | Proof. If \( m \) and \( M \) are the minimum and maximum values, respectively, of \( \varphi \) on \( \left\lbrack {a, b}\right\rbrack \), then \( \varphi \left( \left\lbrack {a, b}\right\rbrack \right) = \left\lbrack {m, M}\right\rbrack \) . If \( m = M \), then \( \varphi \left( x\right) = m \) for all \( x \in \lef... | Yes |
Theorem 7.6.1 (Taylor’s Theorem). Suppose \( f \in {C}^{\left( n + 1\right) }\left( {a, b}\right) ,\alpha \in \left( {a, b}\right) \), and\n\n\[ \n{P}_{n}\left( x\right) = \mathop{\sum }\limits_{{k = 0}}^{n}\frac{{f}^{\left( k\right) }\left( \alpha \right) }{k!}{\left( x - \alpha \right) }^{k}.\n\]\n\n(7.6.1)\n\nThen, ... | Proof. By the Fundamental Theorem of Calculus, we have\n\n\[ \n{\int }_{\alpha }^{x}{f}^{\prime }\left( t\right) {dt} = f\left( x\right) - f\left( \alpha \right)\n\]\n\n(7.6.3)\n\nwhich implies that\n\n\[ \nf\left( x\right) = f\left( \alpha \right) + {\int }_{\alpha }^{x}{f}^{\prime }\left( t\right) {dt}.\n\]\n\n(7.6.4... | Yes |
Proposition 7.7.1. Suppose \( f \) is continuous on \( \lbrack a,\infty ) \) and \( f\left( x\right) \geq 0 \) for all \( x \geq a \) . If there exists \( g : \lbrack a, + \infty ) \rightarrow \mathbb{R} \) for which\n\n\[ \n{\int }_{a}^{+\infty }g\left( x\right) {dx} \n\]\n\n\( \left( {7.7.5}\right) \)\n\nexists and \... | Exercise 7.7.1. Prove the preceding proposition. | No |
Suppose\n\n\[ f\left( x\right) = \frac{1}{1 + {x}^{2}} \]\n\nand\n\n\[ g\left( x\right) = \left\{ \begin{array}{ll} 1, & \text{ if }0 \leq x < 1 \\ \frac{1}{{x}^{2}}, & \text{ if }x \geq 1 \end{array}\right. \]\n\nThen, for \( b > 1 \) ,\n\n\[ {\int }_{0}^{b}g\left( x\right) {dx} = {\int }_{0}^{1}{dx} + {\int }_{1}^{b}... | Also, the substitution \( u = - x \) shows that\n\n\[ {\int }_{-\infty }^{0}\frac{1}{1 + {x}^{2}}{dx} = - {\int }_{+\infty }^{0}\frac{1}{1 + {u}^{2}}{du} = {\int }_{0}^{+\infty }\frac{1}{1 + {u}^{2}}{du}. \] | Yes |
Proposition 8.1.1. The arctangent function is differentiable at every \( x \in \mathbb{R} \) . Moreover, if \( f\left( x\right) = \arctan \left( x\right) \), then\n\n\[ \n{f}^{\prime }\left( x\right) = \frac{1}{1 + {x}^{2}}. \n\] | Proof. The result follows immediately from Theorem 7.5.4.\n\nQ.E.D. | No |
Proposition 8.1.2. The arctangent is increasing on \( \mathbb{R} \) . | Proof. The result follows immediately from the previous proposition and the fact that\n\n\[ \frac{1}{1 + {x}^{2}} > 0 \]\n\nfor every \( x \in \mathbb{R} \) .\n\nQ.E.D. | Yes |
Proposition 8.1.3. For any \( x \in \mathbb{R} \) , \( \arctan \left( x\right) = - \arctan \left( {-x}\right) \) . | Proof. Using the substitution \( t = - u \), we have\n\n\[\n\arctan \left( x\right) = {\int }_{0}^{x}\frac{1}{1 + {t}^{2}}{dt} = - {\int }_{0}^{-x}\frac{1}{1 + {u}^{2}}{du} = - \arctan \left( {-x}\right) .\n\]\n\n(8.1.4)\n\nQ.E.D. | Yes |
Proposition 8.1.4. If \( x > 0 \), then\n\n\[ \arctan \left( x\right) + \arctan \left( \frac{1}{x}\right) = \frac{\pi }{2}. \]\n\n(8.1.6) | Proof. Using the substitution \( t = \frac{1}{u} \), we have\n\n\[ \arctan \left( \frac{1}{x}\right) = {\int }_{0}^{\frac{1}{x}}\frac{1}{1 + {t}^{2}}{dt} \]\n\n\[ = {\int }_{+\infty }^{x}\frac{1}{1 + \frac{1}{{u}^{2}}}\left( {-\frac{1}{{u}^{2}}}\right) {du} \]\n\n\[ = - {\int }_{+\infty }^{x}\frac{1}{1 + {u}^{2}}{du} \... | Yes |
Proposition 8.1.5. If \( x < 0 \), then\n\n\[ \arctan \left( x\right) + \arctan \left( \frac{1}{x}\right) = - \frac{\pi }{2}. \] | Proof. The result follows immediately from the preceding proposition and the fact that arctangent is an odd function. Q.E.D. | No |
Proposition 8.2.1. The tangent function has domain \( D \) (as defined above), range \( \mathbb{R} \), and is differentiable at every point \( x \in D \) . Moreover, the tangent function is increasing on each interval of the form\n\n\[ \left( {-\frac{\pi }{2} + {n\pi },\frac{\pi }{2} + {n\pi }}\right) \]\n\n\( n \in \m... | Proof. These results follow immediately from our definitions.\n\nQ.E.D. | No |
Proposition 8.2.2. The tangent function has period \( \pi \) . | Proof. The result follows immediately from our definitions.\n\nQ.E.D. | No |
Proposition 8.3.1. The sine and cosine functions are continuous on \( \mathbb{R} \) . | Proof. From the definitions, it is sufficient to verify continuity at \( \frac{3\pi }{2} \) . Now\n\n\[ \mathop{\lim }\limits_{{x \rightarrow {\frac{3\pi }{2}}^{ - }}}\sin \left( x\right) = \mathop{\lim }\limits_{{x \rightarrow {\frac{3\pi }{2}}^{ - }}}S\left( x\right) = S\left( \frac{3\pi }{2}\right) = - s\left( \frac... | No |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.