Existence and uniqueness: Picard s theorem

Size: px
Start display at page:

Download "Existence and uniqueness: Picard s theorem"

Transcription

1 Existence and uniqueness: Picard s theorem First-order equations Consider the equation y = f(x, y) (not necessarily linear). The equation dictates a value of y at each point (x, y), so one would expect there to be a unique solution curve through a given point. We will prove the following theorem: THEOREM 1. Let I be a real interval (possibly R itself), and let f be a continuous real function on I R, satisfying the Lipschitz condition f(x, y 2 ) f(x, y 1 ) K y 2 y 1 on this set. Let x I. Then there is a unique function y on I such that y (x) = f[x, y(x)] for x I and y(x ) = y. Note. By the mean-value theorem, the Lipschitz condition will be satisfied if we have f(x, y) K on I R. y LEMMA 1. It is enough to prove the result for the case x = y =. Proof. Suppose the result is known for this case and x, y are given. Let g(x, y) = f(x + x, y + y ). By assumption, there is a unique function z such that z (x) = g[x, z(x)] when x + x I and z() =. Let y(x) = z(x x ) + y. Then y(x ) = y and for x I, y (x) = z (x x ) = = = The next step is to show that the required properties of y can be equally expressed by an integral. LEMMA 2. Let I be an interval containing. For a differentiable function on I, the following statements are equivalent: 1

2 (i) y (x) = f[x, y(x)] for x I and y() = ; (ii) y(x) = Proof. (i) (ii). f[t, y(t)] dt for x I. Let C(I) be the space of all continuous functions on I. We define a mapping A from C(I) to itself as follows: given y C(I), (Ay)(x) = f[t, y(t)] dt. By Lemma 2, y is the required solution if and only if A(y) = y. We take y =, y 1 = A(y ), y 2 = A(y 1 ),..., y n = A(y n 1 ) = A n (y ). We will show that (y n ) converges (uniformly on I) to a limit function y. One would then expect that A(y) = lim n A(y n ) = lim n y n+1 = y, as required. LEMMA 3. Suppose that u(x) v(x) C for x I. Then for each n 1, (A n u)(x) (A n v)(x) C (K x )n n! for x I. Proof. By the Lipschitz condition, f[t, u(t)] f[t, v(t)] CK for t I, so (Au)(x) (Av)(x) = [f(t, u(t)) f(t, v(t))] dt CK x, i.e. the statement holds for n = 1. Now suppose it holds for a certain n. Then, by the Lipschitz condition, f [t, (A n u)(t)] f [t, (A n v)(t)] KC (K t )n. n! So (for x > ), (A n+1 u)(x) (A n+1 v)(x) x = {f [t, (A n u)(t)] f [t, (A n v)(t)]} dt 2

3 (Similarly for x <, with x instead of x.) Proof of the Theorem. For the moment, assume that I is a bounded, closed interval. Then x R (say) for x I, and continuous functions are bounded on I, so there exists M such that f(t, ) M for t I. Uniqueness. Suppose that Au = u and Av = v. Then A n u = u and A n v = v for all n. Also, there exists C such that u(x) v(x) C for x I. By Lemma 3, u(x) v(x) C (K x )n n! for all n 1. But for each x, (K x ) n /n! as n. Hence u(x) = v(x). Existence. Let y =, y 1 = A(y ), y 2 = A(y 1 ),..., y n = A n (y ),.... Then y 1 (x) y (x) = y 1 (x) = f(t, ) dt M x C for x I, where C = MR. By Lemma 3, y n+1 (x) y n (x) for x I. Now n=1 (KR)n /n! is convergent (to e KR ), so by the M-test, n=1 (y n+1 y n ) is uniformly convergent on I (say to y). But (y 1 y ) + (y 2 y 1 ) + + (y n y n 1 ) = y n y = y n, so this says that y n y uniformly on I. In other words, y n (x) y(x) δ n for x I, where δ n as n. By the case n = 1 in Lemma 3, y n+1 (x) (Ay)(x) = (Ay n )(x) Ay(x) K x δ n for x I, so for x I, as required. (Ay)(x) = lim n y n+1 (x) = y(x) 3

