APPLICATIONS OF DIFFERENTIABILITY IN R n.

Similar documents
Course 212: Academic Year Section 1: Metric Spaces

Math Advanced Calculus II

Implicit Functions, Curves and Surfaces

Chapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Chapter 8: Taylor s theorem and L Hospital s rule

Introduction to Optimization Techniques. Nonlinear Optimization in Function Spaces

Most Continuous Functions are Nowhere Differentiable

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Optimization and Optimal Control in Banach Spaces

THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS

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

Many of you got these steps reversed or otherwise out of order.

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

1 Directional Derivatives and Differentiability

1. Bounded linear maps. A linear map T : E F of real Banach

AM 205: lecture 18. Last time: optimization methods Today: conditions for optimality

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

L p Spaces and Convexity

NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II

NOTES ON MULTIVARIABLE CALCULUS: DIFFERENTIAL CALCULUS

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

DIFFERENTIAL GEOMETRY, LECTURE 16-17, JULY 14-17

THE INVERSE FUNCTION THEOREM

HOMEWORK ASSIGNMENT 5

Sobolev Spaces. Chapter 10

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect

MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5

SOME QUESTIONS FOR MATH 766, SPRING Question 1. Let C([0, 1]) be the set of all continuous functions on [0, 1] endowed with the norm

THEOREMS, ETC., FOR MATH 515

Riemannian geometry of surfaces

Analysis II: The Implicit and Inverse Function Theorems

COMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

Math 361: Homework 1 Solutions

Solution of the 8 th Homework

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

g(x) = P (y) Proof. This is true for n = 0. Assume by the inductive hypothesis that g (n) (0) = 0 for some n. Compute g (n) (h) g (n) (0)

Complex Analysis Qualifying Exam Solutions

MATH 6337: Homework 8 Solutions

ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS EXERCISES I (HARMONIC FUNCTIONS)

McGill University Math 354: Honors Analysis 3

Definition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.

The reference [Ho17] refers to the course lecture notes by Ilkka Holopainen.

Division of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45

2. Function spaces and approximation

Optimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30

Laplace s Equation. Chapter Mean Value Formulas

The Mean Value Theorem and the Extended Mean Value Theorem

Math 421, Homework #9 Solutions

WHITNEY EXTENSION THEOREMS FOR CONVEX FUNCTIONS OF THE CLASSES C 1 AND C 1,ω.

INVERSE FUNCTION THEOREM and SURFACES IN R n

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

Lecture 11 Hyperbolicity.

Course Summary Math 211

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

2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.

The Arzelà-Ascoli Theorem

ANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2.

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

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Multivariate Differentiation 1

Constrained Optimization and Lagrangian Duality

Mathematics for Economists

SMSTC (2017/18) Geometry and Topology 2.

March 25, 2010 CHAPTER 2: LIMITS AND CONTINUITY OF FUNCTIONS IN EUCLIDEAN SPACE

Topological properties of Z p and Q p and Euclidean models

Continuity. Chapter 4

Sobolev spaces. May 18

C 1 regularity of solutions of the Monge-Ampère equation for optimal transport in dimension two

Chapter 3. Differentiable Mappings. 1. Differentiable Mappings

Continuity. Chapter 4

Partial Derivatives. w = f(x, y, z).

Continuous Functions on Metric Spaces

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.

STABILITY OF n-th ORDER FLETT S POINTS AND LAGRANGE S POINTS

Course 224: Geometry - Continuity and Differentiability

4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x

Generalized monotonicity and convexity for locally Lipschitz functions on Hadamard manifolds

x y More precisely, this equation means that given any ε > 0, there exists some δ > 0 such that

EXPOSITORY NOTES ON DISTRIBUTION THEORY, FALL 2018

Functional Analysis Exercise Class

Prague, II.2. Integrability (existence of the Riemann integral) sufficient conditions... 37

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

Analysis in weighted spaces : preliminary version

MATH 131A: REAL ANALYSIS (BIG IDEAS)

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

Immerse Metric Space Homework

Several variables. x 1 x 2. x n

TESTING HOLOMORPHY ON CURVES

Some geometry of convex bodies in C(K) spaces

OPTIMALITY CONDITIONS FOR GLOBAL MINIMA OF NONCONVEX FUNCTIONS ON RIEMANNIAN MANIFOLDS

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

FIXED POINT ITERATIONS

for all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true

Math 6455 Nov 1, Differential Geometry I Fall 2006, Georgia Tech

4.7 The Levi-Civita connection and parallel transport

