are continuous). Then we also know that the above function g is continuously differentiable on [a, b]. For that purpose, we will first show that

Size: px
Start display at page:

Download "are continuous). Then we also know that the above function g is continuously differentiable on [a, b]. For that purpose, we will first show that"

Transcription

1 Derivatives and Integrals Now suppose f : [a, b] [c, d] IR is continuous. It is easy to see that for each fixed x [a, b] the function f x (y) = f(x, y) is continuous on [c, d] (note that f x is sometimes used to denote the partial derivative of f w.r.t. x). In particular f x R[c, d] and hence the function g(x) = d c f(x, y)dy is well defined. Using uniform convergence of f(x n, y) to f(x 0, y) on [c, d] (or using the definition of limit), we see that d lim n) = n c f(x 0, y)dy for any sequence (x n ) in [a, b] such that lim n x n = x 0. It then follows that g is a continuous function on [a, b]. Next suppose f C 1 ([a, b] [c, d]). That is, f and all its first directional derivatives are continuous (it is equivalent as requiring both x and y are continuous). Then we also know that the above function g is continuously differentiable on [a, b]. For that purpose, we will first show that g(x n ) g(x 0 ) d lim = n x n x 0 c x (x 0, y)dy for any sequence (x n ) [a, b], x n x 0 and lim n x n = x 0. Again, the above can be shown by showing that f(xn,y) f(x 0,y) x n x 0 converges uniformly to x (x 0, y) on [c, d]. To do this, use Mean value theorem and uniform convergence (or using the definition of limit). 75

2 S, 2016 What about improper integrals? We will just demonstrate it for the case [0, ). Suppose f : [a, b] [0, ) IR is continuous such that the improper integral 0 f(x, y)dy converges uniformly on [a, b]. Then again the function g(x) = 0 f(x, y)dy is a continuous function on [a, b]. Finally, we have the following theorem for derivative and improper integrals. simplicity, we only discuss only one type of improper integral here. Theorem Suppose f C 1 ([a, b] [c, )), and both the improper integrals c f(x, y)dy and c on [a, b] and (x, y)dy converge uniformly on [a, b], then g is continuously differentiable x g (x) = c (x, y)dy. x For What about the derivative of the function x c f(x, y)dy?

3 3110S, Implicit function theorem and inverse function theorem Let f : IR IR be such that f (c) 0. If f is continuous on a neighborhood of c, then f will be of constant sign on a (possibly smaller) neighborhood of c. For simplicity, we may assume that this neighborhood is an open interval I. It then follows from the mean value theorem that f(x) f(y) for all x y, x, y I. Hence f is 1-1 on that interval. Moreover, the range of the interval must be also an open interval J (why?). Hence, we can define an inverse function for f on J. This is called the inverse function theorem. Indeed, the above is true for a continuously differentiable function f : D IR n IR n. If the linear transform (f)(c) (c D, D is open) is invertible, then there exist an open set U (in D) containing c and an open set V containing f(c) such that f is 1-1 from U onto V. It is then possible to define an inverse function f 1 : V U. With the help of chain rule, we see that f 1 is also differentiable and Id n n = f f 1 (x) (f 1 ) x.

4 S, 2016 Closely related to inverse function theorem is the implicit function theorem. Let f : IR 2 IR be continuously differentiable such that x 2 (c) 0 c = (c 1, c 2 ). Then there exists an open interval I containing c 1 and a differentiable function g : I IR such that g(c 1 ) = c 2 and f(x, g(x)) = f(c) for all x I. Moreover, g (x) = x 1 / x 2 on I. Proof. Indeed, if f : IR n+1 IR is continuously differentiable such that x n+1 (c) 0 c = (c 1,, c n+1 ), then there exist an open set U IR n containing (c 1, c 2,, c n ) and a differentiable function g : U IR such that g(c 1,, c n ) = c n+1 and f(x, g(x)) = f(c) for all x U. Moreover, xi g(x) = g x i = x i / x n+1 on U. Proof: Consider the function f(x) = (x, x,, f(x)). Then f : IR n+1 IR n+1 and f c is invertible. Remark Of course, there is also an implicit function theorem for f : IR n+m IR m being continuously differentiable such that the derivative of h = (f 1, f 2,, f m ) at c is invertible. Note that conversely, implicit function theorem implies inverse function theorem.