4 Finally, suppose that I is an open or unbounded interval. Then we can express it as n=1i n, where I 1 I 2 I 3... are bounded, closed intervals with I 1. By the above, there is for each n a unique solution y (n) on I n with y (n) () =. By this uniqueness, y (n+1) agrees with y (n) on I n, so it is consistent to define y on I by: y(x) = y (n) (x) for x I n. Clearly, y satisfies the equation on I. We now give two quite simple examples to show that both parts of the theorem can fail if the Lipschitz condition is not satisfied. Example 1. Consider the equation y = y 2, with y(1) = 1, on the interval [ 1, 1]. Solving by elementary methods, we have 1 y 2 y = 1, 1 y = x + c. The condition y(1) = 1 selects the solution y = 1/x. This is clearly the unique solution on (, 1]. It cannot be extended to a differentiable function at, so there is no solution on [ 1, 1]. To see that the Lipschitz condition fails, note that f(x, y) = y 2. We have f(x, y + 1) f(x, y) = (y + 1) 2 + y 2 = 2y 1, which is unbounded on R. Example 2. Consider y = 3y 2/3 with y() =, on I = R. Clearly, is one solution. Elementary methods give 1 3y 2/3 y = 1, y 1/3 = x + c, y = (x + c) 3. Hence x 3 is another solution with y() =. There are actually infinitely many solutions: for each c >, a solution is y c (x) = { (x c) 3 for x c for x < c. (Then y c is differentiable at c, with derivative ). The Lipschitz condition fails because y 2/3 y = 1 y 1/3 as y +. 4

5 Picard s iteration. The proof of Picard s theorem provides a way of constructing successive approximations to the solution. With the initial condition y(x ) = y, this means we define y (x) = y and y n (x) = (Ay n 1 )(x) = y + x f[t, y n 1 (t)] dt. Example. Consider the equation y = y with y() = 1. Of course, the solution is e x. Picard s iteration gives the following: f(x, y) = y, hence y (x) = 1, y 1 (x) = 1 + f(t, 1) dt = Example. The equation y = 2x + y 2, with y() =. Start with y (x) =. Then Systems of equations and higher order equations Now consider a system of first-order equations y j(x) = f j [x, y 1 (x),..., y n (x)] (1 j n). In vector notation, y(x) = [y 1 (x),..., y n (x)], and the system becomes y (x) = f[x, y(x)]. By a vector adaptation of the proof, we shall obtain a generalization of Theorem 1 to systems of equations. As we have seen before, higher order equations can be seen as a special case of a system. For y = (y 1, y 2,..., y n ) R n, write y = max y j. This is a norm on R n, giving x y as a notion of generalized distance between x and y. Note that x y M simply means that x j y j M for each j. 5

6 Remark. Another norm is y 2 = ( n j=1 y2 j ) 1/2. The two norms are equivalent in the sense that y y 2 n y for all y. This means that either can be used to determine convergence. Though 2 is arguably the true measure of distance, it is more complicated to use in proofs like those that follow. Our y is often denoted by y. Our theorem is: THEOREM 2. Suppose that each f j is continuous on I R n and f j (x, y) f j (x, z) K y z on I R n. Suppose that x I and real numbers α 1,..., α n are given. Then there is a unique vector function y(x) such that y (x) = f[x, y(x)] for x I and y j (x ) = α j for each j. As before, it is sufficient to consider the case where x = α j = for all j. Exactly as in Lemma 2, the required conditions are equivalent to or in vector notation y j (x) = f j [t, y(t)] dt y(x) = f[t, y(t)] dt. (j = 1,..., n), Given y = (y 1,..., y n ), where each y j is in C(I), define Ay to be z, where We require y such that Ay = y. z(x) = f[t, y(t)] dt. LEMMA 3. Let u, v be vector functions such that u(x) v(x) C for x I. Then for each k 1, (A k u)(x) (A k v)(x) C (K x )k k! for x I. Proof. Just like Lemma 3, with the notation adjusted. We describe the induction step. Assume the statement holds for a certain k. Then, by the Lipschitz condition, for each j: [ fj t, (A k u)(t) ] [ f j t, (A k v)(t) ] (K t ) k KC. k! Write A k+1 u = (g 1,..., g n ) and A k+1 v = (h 1,..., h n ). This means that g j (x) = f j [t, (A k u)(t)] dt 6

7 and similarly for h j (x) with v instead of u. Exactly as in Lemma 3, we deduce that for x I, which is equivalent to g j (x) h j (x) C (K x )k+1 (k + 1)! (j = 1,..., n), (A k+1 u)(x) (A k+1 v)(x) C (K x )k+1 (k + 1)!. Theorem 2 now follows exactly as in the case n = 1. Let y () = and y (k) = (y (k) 1,..., y n (k) ) = A k (). (Here the notation y (k) is being used temporarily for the kth function of the sequence, not the kth derivative.) As before, we see that for each j, the functions y (k) j tend to a limit function y j, uniformly on I, as k (in other words, y (k) y uniformly on I), and Ay = y. THEOREM 3. Suppose that f is continuous on I R n and f(x, y) f(x, z) K y z on I R n. Suppose that x I and real numbers α 1,..., α n are given. Then there is a unique function y on I such that y (n) (x) = f[x, y(x), y (x),..., y (n 1) (x)] for x I and y(x ) = α, y (j) (x ) = α j for 1 j n 1. Proof. The equation is equivalent to the system y j = y j+1 for j n 2, y n 1 = f(x, y, y 1,..., y n 1 ). In the notation of Theorem 2 (with j now ranging from to n 1), we have f n 1 = f, while for j n 2, f j (x, y, y 1,..., y n 1 ) = y j+1. We only need to verify that the functions f j satisfy the Lipschitz condition. This is trivial for j n 2, and ensured by our hypothesis for j = n 1. Finally, we specialize this to linear equations, showing that the Lipschitz condition is then automatically satisfied. 7

8 THEOREM 4. Suppose that the functions p, p 1,..., p n 1 and g are continuous on an interval I. Let x I and real numbers α 1,..., α n be given. Then there is a unique function y such that y (n) (x) = p (x)y(x) + p 1 (x)y (x) + + p n 1 (x)y (n 1) (x) + g(x) for x I and y(x ) = α, y (j) (x ) = α j for 1 j n 1. Proof. First assume that I is a bounded, closed interval (then extend to open and unbounded intervals as before). Then each p j is bounded on I: say p j (x) K for x I. Apply Theorem 3 with n 1 f(x, y, y 1,..., y n 1 ) = p j (x)y j + g(x). Since it is a sum of products of continuous functions of single variables, f is continuous on I R n. The Lipschitz condition is satisfied, because: n 1 n 1 f(x, y) f(x, z) = p j (x)(y j z j ) K y j z j nk y z. j= j= j= 8

Picard s Existence and Uniqueness Theorem

Picard s Existence and Uniqueness Theorem Picard s Existence and Uniqueness Theorem Denise Gutermuth 1 These notes on the proof of Picard s Theorem follow the text Fundamentals of Differential Equations and Boundary Value Problems, 3rd edition,

More information

Solutions: Problem Set 4 Math 201B, Winter 2007

Solutions: Problem Set 4 Math 201B, Winter 2007 Solutions: Problem Set 4 Math 2B, Winter 27 Problem. (a Define f : by { x /2 if < x

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

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

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

Nonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems

Nonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Time-varying Systems ẋ = f(t,x) f(t,x) is piecewise continuous in t and locally Lipschitz in x for all t 0 and all x D, (0 D). The origin

More information

UNIQUENESS OF nth ORDER DIFFERENTIAL SYSTEMS WITH STRONG SINGULARITY

UNIQUENESS OF nth ORDER DIFFERENTIAL SYSTEMS WITH STRONG SINGULARITY UNIQUENESS OF nth ORDER DIFFERENTIAL SYSTEMS WITH STRONG SINGULARITY YIFEI PAN AND MEI WANG Abstract. By a Lipschitz type condition, we obtain the uniqueness of solutions for a system of nth order nonlinear

More information

9 Sequences of Functions

9 Sequences of Functions 9 Sequences of Functions 9.1 Pointwise convergence and uniform convergence Let D R d, and let f n : D R be functions (n N). We may think of the functions f 1, f 2, f 3,... as forming a sequence of functions.

More information

Ordinary Differential Equations

Ordinary Differential Equations Ordinary Differential Equations (MA102 Mathematics II) Shyamashree Upadhyay IIT Guwahati Shyamashree Upadhyay ( IIT Guwahati ) Ordinary Differential Equations 1 / 1 Books Shyamashree Upadhyay ( IIT Guwahati

More information

DIFFERENTIATION OF SEQUENCES*

DIFFERENTIATION OF SEQUENCES* T935-1 DIFFERENTIATION OF SEQUENCES 553 DIFFERENTIATION OF SEQUENCES* BY ORRIN FRINK, JR. Conditions under which one may differentiate term by term a convergent sequence of functions are to be found in

More information

Functional Analysis HW 2

Functional Analysis HW 2 Brandon Behring Functional Analysis HW 2 Exercise 2.6 The space C[a, b] equipped with the L norm defined by f = b a f(x) dx is incomplete. If f n f with respect to the sup-norm then f n f with respect

More information

b) The system of ODE s d x = v(x) in U. (2) dt

b) The system of ODE s d x = v(x) in U. (2) dt How to solve linear and quasilinear first order partial differential equations This text contains a sketch about how to solve linear and quasilinear first order PDEs and should prepare you for the general

More information

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables.

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables. Chapter 2 First order PDE 2.1 How and Why First order PDE appear? 2.1.1 Physical origins Conservation laws form one of the two fundamental parts of any mathematical model of Continuum Mechanics. These

More information

Ordinary Differential Equations II

Ordinary Differential Equations II Ordinary Differential Equations II February 23 2017 Separation of variables Wave eq. (PDE) 2 u t (t, x) = 2 u 2 c2 (t, x), x2 c > 0 constant. Describes small vibrations in a homogeneous string. u(t, x)

More information

Sobolev Spaces. Chapter 10

Sobolev Spaces. Chapter 10 Chapter 1 Sobolev Spaces We now define spaces H 1,p (R n ), known as Sobolev spaces. For u to belong to H 1,p (R n ), we require that u L p (R n ) and that u have weak derivatives of first order in L p

More information

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable

More information

5. Some theorems on continuous functions

5. Some theorems on continuous functions 5. Some theorems on continuous functions The results of section 3 were largely concerned with continuity of functions at a single point (usually called x 0 ). In this section, we present some consequences

More information

Here, u(r,θ,t) was the displacement of the membrane from its equilibrium position u = 0. Substitution of a separation-of-variables type solution,

Here, u(r,θ,t) was the displacement of the membrane from its equilibrium position u = 0. Substitution of a separation-of-variables type solution, Lecture 11 Zeros of second-order linear ODEs (finale) Return to the vibrating drum problem In Lecture 4, we considered the problem of a vibrating circular membrane of radius R 0. Recall that our model

More information

15. Polynomial rings Definition-Lemma Let R be a ring and let x be an indeterminate.

15. Polynomial rings Definition-Lemma Let R be a ring and let x be an indeterminate. 15. Polynomial rings Definition-Lemma 15.1. Let R be a ring and let x be an indeterminate. The polynomial ring R[x] is defined to be the set of all formal sums a n x n + a n 1 x n +... a 1 x + a 0 = a

More information

(3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y

(3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y () Consider A = { q Q : q 2 2} as a subset of the metric space (Q, d), where d(x, y) = x y. Then A is A) closed but not open in Q B) open but not closed in Q C) neither open nor closed in Q D) both open