Tangent spaces, normals and extrema

Politecnico di Torino. Porto Institutional Repository

Lecture 4 Lebesgue spaces and inequalities

Transcription:

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 of radius r, centered at x, is denoted by B(x, r). It will be clear from the context what is the dimension (as in the convergence definition below). Usually, we use the Euclidean norm. The ball depends on the norm, but all the concepts are norm independent. CONVENTION: When we say that g is differentiable at x 0 we mean that it is defined in some small (open) ball B(x 0, η). DEFINITION: (directional derivative of a function at a point): Let g(x) R m be defined in B(x 0, η) R n for some small η > 0. Let u S n 1 (i.e., u is a UNIT VECTOR in R n ). The directional derivative of g at x 0, in the u direction, is defined by g(x 0 + hu) g D u g = lim. h 0 h NOTATION: Another common notation is u (x 0). CLAIM: Suppose that g is differentiable at x 0. Then its directional derivative at x 0 exists (in any direction) and satisfies: D u g = Dgu. REMARK: Note that the right-hand side above is an application of a linear transformation (from R n to R m ) to a (unit) vector in R n, so the result is a vector in R m. REMARK: In terms of coordinates, the directional derivative is given by: D u g = Jgu. Now D u g and u are, respectively, the m vector and n vector of coordinates. ***************************************************************** THE CASE OF REAL FUNCTIONS ******************************************************************** REMARK: If m = 1 (i.e., g is a REAL function) then D u g = g u. COROLLARY: If g is a real function, differentiable at x 0, the direction of g is the direction of STEEPEST INCREASE. 1

2 MATANIA BEN-ARTZI The opposite direction, that of g, is that of STEEPEST DE- CREASE. REMARK : If g = 0 then ALL DIRECTIONAL DERIVATIVES VANISH. MORE GENERALLY, suppose that (a) g is a real function differentiable at x 0 R n. (b) (a, b) t γ(t) R n is a differentiable curve. (c) γ(c) = x 0, for some c (a, b). CLAIM: Under the above conditions, g(γ(t)) is differentiable at c and d dt g(γ(t)) t=c = g γ (t) t=c. DEFINITION(derivative along a curve): The derivative d dtg(γ(t)) is called the derivative of g along γ. EXAMPLE: Let γ(t), t R, be a straight line in R n given by γ(t) = x 0 + tu, u S n 1. Then d dt g(γ(t)) t=0 = g u, which is the directional derivative of g at x 0, in the direction of u. DEFINITION (graph of a function): The graph of g is the set {(x, g(x)), x D} R n+1. GEOMETRICALLY, if g = 0 then (x 0, g) is a flat point of the graph y = g(x). On the other hand, if g 0, the the direction of the gradient is the direction of steepest increase on the graph (at the point (x 0, g)). **************************************************************************** HYPERSURFACES and LEVEL SURFACES ****************************************************************************** DEFINITION (hypersurface) Let S R n+1. We say that S is an n dimensional hypersurface if for every y S there exists a δ > 0 such that S B(y, δ) is a graph of a function (with respect to a set of n out of the n + 1 coordinates). In the case n = 2 it is usually called a surface (two-dimensional geometric object). DEFINITION (level surface): Let f be a real function defined in D R n+1, where D is open. Let y 0 D and let c = f(y 0 ). If the set L y0 = {y D, f(y) = c} is a hypersurface, we call it the c level surface of f (in D). REMARK: We can define the local c level surface by restricting to L δ y 0 = L y0 B(y 0, δ) for some small δ > 0. RESTRICTION: We assume always that the function expressing the hypersurface as a graph is continuously differentiable. EXAMPLE: For any real continuously differentiable function g : T R, T R n (T open set) the graph of g is the 0 level surface (in T R R n+1 ) of the function (of the n + 1 coordinates x, y) f(x, y) = y g(x).

