NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES

Size: px
Start display at page:

Download "NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES"

Transcription

1 NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs of Theorems.2, 3.3 are contained in the textboo although in a slightly different setting and with a slightly different language. The statement and proof of Theorem. are not in the textboo, although the textboo does contain a discussion of Euler s broen line method. The purpose of these notes is to collect the various results scattered throughout different parts of the boo and also to provide slightly more details. This is a preliminary version: If you have any comments or corrections, no matter how minor, please send them to me.. Main theorems Throughout, we consider the following initial value problem: { u t = F t, ut, u = u, where F : I U R n is a continuous function with I R an open interval and u U R n an open set. We will loo for a solution u : I R for some open sub-interval I which is a C function satisfying.. A solution to this initial value problem always exists: Theorem. Peano. There exists ɛ > depending on u such that there exists a solution ut for t ɛ, ɛ. In general, uniqueness is false Exercise, or recall from wee. However, uniqueness holds if an extra condition is imposed on F : Theorem.2 Picard Lindelöf, Cauchy Lipschitz. Suppose that, in addition, F satisfies the condition that for any open interval I with Ī I and any open ball Bx, r with Bx, r U, there exists a constant L > such that F t, x F t, y L x y for every t, x, t, y I Bx, r. Then, there exists ɛ > depending on u such that there exists a unique solution ut for t ɛ, ɛ. Remar.3. The additional condition for F required by Theorem.2 is satisfied if F is C Exercise. We will prove Theorems. and.2 in Sections 4 and 2 respectively. We will also discuss another important theorem, the extension theorem Theorem 3.3 in Section Existence and uniqueness by Picard iteration In this section, we prove Theorem.2. Throughout, assume the hypotheses of Theorem.2. By openness of U, given u U, there exists r such that Bu, 2r U. Pic an arbitrary open interval I I such that I I. The assumption of Theorem.2 guarantees that there exists L > such that. F t, x F t, y L x y 2. for every t, x, t, y I Bu, 2r. On the other hand, since F is continuous, there exists M > such that F t, x M for t, x I Bu, 2r. 2.2

2 2 JONATHAN LUK Now, we pic the ɛ in the theorem to so that ɛ, ɛ I for I as above and ɛ < min{ r M, } L Define a sequence of functions u : ɛ, ɛ Bu, 2r by and for, u t = u + u t = u F s, u s ds. 2.4 These u s are nown as Picard s iterates. Our goal is to show that they converge to a solution to.. This is accomplished by the following sequence of lemmata. Lemma 2.. For, u t Bu, r Bu, 2r for t ɛ, ɛ. Proof. We prove this by induction. The = case holds by definition. Assume the lemma holds for replaced by for some. Then, we estimate, using 2.2 and 2.4, u t u ɛ sup s ɛ,ɛ F s, u s ɛm r. Lemma 2.2. For every, u t u t 2 r for t ɛ, ɛ. Proof. We prove this by induction. The = case follows from 2. and the triangle inequality. Assume the inequality holds for replaced by for some 2. Then, by 2. and 2.4 u t u t F s, u s F s, u 2 s ds for every t ɛ, ɛ. ɛl sup s ɛ,ɛ u s u 2 s ɛl2 2 r 2 r, Lemma 2.3. There exists a continuous function u : ɛ, ɛ Bx, 2r such that u t converges to ut uniformly on ɛ, ɛ. Proof. By Lemma 2.2, for every t ɛ, ɛ, u t is a Cauchy sequence. We can then define ut = lim u t. Using Lemma 2.2 again, we see that u u uniformly. Therefore, u is continuous on ɛ, ɛ. Lemma 2.4. The function u in Lemma 2.3 solves for all t ɛ, ɛ. ut = u + Proof. Tae the limit lim of both sides of 2.4. F s, us ds 2.5 Lemma 2.5. Let u be a continuous function that solves 2.5. Then u is continuously differentiable and solves.. Proof. Exercise. Combining the above lemmata yields the existence part of Theorem.2. Note that we have not proven Theorem. since the above proof uses the assumptions in Theorem.2. It remains to prove uniqueness. Proposition 2.6. Suppose there is another solution ũ : ɛ, ɛ + R n for some ɛ ±, ɛ]. Then ũt = ut for all t ɛ, ɛ +. At this point, we do not yet now that the image of u is in Bu, 2r. This will be justified in Lemma 2..