More information

Continuity. Chapter 4

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

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010 Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression

More information

Nonlinear equations. Norms for R n. Convergence orders for iterative methods

Nonlinear equations. Norms for R n. Convergence orders for iterative methods Nonlinear equations Norms for R n Assume that X is a vector space. A norm is a mapping X R with x such that for all x, y X, α R x = = x = αx = α x x + y x + y We define the following norms on the vector

More information

A NOTE ON A BASIS PROBLEM

A NOTE ON A BASIS PROBLEM PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 51, Number 2, September 1975 A NOTE ON A BASIS PROBLEM J. M. ANDERSON ABSTRACT. It is shown that the functions {exp xvx\v_. form a basis for the

More information

Integration on Measure Spaces

Integration on Measure Spaces Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of

More information

Lecture 11 Hyperbolicity.

Lecture 11 Hyperbolicity. Lecture 11 Hyperbolicity. 1 C 0 linearization near a hyperbolic point 2 invariant manifolds Hyperbolic linear maps. Let E be a Banach space. A linear map A : E E is called hyperbolic if we can find closed

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

1 The Existence and Uniqueness Theorem for First-Order Differential Equations

1 The Existence and Uniqueness Theorem for First-Order Differential Equations 1 The Existence and Uniqueness Theorem for First-Order Differential Equations Let I R be an open interval and G R n, n 1, be a domain. Definition 1.1 Let us consider a function f : I G R n. The general

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

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication 7. Banach algebras Definition 7.1. A is called a Banach algebra (with unit) if: (1) A is a Banach space; (2) There is a multiplication A A A that has the following properties: (xy)z = x(yz), (x + y)z =

More information

An Introduction to Numerical Methods for Differential Equations. Janet Peterson

An Introduction to Numerical Methods for Differential Equations. Janet Peterson An Introduction to Numerical Methods for Differential Equations Janet Peterson Fall 2015 2 Chapter 1 Introduction Differential equations arise in many disciplines such as engineering, mathematics, sciences

More information

Multivariable Calculus

Multivariable Calculus 2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)