5 3110S, Taylor s formula By letting g(t) = f(c+t(z c)) we are able to produce a Taylor s formula using partial derivatives. Extremum Similar to one variable functions, if a function has a local extremum at a point c (of an open set), then f(c) must be the zero vector (if it exists). Moreover, Theorem Let f : IR 2 IR be twice continuously differentiable on an open set U and c U. Suppose f(c) = 0. Denote A = x1 x 1 f(c), B = x1 x 2 f(c) and C = x2 x 2 f(c) and 2 f(c) be the two by two matrix ( xi x j f(c)) i,j=1,2. Then (i) If det ( 2 f(c)) > 0 and A > 0 (and hence C > 0), then f has a local minimum at c. (ii) If det ( 2 f(c)) > 0 and A < 0 (and hence C < 0), then f has a local maximum at c. (iii) If det ( 2 f(c)) < 0, then f has a saddle point at c.

6 S, 2016 Remark (i) On IR n, a similar theorem for above will be if x T ( 2 f(c))x 0 with equality only at x = 0 (usually known as ( 2 f(c)) being positive definite), then c is a local minimum. Similarly, if the quadratic form is negative definite, then c is a local maximum. (ii) If c is a local extremum of f, then Proof. (a) d dt t=0f(c + t v) = 0 if it exists. (b) d2 dt t=0f(c + t v) 0 (if it exists) when c is a local maximum. 2 (c) d2 dt t=0f(c + t v) 0 (if it exists) when c is a local minimum. 2 (d) In particular x 2 i f 0 at local maximum and x 2 i f 0 at local minimum. (e) If d 2 dt 2 t=0f(c + t v) < 0 for all nonnezero v, then c is a local maximum. d 2 (f) If dt t=0f(c + t v) > 0 for all nonnezero v, then c is a local minimum. 2 For (ii), just consider the function g(t) = f(c+t v). For (i), it is a consequence of Taylor s formula.

7 3110S, Lagrange multiplier It is usually necessary to find extremum of functions under constraint. For example, let f, g : D IR n R be (at least) continuous. We want to find the extremum of f on {x D : g(x) = 0}. First, we will find all possible points of local extremums. To do that, we have a useful method: Lagrange multiplier. The method of Lagrange multiplier is based on the following fact: If f has a local extremum at c subject to the constraint g(x) = 0, then f c is a scalar multiple of g c if g c 0. In general, under the constraints, g i (x) = 0 for i = 1,, m we can conclude that f c = m i=1 λ i g i c for some λ 1,, λ m IR. Proof. To see that, first note that if γ : ( ε, ε) D is differentiable such that γ(0) = c and g i (γ(t)) = 0 for all i, then g i c γ (0) = 0. Since c is a local extremum, we have 0 = d dt t=0f(γ(t)) = f c γ (0). Next, we will use the implicit function theorem to show that if g i c v = 0, for all i and v 0, then there exists differentiable γ : ( ε, ε) D such that γ(0) = c, γ (0) = v and g i (γ(t)) = 0 for all i. It then follows that f c v = 0. It is now clear that f c is in the linear span of { g i c : i = 1,, m}.

8 S, 2016 Riemann Integrals on higher dimension Let R be a parallelepiped with edges parallel to axes, that is R = [a 1, b 1 ] [a n, b n ]. For simplicity, we will say R is a closed interval in IR n. P is said to be a partition of R if P = {R j : j = 1,, N}, N N, R j s are closed interval in IR n such that R = N j=1r j and they intercept each other only at the boundary and not the interior. We could then define upper and lower sum U(P, f), L(P, f) just as before and so are upper integral and lower integral of f on R. Again, we say a function f is Riemann integral on R if it is bounded and its upper integral coincide with its lower integral. It is then easy to see that continuous functions are Riemann integrable. Moreover, one can again show that (but its proof will be more complicated): R fdx = lim R(P, f, ξ) = lim f(ξj )vol(r j ). P 0 P 0 We will take P be the maximum of lengths of closed intervals R j in the partition. It is then clear that sum and product of integrable functions are integrable and Riemann integral is linear. An important class of Riemann integrable functions are Characteristic functions of domains D with D having measure zero. It is integrable as it is continuous on both D and D c. Fubini s theorem It is clear that if f is continuous, then b d a c f(x, y)dydx = d b c a f(x, y)dxdy. The theorem follows from the fact that linear combinations of products of single variable functions are (uniformly) dense in C(R) (the set of continuous functions on R = [a, b] [c, d]). That is given any ε > 0, there exist continuous functions functions h i C[a, b], g i C[c, d], i = 1,, N, N N such that f(x, y) N i=1 h i (x)g i (y) R < ε.

9 3110S, Indeed, Fubini s theorem holds for any Riemann integrable function f such that f x (y) = f(x, y) is integrable on [c, d] for each x [a, b] and f y (x) = f(x, y) is Riemann integrable for each y [c, d]. Fubini s theorem for improper integral We will just discuss a typical example [0, ) [0, ) here. Theorem Let f R([0, N] [0, N]) for all N and for all ε > 0, there exists N > 0 such that R V S U f(x, y)dxdy < ε for all R > S > N, V > U > N. Suppose also that f x (y) and f y (x) are both integrable on all finite intervals. Then 0 0 f(x, y)dxdy = 0 0 f(x, y)dydx.

