Math 117: Continuity of Functions
|
|
- Rebecca Alexander
- 6 years ago
- Views:
Transcription
1 Math 117: Continuity of Functions John Douglas Moore November 21, 2008 We finally get to the topic of ɛ δ proofs, which in some sense is the goal of the course. It may appear somewhat laborious to use such proofs to prove facts about real-valued functions of one variable, facts that appear to be true from an intuitive perspective. But the techniques developed can be used for far more complicated problems, for which the resolution is by no means self-evident. The reader should focus first on learning the definitions of limits and continuity. Several propositions will illustrate how these definitions can be used in mathematical arguments. Then focus on the main theorems, the Intermediate Value Theorem and the Compactness Theorem. 1 Limits of functions Definition Let D R and let c be an accumulation point of D. A real number L is a limit of the function f : D R at c if for every ɛ > 0 there exists δ > 0 such that x D and 0 < x c < δ f(x) L < ɛ. (1) If it exists, the limit L is unique and we write lim x c f(x) = L. Example. Suppose that f : R R is the function defined by { 2x sin(1/x), if x 0, f(x) = 5, if x = 0, and take c = 0. Then given ɛ > 0 we can let δ = ɛ/2, and 0 < x 0 < δ f(x) 0 = 2 x sin(1/x) 2 x < 2δ = ɛ, so lim x 0 f(x) = 0. Note that the limit does not depend on the value of f at 0. Although the above definition is very useful for proving theorems, it should be remarked that for a given choice of ɛ > 0 it is not always easy to find a δ > 0 that works in (1). (The text [2] provides several examples.) 1
2 Proposition. Let D R and let c be an accumulation point of D. Then lim x c f(x) = L if and only if for every sequence (s n ) of elements of D such that s n s which converges to c, the sequence (f(s n )) converges to L. Proof: Suppose that lim x c f(x) = L and let ɛ > 0 be given. then there exists δ > 0 such that x D and 0 < x c < δ f(x) L < ɛ. If (s n ) is a sequence of elements of D such that s n s which converges to c, then there exists N N such that But then n > N 0 < s n s < δ. n > N 0 < f(s n ) L < ɛ, and (f(s n )) converges to L. Conversely, suppose that L is not a limit of f(x) at c. Then there exists an ɛ > 0 such that for every δ > 0, there is an element x D with 0 < x c < δ and f(x) L ɛ. Then since s is an accumulation point of D, for each n N, we can choose s n D {s} so that 0 < s n c < 1/n and f(s n ) L > ɛ. Then (s n ) is a sequence of elements of D such that s n s which converges to c, but (f(s n )) does not converge to L. Example. Suppose that f : R R is the function defined by { sin(1/x), if x 0, f(x) = 0, if x = 0, and let s n = 2/(nπ). Then s n 0 for n N and the sequence (s n ) converges to zero. Moreover, 1, if s = 1, 5, 9,..., 0, if s = 2, 6, 10,..., f(s n ) = sin(nπ/2) = 1, if s = 3, 7, 11,..., 0, if s = 4, 8, 12,.... We conclude that (f(s n ) does not converge. Thus it follows from the preceding proposition that the function f does not have a limit at c = 0. The previous proposition can be used to translate many properties of convergence of sequences to convergence of functions. Proposition. Suppose that c is an accumulation point of D R. Suppose that f : D R and g : D R are functions such that lim x c f(x) = L and lim x c g(x) = M. Then 1. lim x c (f(x) + g(x)) = L + M, 2
3 2. lim x c (f(x)g(x)) = LM, 3. if g(x) 0 for x D and M 0, then lim x c (f(x)/g(x)) = L/M. This follows from the corresponding proposition on limits of sequences. 2 Continuous functions We now come to what is arguably the most important definition in the course: Definition Let D R and let c be an element of D. A function f : D R is continuous at c if for every ɛ > 0 there exists δ > 0 such that x D and x c < δ f(x) f(c) < ɛ. We say that a function f : D R is continuous if it is continuous at every point c D. Example. We claim that the function f : R R defined by f(x) = 3x is continuous at every point c R. Indeed, suppose c R. If ɛ > 0 is given, we let δ = ɛ/3. Then x c < δ f(x) = f(c) = 3x 3c = 3 x c < 3δ = ɛ. In other words, and f is continuous at c. x c < δ f(x) = f(c) < ɛ, Example. We claim that the function f : R R defined by { 1, if x Q, f(x) = 0, if x R Q. is not continuous at any point c R. Indeed, let c R be a given point. Given any δ > 0, there are both rational and irrational points x (c δ, c+δ), that is there are points x, y (c δ, c+δ) such that f(x) = 1 and f(y) = 0. It follows that there is no δ > 0 such that f(x) f(c) < 1 2 for all x (c δ, c + δ). Proposition. Suppose that f : D R where D R and c D. Then f is continuous at c if and only if it satisfies the following condition: If (x n ) is any sequence in D which converges to c, then (f(x n )) converges to f(c). Proof: Suppose that f is continuous at c and that ɛ > 0 is given. Then there exists δ > 0 such that x D and x c < δ f(x) f(c) < ɛ. 3
4 Suppose now that (x n ) is any sequence in D which converges to c. Then there is N N such that n > N implies that x n c < δ. But then n > N f(x n ) f(c) < ɛ. Hence (f(x n )) converges to f(c). Suppose that f is not continuous at c. Then there exists an ɛ > 0 such that it is not the case that x D and x c < 1 n f(x) f(c) < ɛ. Choose x n D such that x n c < 1/n and f(x n ) f(c) > ɛ. Then (x n ) converges to c but (f(x n )) does not converge to f(c). The preceding proposition allows us to transport many results regarding limits to continuous functions. Thus we obtain: Proposition. If f : D R and g : D R are continuous functions so is the sum f + g and the product fg. Moreover, if g(x) 0 for xind, then (f/g) : D R is a continuous function. This proposition allows us to build up many new continuous functions from old. Thus starting with the fact that the constant function is continuous and the function f(x) = x is continuous, we can conclude that any polynomial is continuous, for example. 3 Intermediate Value Theorem Intermediate Value Theorem. Suppose that f : [a, b] R is continuous and f(a) < 0 < f(b). Then there exists c (a, b) such that f(c) = 0. Proof: Let S = {x [a, b] : f(x) 0}. Then S is nonempty and bounded above, so S has a supremum c by the completeness axiom of the real numbers. Moreover, since a S, c a while clearly c b. The idea behind the proof is to show that f(c) = 0, from which it follows that c (a, b). If f(c) < 0, we can suppose that f(c) = y, where y < 0. Let ɛ = y. Then there exists δ > 0 such that x [a, b] and x c < δ f(x) f(c) < ɛ f(x) < 0. It follows that there is a point y (c, b] N(c; δ) such that f(y) < 0 and c is not the supremum of S, a contradiction. Thus f(c) 0. Similarly, if f(c) > 0, we can suppose that f(c) = y, where y > 0. Let ɛ = y. Then there exists δ > 0 such that x [a, b] and x c < δ f(x) f(c) < ɛ f(x) > 0. 4
5 It follows that if x [a, c) N(c; δ), then f(x) > 0 and hence any point of [a, c) N(c; δ) is an upper bound of S and c is not the supremum of S, a contradiction once again. Thus f(c) 0. This theorem often allows us to construct the solutions to equations. Thus, for example, suppose that we know that the function f(x) = e x is continuous and let g(x) = 4x, also a continuous function. If we want to find a solution to the equation e x = 4x, it suffices to show that the continuous function g(x) f(x) = 4x e x has a zero. But g(0) f(0) = 0 1 = 1 < 0, g(1) f(1) = 4 e > 0, so it follows from the Intermediate Value Theorem that there exists c [0, 1] such that g(c) f(c) = 0. This c is a solution to e x = 4x. 4 Maximum values of continuous functions There is an important criterion for continuity which is expressed in terms of open sets. Suppose that D is a subset of R. A subset V of D is said to be open if V = W D, where W is open in R. Proposition. A function f : D R is continuous if and only if whenever U is an open subset of R, f 1 (U) is an open subset of D. Proof: Suppose that c f 1 (U). Then f(c) U and since U is open, N(f(c); ɛ) U for some ɛ > 0. Since f is continuous, there exists δ c > 0 such that x c < δ c f(x) f(c) < ɛ. In other words, f(n(c; δ c ) D) N(f(c); ɛ). Let W = {N(c, δ c ) : c f 1 (U)}, V = Ṽ D. Since W is the union of open sets, it is open, and hence V = f 1 (U) is an open subset of D. Conversely, if f satisfies the condtion that f 1 (U) is an open subset of D whenever U is an open subset of R, then given c D and ɛ > 0, the set N(f(c); ɛ) is open in R. Thus f 1 (N(f(c); ɛ)) is open in D and hence f 1 (N(f(c); ɛ)) = Ṽ, where Ṽ is open in R. Since c Ṽ, there exists δ > 0 such that N(c : δ) Ṽ. But then x D and x c < δ f(x) f(c) < ɛ, and hence f is continuous. The definition of compactness in terms of open covers and the open set criterion for continuity of functions allows us to provide an efficient proof of existence of maxima and minima in many cases. 5
6 Compactness Theorem. If K is a compact subset of R and f : K R is a continuous function, then f(k) is compact. Proof: Suppose that F = {U α : α A} is an open cover of f(k). For each U α, there is an open subset V α R such that V α K = f 1 (U α ). We then have K {V α : α A}, so that {V α : α A} is an open cover of K. Since K is compact, there exists a finite subcover {V α1,..., V αn }; in other words, But then K V α1 V αn. f(k) f(v α1 ) f(v αn ) U α1 U αn. So {U α1,..., U αn } is a finite subcover of F. Since F was an arbitrary open cover, we have shown that ANY open cover of f(k) has a finite subcover, so f(k) is indeed compact, as needed. Corollary. Suppose that K is a compact subset of R and f : K R is a continuous function. Then f assumes its maximum and minimum values on K. Proof: We prove only that f assumes its maximum value; the proof that it assumes its minimum is similar. By the previous theorem, f(k) is compact and therefore closed and bounded by the Heine-Borel Theorem. Let S = f(k) and let m be the least upper bound of S, which exists by the Completeness Axiom for real numbers. It suffices to show that m S. If m / S, then for any ɛ > 0 there exists and element s S such that m ɛ < s < m, because otherwise m ɛ would be an upper bound, contradicting the fact that m is the least upper bound. Thus m is an accumulation point of S. But since S is closed it contains all of its accumulation points. Therefore m S. Thus m is a maximum for S and f achieves its maximum value on K. 5 Uniform continuity Definition Let D R and let c be an element of D. A function f : D R is uniformly continuous if for every ɛ > 0 there exists δ > 0 such that x, y D and x y < δ f(x) f(y) < ɛ. The key point is that δ does not depend upon the points x or y within D. 6
7 For example, the function f : R R defined by f(x) = 2x is uniformly continuous, because given ɛ > 0, we can set δ = (/2)ɛ and x y < δ 2x 2y < 2δ = ɛ f(x) f(y) < ɛ. On the other hand, suppose f : (0, ) R by f(x) = 1/x. Then f(x) f(c) = 1 x 1 c = 1 xc (c x) f(x) f(c) = 1 xc c x. Suppose that we have chosen a δ > 0 such that x c < δ f(x) f(c) < ɛ, (2) and take x = c δ/2. Then 1 xc 1 c 2 f(x) f(c) 1 c 2 c x, so x c c2 f(x) f(c). Thus in order to achieve (2), we must take δ c 2 ɛ. As c 0, the δ > 0 we must choose 0, so there is no δ > 0 which works for all choices of c (0, ). In other words, f : (0, ) R is continuous, but not uniformly continuous in this case. The open cover definition of compactness makes the following theorem easy to prove: Uniform Continuity Theorem. If K is a compact subset of R and f : K R is a continuous function, then f is uniformly continuous. Proof (following [1]): The proof is based upon the ɛ/2 trick. Suppose that ɛ > 0 is given. Since f is continuous, for each x K there exists δ x > 0 such that For each x K, let Then y x < δ x 2 U x = f(y) f(x) < ɛ 2. ( x δ x 2, x + δ ) x. 2 U = {U x : x K} is an open cover of K. By compactness of K, this cover has a finite subcover, ( K U x1 U x2 U xk, U xi = x i δ x i 2, x i + δ ) x i. 2 Let δ = (1/2) min(δ x1,..., δ xk ). Suppose now that x, y D and x y < δ. Then for some i {1,..., k}, Thus x x i < δ x i 2, y x i < y x + x x i < δ x i 2 + δ x i 2 = δ x i. f(x) f(y) f(x) f(x i ) + f(x i ) f(x) < ɛ 2 + ɛ 2 = ɛ. This shows that f is indeed uniformly continuous. 7
8 6 Continuity of functions on metric spaces The preceding theory can be generalized with very little work to metric spaces. Definition Suppose that (X 1, d 1 ) and (X 2, d 2 ) are metric spaces. A function f : X 1 X 2 is continuous if for every c X 1 and every ɛ > 0 there exists a δ c > 0 such that We can then (3) as x X 1 and d 1 (x, c) < δ c d 2 (f(x), f(c)) < ɛ. (3) x N(x; δ c ) f(x) N(f(c); ɛ). (4) A function f : X 1 X 2 is uniformly continuous if for every ɛ > 0 there exists a δ > 0 such that x, y X 1 and d 1 (x, y) < δ d 2 (f(x), f(y)) < ɛ. Proposition. If (X 1, d 1 ) and (X 2, d 2 ) are metric spaces, then a function f : X 1 X 2 is continuous if and only if whenever U is an open subset of X 2, f 1 (U) is an open subset of X 1. The proof is very similar to the special case presented before. Suppose that c f 1 (U). Then f(c) U and since U is open, N(f(c); ɛ) U for some ɛ > 0. Since f is continuous, there exists δ c > 0 such that (4) holds; thus f(n(c; δ c )) N(f(c); ɛ). Let V = {N(c; δ c ) : c f 1 (U)}. Then V = f 1 (U), and since V is the union of open sets, it is open. Conversely, if f satisfies the condtion that f 1 (U) is an open subset of X 1 whenever U is an open subset of X 2, then given c X 1 and ɛ > 0, the set N(f(c); ɛ) is open in X 2. Thus f 1 (N(f(c); ɛ)) is open in X 2 and since c f 1 (N(f(c); ɛ)), there exists δ > 0 such that N(c : δ) f 1 (N(f(c); ɛ)). But then x N(c; δ) f(x) N(f(c); ɛ), and hence f is continuous. Main Theorem. If (X 1, d 1 ) and (X 2, d 2 ) are metric spaces, f : X 1 X 2 is a continuous function and K is a compact subset of X 1, then f(k) is compact. Once again, the proof is almost identical to the previous special case. Suppose that F = {U α : α A} is an open cover of f(k). For each U α, there is an open subset V α X 1 such that V α K = f 1 (U α ). We then have K {V α : α A}. 8
9 In other words, {V α : α A} is an open cover of K. Since K is compact, there exists a finite subcover {V α1,..., V αn }; in other words, But then K V α1 V αn. f(k) f(v α1 ) f(v αn ) U α1 U αn. So {U α1,..., U αn } is a finite subcover of F. Since F was an arbitrary open cover, we have shown that ANY open cover of f(k) has a finite subcover, so f(k) is indeed compact, as needed. Corollary. Suppose that (X, d) is a metric space and f : X R is a continuous function. If K is a compact subset of X, then f assumes its maximum and minimum values on K. Proof: Once again, we prove only that f assumes its maximum value. By the previous theorem, f(k) is compact and therefore closed and bounded by the Heine-Borel Theorem. Let S = f(k) and let m be the least upper bound of S, which exists by the completeness axiom for real numbers. It suffices to show that m S. If m / S, then for any ɛ > 0 there exists and element s S such that m ɛ < s < m, because otherwise m ɛ would be an upper bound, contradicting the fact that m is the least upper bound. Thus m is an accumulation point of S. But since S is closed it contains all of its accumulation points. Therefore m S. Thus m is a maximum for S and f achieves its maximum value on K. 7 Spaces of functions* Much of the preceding theory can be extended to metric spaces whose elements are functions. We now give an important example of such a metric space. Let and define X = C([a, b], R) = {f : [a, b] R : f is continuous }, d : C([a, b], R) C([a, b], R) R by d(f, g) = sup{ f(x) g(x) : x [a, b]}. The supremum exists by the corollary in the preceding section. It is straightforward to check that this distance function satisfies the axioms for a metric space. Using this example, we can apply many of the techniques that we have learned for dealing with the real numbers to spaces of functions. This leads to an important subject functional analysis that plays a key role in proving existence of solutions to differential equations. Definition A metric space (X, d) is complete if every Cauchy sequence in X converges to a point of X. 9
10 For example, R n is complete. The following theorem says that C([a, b], R) is also complete: Completeness Theorem. Every Cauchy sequence in C([a, b], R) converges in C([a, b], R). The idea behind the proof is simple. One imagines that (f n ) is a Cauchy sequence in C([a, b], R). Then if x [a, b], (f n (x)) is a Cauchy sequence in R and by the Cauchy Sequence Theorem, this sequence must converge to a limit, which we call f(x). This defines a function f : [a, b] R. One must then check that this function is continuous and that it is the limit of the sequence (f n ) within C([a, b], R). Suppose that ɛ > 0 is given. Then there exists N N such that m, n > N d(f m, f n ) < ɛ 2. If x [a, b], there exists N x N such that N x N and But then m > N x f m (x) f(x) < ɛ 2. n > N f n (x) f(x) f n (x) f m (x) + f m (x) f(x) < ɛ 2 + ɛ 2 = ɛ. Since this holds for every x [a, b], we see that (f n ) converges to f within C([a, b], R). To prove that f is continuous, we suppose that c [a, b] and ɛ > 0 is given. Then since (f n ) converges to f, there exists N N such that n > N f n (x) f(x) < ɛ, for all x [a, b]. 3 Since f n is continuous, there exists δ > 0 such that But then x c < δ f(x) f(c) x c < δ f n (x) f n (c) < ɛ 3. < f(x) f n (x) + f n (x) f n (c) + f n (c) f(c) < ɛ 3 + ɛ 3 + ɛ 3 = ɛ. This shows that f is continuous at c. Remark 1. If a sequence (f n ) converges to f in C([a, b], R), we say that it converges uniformly to f. Remark 2. The study of spaces of functions such as C([a, b], R) is called functional analysis. It is an important branch of modern mathematics. 10
11 To proceed further, we use some notions from the later parts of real analysis, derivatives and integrals, notions that you already studied in calculus, and that are discussed with more rigor in the Math 118 sequence. The metric space of functions gives a strategy for proving the existence of solutions to differential equations. Suppose that we want to solve the initial value problem d dx (y(x)) = f(x, y(x)), y(x 0) = y 0, (5) where f : R 2 R is a continuous function which satisfies the condition f(x, y 1 ) f(x, y 2 ) L y 1 y 2, L being a positive constant. (This is called a Lipschitz condition of f.) We can rewrite this differential equation as an integral equation y(x) = y 0 + x x 0 f(ξ, y(ξ))dξ. If y(x) C([x 0, x 0 + ɛ], R), where ɛ > 0 is small, we can define T (y)(x) C([x 0, x 0 + ɛ], R) by T (y)(x) = y 0 + for x [x 0, x 0 + ɛ], thus obtaining a function Note that T (y 1 )(x) T (y 2 )(x) = Thus x x T : C([x 0, x 0 + ɛ], R) C([x 0, x 0 + ɛ], R). x x 0 f(ξ, y 1 (ξ) y 2 (ξ))dξ x 0 f(ξ, y(ξ))dξ, x 0 L y 1 (ξ) y 2 (ξ) dξ Lɛ sup{ y 1 (x) y 2 (x) : x [x 0, x 0 + ɛ]}. d(t (y 1 ), T (y 2 )) ɛld(y 1, y 2 ), and it follows that T is a contraction mapping when ɛ > 0 is sufficiently small. Starting with an approximate solution y 0 (x), one can define a sequence of solutions y n (x) by y n+1 (x) = T (y n )(x). Using the Contraction Mapping Theorem (from the notes on infinite sequences), one can show that (y n (x)) is a Cauchy sequence in C([x 0, x 0 + ɛ], R). It follows from the Completeness Theorem that this Cauchy sequence converges to a limit y (x). It can then be shown that the limit function is a solution to the initialvalue problem (5). The key point is that the notion of metric space provides an avenue for extending many of the theorems used in the foundations of calculus to settings that 11
12 allow us to find solutions to differential equations, both ordinary and partial. This has turned out to be an extremely powerful approach to understanding the theory of differential equations, which is of course widely used in applications of mathematics. 8 Sequential compactness* For metric spaces, there is an alternative definition of compactness is often quite useful: Definition. A metric space (X, d) is said to be sequentially compact if every sequence (x n ) of points in X has a convergent subsequence. The following theorem is proven in Munkres [3], 28: Theorem. A metric space (X, d) is compact if and only if it is sequentially compact. Proof: First suppose that (X, d) is a compact metric space and let (x n ) be a sequence in X. If the set S = {x n : n N} is finite, (x n ) clearly has a convergent subsequence. If S were infinite and had no accumulation point, then U n = {x n } would be an open subset of X for each n N and the open cover {U n : n N} would have no finite subcover. This would contradict compactness. Suppose, on the other hand that (X, d) is sequentially compact and that U = {U α : α A} is an open cover of X. We claim there exists δ > 0 such that every subset of X of diameter < δ lies in some element of mathcalu. If this were not true, we could construct a subset C n X such that C n has diameter < 1/2 n and C n is not contained in any element of U. Choose a point x n C n for each n N. Then the sequence (x n ) would have a sequence converging to some x X. Since x is a member of the open set U α for some α A, we have N(x; 2δ) U α for some δ > 0. But then N(x n ; δ) U α when n is sufficiently large, a contradiction. We next claim that for every ɛ > 0, there exists a finite cover of X by balls N(x i ; ɛ). If not we could construct a sequence (x n ) such that x n / N(x 1 ; ɛ) N(x n 1 ; ɛ). Then this sequence would have no convergent subsequence. We now choose ɛ = δ/3. Our previous claim shows that X is covered by finitely many ɛ-balls each of which is contained in some element U α of U. We choose one such element U α for each ɛ-ball, thereby obtaining our finite subcover. Thus (X, d) is compact. Remark. Thus if we were to restrict attention to metric spaces, the sequential compactness definition would be perfectly acceptable. The reason the open cover definition of compactness is preferred is that it can be applied to topological spaces which are not metric spaces. See [3] for the general definition of topological space. 12
13 It would be nice if the Heine-Borel Theorem held for the infinite-dimensional metric space C([a, b], R), in other words, if closed bounded subsets of C([a, b], R) were compact. This is not true, but certain subspaces of C([a, b], R) are indeed compact. This is a fact which turns out to be quite useful in applications to differential equations. Definition. A collection K of functions in C([a, b], R) is said to be equicontinuous if for every ɛ > 0 there exists a δ > 0 such that x y < δ f(x) f(y) < ɛ, for all f K. The important point is that δ depends only on ɛ, not on f. We say that a subset K of C([a, b], R) is uniformly bounded if there is a constant M > 0 such that f(x) M for all x [a, b] and all f K. Arzela-Ascoli Theorem. let K be a closed bounded equicontinuous subset of C([a, b], R). Then K is sequentially compact. In other words, if (f n ) is a sequence of uniformly bounded equicontinuous functions in C([a, b], R), then (f n ) has a subsequence which converges to an element of C([a, b], R). Proof: The proof makes use of Cantor s diagonalization argument. We can assume without loss of generality that [a, b] = [0, 1]. Let (f n ) be a uniformly bounded equicontinuous family of functions. Choose a sequence (x n ) consisting of all the elements of [0, 1] Q. Choose subsequences (f n1 ) (f n2 ) (f n3 ) (f nk ) such that (f nk )(x k ) converges. The diagonal subsequence (f nn ) then converges at every point of [0, 1] Q. Let ɛ > 0 be given. For this choice of ɛ, there exists δ > 0 such that f, g K and x y < δ f(x) f(y) < ɛ 3. We cover [0, 1] by finitely many intervals N(y i, δ) where y i [0, 1] Q, for 1 i m. For each i there exists N i N such that m, n > N i f nn (y i ) f mm (y i ) < ɛ 3. We let N be the maximum of {N i : 1 i m}. Then if x [0, 1], there exists y i such that x y i < δ, and m, n > N f nn (x) f mm (x) < f nn (x) f nn (y i ) + f nn (y i ) f mm (y i ) + f mm (y i ) f mm (x) < ɛ 3 + ɛ 3 + ɛ 3 = ɛ. Hence the subsequence (f nn ) is a Cauchy sequence in C([a, b], R), and must converge by completeness of C([a, b], R). 13
14 References [1] Edward D. Gaughan, Introduction to analysis, Brooks-Cole, Pacific Grove, [2] S. Lay, Analysis with an introduction to proof, Fourth edition, Pearson Prentice Hall, Upper Saddle River, NJ, [3] J. Munkres, Topology, Second edition, Pearson Prentice Hall, Upper Saddle River, NJ, [4] W. Rudin, Principles of mathematical analysis, Third edition, McGraw- Hill, New York,
Lecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationFunctions. Chapter Continuous Functions
Chapter 3 Functions 3.1 Continuous Functions A function f is determined by the domain of f: dom(f) R, the set on which f is defined, and the rule specifying the value f(x) of f at each x dom(f). If f is
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationAssignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous.
Assignment-1 (Due 11/21) 1. Consider the sequence of functions f n (x) = x n on [, 1]. (a) Show that each function f n is uniformly continuous on [, 1]. Solution: Any continuous function on a compact set
More information4. (alternate topological criterion) For each closed set V Y, its preimage f 1 (V ) is closed in X.
Chapter 2 Functions 2.1 Continuous functions Definition 2.1. Let (X, d X ) and (Y,d Y ) be metric spaces. A function f : X! Y is continuous at x 2 X if for each " > 0 there exists >0 with the property
More informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
More informationQuick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1
Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture 6: Uniformly continuity and sequence of functions 1.1 Uniform Continuity Definition 1.1 Let (X, d 1 ) and (Y, d ) are metric spaces and
More informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationMT804 Analysis Homework II
MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real
More informationProblem Set 5: Solutions Math 201A: Fall 2016
Problem Set 5: s Math 21A: Fall 216 Problem 1. Define f : [1, ) [1, ) by f(x) = x + 1/x. Show that f(x) f(y) < x y for all x, y [1, ) with x y, but f has no fixed point. Why doesn t this example contradict
More informationExam 2 extra practice problems
Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationWeek 5 Lectures 13-15
Week 5 Lectures 13-15 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all
More informationIntroduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION
Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationReal Analysis Chapter 4 Solutions Jonathan Conder
2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationMAT 544 Problem Set 2 Solutions
MAT 544 Problem Set 2 Solutions Problems. Problem 1 A metric space is separable if it contains a dense subset which is finite or countably infinite. Prove that every totally bounded metric space X is separable.
More informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationFIXED POINT METHODS IN NONLINEAR ANALYSIS
FIXED POINT METHODS IN NONLINEAR ANALYSIS ZACHARY SMITH Abstract. In this paper we present a selection of fixed point theorems with applications in nonlinear analysis. We begin with the Banach fixed point
More informationANALYSIS WORKSHEET II: METRIC SPACES
ANALYSIS WORKSHEET II: METRIC SPACES Definition 1. A metric space (X, d) is a space X of objects (called points), together with a distance function or metric d : X X [0, ), which associates to each pair
More informationBootcamp. Christoph Thiele. Summer As in the case of separability we have the following two observations: Lemma 1 Finite sets are compact.
Bootcamp Christoph Thiele Summer 212.1 Compactness Definition 1 A metric space is called compact, if every cover of the space has a finite subcover. As in the case of separability we have the following
More informationPrinciples of Real Analysis I Fall VII. Sequences of Functions
21-355 Principles of Real Analysis I Fall 2004 VII. Sequences of Functions In Section II, we studied sequences of real numbers. It is very useful to consider extensions of this concept. More generally,
More informationMAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.
MAS3706 Topology Revision Lectures, May 208 Z.A.Lykova It is essential that you read and try to understand the lecture notes from the beginning to the end. Many questions from the exam paper will be similar
More informationHonours Analysis III
Honours Analysis III Math 354 Prof. Dmitry Jacobson Notes Taken By: R. Gibson Fall 2010 1 Contents 1 Overview 3 1.1 p-adic Distance............................................ 4 2 Introduction 5 2.1 Normed
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More informationSOME QUESTIONS FOR MATH 766, SPRING Question 1. Let C([0, 1]) be the set of all continuous functions on [0, 1] endowed with the norm
SOME QUESTIONS FOR MATH 766, SPRING 2016 SHUANGLIN SHAO Question 1. Let C([0, 1]) be the set of all continuous functions on [0, 1] endowed with the norm f C = sup f(x). 0 x 1 Prove that C([0, 1]) is a
More informationReview Notes for the Basic Qualifying Exam
Review Notes for the Basic Qualifying Exam Topics: Analysis & Linear Algebra Fall 2016 Spring 2017 Created by Howard Purpose: This document is a compilation of notes generated to prepare for the Basic
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
More informationThe Arzelà-Ascoli Theorem
John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
More informationA Glimpse into Topology
A Glimpse into Topology by Vishal Malik A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 430 (203-4) Lakehead University Thunder Bay, Ontario,
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More information(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff
Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ
More informationHyperreal Calculus MAT2000 Project in Mathematics. Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen
Hyperreal Calculus MAT2000 Project in Mathematics Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen Abstract This project deals with doing calculus not by using epsilons and deltas, but
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationMetric Spaces. DEF. If (X; d) is a metric space and E is a nonempty subset, then (E; d) is also a metric space, called a subspace of X:
Metric Spaces DEF. A metric space X or (X; d) is a nonempty set X together with a function d : X X! [0; 1) such that for all x; y; and z in X : 1. d (x; y) 0 with equality i x = y 2. d (x; y) = d (y; x)
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationSOLUTIONS TO SOME PROBLEMS
23 FUNCTIONAL ANALYSIS Spring 23 SOLUTIONS TO SOME PROBLEMS Warning:These solutions may contain errors!! PREPARED BY SULEYMAN ULUSOY PROBLEM 1. Prove that a necessary and sufficient condition that the
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The
More informationMath 361: Homework 1 Solutions
January 3, 4 Math 36: Homework Solutions. We say that two norms and on a vector space V are equivalent or comparable if the topology they define on V are the same, i.e., for any sequence of vectors {x
More informationMath 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases:
Math 34 Summer 06 Midterm Exam Solutions. Complete the definitions of the following words or phrases: (a) A sequence (a n ) is called a Cauchy sequence if and only if for every ɛ > 0, there exists and
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More information1 Lecture 4: Set topology on metric spaces, 8/17/2012
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture : Set topology on metric spaces, 8/17/01 Definition 1.1. Let (X, d) be a metric space; E is a subset of X. Then: (i) x E is an interior
More informationProblem Set 5. 2 n k. Then a nk (x) = 1+( 1)k
Problem Set 5 1. (Folland 2.43) For x [, 1), let 1 a n (x)2 n (a n (x) = or 1) be the base-2 expansion of x. (If x is a dyadic rational, choose the expansion such that a n (x) = for large n.) Then the
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationMATH 131A: REAL ANALYSIS (BIG IDEAS)
MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationTHE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES
THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES PHILIP GADDY Abstract. Throughout the course of this paper, we will first prove the Stone- Weierstrass Theroem, after providing some initial
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationAdvanced Calculus: MATH 410 Professor David Levermore 28 November 2006
Advanced Calculus: MATH 410 Professor David Levermore 28 November 2006 1. Uniform Continuity Uniform continuity is a very useful concept. Here we introduce it in the context of real-valued functions with
More informationMeasure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond
Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More informationPart A. Metric and Topological Spaces
Part A Metric and Topological Spaces 1 Lecture A1 Introduction to the Course This course is an introduction to the basic ideas of topology and metric space theory for first-year graduate students. Topology
More informationB553 Lecture 1: Calculus Review
B553 Lecture 1: Calculus Review Kris Hauser January 10, 2012 This course requires a familiarity with basic calculus, some multivariate calculus, linear algebra, and some basic notions of metric topology.
More informationMath 5210, Definitions and Theorems on Metric Spaces
Math 5210, Definitions and Theorems on Metric Spaces Let (X, d) be a metric space. We will use the following definitions (see Rudin, chap 2, particularly 2.18) 1. Let p X and r R, r > 0, The ball of radius
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.
More information2. Complex Analytic Functions
2. Complex Analytic Functions John Douglas Moore July 6, 2011 Recall that if A and B are sets, a function f : A B is a rule which assigns to each element a A a unique element f(a) B. In this course, we
More informationSection 45. Compactness in Metric Spaces
45. Compactness in Metric Spaces 1 Section 45. Compactness in Metric Spaces Note. In this section we relate compactness to completeness through the idea of total boundedness (in Theorem 45.1). We define
More informationPOINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol.1 (13) (2005), 117 127 POINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS SAM B. NADLER, JR. Abstract. The problem of characterizing the metric spaces on which the
More information11691 Review Guideline Real Analysis. Real Analysis. - According to Principles of Mathematical Analysis by Walter Rudin (Chapter 1-4)
Real Analysis - According to Principles of Mathematical Analysis by Walter Rudin (Chapter 1-4) 1 The Real and Complex Number Set: a collection of objects. Proper subset: if A B, then call A a proper subset
More information