More information

TEST CODE: PMB SYLLABUS

TEST CODE: PMB SYLLABUS TEST CODE: PMB SYLLABUS Convergence and divergence of sequence and series; Cauchy sequence and completeness; Bolzano-Weierstrass theorem; continuity, uniform continuity, differentiability; directional

More information

Basic Theory of Linear Differential Equations

Basic Theory of Linear Differential Equations Basic Theory of Linear Differential Equations Picard-Lindelöf Existence-Uniqueness Vector nth Order Theorem Second Order Linear Theorem Higher Order Linear Theorem Homogeneous Structure Recipe for Constant-Coefficient

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

f(x) f(z) c x z > 0 1

f(x) f(z) c x z > 0 1 INVERSE AND IMPLICIT FUNCTION THEOREMS I use df x for the linear transformation that is the differential of f at x.. INVERSE FUNCTION THEOREM Definition. Suppose S R n is open, a S, and f : S R n is a

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

Honours Analysis III

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

Half of Final Exam Name: Practice Problems October 28, 2014

Half of Final Exam Name: Practice Problems October 28, 2014 Math 54. Treibergs Half of Final Exam Name: Practice Problems October 28, 24 Half of the final will be over material since the last midterm exam, such as the practice problems given here. The other half

More information

4r 2 12r + 9 = 0. r = 24 ± y = e 3x. y = xe 3x. r 2 6r + 25 = 0. y(0) = c 1 = 3 y (0) = 3c 1 + 4c 2 = c 2 = 1

