Math Advanced Calculus II
|
|
- Martha Dennis
- 5 years ago
- Views:
Transcription
1 Math Advanced Calculus II Manifolds and Lagrange Multipliers In this section, we will investigate the structure of critical points of differentiable functions. In practice, one often is trying to maximize or minimize a particular function with respect to certain constraints. When these constraints are sufficiently nice, i.e., they are the zero sets of some continuously differentiable maps, then we can use the extra structure provided by the constraints to both find and nicely characterize the critical points of our original map. This is called the Lagrange multiplier method. In order to do this, we need to introduce the notion of a manifold in R n, which is a subspace which locally looks like some lower dimensional Euclidean space. Roughly, a k-manifold M R n has the property that an open neighborhood of any given point in M looks like an open neighborhood of a point in R k for some fixed k n. We will make this more precise shortly. Manifolds have several nice features reminiscent of R n and this extra geometric structure will allow us to translate problems about differentiable maps attaining critical values on a manifold into the features of the manifold itself. What we will see is that certain nice subsets of zero sets of continuously differentiable maps are often manifolds whose internal geometry are determined by the differentiable maps in question. The Lagrange multiplier method thus involves solving critical value problems for some differentiable function f : R n R on some manifold M R n defined by some continuously differentiable map g : R n R m via direct calculations involving various quantities related to the map g itself. 1 Critical points of functions along curves We first want to work out the easiest situation, when the critical point of a differentiable function f : R n R lies in some open set in R n on which f is defined and differentiable. Definition 1. Let D be a compact set of R n. We say that the function f : D R has a local maximum (respectively, local minimum) on D at the point p D if and only if there exists an open ball B D centered at p such that f(x) f(p) [respectively, f(x) f(p)] for all points x B. Recall the well-known result from single-variable calculus that if the differentiable function f : R R has a local maximum or local minimum at p R, then f (p) = 0. Theorem 1. Let S R n, and ϕ : R S be a differentiable curve with ϕ(0) = a. If f is a differentiable real-valued function defined on some open set containing S, and f has a local 1
2 maximum (or local minimum) on S at a, then the gradient vector f(a) is orthogonal to the velocity vector ϕ (0). Proof. Use the chain rule. Corollary 1. If U is an open set of R n and a U is a point at which the differentiable function f : U R has a local maximum or local minimum, then f(a) = 0. Proof. Prove that f(a) v = 0 for every v R n. φ(t) = a + tv so that φ (t) v. Now use Theorem 1. For each v R n, define φ : R R n by 2 Single-constraint Optimization In this section, we will focus on single-constraint optimization problems. We will begin by introducing the notion of an (n 1)-manifold in R n. 2.1 (n 1)-manifolds in R n As suggested in the discussion at the beginning, the key idea here is that every point in an (n 1)- manifold in R n has an open neighborhood which looks like an open neighborhood of a point in R n 1. We now make this precise. Definition 2. The projection mapping π i : R n R n 1 is defined by removing the i th coordinate: π i (x 1,..., x n ) = (x 1,..., x i,..., x n ) = (x 1,..., x i 1, x i+1,..., x n ) R n 1. The open neighborhoods mentioned above are called patches. The idea of a patch is that, up to reordering the coordinate basis, a patch in an (n 1)-manifold looks like the graph of some differentiable function h : U R for some open U R n 1. Definition 3 ((n 1)-dimensional patch). The set P R n is called an (n 1)-dimensional patch if and only if for some integer i with 1 i n there exists An open set U R n 1 and A differentiable function h : U R, such that P = {x R n : π i (x) U and x i = h(π i (x)) }. 2
3 Remark 1. The definition of an (n 1)-dimensional patch is equivalent to having a permutation x i1,..., x in of the coordinates x 1,..., x n and a differentiable function h : U R on an open set U R n 1 such that: P = {x R n : (x i1,..., x in 1 ) U and x in = h(x i1,..., x in 1 ) } This observation is relevant to how we will define a k-dimensional manifold later. Remark 2. The terminology patch is not standard. theory, patches are called charts. In differentiable geometry and manifold We are now ready for one of our main definitions: Definition 4 ((n 1)-manifold). The set M R n is called an (n 1)-dimensional manifold if and only if each point a M lies in an open subset U R n such that U M is an (n 1)- dimensional patch. 2.2 Manifolds have tangent planes As suggested before, a key property of a manifold is having a tangent plane of the same dimension at each point. We now make this latter concept precise: Definition 5 (Tangent planes). A set M R n is said to have a k-dimensional tangent plane at the point a M if the union of all tangent lines to differentiable curves on M passing through a is a k-dimensional plane. Theorem 2. If M is an (n 1)-dimensional manifold in R n, then at each of its points M has an (n 1)-dimensional tangent plane. Proof. Let a M. It suffices to prove that the set of all velocity vectors to differentiable curves on M passing through a is an (n 1)-dimensional subspace of R n. By assumption that M is a manifold, there exists a differentiable function h : R n 1 R such that for some i we have x i = h(x 1,..., ˆx i,... x n ) for all points (x 1,..., x n ) M sufficiently close to a. Without loss of generality, we may assume that i = n. Let φ : R M be a differentiable curve with φ(0) = a. Let π n : R n R n 1 be the standard projection, and define ψ : R R n 1 by ψ = π n φ. By definition of M being a manifold and the function h, there exists some U R n such that we have that φ(t) = (ψ(t), h(ψ(t))) 3
4 when φ(t) U M, which happens when t is sufficiently close to 0. Setting ψ(0) = b, we now apply the chain rule and obtain that φ (0) = ( ψ (0), h(b) ψ (0) ) n 1 = φ i(0) (e i, D i h(b)), where e 1,..., e n 1 are the unit basis vectors in R n 1. Hence φ (0) lives in the (n 1)-dimensional vector subspace of R n spanned by the n 1 vectors: i=1 which are clearly linearly independent. ((e 1, D 1 h(b)),..., (e n 1, D n 1 h(b)) Since we have shown that the tangent line at a of any given differentiable curve lying on M and passing through a lies in this subspace, it now suffices to prove that any vector in this subspace is the velocity vector of some curve of this type. To that end, let v = n 1 i=1 v i (e i, D i h(b)), so that v lies in this subspace. Define a differentiable curve φ v (t) = (b + tw, h(b + tw)) where w = (v 1,..., v n 1 ) R n 1. By definition of U R n 1 being open, there exists ɛ > 0 so that φ v (t) U M. Hence, we get a differentiable curve φ v : ( ɛ, ɛ) M (differentiability of φ v follows easily from the fact that h is differentiable) so that φ v (0) = a, and φ v(0) = v. which is what we wanted. 2.3 Recognizing manifolds In this subsection, we will state a theorem (to be proven later) and prove another, the latter which states that the zero sets of differentiable functions are manifolds, with a specific description of their tangent planes. We will prove the next theorem in the next chapter: Theorem (Implicit Function Theorem). Let g : R n R be continuously differentiable and suppose that g(a) = 0 and D n g(a) 0. Then there exists 4
5 A neighborhood U R n of a, A neighborhood V R n 1 of (a 1,..., a n 1 ), and A differentiable function f : V R such that U g 1 (0) = {x R n : (x 1,..., x n 1 ) V and x n = f(x 1,..., x n 1 )}. Remark 3. Note the similarity to the role of the function f in the IFT to the function h in the definition of an (n 1)-manifold. Theorem 3. Suppose that g : R n R is continuously differentiable. If M = {x g 1 [0] R n g(x) 0}, then M is an (n 1)-manifold. Moreover, if a M, then g(a) is orthogonal to the tangent plane to M at a. Proof. Let a M so that g(a) = 0 but g(a) 0. Then there exists 1 i n such that D i g(a) 0. In order to apply the IFT (Theorem 2.3) as stated, we will define a new function G : R n R by G(x 1,..., x n ) = g(x 1,..., x i 1, x n, x i,..., x n 1 ), which we note has the property that G(b) = 0 and D n G(b) 0 where b = (a 1,..., a i 1, a i+1,..., a n, a i ). By the Implicit Function Theorem 2.3, there exist open sets U R n and V R n 1 and a differentiable function F : V R so that U G 1 (0) = {x R n (x 1,... x n 1 ) V and x n = F (x 1,..., x n 1 )}. Set W = {(x 1,..., x n ) R n (x 1,..., x i 1, x i+1,..., x n, x i ) U}. Then W M = {(x 1,..., x n ) W x i = F (x 1,..., x i 1, x i+1,..., x n )} making W M an (n 1)-dimensional patch by definition. Hence M is an (n 1)-manifold. To see the moreover statement, it suffices to prove that g(a) is orthogonal to any velocity vector of a differentiable curve at a. Thus let φ : R M be a differentiable curve with φ(0) = a. Since g(x) = 0 for all x M, we see that g φ 0. Hence the chain rule gives us g(a) φ (0) = (g φ) (0) = 0, which completes the proof. 5
6 Theorem 4. Suppose g : R n R is continuously differentiable and let M be the set of points x R n at which g(x) = 0 and g(x) 0. If the differentiable function f : R n R attains a local maximum or minimum on M at the point a M, then f(a) = λ g(a) for some number λ, denoted as the Lagrange multiplier. Proof. By Theorem 3, M is an (n 1)-manifold, so M has an (n 1)-dimensional tangent plane by Theorem 2. By Theorems 1 and 3, the vectors f(a) and g(a) are both orthogonal to this tangent plane. Since the orthogonal complement to an (n 1)-dimensional subspace of R n is 1-dimensional, it follows that f(a) and g(a) are collinear. Since g(a) 0, this implies that f(a) is a scalar multiple of g(a), completing the proof. 3 Multiple-constraint Optimization Definition 6. The set P R n is called a k-dimensional patch and only if there exists a permutation x i1,..., x in of x 1,..., x n, and differentiable function h : U R n k for U R k open, such that P = {x R n : (x i1,..., x ik ) U and (x ik+1,..., x in ) = h(x i1,..., x ik ) } Definition 7. The set M R n is called a k-dimensional manifold if and only if each point a M lies in an open subset U R n such that U M is a k-dimensional patch. Theorem 5. If M is a k-dimensional manifold in R n then, at each of its points, M has a k- dimensional tangent plane. Proof. On the blackboard. Theorem (Implicit Mapping Theorem). Let g : R n R m (m < n) be a continuously differentiable map. Suppose that g(a) = 0 and that the rank of the derivative matrix g (a) is m. Then there exists a permutation x i1,..., x in of the coordinates in R n, an open set U R n containing a, an open subset V R n m containing b = π [n m+1,n] (a i1,..., a in ), and a differentiable mapping h : V R m such that each point x U lies on S = g 1 [0] if and only if (x i1,..., x in m ) V and (x in m+1,..., x in ) = h(x i1,..., x in m ). Theorem 6. Suppose that g : R n R m (m < n) is continuously differentiable. If M is the set of all points x S = g 1 [0] for which the rank of g (x) is m, then M is an (n m)-manifold. Given a M, the gradient vectors g 1 (a),..., g m (a) are all orthogonal to the tangent plane to M at a. 6
7 Theorem 7. Suppose g : R n R m (m < n) is continuously differentiable and let M be the set of points x R n such that g(x) = 0 and the gradient vectors g 1 (x),..., g m (x) are linearly independent. If the differentiable function f : R n R attains a local maximum or minimum on M at the point a M, then there exist real numbers λ 1,..., λ m (called Lagrange multipliers) such that: f(a) = λ 1 g 1 (a) λ m g m (a). 7
0.1 Tangent Spaces and Lagrange Multipliers
01 TANGENT SPACES AND LAGRANGE MULTIPLIERS 1 01 Tangent Spaces and Lagrange Multipliers If a differentiable function G = (G 1,, G k ) : E n+k E k then the surface S defined by S = { x G( x) = v} is called
More informationInverse and Implicit Mapping Theorems (Sections III.3-III.4)
MATH W8 Daily Notes Preamble As an executive decision, I am skipping Section III.2. It is something like an 8-page lemma, with a number of concepts and results introduced at this stage mainly for the purpose
More informationDifferentiation. 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 informationAPPLICATIONS 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 informationTangent 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 informationAnalysis II: The Implicit and Inverse Function Theorems
Analysis II: The Implicit and Inverse Function Theorems Jesse Ratzkin November 17, 2009 Let f : R n R m be C 1. When is the zero set Z = {x R n : f(x) = 0} the graph of another function? When is Z nicely
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationChapter 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 informationLAGRANGE MULTIPLIERS
LAGRANGE MULTIPLIERS MATH 195, SECTION 59 (VIPUL NAIK) Corresponding material in the book: Section 14.8 What students should definitely get: The Lagrange multiplier condition (one constraint, two constraints
More informationImplicit 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 informationB553 Lecture 3: Multivariate Calculus and Linear Algebra Review
B553 Lecture 3: Multivariate Calculus and Linear Algebra Review Kris Hauser December 30, 2011 We now move from the univariate setting to the multivariate setting, where we will spend the rest of the class.
More informationCalculus 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 informationDegree of circle maps and Sard s theorem.
February 24, 2005 12-1 Degree of circle maps and Sard s theorem. We are moving toward a structure theory for maps certain maps of the interval and circle. There are certain fundamental notions that we
More informationUpon successful completion of MATH 220, the student will be able to:
MATH 220 Matrices Upon successful completion of MATH 220, the student will be able to: 1. Identify a system of linear equations (or linear system) and describe its solution set 2. Write down the coefficient
More information2. Intersection Multiplicities
2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.
More information1 Lagrange Multiplier Method
1 Lagrange Multiplier Method Near a maximum the decrements on both sides are in the beginning only imperceptible. J. Kepler When a quantity is greatest or least, at that moment its flow neither increases
More informationChapter 8: Taylor s theorem and L Hospital s rule
Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))
More informationTranspose & Dot Product
Transpose & Dot Product Def: The transpose of an m n matrix A is the n m matrix A T whose columns are the rows of A. So: The columns of A T are the rows of A. The rows of A T are the columns of A. Example:
More informationCourse 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 informationFinal Exam Solutions June 10, 2004
Math 0400: Analysis in R n II Spring 004 Section 55 P. Achar Final Exam Solutions June 10, 004 Total points: 00 There are three blank pages for scratch work at the end of the exam. Time it: hours 1. True
More informationII. DIFFERENTIABLE MANIFOLDS. Washington Mio CENTER FOR APPLIED VISION AND IMAGING SCIENCES
II. DIFFERENTIABLE MANIFOLDS Washington Mio Anuj Srivastava and Xiuwen Liu (Illustrations by D. Badlyans) CENTER FOR APPLIED VISION AND IMAGING SCIENCES Florida State University WHY MANIFOLDS? Non-linearity
More informationTranspose & Dot Product
Transpose & Dot Product Def: The transpose of an m n matrix A is the n m matrix A T whose columns are the rows of A. So: The columns of A T are the rows of A. The rows of A T are the columns of A. Example:
More informationOrthogonality. 6.1 Orthogonal Vectors and Subspaces. Chapter 6
Chapter 6 Orthogonality 6.1 Orthogonal Vectors and Subspaces Recall that if nonzero vectors x, y R n are linearly independent then the subspace of all vectors αx + βy, α, β R (the space spanned by x and
More informationMath Topology II: Smooth Manifolds. Spring Homework 2 Solution Submit solutions to the following problems:
Math 132 - Topology II: Smooth Manifolds. Spring 2017. Homework 2 Solution Submit solutions to the following problems: 1. Let H = {a + bi + cj + dk (a, b, c, d) R 4 }, where i 2 = j 2 = k 2 = 1, ij = k,
More informationThere are two things that are particularly nice about the first basis
Orthogonality and the Gram-Schmidt Process In Chapter 4, we spent a great deal of time studying the problem of finding a basis for a vector space We know that a basis for a vector space can potentially
More information2015 Math Camp Calculus Exam Solution
015 Math Camp Calculus Exam Solution Problem 1: x = x x +5 4+5 = 9 = 3 1. lim We also accepted ±3, even though it is not according to the prevailing convention 1. x x 4 x+4 =. lim 4 4+4 = 4 0 = 4 0 = We
More informationINVERSE FUNCTION THEOREM and SURFACES IN R n
INVERSE FUNCTION THEOREM and SURFACES IN R n Let f C k (U; R n ), with U R n open. Assume df(a) GL(R n ), where a U. The Inverse Function Theorem says there is an open neighborhood V U of a in R n so that
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
More informationSpanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
More informationChapter -1: Di erential Calculus and Regular Surfaces
Chapter -1: Di erential Calculus and Regular Surfaces Peter Perry August 2008 Contents 1 Introduction 1 2 The Derivative as a Linear Map 2 3 The Big Theorems of Di erential Calculus 4 3.1 The Chain Rule............................
More informationLECTURE 2. (TEXED): IN CLASS: PROBABLY LECTURE 3. MANIFOLDS 1. FALL TANGENT VECTORS.
LECTURE 2. (TEXED): IN CLASS: PROBABLY LECTURE 3. MANIFOLDS 1. FALL 2006. TANGENT VECTORS. Overview: Tangent vectors, spaces and bundles. First: to an embedded manifold of Euclidean space. Then to one
More informationReview 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 informationM311 Functions of Several Variables. CHAPTER 1. Continuity CHAPTER 2. The Bolzano Weierstrass Theorem and Compact Sets CHAPTER 3.
M311 Functions of Several Variables 2006 CHAPTER 1. Continuity CHAPTER 2. The Bolzano Weierstrass Theorem and Compact Sets CHAPTER 3. Differentiability 1 2 CHAPTER 1. Continuity If (a, b) R 2 then we write
More information1 The Local-to-Global Lemma
Point-Set Topology Connectedness: Lecture 2 1 The Local-to-Global Lemma In the world of advanced mathematics, we are often interested in comparing the local properties of a space to its global properties.
More informationDEVELOPMENT OF MORSE THEORY
DEVELOPMENT OF MORSE THEORY MATTHEW STEED Abstract. In this paper, we develop Morse theory, which allows us to determine topological information about manifolds using certain real-valued functions defined
More informationChapter 6 - Orthogonality
Chapter 6 - Orthogonality Maggie Myers Robert A. van de Geijn The University of Texas at Austin Orthogonality Fall 2009 http://z.cs.utexas.edu/wiki/pla.wiki/ 1 Orthogonal Vectors and Subspaces http://z.cs.utexas.edu/wiki/pla.wiki/
More informationSection 3.5 The Implicit Function Theorem
Section 3.5 The Implicit Function Theorem THEOREM 11 (Special Implicit Function Theorem): Suppose that F : R n+1 R has continuous partial derivatives. Denoting points in R n+1 by (x, z), where x R n and
More informationChanging coordinates to adapt to a map of constant rank
Introduction to Submanifolds Most manifolds of interest appear as submanifolds of others e.g. of R n. For instance S 2 is a submanifold of R 3. It can be obtained in two ways: 1 as the image of a map into
More informationVector Calculus. Lecture Notes
Vector Calculus Lecture Notes Adolfo J. Rumbos c Draft date November 23, 211 2 Contents 1 Motivation for the course 5 2 Euclidean Space 7 2.1 Definition of n Dimensional Euclidean Space........... 7 2.2
More informationChapter 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 informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationLINEAR ALGEBRA: THEORY. Version: August 12,
LINEAR ALGEBRA: THEORY. Version: August 12, 2000 13 2 Basic concepts We will assume that the following concepts are known: Vector, column vector, row vector, transpose. Recall that x is a column vector,
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationDefinition 1.2. Let p R n be a point and v R n be a non-zero vector. The line through p in direction v is the set
Important definitions and results 1. Algebra and geometry of vectors Definition 1.1. A linear combination of vectors v 1,..., v k R n is a vector of the form c 1 v 1 + + c k v k where c 1,..., c k R are
More informationLecture 18: The Rank of a Matrix and Consistency of Linear Systems
Lecture 18: The Rank of a Matrix and Consistency of Linear Systems Winfried Just Department of Mathematics, Ohio University February 28, 218 Review: The linear span Definition Let { v 1, v 2,..., v n }
More informationMath 6455 Nov 1, Differential Geometry I Fall 2006, Georgia Tech
Math 6455 Nov 1, 26 1 Differential Geometry I Fall 26, Georgia Tech Lecture Notes 14 Connections Suppose that we have a vector field X on a Riemannian manifold M. How can we measure how much X is changing
More informationThe theory of manifolds Lecture 2
The theory of manifolds Lecture 2 Let X be a subset of R N, Y a subset of R n and f : X Y a continuous map. We recall Definition 1. f is a C map if for every p X, there exists a neighborhood, U p, of p
More informationPOINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol.1 (13) (2005), 117 127 POINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS SAM B. NADLER, JR. Abstract. The problem of characterizing the metric spaces on which the
More informationMATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005
MATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005 1. True or False (22 points, 2 each) T or F Every set in R n is either open or closed
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date May 9, 29 2 Contents 1 Motivation for the course 5 2 Euclidean n dimensional Space 7 2.1 Definition of n Dimensional Euclidean Space...........
More informationMath 147, Homework 1 Solutions Due: April 10, 2012
1. For what values of a is the set: Math 147, Homework 1 Solutions Due: April 10, 2012 M a = { (x, y, z) : x 2 + y 2 z 2 = a } a smooth manifold? Give explicit parametrizations for open sets covering M
More informationv = v 1 2 +v 2 2. Two successive applications of this idea give the length of the vector v R 3 :
Length, Angle and the Inner Product The length (or norm) of a vector v R 2 (viewed as connecting the origin to a point (v 1,v 2 )) is easily determined by the Pythagorean Theorem and is denoted v : v =
More informationThe Laplace-Beltrami-Operator on Riemannian Manifolds. 1 Why do we need the Laplace-Beltrami-Operator?
Frank Schmidt Computer Vision Group - Technische Universität ünchen Abstract This report mainly illustrates a way to compute the Laplace-Beltrami-Operator on a Riemannian anifold and gives information
More informationAdvanced Calculus Notes. Michael P. Windham
Advanced Calculus Notes Michael P. Windham February 25, 2008 Contents 1 Basics 5 1.1 Euclidean Space R n............................ 5 1.2 Functions................................. 7 1.2.1 Sets and functions........................
More informationLagrange Multipliers
Optimization with Constraints As long as algebra and geometry have been separated, their progress have been slow and their uses limited; but when these two sciences have been united, they have lent each
More informationMATH 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
More informationDifferential Topology Final Exam With Solutions
Differential Topology Final Exam With Solutions Instructor: W. D. Gillam Date: Friday, May 20, 2016, 13:00 (1) Let X be a subset of R n, Y a subset of R m. Give the definitions of... (a) smooth function
More informationMATH Linear Algebra
MATH 304 - Linear Algebra In the previous note we learned an important algorithm to produce orthogonal sequences of vectors called the Gramm-Schmidt orthogonalization process. Gramm-Schmidt orthogonalization
More information1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces.
1. Tangent Vectors to R n ; Vector Fields and One Forms All the vector spaces in this note are all real vector spaces. The set of n-tuples of real numbers is denoted by R n. Suppose that a is a real number
More informationMath 396. Bijectivity vs. isomorphism
Math 396. Bijectivity vs. isomorphism 1. Motivation Let f : X Y be a C p map between two C p -premanifolds with corners, with 1 p. Assuming f is bijective, we would like a criterion to tell us that f 1
More informationB553 Lecture 1: Calculus Review
B553 Lecture 1: Calculus Review Kris Hauser January 10, 2012 This course requires a familiarity with basic calculus, some multivariate calculus, linear algebra, and some basic notions of metric topology.
More informationfy (X(g)) Y (f)x(g) gy (X(f)) Y (g)x(f)) = fx(y (g)) + gx(y (f)) fy (X(g)) gy (X(f))
1. Basic algebra of vector fields Let V be a finite dimensional vector space over R. Recall that V = {L : V R} is defined to be the set of all linear maps to R. V is isomorphic to V, but there is no canonical
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationBROUWER FIXED POINT THEOREM. Contents 1. Introduction 1 2. Preliminaries 1 3. Brouwer fixed point theorem 3 Acknowledgments 8 References 8
BROUWER FIXED POINT THEOREM DANIELE CARATELLI Abstract. This paper aims at proving the Brouwer fixed point theorem for smooth maps. The theorem states that any continuous (smooth in our proof) function
More informationImplications of the Constant Rank Constraint Qualification
Mathematical Programming manuscript No. (will be inserted by the editor) Implications of the Constant Rank Constraint Qualification Shu Lu Received: date / Accepted: date Abstract This paper investigates
More informationMAT 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 informationM4P52 Manifolds, 2016 Problem Sheet 1
Problem Sheet. Let X and Y be n-dimensional topological manifolds. Prove that the disjoint union X Y is an n-dimensional topological manifold. Is S S 2 a topological manifold? 2. Recall that that the discrete
More informationCALCULUS ON MANIFOLDS
CALCULUS ON MANIFOLDS 1. Manifolds Morally, manifolds are topological spaces which locally look like open balls of the Euclidean space R n. One can construct them by piecing together such balls ( cells
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationIn view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written
11.8 Inequality Constraints 341 Because by assumption x is a regular point and L x is positive definite on M, it follows that this matrix is nonsingular (see Exercise 11). Thus, by the Implicit Function
More informationZangwill s Global Convergence Theorem
Zangwill s Global Convergence Theorem A theory of global convergence has been given by Zangwill 1. This theory involves the notion of a set-valued mapping, or point-to-set mapping. Definition 1.1 Given
More informationInner product spaces. Layers of structure:
Inner product spaces Layers of structure: vector space normed linear space inner product space The abstract definition of an inner product, which we will see very shortly, is simple (and by itself is pretty
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 2
MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary
More informationDifferential Topology Solution Set #2
Differential Topology Solution Set #2 Select Solutions 1. Show that X compact implies that any smooth map f : X Y is proper. Recall that a space is called compact if, for every cover {U } by open sets
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EECS 227A Nonlinear and Convex Optimization. Solutions 5 Fall 2009
UC Berkeley Department of Electrical Engineering and Computer Science EECS 227A Nonlinear and Convex Optimization Solutions 5 Fall 2009 Reading: Boyd and Vandenberghe, Chapter 5 Solution 5.1 Note that
More informationVector Spaces. (1) Every vector space V has a zero vector 0 V
Vector Spaces 1. Vector Spaces A (real) vector space V is a set which has two operations: 1. An association of x, y V to an element x+y V. This operation is called vector addition. 2. The association of
More informationThe Derivative. Appendix B. B.1 The Derivative of f. Mappings from IR to IR
Appendix B The Derivative B.1 The Derivative of f In this chapter, we give a short summary of the derivative. Specifically, we want to compare/contrast how the derivative appears for functions whose domain
More informationSYLLABUS. 1 Linear maps and matrices
Dr. K. Bellová Mathematics 2 (10-PHY-BIPMA2) SYLLABUS 1 Linear maps and matrices Operations with linear maps. Prop 1.1.1: 1) sum, scalar multiple, composition of linear maps are linear maps; 2) L(U, V
More informationPreliminary draft only: please check for final version
ARE211, Fall2012 CALCULUS4: THU, OCT 11, 2012 PRINTED: AUGUST 22, 2012 (LEC# 15) Contents 3. Univariate and Multivariate Differentiation (cont) 1 3.6. Taylor s Theorem (cont) 2 3.7. Applying Taylor theory:
More informationLagrange Multipliers
Lagrange Multipliers (Com S 477/577 Notes) Yan-Bin Jia Nov 9, 2017 1 Introduction We turn now to the study of minimization with constraints. More specifically, we will tackle the following problem: minimize
More informationIntroduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION
Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from
More informationThe Implicit Function Theorem 1
John Nachbar Washington University September 6, 2016 1 Introduction The Implicit Function Theorem 1 The Implicit Function Theorem is a non-linear version of the following observation from linear algebra.
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationChapter 2 Convex Analysis
Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,
More informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationInstructions. 2. Four possible answers are provided for each question and only one of these is correct.
Instructions 1. This question paper has forty multiple choice questions. 2. Four possible answers are provided for each question and only one of these is correct. 3. Marking scheme: Each correct answer
More informationCorrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015
Corrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015 Changes or additions made in the past twelve months are dated. Page 29, statement of Lemma 2.11: The
More informationCHAPTER 9. Embedding theorems
CHAPTER 9 Embedding theorems In this chapter we will describe a general method for attacking embedding problems. We will establish several results but, as the main final result, we state here the following:
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationMath 10C - Fall Final Exam
Math 1C - Fall 217 - Final Exam Problem 1. Consider the function f(x, y) = 1 x 2 (y 1) 2. (i) Draw the level curve through the point P (1, 2). Find the gradient of f at the point P and draw the gradient
More informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationf(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 informationi = f iα : φ i (U i ) ψ α (V α ) which satisfy 1 ) Df iα = Df jβ D(φ j φ 1 i ). (39)
2.3 The derivative A description of the tangent bundle is not complete without defining the derivative of a general smooth map of manifolds f : M N. Such a map may be defined locally in charts (U i, φ
More informationVANDERBILT UNIVERSITY. MATH 2300 MULTIVARIABLE CALCULUS Practice Test 1 Solutions
VANDERBILT UNIVERSITY MATH 2300 MULTIVARIABLE CALCULUS Practice Test 1 Solutions Directions. This practice test should be used as a study guide, illustrating the concepts that will be emphasized in the
More informationTopology Homework Assignment 1 Solutions
Topology Homework Assignment 1 Solutions 1. Prove that R n with the usual topology satisfies the axioms for a topological space. Let U denote the usual topology on R n. 1(a) R n U because if x R n, then
More informationExtra exercises Analysis in several variables
Extra exercises Analysis in several variables E.P. van den Ban Spring 2018 Exercise 1. Let U R n and V R p be open subsets and let π : U V be a C k map which is a surjective submersion. By a local C k
More information1.3 Linear Dependence & span K
( ) Conversely, suppose that every vector v V can be expressed uniquely as v = u +w for u U and w W. Then, the existence of this expression for each v V is simply the statement that V = U +W. Moreover,
More informationThe theory of manifolds Lecture 3. Tf : TR n TR m
The theory of manifolds Lecture 3 Definition 1. The tangent space of an open set U R n, TU is the set of pairs (x, v) U R n. This should be thought of as a vector v based at the point x U. Denote by T
More informationMath 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