Course Summary Math 211

Course Summary Math 211 Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.

More information

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE)

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE) Review of Multi-Calculus (Study Guide for Spivak s CHPTER ONE TO THREE) This material is for June 9 to 16 (Monday to Monday) Chapter I: Functions on R n Dot product and norm for vectors in R n : Let X

More information

MATH. 4548, Autumn 15, MWF 12:40 p.m. QUIZ 1 September 4, 2015 PRINT NAME A. Derdzinski Show all work. No calculators. The problem is worth 10 points.

MATH. 4548, Autumn 15, MWF 12:40 p.m. QUIZ 1 September 4, 2015 PRINT NAME A. Derdzinski Show all work. No calculators. The problem is worth 10 points. MATH. 4548, Autumn 15, MWF 12:40 p.m. QUIZ 1 September 4, 2015 PRINT NAME A. Derdzinski Show all work. No calculators. The problem is worth 10 points. 1. Let f : (, 0) IR be given by f(x) = 1/x 2. Prove

More information

FIXED POINT ITERATIONS

FIXED POINT ITERATIONS FIXED POINT ITERATIONS MARKUS GRASMAIR 1. Fixed Point Iteration for Non-linear Equations Our goal is the solution of an equation (1) F (x) = 0, where F : R n R n is a continuous vector valued mapping in

More information

Mathematical Analysis IIa (STÆ207G): Notes on manifolds, tangent spaces

Mathematical Analysis IIa (STÆ207G): Notes on manifolds, tangent spaces Mathematical Analysis IIa (STÆ27G): Notes on manifolds, tangent spaces Valentina Giangreco Puletti February 215, Revised in Feb 217 ontents 1 Manifolds: Summary 3 1.1 Equation vs Parameterization............................

More information

Higher order derivative

Higher order derivative 2 Î 3 á Higher order derivative Î 1 Å Iterated partial derivative Iterated partial derivative Suppose f has f/ x, f/ y and ( f ) = 2 f x x x 2 ( f ) = 2 f x y x y ( f ) = 2 f y x y x ( f ) = 2 f y y y

More information

Numerical Analysis: Interpolation Part 1

Numerical Analysis: Interpolation Part 1 Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,

More information

APPLICATIONS OF DIFFERENTIABILITY IN R n.

APPLICATIONS OF DIFFERENTIABILITY IN R n. APPLICATIONS OF DIFFERENTIABILITY IN R n. MATANIA BEN-ARTZI April 2015 Functions here are defined on a subset T R n and take values in R m, where m can be smaller, equal or greater than n. The (open) ball

More information

Implicit Functions, Curves and Surfaces

Implicit Functions, Curves and Surfaces Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then

More information

MA102: Multivariable Calculus

MA102: Multivariable Calculus MA102: Multivariable Calculus Rupam Barman and Shreemayee Bora Department of Mathematics IIT Guwahati Differentiability of f : U R n R m Definition: Let U R n be open. Then f : U R n R m is differentiable

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

Multivariable Calculus Notes. Faraad Armwood. Fall: Chapter 1: Vectors, Dot Product, Cross Product, Planes, Cylindrical & Spherical Coordinates

Multivariable Calculus Notes. Faraad Armwood. Fall: Chapter 1: Vectors, Dot Product, Cross Product, Planes, Cylindrical & Spherical Coordinates Multivariable Calculus Notes Faraad Armwood Fall: 2017 Chapter 1: Vectors, Dot Product, Cross Product, Planes, Cylindrical & Spherical Coordinates Chapter 2: Vector-Valued Functions, Tangent Vectors, Arc

More information

Indeed, the family is still orthogonal if we consider a complex valued inner product ( or an inner product on complex vector space)

Indeed, the family is still orthogonal if we consider a complex valued inner product ( or an inner product on complex vector space) Fourier series of complex valued functions Suppose now f is a piecewise continuous complex valued function on [, π], that is f(x) = u(x)+iv(x) such that both u and v are real valued piecewise continuous

More information

HOMEWORK 7 SOLUTIONS

HOMEWORK 7 SOLUTIONS HOMEWORK 7 SOLUTIONS MA11: ADVANCED CALCULUS, HILARY 17 (1) Using the method of Lagrange multipliers, find the largest and smallest values of the function f(x, y) xy on the ellipse x + y 1. Solution: The

More information

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games

Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,

More information

Differentiation. f(x + h) f(x) Lh = L.

