SMSTC (2017/18) Geometry and Topology 2.
|
|
- Verity Richardson
- 5 years ago
- Views:
Transcription
1 SMSTC (2017/18) Geometry and Topology 2 Lecture 1: Differentiable Functions and Manifolds in R n Lecturer: Diletta Martinelli (Notes by Bernd Schroers) a wwwsmstcacuk 11 General remarks In this lecture we review properties of differentiable functions R n R m and explain how they can be used to define parametrised surfaces and (sub)manifolds in R n The two key results are the inverse mapping theorem and the implicit function theorem We will prove both and illustrate them with examples The proof of the inverse mapping theorem requires the contraction mapping theorem in metric spaces, which is an important tool in many branches of analysis We therefore prove it here as well One of messages of this lecture is that differentiating a function f : R n R m is more than computing partial derivatives Differentiation of a function at a point p means finding the best linear approximation at p The linear approximation itself is a linear map f (p) : R n R m (or, as you shall see in later lectures, more precisely a linear map of tangent spaces T p R n T f(p) R m ) The linear map can be represented by a matrix of partial derivatives but it is the properties of the linear map which determine the properties of f sufficiently close to p The material in this lecture takes up an unfortunate position in the university curriculum in the UK and the USA: it is usually omitted from undergraduate courses because it is considered too abstract and difficult, and then, if at all, taught in the context of differentiable manifolds at the graduate level Here we steer an intermediate course, formulating and proving the inverse mapping and implicit function theorems for functions on R n R m There are relatively few books that cover the material at the same level, but [1] and [2] are notable exceptions 12 Differentiable maps R n R m Notation: We denote vectors in R n by ordinary Roman letters x, y, and write x for the norm (usually the Euclidean norm) We denote the components of x R n by x 1,, x n We use column or row notation for vectors based on notational convenience The idea of differentiation is that of approximation by a linear function: Definition 11 Let U be an open set in R n Then f : U R m is called differentiable in a U if there is a linear map L : R n R m and a function r : U R m which is continuous in a and vanishes at a so that for all x U a DilettaMartinelli@edacuk f(x) = f(a) + L(x a) + r(x) x a (11) 1 1
2 SMST C: Geometry and Topology y f y=f(a)+f (a)(x a) a x Figure 11: Differentiation as approximation by a linear map The linear map L is uniquely determined by this condition (check it!) and is called the derivative of f at a, written f (a) or df a While all terms in the equation (11) are well-defined, the definition does not state which vector spaces the linear maps L acts on and takes its value in The full answer to this question is that the map L is really a map of tangent spaces L : T a R n T f(a) R m A careful definition of tangent spaces would take us to far afield at the moment, but in the current context we can think of T a R n simply as the vector space obtained from the affine space R n by identifying the point a as the origin, ie, as the space of vectors beginning at a In order to determine if a function is differentiable we need to have a candidate linear map L and then we need to check if satisfies r(x) = f(x) f(a) L(x a) x a The candidate linear map we use is given by the Jacobian matrix (12) lim r(x) = 0 (13) x a (a) f m (a) x n (a) f m x n (a) Warning:: The function f may not be differentiable in a point a even if the Jacobian matrix exists there - see the Exercises for this lecture! If the Jacobian matrix exists and if (12) satisfies the requirement (13) then we write (a) f (a) = f n (a) x n (a) f n x n (a)
3 SMST C: Geometry and Topology Example 11 With x(r, θ) = (r cos θ, r sin θ), find x where it is defined Compare r with r One can show that continuous partial differentiability is a sufficient condition for differentiability: Lemma 11 If all first partial derivatives of f : U R m exist and are continuous in a, then f is differentiable in a and f equals the Jacobian matrix at a Most of the results for differentiation of functions f : R R hold for maps f : R n R m but need to be suitably interpreted For real numbers α, β and differentiable functions f, g : R n R m we have (αf + βg) = αf + βg If we have a product on R n (for example the scalar product, or the vector product in the case of n = 3), the product or Leibniz rule hold, but both sides now need to be interpreted as linear maps: (fg) (a) = f (a)g(a) + f(a)g (a) In the chain rule for f : R n R m and g : R k R n the right hand side has to be read as matrix multiplication: (f g) (a) = f (g(a))g (a) Finally, we have Lemma 12 If a function f : U R n is differentiable in a U with invertible derivative f (a) and has an inverse f 1 which is continuous in b = f(a), then the inverse is also differentiable in b, with derivative ( f 1 ) (b) = ( f (a) ) 1, where the right hand side is the matrix inverse Example 12 Note that the existence and non-vanishing of f at a point is not sufficient for local invertibility You are asked to explore this in one of the exercises for this lecture by considering the function { 0 if x = 0 f(x) = x + x 2 cos 1 x if x 0 The function f is differentiable in x = 0 and f (0) 0 but that there is no neighbourhood U of 0 where f is invertible Recall the mean value theorem in R: Theorem 11 Suppose the function f : [a, b] R is continuous and differentiable in (a, b) Then there is a c (a, b) so that f f(b) f(a) (c) = b a The theorem holds in a modified form for real valued functions on R n : Theorem 12 If f : U R is differentiable and the line ab joining a, b U lies in U, then there is a point c on that line so that f(b) f(a) = f (c)(b a)
4 SMST C: Geometry and Topology For a function f : U R m one can still apply the mean value theorem to each component f j of f, getting m points c j on the line ab where f j (b) f j (a) = f j (c j)(b a) If one has a bound B on the matrix norm of f (c) which is uniform on the line ab then one can deduce a useful inequality: sup c ab f (c) B, f(b) f(a) B b a (14) 13 Banach contraction mapping theorem As preparation for the proof of the inverse mapping theorem we prove a very general and powerful result of maps in metric spaces Definition 12 A metric on a set X is a mapping d : X X R + 0 with d(x, y) = d(y, x) symmetry (15) d(x, y) = 0 x = y definiteness (16) d(x, y) d(x, z) + d(z, y) triangle inequality (17) for all x, y, z X Definition 13 A metric space (X, d) is complete if every Cauchy sequence has a limit in (X, d) Example 13 R n with metric d(x, y) = x y T(x 0 ) x2 x1 x0 x Figure 12: The sequence (x n ) used in the contraction mapping theorem Definition 14 Let (X, d) be a metric space A mapping T : X X is said to be a contraction mapping if there is a k (0, 1) so that for all x, y X d(t x, T y) kd(x, y) The constant k is called a Lipschitz constant Note that contraction mappings are continuous
5 SMST C: Geometry and Topology Theorem 13 (Banach contraction mapping theorem) Let (X, d) be a complete metric space and T : X X a contraction mapping with Lipschitz constant k Then 1 For any x 0 X, the sequence (x n ) defined via converges x n = T (x n 1 ), n N 2 All sequences (x n ) defined in this way have the same limit x (independent of x 0 ) and x is the unique solution of x = T (x) It is called the fixed point of T Proof 1 Recalling we have the inequality m l=1 k l = 1 km+1 1 k 1 1 k d(x n+m, x n ) d(x n+m, x n+m 1 ) + + d(x n+1, x n ) (k n+m 1 + k n )d(x 1, x 0 ) kn 1 k d(x 1, x 0 ) Hence the sequences (x n ) are Cauchy sequences for any x 0 X The completeness of X then guarantees the existence and uniques of the limit for each of these sequences 2 Fix a x 0 and denote the limit of (x n ) by x Then d(x, T (x )) d(x, x n ) + d(x n, T (x )) d(x, x n ) + kd(x n 1, x ) 0 for n Hence T (x ) = x and thus x is a fixed point of T Let x be another fixed point Then d(x, x) = d(t (x ), T ( x)) kd(x, x) (1 k)d(x, x) 0 Since (1 k) is positive, we deduce that d(x, x) = 0 and hence x = x The uniqueness of the fixed point implies that all sequences (x n ) have the same limit 14 The inverse mapping theorem Theorem 14 Let U R n be open and f : U R n continuously differentiable Assume that for a U, the linear map f (a) : R n R n is invertible, ie, det f (a) 0 Then there exists a neighbourhood V of a such that 1 f V is injective, 2 f(v ) is open, 3 The inverse function g of f V is continuously differentiable Proof Assume without loss of generality that a = 0, f(a) = 0 and f (0) = id This can always be achieved by multiplying f from the left with the matrix f (0) 1
6 SMST C: Geometry and Topology We define the map φ y : U R n via φ y (x) = x f(x) + y, and note that every fixed point of φ y is an inverse image of y contraction mapping theorem, and need to check its conditions We would like to apply the First we need to show that φ y maps a complete metric space to itself Thus we are looking for a closed ball B(0, 2r) of radius 2r around the origin so that for every y B(0, r), the map φ y maps B(0, 2r) to itself and is contracting Using f (0) = id and the continuity of f we conclude that there is a r > 0 so that for all x B(0, 2r) id f (x) 1 2 The inequality (14) deduced from the mean value theorem applied to φ 0 (x) = x f(x) then gives Thus, by the triangle inequality so that φ y : B(0, 2r) B(0, 2r) as claimed x f(x) 1 2 x φ y (x) x f(x) + y 2r, Next we need to establish that φ y is a contraction mapping Using again the inequality (14) for φ y and x 1, x 2 B(0, 2r) we deduce φ y (x 2 ) φ y (x 1 ) 1 2 x 1 x 2, so that φ y is indeed a contraction and has a unique fixed point x, ie, for each y B(0, r) there is a unique x B(0, 2r) so that f(x) = y We thus know that f maps the preimage of B(0, r) bijectively to B(0, r) By the continuity of f this preimage is an open set; we denote it by V To show, finally, that the inverse map g of f V is continuously differentiable we only need to show that it is continuous, by Lemma 12 To show continuity we observe implies φ 0 (x 1 ) = x 1 f(x 1 ), φ 0 (x 2 ) = x 2 f(x 2 ), x 1, x 2 B(0, 2r) or, by the same inequality as above, so that, with y i = f(x i ), i = 1, 2, x 2 x 1 = φ 0 (x 2 ) φ 0 (x 1 ) + f(x 2 ) f(x 1 ) x 2 x x 2 x 1 + f(x 2 ) f(x 1 ) g(y 2 ) g(y 1 ) 2 y 2 y 1, which implies continuity of g and completes the proof
7 SMST C: Geometry and Topology The implicit function theorem We are interested in systems of equations of the form f 1 (x 1,, x m, u 1,, u p ) = 0 f m (x 1,, x m, u 1,, u p ) = 0, (18) and would like to know if we can express x 1,, x m as functions of u 1,, u p We write D for an open subset of R m R p, and combine the functions f 1,, f m into one function f : D R m We write f (1) for the derivative of f with respect to the first m variables x 1,, x m, so f (1) is represented by the Jacobian matrix f m Theorem 15 (Implicit function theorem) Assume that D R m R p is open and that f : D R m is continuously differentiable Assume further that x m f m x m f(a, b) = 0 and det f (1) (a, b) 0 Then there exists a neighbourhood U of b and a uniquely determined continuously differentiable map ϕ : U R m so that, for all u U, f(ϕ(u), u) = 0 Proof Define the function F : D R m R p via F (x, u) = (f(x, u), u) One checks that F is continuously differentiable, with Jacobian and ( f F = (1) f (2) ) 0 id R p detf = detf (1) The map F satisfies the assumptions of the inverse mapping theorem, so for each (a, b) D there is a neighbourhood W so that F W has a continuously differentiable inverse G : F (W ) W The equation F (x, u) = (y, v) is then equivalent to G(y, v) = (x, u) with x = g(y, v), u = v,
8 SMST C: Geometry and Topology where g : R m R p R m is continuously differentiable We claim that ϕ(v) = g(0, v) is the required map Indeed, we have F G =id, so or, with y = 0 and u = v, f(g(y, v), v) = y f(ϕ(u), u) = 0 This is the only solution of f(x, u) = 0, since g(f(x, u), u) = x with f(x, u) = 0 implies g(0, u) = ϕ(u) = x The derivative of the map ϕ can be computed directly from f(ϕ(u), u) = 0 Using the chain rule, one finds ϕ (u) = f (1) (ϕ(u), u) 1 f (2) (ϕ(u), u) 16 Submanifolds of R n We begin by considering parametrised p-dimensional surfaces in R n (p < n): Definition 15 Let U R p be an open set and σ : U R n a continuously differentiable map If σ has rank p (ie, if it is injective), we call σ a parametrised p-surface in R n Definition 16 A parametrisation σ : V R n is equivalent to the parametrisation σ : U R n if there is a diffeomorphism φ : V U so that σ = σ φ Example 14 The stereographic parametrisation of the 2-sphere σ(u 1, u 2 ) = u (2u 1, 2u 2, 1 u 2 u2 1 u 2 2) (19) 2 (projection from the South pole) can be traded for σ(x 1, x 2 ) = (x 1, x 2, 1 x 2 1 x2 2 ) (110) on the upper hemisphere - see Fig 13 Definition 17 Let g : R n R n p be continuously differentiable and assume that g has maximal rank n p everywhere Then we call the set M := {x g(x) = 0} of zeros of g a p-dimensional submanifold of R n (assuming that M is not the empty set)
9 SMST C: Geometry and Topology S 2 p= σ (u) u σ Figure 13: Parametrising the the sphere Note that all level sets {x f(x) = c} for a constant c R n p are included in this definition: we simply take g = f c Example 15 We have already encountered the 2-sphere of radius r: S 2 = {x R 3 x x x 2 3 = r 2 } Lemma 13 Every p-dimensional submanifold of R n can locally be described by a parametrised p-surface in R n Proof This is a direct consequence of the implicit function theorem 17 Sard s theorem In defining a submanifold as a level set of a function f : R n R n p we need to check the maximal rank requirement on the derivative f Sard s theorem tells us that if we pick a value c in the image set of a suitably smooth f : R n R n p at random then the level set {x f(x) = c} will almost certainly be a submanifold To formulate the theorem we need some terminology Definition 18 For a differentiable function f : U R n R m with m < n, a point a U is called a critical point if the rank of f (a) is smaller than the maximal rank m The set of critical points is called the critical set of f Theorem 16 (Sard s Theorem) Let f : R n R n p be a k-times differentiable function, where k max{p + 1, 1} Write X for the critical set of f Then f(x) has Lebesgue measure 0 in R n p
10 SMST C: Geometry and Topology Exercises 1H 1H1 (a) Consider the function f : R 2 R 2 given by 0 if (x 1, x 2 ) = (0, 0) f(x 1, x 2 ) = x 1 x 2 if (x 1, x 2 ) (0, 0) x 2 1 +x 2 2 Show that both partial derivatives exist at (x 1, x 2 ) = (0, 0) but that the function is not differentiable there (b) Prove Lemma 12 (c) (i) Suppose a function f : U R n R m is such that all partial derivatives exist and are continuous in U Show that f is then continuously differentiable in U (ii) Let (a, b) be an open interval and x 0 (a, b) Suppose a continuous function f : (a, b) R is differentiable in (a, b) \ {x 0 }, and the limit lim x x 0 f (x) exists Show that the function is then differentiable in x 0 and that f (x 0 ) = lim x x 0 f (x), so that the function is in fact continuously differentiable at x 0 (iii) Consider now a continuous function U R n R m and a point x 0 U Suppose that all the partial derivatives exist and are continuous in U \ {x 0 }, and that, moreover, the limits of all partial derivatives exist as x x 0 Show that the function is then continuously differentiable in all of U (iv) Use (iii) to show that the function f : R 2 R 2 given by ( ) x2 x f(x) = 1 r, r = x x 1 x 2 r x2 2, is continuously differentiable in all of R 2, and compute its derivative at the origin (d) Consider the function f(x) = { 0 if x = 0 x + x 2 cos 1 x if x 0 Show that f is differentiable in x = 0 and that f (0) 0 but there is no neighbourhood U of 0 where f is invertible Why does the inverse mapping theorem not apply? (e) Suppose that the cubic equation t 3 y 1 t 2 + y 2 t y 3 = 0 has three distinct real zeros when (y 1, y 2, y 3 ) = (b 1, b 2, b 3 ) R 3 Deduce that the equation has three distinct real zeros for (y 1, y 2, y 3 ) in a sufficiently small neighbourhood of (b 1, b 2, b 3 ) Hint: Write the coefficients of a cubic polynomial as a function of the zeros and use the inverse mapping theorem (f) What is bigger, e π or π e? Justify your answer with a full proof
11 SMST C: Geometry and Topology References [1] Michael Spivak, Calculus on Manifolds, W A Benjamin, New York 1965 [2] Tom M Apostol, Mathematical Analysis, Addison-Wesley, 1974
Course 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationCOMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM
COMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM A metric space (M, d) is a set M with a metric d(x, y), x, y M that has the properties d(x, y) = d(y, x), x, y M d(x, y) d(x, z) + d(z, y), x,
More informationProblem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1
Problem set 5, Real Analysis I, Spring, 25. (5) Consider the function on R defined by f(x) { x (log / x ) 2 if x /2, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, R f /2
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
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 informationTHE 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 informationTHE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS
THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, S.C. 29208, USA HOWARD@MATH.SC.EDU Abstract. This is an edited version of a
More information1.4 The Jacobian of a map
1.4 The Jacobian of a map Derivative of a differentiable map Let F : M n N m be a differentiable map between two C 1 manifolds. Given a point p M we define the derivative of F at p by df p df (p) : T p
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationSeveral variables. x 1 x 2. x n
Several variables Often we have not only one, but several variables in a problem The issues that come up are somewhat more complex than for one variable Let us first start with vector spaces and linear
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationLecture 11 Hyperbolicity.
Lecture 11 Hyperbolicity. 1 C 0 linearization near a hyperbolic point 2 invariant manifolds Hyperbolic linear maps. Let E be a Banach space. A linear map A : E E is called hyperbolic if we can find closed
More 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 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 information1. Bounded linear maps. A linear map T : E F of real Banach
DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:
More informationMath 190: Fall 2014 Homework 4 Solutions Due 5:00pm on Friday 11/7/2014
Math 90: Fall 04 Homework 4 Solutions Due 5:00pm on Friday /7/04 Problem : Recall that S n denotes the n-dimensional unit sphere: S n = {(x 0, x,..., x n ) R n+ : x 0 + x + + x n = }. Let N S n denote
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 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 informationMathematical Analysis Outline. William G. Faris
Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,
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 informationAnalysis 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 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 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 information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationCourse 224: Geometry - Continuity and Differentiability
Course 224: Geometry - Continuity and Differentiability Lecture Notes by Prof. David Simms L A TEXed by Chris Blair 1 Continuity Consider M, N finite dimensional real or complex vector spaces. What does
More informationNOTES ON MULTIVARIABLE CALCULUS: DIFFERENTIAL CALCULUS
NOTES ON MULTIVARIABLE CALCULUS: DIFFERENTIAL CALCULUS SAMEER CHAVAN Abstract. This is the first part of Notes on Multivariable Calculus based on the classical texts [6] and [5]. We present here the geometric
More informationM2PM1 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 informationAnalysis II - few selective results
Analysis II - few selective results Michael Ruzhansky December 15, 2008 1 Analysis on the real line 1.1 Chapter: Functions continuous on a closed interval 1.1.1 Intermediate Value Theorem (IVT) Theorem
More informationFIXED POINT METHODS IN NONLINEAR ANALYSIS
FIXED POINT METHODS IN NONLINEAR ANALYSIS ZACHARY SMITH Abstract. In this paper we present a selection of fixed point theorems with applications in nonlinear analysis. We begin with the Banach fixed point
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationTransformations from R m to R n.
Transformations from R m to R n 1 Differentiablity First of all because of an unfortunate combination of traditions (the fact that we read from left to right and the way we define matrix multiplication
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 informationChapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem
Chapter 4 Inverse Function Theorem d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d d dd d d d d This chapter
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 informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More 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 informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationMath 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 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 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 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 informationMath General Topology Fall 2012 Homework 1 Solutions
Math 535 - General Topology Fall 2012 Homework 1 Solutions Definition. Let V be a (real or complex) vector space. A norm on V is a function : V R satisfying: 1. Positivity: x 0 for all x V and moreover
More informationManifolds and tangent bundles. Vector fields and flows. 1 Differential manifolds, smooth maps, submanifolds
MA 755 Fall 05. Notes #1. I. Kogan. Manifolds and tangent bundles. Vector fields and flows. 1 Differential manifolds, smooth maps, submanifolds Definition 1 An n-dimensional C k -differentiable manifold
More informationLECTURE 5: SMOOTH MAPS. 1. Smooth Maps
LECTURE 5: SMOOTH MAPS 1. Smooth Maps Recall that a smooth function on a smooth manifold M is a function f : M R so that for any chart 1 {ϕ α, U α, V α } of M, the function f ϕ 1 α is a smooth function
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 informationOutline of the course
School of Mathematical Sciences PURE MTH 3022 Geometry of Surfaces III, Semester 2, 20 Outline of the course Contents. Review 2. Differentiation in R n. 3 2.. Functions of class C k 4 2.2. Mean Value Theorem
More informationHOMEWORK FOR , FALL 2007 ASSIGNMENT 1 SOLUTIONS. T = sup T(x) Ax A := sup
HOMEWORK FOR 18.101, FALL 007 ASSIGNMENT 1 SOLUTIONS (1) Given a linear map T : R m R n Define the operator norm of T as follows: T(x) T := sup x 0 x Similarly, if A is a matrix, define the operator norm
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 informationMath 215B: Solutions 3
Math 215B: Solutions 3 (1) For this problem you may assume the classification of smooth one-dimensional manifolds: Any compact smooth one-dimensional manifold is diffeomorphic to a finite disjoint union
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
More informationLecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differenti. equations.
Lecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differential equations. 1 Metric spaces 2 Completeness and completion. 3 The contraction
More informationMath 225B: Differential Geometry, Final
Math 225B: Differential Geometry, Final Ian Coley March 5, 204 Problem Spring 20,. Show that if X is a smooth vector field on a (smooth) manifold of dimension n and if X p is nonzero for some point of
More informationMath General Topology Fall 2012 Homework 6 Solutions
Math 535 - General Topology Fall 202 Homework 6 Solutions Problem. Let F be the field R or C of real or complex numbers. Let n and denote by F[x, x 2,..., x n ] the set of all polynomials in n variables
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationBasic Properties of Metric and Normed Spaces
Basic Properties of Metric and Normed Spaces Computational and Metric Geometry Instructor: Yury Makarychev The second part of this course is about metric geometry. We will study metric spaces, low distortion
More informationInverse Function Theorem
Inverse Function Theorem Ethan Y. Jaffe 1 Motivation When as an undergraduate I first learned the inverse function theorem, I was using a textbook of Munkres [1]. The proof presented there was quite complicated
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More 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 informationDifferential Topology Solution Set #3
Differential Topology Solution Set #3 Select Solutions 1. Chapter 1, Section 4, #7 2. Chapter 1, Section 4, #8 3. Chapter 1, Section 4, #11(a)-(b) #11(a) The n n matrices with determinant 1 form a group
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 informationReal Analysis Prelim Questions Day 1 August 27, 2013
Real Analysis Prelim Questions Day 1 August 27, 2013 are 5 questions. TIME LIMIT: 3 hours Instructions: Measure and measurable refer to Lebesgue measure µ n on R n, and M(R n ) is the collection of measurable
More informationChap. 1. Some Differential Geometric Tools
Chap. 1. Some Differential Geometric Tools 1. Manifold, Diffeomorphism 1.1. The Implicit Function Theorem ϕ : U R n R n p (0 p < n), of class C k (k 1) x 0 U such that ϕ(x 0 ) = 0 rank Dϕ(x) = n p x U
More informationThe Borsuk Ulam Theorem
The Borsuk Ulam Theorem Anthony Carbery University of Edinburgh & Maxwell Institute for Mathematical Sciences May 2010 () 1 / 43 Outline Outline 1 Brouwer fixed point theorem 2 Borsuk Ulam theorem Introduction
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 informationMath 361: Homework 1 Solutions
January 3, 4 Math 36: Homework Solutions. We say that two norms and on a vector space V are equivalent or comparable if the topology they define on V are the same, i.e., for any sequence of vectors {x
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationSARD S THEOREM ALEX WRIGHT
SARD S THEOREM ALEX WRIGHT Abstract. A proof of Sard s Theorem is presented, and applications to the Whitney Embedding and Immersion Theorems, the existence of Morse functions, and the General Position
More informationMetric Spaces Lecture 17
Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =
More informationMath 868 Final Exam. Part 1. Complete 5 of the following 7 sentences to make a precise definition (5 points each). Y (φ t ) Y lim
SOLUTIONS Dec 13, 218 Math 868 Final Exam In this exam, all manifolds, maps, vector fields, etc. are smooth. Part 1. Complete 5 of the following 7 sentences to make a precise definition (5 points each).
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 informationMA2AA1 (ODE s): The inverse and implicit function theorem
MA2AA1 (ODE s): The inverse and implicit function theorem Sebastian van Strien (Imperial College) February 3, 2013 Differential Equations MA2AA1 Sebastian van Strien (Imperial College) 0 Some of you did
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 informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationDifferential Geometry qualifying exam 562 January 2019 Show all your work for full credit
Differential Geometry qualifying exam 562 January 2019 Show all your work for full credit 1. (a) Show that the set M R 3 defined by the equation (1 z 2 )(x 2 + y 2 ) = 1 is a smooth submanifold of R 3.
More informationEconomics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011
Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationAppendix B: Multivariable Calculus
Chapter 9 Appendix B: Multivariable Calculus 9.1 Basic Theorems of Multivariable Calculus The Euclidean spacer n is the set of n-tuples x=(x 1,..., x n )=(x i ), i= 1,...,n. The standard basis inr n is
More informationDIFFERENTIAL GEOMETRY, LECTURE 16-17, JULY 14-17
DIFFERENTIAL GEOMETRY, LECTURE 16-17, JULY 14-17 6. Geodesics A parametrized line γ : [a, b] R n in R n is straight (and the parametrization is uniform) if the vector γ (t) does not depend on t. Thus,
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 informationReview for the Final Exam
Math 171 Review for the Final Exam 1 Find the limits (4 points each) (a) lim 4x 2 3; x x (b) lim ( x 2 x x 1 )x ; (c) lim( 1 1 ); x 1 ln x x 1 sin (x 2) (d) lim x 2 x 2 4 Solutions (a) The limit lim 4x
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 informationVectors. January 13, 2013
Vectors January 13, 2013 The simplest tensors are scalars, which are the measurable quantities of a theory, left invariant by symmetry transformations. By far the most common non-scalars are the vectors,
More informationPreliminary Exam 2018 Solutions to Morning Exam
Preliminary Exam 28 Solutions to Morning Exam Part I. Solve four of the following five problems. Problem. Consider the series n 2 (n log n) and n 2 (n(log n)2 ). Show that one converges and one diverges
More information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationChapter 2 Linear Transformations
Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationLecture 2: Review of Prerequisites. Table of contents
Math 348 Fall 217 Lecture 2: Review of Prerequisites Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In this
More informationMath 54 - HW Solutions 5
Math 54 - HW Solutions 5 Dan Crytser August 6, 202 Problem 20.a To show that the Manhattan metric d(, y) = y +... + n y n induces the standard topology on R n, we show that it induces the same topology
More informationIntroduction to Algebraic and Geometric Topology Week 3
Introduction to Algebraic and Geometric Topology Week 3 Domingo Toledo University of Utah Fall 2017 Lipschitz Maps I Recall f :(X, d)! (X 0, d 0 ) is Lipschitz iff 9C > 0 such that d 0 (f (x), f (y)) apple
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 6: The metric space M(G) and normal families
Chapter 6: The metric space MG) and normal families Course 414, 003 04 March 9, 004 Remark 6.1 For G C open, we recall the notation MG) for the set algebra) of all meromorphic functions on G. We now consider
More informationSurfaces JWR. February 13, 2014
Surfaces JWR February 13, 214 These notes summarize the key points in the second chapter of Differential Geometry of Curves and Surfaces by Manfredo P. do Carmo. I wrote them to assure that the terminology
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationTheorem 3.11 (Equidimensional Sard). Let f : M N be a C 1 map of n-manifolds, and let C M be the set of critical points. Then f (C) has measure zero.
Now we investigate the measure of the critical values of a map f : M N where dim M = dim N. Of course the set of critical points need not have measure zero, but we shall see that because the values of
More information