3 NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES 3 Proof. Let us just prove that ũ and u agree on [, ɛ +. It is easy to chec Exercise that the same argument can be applied to show that they also agree on ɛ, ]. Step. First, we note that on any sub-interval [, ɛ [, ɛ +, if we assume that ũt Bu, 2r, then ũt = ut on [, ɛ. This is because for any t [, ɛ, d dt ũt ut 2 = ũt ut, F t, ũt F t, ut 2L ũt ut 2. Therefore, e 2Lt ũt ut 2 is a non-increasing function on [, ɛ. However, it is non-negative and is when t =. Hence, ũt ut 2 = for t [, ɛ. Step 2. Now, let τ := sup{t, ɛ + : ũs = us, s [, t}. If τ = ɛ +, we are done. So assume τ < ɛ +. Since uτ Bu, r, by continuity of ũ, there exists δ, ɛ + τ such that ũt Bu, 2r for t [τ, τ + δ. But then by Step, ũt = ut on [, τ + δ, contradicting the choice of τ. 2.. Aside: the contraction mapping theorem. Theorem.2 can also be realized as a special case of a more general theorem: the contraction mapping theorem. In fact, this is the point of view of the textboo. Let us briefly outline this. First, we recall the contraction mapping theorem from 6CM: Theorem 2.7 Contraction mapping theorem. Let X, d be a complete metric space. Suppose Φ : X X is a map such that for some λ <, dφx, Φy λdx, y for every x, y X, then Φ has a unique fixed point. Recall that existence can be proved by an iteration argument. Pic x X arbitrarily. Define x = Φx for. One then shows that there exists x X such that x x. Exercise This can be applied to the initial value problem as follows: Let X be the set of bounded and continuous functions u : ɛ, ɛ Bu, r. Let d be a distance defined on X by du, v = One checs that this is a complete space Exercise. Define now Φ : X X by Φut = u + sup ut vt. t ɛ,ɛ F s, us ds. It can be shown Exercise using methods similar to the proof of Theorem.2 that Φ is well-defined i.e., the image is indeed in X and is a contraction if t ɛ, ɛ for ɛ sufficiently small. 3. Extension theorem In this section, we continue to wor under the assumptions of Theorem.2. Recall that even in the case I = R, it is not always possible to have a solution on the whole of R. Our next goal is to understand what goes wrong. It is useful to eep in mind the example u t = ut 2, u =, where the solution ut = t can only be defined on,. Our goal is to characterize the maximal interval of existence in general. The main result is given in Theorem 3.3. In order to tal about the maximal interval of existence, we first need a slightly stronger uniqueness statement than that in Theorem.2. Roughly, it says that as long as a solution exists, it is unique. Proposition 3.. Let J and J 2 both be open sub-intervals of I containing. Suppose u : J R n and u 2 : J 2 R n are both continuously differentiable and both solve., then u u 2 on J J 2. Proof. As in the proof of Proposition 2.6, it suffices to consider J J 2,. The case J J 2, is similar. Assume uniqueness does not hold. Let τ := inf{t J J 2, : u t u 2 t}. By assumption, τ J J 2. Apply Theorem.2 but now to the initial value problem { u t = F t, ut, uτ = u τ,

4 4 JONATHAN LUK there exists δ > such that there is a unique solution for t τ δ, τ + δ. This contradicts the choice of τ. We can now define the maximal interval of existence J by J := {t I : there is a solution to. in an open interval including t}. By Proposition 3., there is a unique solution defined on J. Moreover, it is indeed maximal in the sense that there exists no open interval J with J J I such that a solution exists on J. Before we get to our main result Theorem 3.3, we first need a lemma. Note that the ey point of the lemma is that the same ɛ can be chosen for all t, u I K. Lemma 3.2. Given an open interval I such that I I and a compact subset K U, there exists an ɛ > such that for every t, u I K, there is a unique solution to { u t = F t, ut, 3. ut = u, on t t ɛ, t ɛ. Proof. Recall that we chose ɛ depending only on the interval I, and the constants L and M in 2. and 2.2. Therefore, for x U and r > such that Bx, 2r U, ɛ can be chosen uniformly for every t, u I Bx, r. Now for every x K, there is an r x > depending on x such that Bx, 2r x U. Obviously, x K Bx, r x K. By compactness of K, there exists a finite set {x,..., x N } such that N i=bx i, r xi K. For each i {,..., N}, we can choose an ɛ i such that for any u Bx i, r xi, the unique solution exists for t ɛ i, ɛ i. Taing ɛ = min{ɛ,..., ɛ N } yields the result. Theorem 3.3 Extension theorem. Let u : J R n be the maximal interval of existence. Suppose J = T, T +, where T + I i.e., T + is not the right end-point of I. Then lim inf t T + distut, U + ut = +. Here U is the boundary of U, and distut, U is defined by distut, U = sup{r : But, r U}. Proof. Suppose not. Then there is a sequence t n T + such that for every n N, distut n, U + ut n <. In particular, we now that {ut n } n= is a compact subset of U. By Lemma 3.2, there exists an ɛ > independent of n! such that a unique solution exists on the interval t n ɛ, t n + ɛ for every n N. This contradicts the fact that t n T +. Remar 3.4. Of course, in a completely analogous manner, if T I, then lim inf t T + distut, U + ut = +. This is called an extension theorem because it implies that one can extend the solution beyond a time T I if lim inf t T distut, U + ut < +. As we will see, this is quite useful, since we can often show that a unique solution exists for all time by proving certain estimates. 4. Existence by Euler s broen line method and compactness In this section, we prove Theorem.. Nevertheless, before we get to that, we need an important theorem, the Arzela Ascoli theorem, which gives a criterion such that one can extract a subsequential limit of continuous functions.

5 NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES Arzela Ascoli theorem. Theorem 4.. Let K R be a compact interval and {f n } n N be a sequence of continuous functions f n : K R n such that Uniform boundedness there exists an M > so that f n t M for all t K, n N, Equicontinuity for every ɛ >, there exists δ > such that f n t f n s < ɛ for all n N whenever t s < δ. Then there exists a subsequence {f n } = i.e., there is a subset {n, n 2,... } N with n < n 2 <... and a continuous function f : K R such that f n f uniformly as i.e., for every ɛ >, there exists N such that sup t K f n t ft < ɛ for every. Proof. Step. We first find the subsequence and the limiting function f. Let {t i } i= be a countable dense subset of K. Step a. By the assumptions of the theorem, {f n t } n= is a bounded subset of R n. By the Bolzano Weierstrass theorem, there exists a subsequence {f n,l } l= such that lim l f n,l t exists. Step b. Given {f ni,l } l=, we now construct a sequence {f n i+,l } l=, which is a subsequenc of {f ni,l } l=. By uniform boundedness, {f n i,l t i+ } l= is bounded. Using the Bolzano Weierstrass theorem, there exists a subsequence {f ni+,l } l= of {f n i,l } l= such that lim l f ni+,l t i+ exists. Step c. Define now {f n } = to be the diagonal sequence f n = f n,. By definition, lim f n t i exists for all i N. Step 2. We now show that indeed f n f uniformly as. Let ɛ >. By equicontinuity, there exists δ > such that if t s < δ, then f n t f n s < ɛ 3 for all n. By the density of {t i } i=, there exists a finite subset {t i} N i= such that for every t K, there is an i {,..., N} such that t t i < δ. Now since lim f n t i exists for all i {,..., N}, {f n t i } = is a Cauchy sequence in Rn. Hence, there exists such that whenever, 2, f n t i f n2 t i < ɛ 3. We now claim that for every t K, whenever, 2, f n t f n2 t < ɛ. Indeed, since for every t K, we can find i {,..., N} such that t t i < δ, we have f n t f n2 t f n t f n t i + f n t i f n2 t i + f n2 t i f n2 t < ɛ 3 + ɛ 3 + ɛ = ɛ Step 3. Step 2 shows that {f n t} = is Cauchy for every t K. Hence, ft = lim f n t exists for every t K. Moreover, 4. implies that ft is a uniform limit of f n t, and it is therefore also continuous Euler s broen line method. The goal of this subsection is to prove Theorem.. From now on, suppose the hypotheses of Theorem. hold. In particular, we do not assume the hypotheses of Theorem.2. Lie the proof of Theorem.2, we prove existence by constructing a sequence of functions 2 u : [ ɛ, ɛ] U. The construction this time is different: For each, we divide the interval [ ɛ, ɛ] into 2 sub-intervals of equal length, and u t is a linear function on each of these sub-intervals hence the name broen line. More precisely, define u t on the intervals [ ɛ, ] and [, ɛ ] by For j =, 2,...,, for t [ jɛ, j+ɛ u t = u + tf, u. ], define u t = u jɛ + Similarly, for t [ j+ɛ 2 +, jɛ 2 + ], define u t = u jɛ + Let us note that this can be rephrased as u t = u + t jɛ jɛ F, u jɛ. t + jɛ F jɛ, u jɛ. F w s, v s ds, Note that we define u on the closed interval so as to apply Arzela Ascoli Theorem later.

6 6 JONATHAN LUK where w : [ ɛ, ɛ] R is defined by for t = jɛ w t = jɛ for t jɛ, j+ɛ for t [ j+ɛ ], j =,,..., 4.3, jɛ, j =,,..., and v : [ ɛ, ɛ] U is defined by u for t = v t = u jɛ jɛ for t, j+ɛ ], j =,,..., 4.4 u jɛ j+ɛ for t [, jɛ, j =,,...,. We now choose our small ɛ as follows: Since u U, there is an r > such that Bx, r U. Fix a closed interval I I. By continuity, there exists M > such that F t, x M for t, x I Bx, r. We choose ɛ such that [ ɛ, ɛ] I and ɛ < r M 4.5 Lemma 4.2. u t is uniformly bounded and equicontinuous on [ ɛ, ɛ]. Hence, by Theorem 4., there exists a subsequence u l t and a continuous function u : [ ɛ, ɛ] U such that u l u uniformly as l. Proof. Step. We first prove uniform boundedness. In fact, we prove a stronger statement that u t Bu, r for all t [ ɛ, ɛ]. This follows since by 4.5, Step 2. By the definition of u and 4.5, Equicontinuity follows from this. u t u M ds Mɛ r. u t u s M t s. Lemma 4.3. Let w t : [ ɛ, ɛ] R be as in 4.3. Then w t converges uniformly to the function t for t ɛ, ɛ as. Proof. It is easy to chec that w t t ɛ, which as. Lemma 4.4. Let v t be as in 4.4 and v l be the subsequence with l as in Lemma 4.2. Then v l t converges uniformly to ut for t [ ɛ, ɛ]. Proof. Let δ >. We want to show that for l sufficiently large, v l t ut < δ for every l l for every t [ ɛ, ɛ]. It is easy to chec that v t u t ɛm. On the other hand, by Lemma 4.2, there exists l such that u l t ut < δ 2 for every l l and for every t [ ɛ, ɛ]. Now, taing l l such that ɛm l < δ 2, we have v l t ut v l t u l t + u l t ut < δ 2 + δ 2 = δ for every l l for every t [ ɛ, ɛ]. Lemma 4.5. ut as in Lemma 4.2 satisfies 2.5. Proof. Consider 4.2 for the subsequence l. Tae l on both sides. Lemma 4.6. ut as in Lemma 4.2 satisfies.. Proof. Apply Lemma 2.5.

7 NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES 7 5. Example: the exponential function Both the Picard s iteration method and the Euler s broen line method give us more than mere examples. They provide a way of computing the solution. Let us loo at a simple example. We now by explicit computation that e t is the unique solution to u t = ut, u =. By the above discussion, we have two ways to compute e t. First, by Picard s iteration, we have Explicit computation gives u =, u t = + u s ds. u t =, u t = + t, u 2 t = + t + t2 2,..., u t = Theorem.2 implies that for small t at least, e t = n= t n n!. Of course, we now from 6CM that in fact this is true for all t R! On the other hand, we can use Euler s broen line method to compute u jɛ = + ɛ j, which implies Exercise e t = lim + ɛ t ɛ. n= t n n!.

Principles of Real Analysis I Fall VII. Sequences of Functions

Principles 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 information

From 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.

From 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 information

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Functional 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 information

Problem 1: Compactness (12 points, 2 points each)

Problem 1: Compactness (12 points, 2 points each) Final exam Selected Solutions APPM 5440 Fall 2014 Applied Analysis Date: Tuesday, Dec. 15 2014, 10:30 AM to 1 PM You may assume all vector spaces are over the real field unless otherwise specified. Your

More information

The Heine-Borel and Arzela-Ascoli Theorems

The 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 information

Continuous Functions on Metric Spaces

Continuous 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 information

4.6 Montel's Theorem. Robert Oeckl CA NOTES 7 17/11/2009 1

4.6 Montel's Theorem. Robert Oeckl CA NOTES 7 17/11/2009 1 Robert Oeckl CA NOTES 7 17/11/2009 1 4.6 Montel's Theorem Let X be a topological space. We denote by C(X) the set of complex valued continuous functions on X. Denition 4.26. A topological space is called

More information

The Space of Continuous Functions

The Space of Continuous Functions Chapter 3 The Space of Continuous Functions dddddddddddddddddddddddddd dddd ddddddddddddddddddddd dddddddddddddddddd ddddddd ddddddddddddddddddddddddd ddddddddddddddddddddddddd dddddddddddddd ddddddddddd

More information

MATH 140B - HW 5 SOLUTIONS

MATH 140B - HW 5 SOLUTIONS MATH 140B - HW 5 SOLUTIONS Problem 1 (WR Ch 7 #8). If I (x) = { 0 (x 0), 1 (x > 0), if {x n } is a sequence of distinct points of (a,b), and if c n converges, prove that the series f (x) = c n I (x x n

More information

Metric Spaces and Topology

Metric 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 information

Math 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 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 information

converges as well if x < 1. 1 x n x n 1 1 = 2 a nx n

converges 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 information

Midterm 1. Every element of the set of functions is continuous

Midterm 1. Every element of the set of functions is continuous Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions

More information

Bootcamp. 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 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 information

Introductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19

Introductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19 Introductory Analysis I Fall 204 Homework #9 Due: Wednesday, November 9 Here is an easy one, to serve as warmup Assume M is a compact metric space and N is a metric space Assume that f n : M N for each

More information

THEOREMS, ETC., FOR MATH 515

THEOREMS, 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 information

Math 209B Homework 2

Math 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 information

The Arzelà-Ascoli Theorem

The 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 information

Math 140A - Fall Final Exam

Math 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 information

Problem Set 5: Solutions Math 201A: Fall 2016

Problem 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 information

I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm

I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm Proposition : B(K) is complete. f = sup f(x) x K Proof.

More information

Spaces of continuous functions

Spaces of continuous functions Chapter 2 Spaces of continuous functions 2.8 Baire s Category Theorem Recall that a subset A of a metric space (X, d) is dense if for all x X there is a sequence from A converging to x. An equivalent definition

More information

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

g 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 information

An introduction to Mathematical Theory of Control

An introduction to Mathematical Theory of Control An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018

More information

Most Continuous Functions are Nowhere Differentiable

Most Continuous Functions are Nowhere Differentiable Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we

More information

MA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt

MA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt MA526 Homework 4 Group 4 April 26, 26 Qn 6.2 Show that H is not bounded as a map: L L. Deduce from this that H is not bounded as a map L L. Let {ϕ n } be an approximation of the identity s.t. ϕ C, sptϕ

More information

2.3. COMPACTNESS 1. Proposition 2.1. Every compact set in a metric space is closed and bounded.

2.3. COMPACTNESS 1. Proposition 2.1. Every compact set in a metric space is closed and bounded. 2.3. COMPACTNESS 1 2.3 Compactness Recall that Bolzano-Weierstrass Theorem asserts that every sequence in a closed bounded interval has a convergent subsequence in this interval. The result still holds

More information

Lecture 4: Completion of a Metric Space

Lecture 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 information

Theory of Ordinary Differential Equations

Theory of Ordinary Differential Equations Theory of Ordinary Differential Equations Existence, Uniqueness and Stability Jishan Hu and Wei-Ping Li Department of Mathematics The Hong Kong University of Science and Technology ii Copyright c 24 by

More information

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books. Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define

More information

Assignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous.

Assignment-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 information

Part III. 10 Topological Space Basics. Topological Spaces

Part III. 10 Topological Space Basics. Topological Spaces Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

More information

THE INVERSE FUNCTION THEOREM

THE INVERSE FUNCTION THEOREM THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)

More information

MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES

MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of

More information

Week 2: Sequences and Series

Week 2: Sequences and Series QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime

More information

Analysis III Theorems, Propositions & Lemmas... Oh My!

Analysis 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 information

Lecture notes on Ordinary Differential Equations. S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay

Lecture notes on Ordinary Differential Equations. S. Sivaji Ganesh Department of Mathematics Indian Institute of Technology Bombay Lecture notes on Ordinary Differential Equations S. Ganesh Department of Mathematics Indian Institute of Technology Bombay May 20, 2016 ii IIT Bombay Contents I Ordinary Differential Equations 1 1 Initial

More information

Math 426 Homework 4 Due 3 November 2017

Math 426 Homework 4 Due 3 November 2017 Math 46 Homework 4 Due 3 November 017 1. Given a metric space X,d) and two subsets A,B, we define the distance between them, dista,b), as the infimum inf a A, b B da,b). a) Prove that if A is compact and

More information

7 Complete metric spaces and function spaces

7 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 information

Analysis III. Exam 1

Analysis 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

NOTES ON LINEAR ODES

NOTES ON LINEAR ODES NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary

More information

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6 Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some

More information

Nonlinear Control Systems

Nonlinear Control Systems Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 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 information

REGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS

REGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS C,α REGULARITY FOR INFINITY HARMONIC FUNCTIONS IN TWO DIMENSIONS LAWRENCE C. EVANS AND OVIDIU SAVIN Abstract. We propose a new method for showing C,α regularity for solutions of the infinity Laplacian

More information

Lecture 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 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 information

MATH 131A: REAL ANALYSIS (BIG IDEAS)

MATH 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 information

ANALYSIS WORKSHEET II: METRIC SPACES

ANALYSIS 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 information

Sets, Functions and Metric Spaces

Sets, Functions and Metric Spaces Chapter 14 Sets, Functions and Metric Spaces 14.1 Functions and sets 14.1.1 The function concept Definition 14.1 Let us consider two sets A and B whose elements may be any objects whatsoever. Suppose that

More information

Lectures 2 3 : Wigner s semicircle law

Lectures 2 3 : Wigner s semicircle law Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j=1 be a symmetric n n matrix with Random entries

More information

EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES

EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES JEREMY J. BECNEL Abstract. We examine the main topologies wea, strong, and inductive placed on the dual of a countably-normed space

More information

Summer Jump-Start Program for Analysis, 2012 Song-Ying Li. 1 Lecture 7: Equicontinuity and Series of functions

Summer Jump-Start Program for Analysis, 2012 Song-Ying Li. 1 Lecture 7: Equicontinuity and Series of functions Summer Jump-Start Program for Analysis, 0 Song-Ying Li Lecture 7: Equicontinuity and Series of functions. Equicontinuity Definition. Let (X, d) be a metric space, K X and K is a compact subset of X. C(K)

More information

1. 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

1. 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 information

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible.

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible. Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 2.6.3, 2.7.4, 2.7.5, 2.7.2,

More information

MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD

MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD TSOGTGEREL GANTUMUR 1. Introduction Suppose that we want to solve the equation f(z) = β where f is a nonconstant entire function and

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure

More information

Problem Set 5. 2 n k. Then a nk (x) = 1+( 1)k

Problem 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 information

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(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 information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real 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 information

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.

1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. 1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for

More information

We are now going to go back to the concept of sequences, and look at some properties of sequences in R

We are now going to go back to the concept of sequences, and look at some properties of sequences in R 4 Lecture 4 4. Real Sequences We are now going to go back to the concept of sequences, and look at some properties of sequences in R Definition 3 A real sequence is increasing if + for all, and strictly

More information

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

More information

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going

More information

Existence and Uniqueness

Existence and Uniqueness Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect

More information

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions

More information

16 1 Basic Facts from Functional Analysis and Banach Lattices

16 1 Basic Facts from Functional Analysis and Banach Lattices 16 1 Basic Facts from Functional Analysis and Banach Lattices 1.2.3 Banach Steinhaus Theorem Another fundamental theorem of functional analysis is the Banach Steinhaus theorem, or the Uniform Boundedness

More information

REAL AND COMPLEX ANALYSIS

REAL 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 information

The Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation:

The Dirichlet s P rinciple. In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: Oct. 1 The Dirichlet s P rinciple In this lecture we discuss an alternative formulation of the Dirichlet problem for the Laplace equation: 1. Dirichlet s Principle. u = in, u = g on. ( 1 ) If we multiply

More information

Spectral theory for compact operators on Banach spaces

Spectral theory for compact operators on Banach spaces 68 Chapter 9 Spectral theory for compact operators on Banach spaces Recall that a subset S of a metric space X is precompact if its closure is compact, or equivalently every sequence contains a Cauchy

More information

Compact operators on Banach spaces

Compact operators on Banach spaces Compact operators on Banach spaces Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto November 12, 2017 1 Introduction In this note I prove several things about compact

More information

FINAL EXAM Math 25 Temple-F06

FINAL EXAM Math 25 Temple-F06 FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short

More information

Numerical Sequences and Series

Numerical Sequences and Series Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is

More information

2.4 The Extreme Value Theorem and Some of its Consequences

2.4 The Extreme Value Theorem and Some of its Consequences 2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or

More information

Exercise Solutions to Functional Analysis

Exercise Solutions to Functional Analysis Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n

More information

On linear and non-linear equations. (Sect. 1.6).

On linear and non-linear equations. (Sect. 1.6). On linear and non-linear equations. (Sect. 1.6). Review: Linear differential equations. Non-linear differential equations. The Picard-Lindelöf Theorem. Properties of solutions to non-linear ODE. The Proof

More information

R N Completeness and Compactness 1

R N Completeness and Compactness 1 John Nachbar Washington University in St. Louis October 3, 2017 R N Completeness and Compactness 1 1 Completeness in R. As a preliminary step, I first record the following compactness-like theorem about

More information

GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES

GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February

More information

An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010

An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010 An Introduction to Complex Analysis and Geometry John P. D Angelo, Pure and Applied Undergraduate Texts Volume 12, American Mathematical Society, 2010 John P. D Angelo, Univ. of Illinois, Urbana IL 61801.

More information

Riemann integral and volume are generalized to unbounded functions and sets. is an admissible set, and its volume is a Riemann integral, 1l E,

Riemann integral and volume are generalized to unbounded functions and sets. is an admissible set, and its volume is a Riemann integral, 1l E, Tel Aviv University, 26 Analysis-III 9 9 Improper integral 9a Introduction....................... 9 9b Positive integrands................... 9c Special functions gamma and beta......... 4 9d Change of

More information

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

Economics 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 information

Sobolev Spaces. Chapter Hölder spaces

Sobolev Spaces. Chapter Hölder spaces Chapter 2 Sobolev Spaces Sobolev spaces turn out often to be the proper setting in which to apply ideas of functional analysis to get information concerning partial differential equations. Here, we collect

More information

Functional Analysis HW #3

Functional Analysis HW #3 Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform

More information

Math 328 Course Notes

Math 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 information

Existence and uniqueness of solutions for nonlinear ODEs

Existence and uniqueness of solutions for nonlinear ODEs Chapter 4 Existence and uniqueness of solutions for nonlinear ODEs In this chapter we consider the existence and uniqueness of solutions for the initial value problem for general nonlinear ODEs. Recall

More information

McGill University Math 354: Honors Analysis 3

McGill 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 information

NORMS ON SPACE OF MATRICES

NORMS ON SPACE OF MATRICES NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system

More information

Continuity. Matt Rosenzweig

Continuity. Matt Rosenzweig Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise

More information

MATH 202B - Problem Set 5

MATH 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 information

MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE

MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).

More information

Measure and Integration: Solutions of CW2

Measure and Integration: Solutions of CW2 Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost

More information

MAT 544 Problem Set 2 Solutions

MAT 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 information

Lecture 3. Econ August 12

Lecture 3. Econ August 12 Lecture 3 Econ 2001 2015 August 12 Lecture 3 Outline 1 Metric and Metric Spaces 2 Norm and Normed Spaces 3 Sequences and Subsequences 4 Convergence 5 Monotone and Bounded Sequences Announcements: - Friday

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

Chapter 2 Metric Spaces

Chapter 2 Metric Spaces Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

FUNCTIONAL 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 information

Richard DiSalvo. Dr. Elmer. Mathematical Foundations of Economics. Fall/Spring,

Richard DiSalvo. Dr. Elmer. Mathematical Foundations of Economics. Fall/Spring, The Finite Dimensional Normed Linear Space Theorem Richard DiSalvo Dr. Elmer Mathematical Foundations of Economics Fall/Spring, 20-202 The claim that follows, which I have called the nite-dimensional normed

More information

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

1 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 information

Synchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology

Synchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology Synchronization, Chaos, and the Dynamics of Coupled Oscillators Supplemental 1 Winter 2017 Zachary Adams Undergraduate in Mathematics and Biology Outline: The shift map is discussed, and a rigorous proof

More information