4r 2 12r + 9 = 0. r = 24 ± y = e 3x. y = xe 3x. r 2 6r + 25 = 0. y(0) = c 1 = 3 y (0) = 3c 1 + 4c 2 = c 2 = 1 Mathematics MATB44, Assignment 2 Solutions to Selected Problems Question. Solve 4y 2y + 9y = 0 Soln: The characteristic equation is The solutions are (repeated root) So the solutions are and Question 2

More information

2 Complex Functions and the Cauchy-Riemann Equations

2 Complex Functions and the Cauchy-Riemann Equations 2 Complex Functions and the Cauchy-Riemann Equations 2.1 Complex functions In one-variable calculus, we study functions f(x) of a real variable x. Likewise, in complex analysis, we study functions f(z)

More information

1+t 2 (l) y = 2xy 3 (m) x = 2tx + 1 (n) x = 2tx + t (o) y = 1 + y (p) y = ty (q) y =

1+t 2 (l) y = 2xy 3 (m) x = 2tx + 1 (n) x = 2tx + t (o) y = 1 + y (p) y = ty (q) y = DIFFERENTIAL EQUATIONS. Solved exercises.. Find the set of all solutions of the following first order differential equations: (a) x = t (b) y = xy (c) x = x (d) x = (e) x = t (f) x = x t (g) x = x log