Differentiation. f(x + h) f(x) Lh = L. Analysis in R n Math 204, Section 30 Winter Quarter 2008 Paul Sally, e-mail: sally@math.uchicago.edu John Boller, e-mail: boller@math.uchicago.edu website: http://www.math.uchicago.edu/ boller/m203 Differentiation

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

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces Introduction to Optimization Techniques Nonlinear Optimization in Function Spaces X : T : Gateaux and Fréchet Differentials Gateaux and Fréchet Differentials a vector space, Y : a normed space transformation

More information

Advanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x

Advanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x . Define f n, g n : [, ] R by f n (x) = Advanced Calculus Math 27B, Winter 25 Solutions: Final nx2 + n 2 x, g n(x) = n2 x 2 + n 2 x. 2 Show that the sequences (f n ), (g n ) converge pointwise on [, ],

More information

SIMPLE MULTIVARIATE OPTIMIZATION

SIMPLE MULTIVARIATE OPTIMIZATION SIMPLE MULTIVARIATE OPTIMIZATION 1. DEFINITION OF LOCAL MAXIMA AND LOCAL MINIMA 1.1. Functions of variables. Let f(, x ) be defined on a region D in R containing the point (a, b). Then a: f(a, b) is a

More information

Vector Spaces and SubSpaces

Vector Spaces and SubSpaces Vector Spaces and SubSpaces Linear Algebra MATH 2076 Linear Algebra Vector Spaces & SubSpaces Chapter 4, Section 1b 1 / 10 What is a Vector Space? A vector space is a bunch of objects that we call vectors

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory

More information

Calculus - II Multivariable Calculus. M.Thamban Nair. Department of Mathematics Indian Institute of Technology Madras

Calculus - II Multivariable Calculus. M.Thamban Nair. Department of Mathematics Indian Institute of Technology Madras Calculus - II Multivariable Calculus M.Thamban Nair epartment of Mathematics Indian Institute of Technology Madras February 27 Revised: January 29 Contents Preface v 1 Functions of everal Variables 1 1.1

More information

Math 207 Honors Calculus III Final Exam Solutions

Math 207 Honors Calculus III Final Exam Solutions Math 207 Honors Calculus III Final Exam Solutions PART I. Problem 1. A particle moves in the 3-dimensional space so that its velocity v(t) and acceleration a(t) satisfy v(0) = 3j and v(t) a(t) = t 3 for

More information

FINAL REVIEW Answers and hints Math 311 Fall 2017

FINAL REVIEW Answers and hints Math 311 Fall 2017 FINAL RVIW Answers and hints Math 3 Fall 7. Let R be a Jordan region and let f : R be integrable. Prove that the graph of f, as a subset of R 3, has zero volume. Let R be a rectangle with R. Since f is

More information

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced

More information

MAT 257, Handout 13: December 5-7, 2011.

MAT 257, Handout 13: December 5-7, 2011. MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most

More information

Copyright c 2007 Jason Underdown Some rights reserved. quadratic formula. absolute value. properties of absolute values

Copyright c 2007 Jason Underdown Some rights reserved. quadratic formula. absolute value. properties of absolute values Copyright & License Formula Copyright c 2007 Jason Underdown Some rights reserved. quadratic formula absolute value properties of absolute values equation of a line in various forms equation of a circle

More information

The Mean Value Theorem and the Extended Mean Value Theorem

The Mean Value Theorem and the Extended Mean Value Theorem The Mean Value Theorem and the Extended Mean Value Theorem Willard Miller September 21, 2006 0.1 The MVT Recall the Extreme Value Theorem (EVT) from class: If the function f is defined and continuous on

More information

Vector Derivatives and the Gradient

Vector Derivatives and the Gradient ECE 275AB Lecture 10 Fall 2008 V1.1 c K. Kreutz-Delgado, UC San Diego p. 1/1 Lecture 10 ECE 275A Vector Derivatives and the Gradient ECE 275AB Lecture 10 Fall 2008 V1.1 c K. Kreutz-Delgado, UC San Diego

More information

Multiple Integrals. Introduction and Double Integrals Over Rectangular Regions. Philippe B. Laval. Spring 2012 KSU

Multiple Integrals. Introduction and Double Integrals Over Rectangular Regions. Philippe B. Laval. Spring 2012 KSU Multiple Integrals Introduction and Double Integrals Over Rectangular Regions Philippe B Laval KSU Spring 2012 Philippe B Laval (KSU) Multiple Integrals Spring 2012 1 / 21 Introduction In this section

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

MA1032-Numerical Analysis-Analysis Part-14S2- 1 of 8

MA1032-Numerical Analysis-Analysis Part-14S2-  1 of 8 MA1032-Numerical Analysis-Analysis Part-14S2-www.math.mrt.ac.lk/UCJ-20151221-Page 1 of 8 RIEMANN INTEGRAL Example: Use equal partitions of [0,1] to estimate the area under the curve = using 1. left corner

More information