APPLICATIONS OF DIFFERENTIABILITY IN R n. 3 *********************************************************************** GRADIENTS AND LEVEL SURFACES ********************************************************************** FUNDAMENTAL QUESTION: Let D R n+1 be an open domain (i.e., connected) and f : D R a real differentiable function. Let x 0 D. When is the set L δ x 0 = {x D B(x 0, δ), f(x) = f} a hypersurface (for sufficiently small δ > 0)? LEMMA. Suppose that f > 0. Then there exists a ball B(x 0, δ) such that the set {x D B(x 0, δ), f(x) = f} is a hypersurface. NOTATION: For x R n+1 we write x = (x 1, x ), R n. PROOF. Let c = f., x = (x 2,..., x n, x n+1 ) By continuity, there exists δ 1 > 0 such that, f (z) > 0, z = (z 1, z ), z 1 1 < δ 1, z < δ 1. f is strictly increasing in x 1, so for some θ > 0, f( 1 + δ 1, ) > c + θ, f( 1 δ 1, ) < c θ. By continuity there exists 0 < δ 2 < δ 1 such that f( 1 + δ 1, x ) > c + θ, f( 1 δ 1, x ) < c θ, x < δ 2. CONCLUSION: Since f(x 1, x ) is continuous and strictly increasing in x 1, the intermediate value theorem implies that, for every x B(, δ 2 ) there exists a UNIQUE x 1 = x 1 (x ) ( 1 δ 1, 1 + δ 1 ) such that f( x 1, x ) = c. PROPOSITION: The (real) function x 1 (x ) is continuously differentiable on B(, δ 2 ). PROOF of the PROPOSITION. (a) Continuity: Let ε > 0 be given. Take above 0 < δ 1 < ε. Then there is a suitable δ 2 > 0. If y, z B(, δ 2 ) R n Then x 1 (y), x 1 (z) ( 1 δ 1, 1 + δ 1 ) so that x 1 (y) x 1 (z) 2ε. (b) Differentiability: Take y, z B(, δ 2 ) R n so that only their first coordinates are different, namely, y = (x 2, x 3,..., x n+1 ), z = (x 2 + h, x 3,..., x n+1 ). Then by definition f( x 1 (y), y) f( x 1 (z), z) = c c = 0. On the other hand f( x 1 (z), z) f( x 1 (y), y) = [f( x 1 (z), z) f( x 1 (y), z)] Denote +[f( x 1 (y), z) f( x 1 (y), y)]. x 1 = x 1 (z) x 1 (y).

4 MATANIA BEN-ARTZI Then from the mean value theorem f( x 1 (z), z) f( x 1 (y), z) = f (ξ 1, z) x 1, where ξ 1 is between x 1 (z) and x 1 (y). Similarly f( x 1 (y), z) f( x 1 (y), y) = f x 2 ( x 1 (y), ξ 2, x 3,..., x n+1 )h, where ξ 2 (x 2, x 2 + h) (assuming h > 0). Hence We conclude that 0 = f (ξ 1, z) x 1 + f x 2 ( x 1 (y), ξ 2, x 3,..., x n+1 )h. x 1 h f = x 2 ( x 1 (y), ξ 2, x 3,..., x n+1 ). f (ξ 1, z) By the continuity property of x 1 we have ξ 1 x 1 (y), ξ 2 x 2, as h 0. We therefore obtain in the limit (as h 0), since the partial derivatives are continuous, x [ 1 f ] 1 f (y) = ( x 1 (y), y) ( x 1 (y), y), y B(, δ 2 ). x 2 x 2 Replacing x 2 by any x j, 3 j n + 1, we see that all partial derivatives of x 1 (x ) exist and are continuous for x B(, δ 2 ). THIS CONCLUDES THE PROOF OF THE PROPOSITION AND THEREFORE THE LEMMA IS PROVED. *********************************************************************** GEOMETRIC INTERPRETATION OF THE GRADIENT ********************************************************************** DEFINITION (orthogonality to a hypersurface): Let S R n+1 be a hypersurface and y 0 S. We say that a vector N R n+1 is orthogonal to S at y 0 if the following condition is satisfied: For every curve {γ(t), ε < t < ε} S such that γ(0) = y 0, the tangent γ (0) is orthogonal to N, namely, N γ (0) = 0. THEOREM (the gradient as normal to level surfaces): Let f be a real continuously differentiable function in a neighborhood of y 0 R n+1, and assume that f(y 0 ) 0. Let L δ y 0 = {y B(y 0, δ), f(y) = f(y 0 )} be the level surface through y 0, for some sufficiently small δ > 0. Then f(y 0 ) is orthogonal to L δ y 0 (at y 0 ). PROOF: Let {γ(t), ε < t < ε} L y0 be a curve such that γ(0) = y 0. Then f(γ(t)) f(y 0 ) (why?) so that by the chain rule 0 = d dt f(γ(t)) = f(γ(t)) γ (t), t ( ε, ε). In particular, this is true at t = 0, so that f(y 0 ) is orthogonal to γ (0).