More information

Defining the Integral

Defining the Integral Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be

More information

On the Periodic Solutions of Certain Fifth Order Nonlinear Vector Differential Equations

On the Periodic Solutions of Certain Fifth Order Nonlinear Vector Differential Equations On the Periodic Solutions of Certain Fifth Order Nonlinear Vector Differential Equations Melike Karta Department of Mathematics, Faculty of Science and Arts, Agri Ibrahim Cecen University, Agri, E-mail:

More information

Zweier I-Convergent Sequence Spaces

Zweier I-Convergent Sequence Spaces Chapter 2 Zweier I-Convergent Sequence Spaces In most sciences one generation tears down what another has built and what one has established another undoes. In mathematics alone each generation builds

More information

Math 361: Homework 1 Solutions

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

First and Second Order Differential Equations Lecture 4

First and Second Order Differential Equations Lecture 4 First and Second Order Differential Equations Lecture 4 Dibyajyoti Deb 4.1. Outline of Lecture The Existence and the Uniqueness Theorem Homogeneous Equations with Constant Coefficients 4.2. The Existence

More information

ABSTRACT AND CONCRETE GRONWALL LEMMAS

ABSTRACT AND CONCRETE GRONWALL LEMMAS Fixed Point Theory, 1(29), No. 2, 221-228 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html ABSTRACT AND CONCRETE GRONWALL LEMMAS CECILIA CRĂCIUN AND NICOLAE LUNGU Colfe s School Horn Park Lane London, SE12

More information

Fixed point iteration Numerical Analysis Math 465/565

Fixed point iteration Numerical Analysis Math 465/565 Fixed point iteration Numerical Analysis Math 465/565 1 Fixed Point Iteration Suppose we wanted to solve : f(x) = cos(x) x =0 or cos(x) =x We might consider a iteration of this type : x k+1 = cos(x k )

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

Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1

Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1 Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems p. 1/1 p. 2/1 Converse Lyapunov Theorem Exponential Stability Let x = 0 be an exponentially stable equilibrium

More information

Ordinary Differential Equation Theory

Ordinary Differential Equation Theory Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit

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

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

Continuity. Chapter 4

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

Lecture Notes 1. First Order ODE s. 1. First Order Linear equations A first order homogeneous linear ordinary differential equation (ODE) has the form

Lecture Notes 1. First Order ODE s. 1. First Order Linear equations A first order homogeneous linear ordinary differential equation (ODE) has the form Lecture Notes 1 First Order ODE s 1. First Order Linear equations A first order homogeneous linear ordinary differential equation (ODE) has the form This equation we rewrite in the form or From the last

More information

CHAPTER I THE RIESZ REPRESENTATION THEOREM

CHAPTER I THE RIESZ REPRESENTATION THEOREM CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

Nonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems

Nonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Time-varying Systems ẋ = f(t,x) f(t,x) is piecewise continuous in t and locally Lipschitz in x for all t 0 and all x D, (0 D). The origin

More information

Series Solutions. 8.1 Taylor Polynomials

Series Solutions. 8.1 Taylor Polynomials 8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns

More information

x arctan x = x x x x2 9 +

x arctan x = x x x x2 9 + Math 1B Project 3 Continued Fractions. Many of the special functions that occur in the applications of mathematics are defined by infinite processes, such as series, integrals, and iterations. The continued

More information

AP Calculus Testbank (Chapter 9) (Mr. Surowski)

AP Calculus Testbank (Chapter 9) (Mr. Surowski) AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series

More information

Some topics in analysis related to Banach algebras, 2

Some topics in analysis related to Banach algebras, 2 Some topics in analysis related to Banach algebras, 2 Stephen Semmes Rice University... Abstract Contents I Preliminaries 3 1 A few basic inequalities 3 2 q-semimetrics 4 3 q-absolute value functions 7

More information

2 Statement of the problem and assumptions

2 Statement of the problem and assumptions Mathematical Notes, 25, vol. 78, no. 4, pp. 466 48. Existence Theorem for Optimal Control Problems on an Infinite Time Interval A.V. Dmitruk and N.V. Kuz kina We consider an optimal control problem on