M2P1 Analysis II (2005) Dr M Ruzhansky List of definitions, statements and examples. Chapter 1: Limits and continuity.

M2P1 Analysis II (2005) Dr M Ruzhansky List of definitions, statements and examples. Chapter 1: Limits and continuity. M2P1 Analysis II (2005) Dr M Ruzhansky List of definitions, statements and examples. Chapter 1: Limits and continuity. This chapter is mostly the revision of Chapter 6 of M1P1. First we consider functions

More information

Families of Functions, Taylor Polynomials, l Hopital s

Families of Functions, Taylor Polynomials, l Hopital s Unit #6 : Rule Families of Functions, Taylor Polynomials, l Hopital s Goals: To use first and second derivative information to describe functions. To be able to find general properties of families of functions.

More information

Math 117: Honours Calculus I Fall, 2002 List of Theorems. a n k b k. k. Theorem 2.1 (Convergent Bounded) A convergent sequence is bounded.

Math 117: Honours Calculus I Fall, 2002 List of Theorems. a n k b k. k. Theorem 2.1 (Convergent Bounded) A convergent sequence is bounded. Math 117: Honours Calculus I Fall, 2002 List of Theorems Theorem 1.1 (Binomial Theorem) For all n N, (a + b) n = n k=0 ( ) n a n k b k. k Theorem 2.1 (Convergent Bounded) A convergent sequence is bounded.

More information

Calculus 2502A - Advanced Calculus I Fall : Local minima and maxima

Calculus 2502A - Advanced Calculus I Fall : Local minima and maxima Calculus 50A - Advanced Calculus I Fall 014 14.7: Local minima and maxima Martin Frankland November 17, 014 In these notes, we discuss the problem of finding the local minima and maxima of a function.

More information

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016

1 Overview. 2 A Characterization of Convex Functions. 2.1 First-order Taylor approximation. AM 221: Advanced Optimization Spring 2016 AM 221: Advanced Optimization Spring 2016 Prof. Yaron Singer Lecture 8 February 22nd 1 Overview In the previous lecture we saw characterizations of optimality in linear optimization, and we reviewed the

More information

Functional Analysis Exercise Class

Functional Analysis Exercise Class Functional Analysis Exercise Class Wee November 30 Dec 4: Deadline to hand in the homewor: your exercise class on wee December 7 11 Exercises with solutions Recall that every normed space X can be isometrically

More information

Convex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version

Convex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version Convex Optimization Theory Chapter 5 Exercises and Solutions: Extended Version Dimitri P. Bertsekas Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com

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

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1 Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear

More information

Calculus The Mean Value Theorem October 22, 2018

Calculus The Mean Value Theorem October 22, 2018 Calculus The Mean Value Theorem October, 018 Definitions Let c be a number in the domain D of a function f. Then f(c) is the (a) absolute maximum value of f on D, i.e. f(c) = max, if f(c) for all x in

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

1 Definition of the Riemann integral

1 Definition of the Riemann integral MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of

More information

Solutions Final Exam May. 14, 2014

Solutions Final Exam May. 14, 2014 Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10

More information

REVIEW OF DIFFERENTIAL CALCULUS

REVIEW OF DIFFERENTIAL CALCULUS REVIEW OF DIFFERENTIAL CALCULUS DONU ARAPURA 1. Limits and continuity To simplify the statements, we will often stick to two variables, but everything holds with any number of variables. Let f(x, y) be

More information

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40 NATIONAL BOARD FOR HIGHER MATHEMATICS Research Scholarships Screening Test Saturday, February 2, 2008 Time Allowed: Two Hours Maximum Marks: 40 Please read, carefully, the instructions on the following

More information

MATH 019: Final Review December 3, 2017

MATH 019: Final Review December 3, 2017 Name: MATH 019: Final Review December 3, 2017 1. Given f(x) = x 5, use the first or second derivative test to complete the following (a) Calculate f (x). If using the second derivative test, calculate

More information

MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula.

MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula. MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula. Points of local extremum Let f : E R be a function defined on a set E R. Definition. We say that f attains a local maximum

More information

M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version

M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version M2PM1 Analysis II (2008) Dr M Ruzhansky List of definitions, statements and examples Preliminary version Chapter 0: Some revision of M1P1: Limits and continuity This chapter is mostly the revision of Chapter

More information

MATH The Chain Rule Fall 2016 A vector function of a vector variable is a function F: R n R m. In practice, if x 1, x n is the input,

MATH The Chain Rule Fall 2016 A vector function of a vector variable is a function F: R n R m. In practice, if x 1, x n is the input, MATH 20550 The Chain Rule Fall 2016 A vector function of a vector variable is a function F: R n R m. In practice, if x 1, x n is the input, F(x 1,, x n ) F 1 (x 1,, x n ),, F m (x 1,, x n ) where each