APPLICATIONS OF DIFFERENTIABILITY IN R n. 5 EXAMPLE(tangent plane of a surface in R 3 ): Let f(x, y, z) be a continuously differentiable function in a ball B(P 0, δ) R 3, P 0 = (x 0, y 0, z 0 ). If f(p 0 ) 0, then the equation f(x, y, z) = f(p 0 ) defines a surface in a small neighborhood of P 0, and the equation of the tangent plane to this surface, at P 0, is given by f(p 0 ) (x x 0, y y 0, z z 0 ) = f x (P 0)(x x 0 )+ f y (P 0)(y y 0 )+ f z (P 0)(z z 0 ) = 0. *************************************************************************** EXTREMUM *************************************************************************** We assume that T R n is an open domain and g is a real continuous function defined in T. DEFINITION (critical point): If the real function g(x) is differentiable at x 0, and g = 0 we say that x 0 is a critical point of g. DEFINITION (local extremum): Let g be a real function defined in T R n. We say that g has a local maximum (resp. minimum) at x 0 T if there exists δ > 0 such that g g(y), y T B(x 0, δ) (resp. g g(y), y T B(x 0, δ)). THEOREM: Let g be a real function defined in B(x 0, δ) R n and differentiable at x 0. If g has a local extremum at x 0, then x 0 is a critical point of g. PROOF. In particular, for every j = 1, 2,..., n, the function has an extremum (at x 0 ) along the x j direction (i.e., the one-dimensional function g(x 0 + te j ) has extremum at t = 0). It follows that = 0, j = 1, 2,..., n. DEFINITION (local extremum with constraints): Let g be a real function defined in T R n. Let φ be another real function defined in T R n, such that φ = 0 at x 0 T. We say that g has a local maximum (resp. minimum) at x 0, subject to the constraint φ = 0, if there exists δ > 0 such that g g(y), y T B(x 0, δ) {φ(y) = 0} (resp. g g(y), y T B(x 0, δ) {φ(y) = 0}). THEOREM: Let g, φ be real functions defined in a ball B(x 0, δ) R n. Suppose that (1) g is differentiable at x 0. (2) φ is continuously differentiable in B(x 0, δ) R n, φ = 0 and φ 0. Then: If g has a local extremum at x 0, subject to the constraint φ = 0, then there exists a constant µ R such that g = µ φ. PROOF. (a) By the conditions on φ we know that the level surface φ(x) = 0 exists in a neighborhood of x 0, and without loss of generality we may assume

6 MATANIA BEN-ARTZI that it is given as where n = ψ(x 0). (b) Recall that x n = ψ(x ), x = (x 1,..., x n 1 ), ψ (x 0) =, j = 1, 2,..., n 1. (c) Thus, in a neighborhood of x 0, the function g, subject to the constraint, can be expressed as a function of the n 1 coordinates x, h(x ) = g(x, ψ(x )), x in a neighborhood of x 0. (d) The function h has an extremum at x 0, so its gradient vanishes there. By the chain rule, 0 = h (x 0) = + ψ (x 0), j = 1, 2,..., n 1, so that = x j x n = µ, j = 1, 2,..., n 1, where (e) Of course also µ =. = µ. DEFINITION (Lagrange multiplier): The constant µ in the theorem is called the Lagrange multiplier of the constrained extremal problem. ************************************************************** THE GRADIENT CAN BE USED TO ESTIMATE FUNCTIONAL DIFFERENCES. ******************************************************************** THEOREM: Let g be a real differentiable function in an open set T R n. Let a, b T be such that the line segment l(a, b) connecting them is contained in T. Then g(b) g(a) sup g(x) b a. x l(a,b) PROOF. Consider the function f(t) = g(a + t(b a)), defined on the real interval t [0, 1]. By the chain rule it is differentiable with derivative given by f (t) = g(a + t(b a)) (b a). Now apply the mean value theorem and the Cauchy-Schwarz inequality.

APPLICATIONS OF DIFFERENTIABILITY IN R n. 7 HOWEVER, IT IS NOT NECESSARY FOR g TO HAVE A CRITICAL POINT ON l EVEN IF g(b) = g(a) (different from Rolle s Theorem in one dimension). EXAMPLE: Take n = 2 and consider T = {(x, y), 1 < x 2 + y 2 < 17} and g(x, y) = x 2 + y 2. THEOREM: Let T R n be open and connected and let g be a real differentiable function in T. Suppose that g 0 in T. Then g constant in T. Institute of Mathematics, Hebrew University, Jerusalem 91904, Israel E-mail address: mbartzi@math.huji.ac.il