More information

MATH 819 FALL We considered solutions of this equation on the domain Ū, where

MATH 819 FALL We considered solutions of this equation on the domain Ū, where MATH 89 FALL. The D linear wave equation weak solutions We have considered the initial value problem for the wave equation in one space dimension: (a) (b) (c) u tt u xx = f(x, t) u(x, ) = g(x), u t (x,

More information

X. Linearization and Newton s Method

X. Linearization and Newton s Method 163 X. Linearization and Newton s Method ** linearization ** X, Y nls s, f : G X Y. Given y Y, find z G s.t. fz = y. Since there is no assumption about f being linear, we might as well assume that y =.

More information

Lecture 4 Lebesgue spaces and inequalities

Lecture 4 Lebesgue spaces and inequalities Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how

More information

Lax Solution Part 4. October 27, 2016

Lax Solution Part 4.   October 27, 2016 Lax Solution Part 4 www.mathtuition88.com October 27, 2016 Textbook: Functional Analysis by Peter D. Lax Exercises: Ch 16: Q2 4. Ch 21: Q1, 2, 9, 10. Ch 28: 1, 5, 9, 10. 1 Chapter 16 Exercise 2 Let h =

More information

g(t) = f(x 1 (t),..., x n (t)).

g(t) = f(x 1 (t),..., x n (t)). Reading: [Simon] p. 313-333, 833-836. 0.1 The Chain Rule Partial derivatives describe how a function changes in directions parallel to the coordinate axes. Now we shall demonstrate how the partial derivatives

More information

DYNAMICAL SYSTEMS AND NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS

DYNAMICAL SYSTEMS AND NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS DYNAMICAL SYSTEMS AND NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS J. Banasiak School of Mathematical Sciences University of KwaZulu-Natal, Durban, South Africa 2 Contents 1 Solvability of ordinary differential

More information

Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures

Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures 2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon

More information

MATH 32A: MIDTERM 2 REVIEW. sin 2 u du z(t) = sin 2 t + cos 2 2

MATH 32A: MIDTERM 2 REVIEW. sin 2 u du z(t) = sin 2 t + cos 2 2 MATH 3A: MIDTERM REVIEW JOE HUGHES 1. Curvature 1. Consider the curve r(t) = x(t), y(t), z(t), where x(t) = t Find the curvature κ(t). 0 cos(u) sin(u) du y(t) = Solution: The formula for curvature is t

More information

Partial Differential Equations

Partial Differential Equations Part II Partial Differential Equations Year 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2015 Paper 4, Section II 29E Partial Differential Equations 72 (a) Show that the Cauchy problem for u(x,

More information

Math212a1413 The Lebesgue integral.

Math212a1413 The Lebesgue integral. Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the

More information

Problem set 1, Real Analysis I, Spring, 2015.

Problem set 1, Real Analysis I, Spring, 2015. Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n

More information

Nonlinear Systems Theory

Nonlinear Systems Theory Nonlinear Systems Theory Matthew M. Peet Arizona State University Lecture 2: Nonlinear Systems Theory Overview Our next goal is to extend LMI s and optimization to nonlinear systems analysis. Today we

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

POINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS

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

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

More information

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

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,

More information

An Introduction to Partial Differential Equations

An Introduction to Partial Differential Equations An Introduction to Partial Differential Equations Ryan C. Trinity University Partial Differential Equations Lecture 1 Ordinary differential equations (ODEs) These are equations of the form where: F(x,y,y,y,y,...)

More information

Homework 27. Homework 28. Homework 29. Homework 30. Prof. Girardi, Math 703, Fall 2012 Homework: Define f : C C and u, v : R 2 R by

Homework 27. Homework 28. Homework 29. Homework 30. Prof. Girardi, Math 703, Fall 2012 Homework: Define f : C C and u, v : R 2 R by Homework 27 Define f : C C and u, v : R 2 R by f(z) := xy where x := Re z, y := Im z u(x, y) = Re f(x + iy) v(x, y) = Im f(x + iy). Show that 1. u and v satisfies the Cauchy Riemann equations at (x, y)

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

A Generalization of Barbalat s Lemma with Applications to Robust Model Predictive Control

A Generalization of Barbalat s Lemma with Applications to Robust Model Predictive Control A Generalization of Barbalat s Lemma with Applications to Robust Model Predictive Control Fernando A. C. C. Fontes 1 and Lalo Magni 2 1 Officina Mathematica, Departamento de Matemática para a Ciência e

More information

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the

More information

Several variables. x 1 x 2. x n

Several variables. x 1 x 2. x n Several variables Often we have not only one, but several variables in a problem The issues that come up are somewhat more complex than for one variable Let us first start with vector spaces and linear

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

A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES

A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES IJMMS 25:6 2001) 397 409 PII. S0161171201002290 http://ijmms.hindawi.com Hindawi Publishing Corp. A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES

More information

Resolution for Predicate Logic

Resolution for Predicate Logic Logic and Proof Hilary 2016 James Worrell Resolution for Predicate Logic A serious drawback of the ground resolution procedure is that it requires looking ahead to predict which ground instances of clauses

More information

Essential Ordinary Differential Equations

Essential Ordinary Differential Equations MODULE 1: MATHEMATICAL PRELIMINARIES 10 Lecture 2 Essential Ordinary Differential Equations In this lecture, we recall some methods of solving first-order IVP in ODE (separable and linear) and homogeneous

More information

Into a Hilbert Space

Into a Hilbert Space ariv:math/0410427v1 [math.fa] 19 Oct 2004 l p (p > 2) Does Not Coarsely Embed Into a Hilbert Space William B. JOHNSON and N. Lovasoa RANDRIANARIVONY 1 A (not necessarily continuous) map f between two metric

More information

MATH 220: PROBLEM SET 1, SOLUTIONS DUE FRIDAY, OCTOBER 2, 2015

MATH 220: PROBLEM SET 1, SOLUTIONS DUE FRIDAY, OCTOBER 2, 2015 MATH 220: PROBLEM SET 1, SOLUTIONS DUE FRIDAY, OCTOBER 2, 2015 Problem 1 Classify the following PDEs by degree of non-linearity (linear, semilinear, quasilinear, fully nonlinear: (1 (cos x u x + u y =

More information

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε 1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

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

Austin Mohr Math 704 Homework 6

Austin Mohr Math 704 Homework 6 Austin Mohr Math 704 Homework 6 Problem 1 Integrability of f on R does not necessarily imply the convergence of f(x) to 0 as x. a. There exists a positive continuous function f on R so that f is integrable

More information

PUTNAM PROBLEMS DIFFERENTIAL EQUATIONS. First Order Equations. p(x)dx)) = q(x) exp(

PUTNAM PROBLEMS DIFFERENTIAL EQUATIONS. First Order Equations. p(x)dx)) = q(x) exp( PUTNAM PROBLEMS DIFFERENTIAL EQUATIONS First Order Equations 1. Linear y + p(x)y = q(x) Muliply through by the integrating factor exp( p(x)) to obtain (y exp( p(x))) = q(x) exp( p(x)). 2. Separation of

More information

56 4 Integration against rough paths

56 4 Integration against rough paths 56 4 Integration against rough paths comes to the definition of a rough integral we typically take W = LV, W ; although other choices can be useful see e.g. remark 4.11. In the context of rough differential

More information

Sec. 1.1: Basics of Vectors

Sec. 1.1: Basics of Vectors Sec. 1.1: Basics of Vectors Notation for Euclidean space R n : all points (x 1, x 2,..., x n ) in n-dimensional space. Examples: 1. R 1 : all points on the real number line. 2. R 2 : all points (x 1, x

More information

2 Sequences, Continuity, and Limits

2 Sequences, Continuity, and Limits 2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs

More information

THE CONTRACTION MAPPING THEOREM

THE CONTRACTION MAPPING THEOREM THE CONTRACTION MAPPING THEOREM KEITH CONRAD 1. Introduction Let f : X X be a mapping from a set X to itself. We call a point x X a fixed point of f if f(x) = x. For example, if [a, b] is a closed interval

More information