More information

Math 127C, Spring 2006 Final Exam Solutions. x 2 ), g(y 1, y 2 ) = ( y 1 y 2, y1 2 + y2) 2. (g f) (0) = g (f(0))f (0).

Math 127C, Spring 2006 Final Exam Solutions. x 2 ), g(y 1, y 2 ) = ( y 1 y 2, y1 2 + y2) 2. (g f) (0) = g (f(0))f (0). Math 27C, Spring 26 Final Exam Solutions. Define f : R 2 R 2 and g : R 2 R 2 by f(x, x 2 (sin x 2 x, e x x 2, g(y, y 2 ( y y 2, y 2 + y2 2. Use the chain rule to compute the matrix of (g f (,. By the chain

More information

Solutions to Homework 9

Solutions to Homework 9 Solutions to Homework 9 Read the proof of proposition 1.7 on p. 271 (section 7.1). Write a more detailed proof. In particular, state the defintion of uniformly continuous and explain the comment whose

More information

Differentiable Functions

Differentiable Functions Differentiable Functions Let S R n be open and let f : R n R. We recall that, for x o = (x o 1, x o,, x o n S the partial derivative of f at the point x o with respect to the component x j is defined as

More information

Caculus 221. Possible questions for Exam II. March 19, 2002

Caculus 221. Possible questions for Exam II. March 19, 2002 Caculus 221 Possible questions for Exam II March 19, 2002 These notes cover the recent material in a style more like the lecture than the book. The proofs in the book are in section 1-11. At the end there

More information

Optimization Theory. Lectures 4-6

Optimization Theory. Lectures 4-6 Optimization Theory Lectures 4-6 Unconstrained Maximization Problem: Maximize a function f:ú n 6 ú within a set A f ú n. Typically, A is ú n, or the non-negative orthant {x0ú n x$0} Existence of a maximum:

More information

Numerical Optimization of Partial Differential Equations

Numerical Optimization of Partial Differential Equations Numerical Optimization of Partial Differential Equations Part I: basic optimization concepts in R n Bartosz Protas Department of Mathematics & Statistics McMaster University, Hamilton, Ontario, Canada

More information

Lecture 13 - Wednesday April 29th

Lecture 13 - Wednesday April 29th Lecture 13 - Wednesday April 29th jacques@ucsdedu Key words: Systems of equations, Implicit differentiation Know how to do implicit differentiation, how to use implicit and inverse function theorems 131

More information

CONTENTS. Preface Preliminaries 1

CONTENTS. Preface Preliminaries 1 Preface xi Preliminaries 1 1 TOOLS FOR ANALYSIS 5 1.1 The Completeness Axiom and Some of Its Consequences 5 1.2 The Distribution of the Integers and the Rational Numbers 12 1.3 Inequalities and Identities

More information

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0 Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =

More information

HW3 - Due 02/06. Each answer must be mathematically justified. Don t forget your name. 1 2, A = 2 2

HW3 - Due 02/06. Each answer must be mathematically justified. Don t forget your name. 1 2, A = 2 2 HW3 - Due 02/06 Each answer must be mathematically justified Don t forget your name Problem 1 Find a 2 2 matrix B such that B 3 = A, where A = 2 2 If A was diagonal, it would be easy: we would just take

More information

Tangent spaces, normals and extrema

Tangent spaces, normals and extrema Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent

More information

8 Singular Integral Operators and L p -Regularity Theory

8 Singular Integral Operators and L p -Regularity Theory 8 Singular Integral Operators and L p -Regularity Theory 8. Motivation See hand-written notes! 8.2 Mikhlin Multiplier Theorem Recall that the Fourier transformation F and the inverse Fourier transformation

More information

Partial Derivatives Formulas. KristaKingMath.com

Partial Derivatives Formulas. KristaKingMath.com Partial Derivatives Formulas KristaKingMath.com Domain and range of a multivariable function A function f of two variables is a rule that assigns to each ordered pair of real numbers (x, y) in a set D

More information

Multiple Integrals. Introduction and Double Integrals Over Rectangular Regions. Philippe B. Laval KSU. Today

Multiple Integrals. Introduction and Double Integrals Over Rectangular Regions. Philippe B. Laval KSU. Today Multiple Integrals Introduction and Double Integrals Over Rectangular Regions Philippe B. Laval KSU Today Philippe B. Laval (KSU) Double Integrals Today 1 / 21 Introduction In this section we define multiple

More information

Chapter 2: Unconstrained Extrema

Chapter 2: Unconstrained Extrema Chapter 2: Unconstrained Extrema Math 368 c Copyright 2012, 2013 R Clark Robinson May 22, 2013 Chapter 2: Unconstrained Extrema 1 Types of Sets Definition For p R n and r > 0, the open ball about p of

More information

Chapter 3. Differentiable Mappings. 1. Differentiable Mappings

Chapter 3. Differentiable Mappings. 1. Differentiable Mappings Chapter 3 Differentiable Mappings 1 Differentiable Mappings Let V and W be two linear spaces over IR A mapping L from V to W is called a linear mapping if L(u + v) = Lu + Lv for all u, v V and L(λv) =

More information

0, otherwise. Find each of the following limits, or explain that the limit does not exist.

0, otherwise. Find each of the following limits, or explain that the limit does not exist. Midterm Solutions 1, y x 4 1. Let f(x, y) = 1, y 0 0, otherwise. Find each of the following limits, or explain that the limit does not exist. (a) (b) (c) lim f(x, y) (x,y) (0,1) lim f(x, y) (x,y) (2,3)

More information

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ Question No: 1 (Marks: 1) If for a linear transformation the equation T(x) =0 has only the trivial solution then T is One-to-one Onto Question

More information

Math 409 Final Exam Solutions May 9, 2005

Math 409 Final Exam Solutions May 9, 2005 Math 49 Final Exam Solutions May 9, 25 1. 25) State and prove the monotone convergence theorem. Then use it to show that the recursive sequence defined below converges to some number l. What must l equal?

More information

The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems

The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems The Contraction Mapping Theorem Theorem The Contraction Mapping Theorem) Let B a = { x IR d x < a } denote the open ball of

More information

II. FOURIER TRANSFORM ON L 1 (R)

II. FOURIER TRANSFORM ON L 1 (R) II. FOURIER TRANSFORM ON L 1 (R) In this chapter we will discuss the Fourier transform of Lebesgue integrable functions defined on R. To fix the notation, we denote L 1 (R) = {f : R C f(t) dt < }. The

More information

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any

More information

CALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M =

CALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = CALCULUS ON MANIFOLDS 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = a M T am, called the tangent bundle, is itself a smooth manifold, dim T M = 2n. Example 1.

More information

University of Houston, Department of Mathematics Numerical Analysis, Fall 2005

University of Houston, Department of Mathematics Numerical Analysis, Fall 2005 3 Numerical Solution of Nonlinear Equations and Systems 3.1 Fixed point iteration Reamrk 3.1 Problem Given a function F : lr n lr n, compute x lr n such that ( ) F(x ) = 0. In this chapter, we consider

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

MATH2111 Higher Several Variable Calculus Integration

MATH2111 Higher Several Variable Calculus Integration MATH2 Higher Several Variable Calculus Integration Dr. Jonathan Kress School of Mathematics and Statistics University of New South Wales Semester, 26 [updated: April 3, 26] JM Kress (UNSW Maths & Stats)

More information

Math 117: Honours Calculus I Fall, 2012 List of Theorems. a n k b k. k. Theorem 2.1 (Convergent Bounded): A convergent sequence is bounded.

Math 117: Honours Calculus I Fall, 2012 List of Theorems. a n k b k. k. Theorem 2.1 (Convergent Bounded): A convergent sequence is bounded. Math 117: Honours Calculus I Fall, 2012 List of Theorems Theorem 1.1 (Binomial Theorem): For all n N, (a+b) n = n k=0 ( ) n a n k b k. k Theorem 2.1 (Convergent Bounded): A convergent sequence is bounded.

More information

Some analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim

Some analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim Some analysis problems. Let f be a continuous function on R and let for n =,2,..., F n (x) = x (x t) n f(t)dt. Prove that F n is n times differentiable, and prove a simple formula for its n-th derivative.

More information

MATH 205C: STATIONARY PHASE LEMMA

MATH 205C: STATIONARY PHASE LEMMA MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)

More information

Test 3 Review. y f(a) = f (a)(x a) y = f (a)(x a) + f(a) L(x) = f (a)(x a) + f(a)

Test 3 Review. y f(a) = f (a)(x a) y = f (a)(x a) + f(a) L(x) = f (a)(x a) + f(a) MATH 2250 Calculus I Eric Perkerson Test 3 Review Sections Covered: 3.11, 4.1 4.6. Topics Covered: Linearization, Extreme Values, The Mean Value Theorem, Consequences of the Mean Value Theorem, Concavity

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

Math 425 Notes 9. We state a rough version of the fundamental theorem of calculus. Almost all calculations involving integrals lead back to this.

Math 425 Notes 9. We state a rough version of the fundamental theorem of calculus. Almost all calculations involving integrals lead back to this. Multiple Integrals: efintion Math 425 Notes 9 We state a rough version of the fundamental theorem of calculus. Almost all calculations involving integrals lead back to this. efinition 1. Let f : R R and

More information

Basics of Calculus and Algebra

Basics of Calculus and Algebra Monika Department of Economics ISCTE-IUL September 2012 Basics of linear algebra Real valued Functions Differential Calculus Integral Calculus Optimization Introduction I A matrix is a rectangular array

More information

Math 302 Outcome Statements Winter 2013

Math 302 Outcome Statements Winter 2013 Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a

More information

Math 4263 Homework Set 1

Math 4263 Homework Set 1 Homework Set 1 1. Solve the following PDE/BVP 2. Solve the following PDE/BVP 2u t + 3u x = 0 u (x, 0) = sin (x) u x + e x u y = 0 u (0, y) = y 2 3. (a) Find the curves γ : t (x (t), y (t)) such that that

More information

The Contraction Mapping Theorem and the Implicit Function Theorem

The Contraction Mapping Theorem and the Implicit Function Theorem The Contraction Mapping Theorem and the Implicit Function Theorem Theorem The Contraction Mapping Theorem Let B a = { x IR d x < a } denote the open ball of radius a centred on the origin in IR d. If the

More information

REAL ANALYSIS II: PROBLEM SET 2

REAL ANALYSIS II: PROBLEM SET 2 REAL ANALYSIS II: PROBLEM SET 2 21st Feb, 2016 Exercise 1. State and prove the Inverse Function Theorem. Theorem Inverse Function Theorem). Let f be a continuous one to one function defined on an interval,

More information

E 600 Chapter 3: Multivariate Calculus

E 600 Chapter 3: Multivariate Calculus E 600 Chapter 3: Multivariate Calculus Simona Helmsmueller August 21, 2017 Goals of this lecture: Know when an inverse to a function exists, be able to graphically and analytically determine whether a

More information

Elementary maths for GMT

Elementary maths for GMT Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1

More information

MATHEMATICAL ECONOMICS: OPTIMIZATION. Contents

MATHEMATICAL ECONOMICS: OPTIMIZATION. Contents MATHEMATICAL ECONOMICS: OPTIMIZATION JOÃO LOPES DIAS Contents 1. Introduction 2 1.1. Preliminaries 2 1.2. Optimal points and values 2 1.3. The optimization problems 3 1.4. Existence of optimal points 4

More information

Economics 204 Summer/Fall 2011 Lecture 11 Monday August 8, f(x + h) (f(x) + ah) = a = 0 = 0. f(x + h) (f(x) + T x (h))

Economics 204 Summer/Fall 2011 Lecture 11 Monday August 8, f(x + h) (f(x) + ah) = a = 0 = 0. f(x + h) (f(x) + T x (h)) Economics 204 Summer/Fall 2011 Lecture 11 Monday August 8, 2011 Sections 41-43 (Unified) Definition 1 Let f : I R, where I R is an open interval f is differentiable at x I if for some a R f(x + h) f lim

More information

Linear Independence of Finite Gabor Systems

Linear Independence of Finite Gabor Systems Linear Independence of Finite Gabor Systems 1 Linear Independence of Finite Gabor Systems School of Mathematics Korea Institute for Advanced Study Linear Independence of Finite Gabor Systems 2 Short trip

More information

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018

MATH 5720: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 2018 MATH 57: Unconstrained Optimization Hung Phan, UMass Lowell September 13, 18 1 Global and Local Optima Let a function f : S R be defined on a set S R n Definition 1 (minimizers and maximizers) (i) x S

More information

Introductory Numerical Analysis

Introductory Numerical Analysis Introductory Numerical Analysis Lecture Notes December 16, 017 Contents 1 Introduction to 1 11 Floating Point Numbers 1 1 Computational Errors 13 Algorithm 3 14 Calculus Review 3 Root Finding 5 1 Bisection

More information

Economics 205 Exercises

Economics 205 Exercises Economics 05 Eercises Prof. Watson, Fall 006 (Includes eaminations through Fall 003) Part 1: Basic Analysis 1. Using ε and δ, write in formal terms the meaning of lim a f() = c, where f : R R.. Write the

More information

SOLUTIONS OF SELECTED PROBLEMS

SOLUTIONS OF SELECTED PROBLEMS SOLUTIONS OF SELECTED PROBLEMS Problem 36, p. 63 If µ(e n < and χ En f in L, then f is a.e. equal to a characteristic function of a measurable set. Solution: By Corollary.3, there esists a subsequence

More information

MTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.

MTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1. MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:

More information

5 Integration with Differential Forms The Poincare Lemma Proper Maps and Degree Topological Invariance of Degree...

5 Integration with Differential Forms The Poincare Lemma Proper Maps and Degree Topological Invariance of Degree... Contents 1 Review of Topology 3 1.1 Metric Spaces............................... 3 1.2 Open and Closed Sets.......................... 3 1.3 Metrics on R n............................... 4 1.4 Continuity.................................

More information