INVERSE FUNCTION THEOREM and SURFACES IN R n
|
|
- Luke Park
- 5 years ago
- Views:
Transcription
1 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 f V : V R n is a homeomorphism onto its image W = f(v ), an open subset of R n ; the inverse g = f 1 : W V is a C k map. The inverse function theorem as an existence theorem. Given f : X Y (X, Y Banach spaces) and y Y, we seek to solve the nonlinear equation: f(x) = y. The idea is that if f is close (in some sense) to a linear operator A L(X, Y ) for which the problem is uniquely solvable, and (for a given b Y ) we happen to know a solution a X to f(x) = b, then for values y close to b the equation should have a unique solution (close to a). For example, suppose f has the form f(x) = Ax + φ(x), where A L(X, Y ) is invertible (with bounded inverse) and φ : X Y is Lipschitz, with a small Lipschitz constant Lip(φ). Then to solve Ax + φ(x) = y assuming the linear problem Av = w can be solved uniquely for any w Y (that is, A is invertible, and v X C w Y, where C = A 1 ) we compute successive approximations, starting from an arbitrary a X and solving the sequence of linear problems with given right-hand side : Ax 1 = y φ(a), Ax 2 = y φ(x 1 ), Ax 3 = y φ(x 2 ), Convergence of (x n ) is established by setting this up as a fixed point problem, for F (x) = A 1 [y φ(x)]: x 1 = F (a), x 2 = F (x 1 ), Convergence to a fixed point is guaranteed provided F is a contraction of X: F (x) F ( x) λ x x, where 0 < λ < 1. Since F (x) F ( x) = A 1 [φ(x) φ( x)], it suffices to require Lip(φ) < 1/ A 1. Then the estimate (for two solutions of f(x) = y, f( x) = ȳ, y, ȳ Y : x x = A 1 [y ȳ] A 1 [φ(x) φ( x)] A 1 ( y ȳ + Lip(φ) x x ), 1
2 (1 λ) x x A 1 y ȳ, λ = A 1 Lip(φ) < 1 shows that the inverse map g(y) = x is Lipschitz, with constant Lip(g) A 1 /(1 λ). We recall here the standard fixed point theorem for contractions. Contractions have unique fixed points. Let (X, d) be a complete metric space, F : X X a λ-contraction, where 0 < λ < 1: d(f (x), F (y)) λd(x, y), x, y X. Then F has a unique fixed point p X, which is globally attracting (F n (x) p, x X.) Proof. Let x X. For the sequence of iterates x n = F n (x), the contraction property easily implies d(x m+1, x m ) λ m d(x 1, x) := λ m δ, and then if n > m N: d(x n, x m ) d(x n, x n 1 ) +... d(x m+1, x m ) (λ n λ m )δ λn 1 λ δ, so (x n ) is a Cauchy sequence, and x n p X. Then p is a fixed point: d(f (p), p) d(f (p), F (x n )) + d(x n+1, p) λd(x n, p) + d(x n+1, p) 0. It follows easily from the contraction property that F can only have one fixed point. Typically the perturbation φ of the invertible linear map A will satisfy a Lipschitz condition only in some open set U X. Then given a point b Y for which the problem has a unique solution a U (that is, f(a) = b) and a nearby point y Y, we seek solutions x B r (a), (closed ball), where r > 0 is small enough that this ball is contained in U. The successive approximations scheme still works, provided we guarantee this ball is invariant under F. So we estimate, for x B r (a) (using a = A 1 [b φ(a)]): F (x) a = A 1 [y φ(x)] a = A 1 [y b] A 1 [φ(x) φ(a)] A 1 ( y b + Lip(φ) x a ) A 1 (s + Lip(φ)r), and this is bounded above by r provided we pick y B s (b) (open ball in Y ), where s (1 λ)r (with λ = A 1 Lip(φ) < 1 as before). We summarize A 1 as follows: 2
3 Proposition 1. Perturbations of invertible linear maps are homeomorphisms. Let f : U Y (U X open) have the form f(x) = Ax + φ(x), where A L(X, Y ) is boundedly invertible and φ is Lipschitz with Lip(φ) < A 1 1. Then V = f(u) is open in Y, and f : U V is a homeomorphism with Lipschitz inverse. If U = X, f is a homeomorphism onto Y (with Lipschitz inverse). Turning to the case of f : U R n, where U R n is an open set, suppose f is differentiable at a U, with df(a) GL(R n ) (that is, df(a) is an invertible linear map.) Then we have, for a function r : U R n : f(x) = f(a)+df(a)[x a]+r(x) = df(a)[x]+φ(x), φ(x) = f(a) df(a)[a]+r(x), so φ is Lipschitz in U if and only if r is (with the same Lipschitz constant.) Recall the condition r is Lipschitz with s small constant, in a sufficiently small ball with center a corresponds exactly to strong differentiability at a. This motivates the hypothesis in the statement of the Inverse Function Theorem. Inverse Function Theorem. Let f : U R n (U R n open) be strongly differentiable at a U, and assume df(a) GL(R n ) (that is, df(a) is an isomorphism.) Then there exists a neighborhood V U of a so that: (i) The restriction f V is a bi-lipschitz homeomorphism onto its image W = f(v ), and W is open in R n. (ii) The inverse map g = f 1 : W V is strongly differentiable at b = f(a); (iii) If f C 1 (U; R n ), then V can be chosen so that g = f 1 is differentiable in W ; (iv) If f C k (U; R n ) (with k 1) then g C k (W ; R n ). Proof. (i): Since f is strongly differentiable at a, we may find an open ball V = B r (a) so that for x, x in V : f(x) = f(a)+df(a)[x a]+r(x), where r(x) r( x) λ x x with λ df(a) 1 < 1. In other words (since f(a) df(a)[a] is a constant) in this ball V, f is a perturbation of the isomorphism df(a). Conclusion (i) follows from the proposition. Prior to proving (ii) and (iii), we consider a general result on differentiability of the inverse (of a homeomorphism). Note that the inverse of the 3
4 homeomorphism f(x) = x 3 of the real line is not differentiable at x = 0. This can only happen since f (0) = 0. Differentiability of the inverse. Let f : U V be a homeomorphism, where U, V are open in R n, with inverse g : V U. If f is differentiable at a U and df(a) GL(R n ), then g is differentiable at b = f(a), with dg(b) = [df(a)] 1. If f is strongly differentiable at a, then g is strongly differentiable at b. Proof. Defining s(w) (for w R n with w < dist(b, V )) by: g(b + w) = g(b) + [df(a)] 1 [w] + s(w), we need to show lim w 0 s(w)/ w = 0. Let v = g(b+w) g(b), and compute: df(a)[v]+r(v) = f(a+v) f(a) = f(g(b)+g(b+w) g(b)) b = b+w b = w. Thus: so: s(w) = v [df(a)] 1 [df(a)[v] + r(v)] = [df(a)] 1 [r(v)], s(w) w df(a) 1 r(v) v v f(a + v) f(a), and the claim follows from lim v 0 r(v)/ v = 0, the fact that v 0 iff w 0 (since f and g are both continuous), and the fact (proved earlier) that f(a + v) f(a) / v is bounded below, for v sufficiently small (since df(a) is an isomorphism.) Turning to strong differentiability, if we set v = g(b+w) g(b) (as before) and u = g(b + z) g(b), it follows as above that we have the relation, for the first-order Taylor remainders (of f at a and of g at b): s(w) s(z) = [df(a)] 1 [r(v) r(u)], w z = df(a)[v u] + r(v) r(u). Recall f is strongly differentiable at a iff the remainder r satisfies a Lipschitz condition with arbitrarily small constant, in a sufficiently small ball with center a. As the following estimates show, this implies s has the same property, in a sufficiently small ball with center b; thus g is strongly differentiable at b. w z df(a) v u ɛ v u v u ( df(a) ɛ) 1 w z := M w z. s(w) s(z) df(a) 1 r(v) r(u) ɛ df(a) 1 v u ɛm df(a) 1 w z 4
5 Statement (ii) in the IFT follows directly from this. Proof (iii) in the IFT: If f C 1 (U, R n ), since df : U L(R n ) is continuous, df(a) GL(R n ) and GL(R n ) is open in L(R n ), we have df(x) GL(R n ) for x in a neighborhood V 1 V of a. Then the lemma on differentiability of the inverse guarantees g = f 1 is differentiable at each point of W = f(v 1 ). Before proving (iv) we must take a short detour. Lemma 1. The inversion map f(x) = X 1 is smooth from GL(R n ) to L(R n ) M(n) (n n matrices.) Proof. First, f is continuous at any X GL(R n ), since it is differentiable, with df(x)[v ] = X 1 V X 1. We know the directional derivative is V f(x) = X 1 V X 1. Given V M(n), let B V : M(n) M(n) M(n) be the bilinear map B V (X, Y ) = XV Y. For fixed V M(n), the directional derivative map V f : GL(R n ) M(n) is the composition: V f = B (f, f), where (f, f) : GL(n) M(n) M(n) maps X (X 1, X 1 ). Thus V f is continuous in GL(R n ) for all V M(n), so f is C 1. Then (f, f) is C 1, and since B V (being bilinear) is smooth, it follows the composition V f is C 1 (for each V M(n)), so f is C 2. Repeating this argument (or by induction) we see that f is a C k map, for each k 1. Corollary 1 (of lemma 1). Let f : U V be a homeomorphism between open subsets U, V of R n, of class C k (k 1). If g = f 1 is differentiable in V, then g is of class C k. Proof. It follows from the Chain Rule that, if g is differentiable in V, we have df(x) GL(R n ) for all x U and dg(y) = [df(g(y))] 1. Thus dg : V L(R n ) may be written as the composition: V U GL(R n ) L(R n ) dg = Inv df g, where Inv : GL(R n ) L(R n ) is the inversion map (which, according to the Lemma, is smooth.) Thus if f is C k (or df is C k 1 ), it follows dg is C k 1 (or g is C k.) Clearly this Corollary implies part (iv) of the IFT. Corollary 2 (of the proof of the IFT). (Differentiable perturbation of the identity.) Let U R n be open and convex, φ : U R n of class C 1, with dφ(x) λ < 1 for all x U. Then f : U R n given by f(x) = x + φ(x) 5
6 is a diffeomorphism from U onto its image f(u), an open subset of R n. If U = R n, then f(u) = R n. If f is C k (k 1), then g = f 1 is C k. Proof. Since U is convex, it follows φ is a λ-contraction. Thus f is a homeomorphism onto an open set f(u). Since df(x) = I n + dφ(x) and dφ(x) < 1, we know df(x) is an isomorphism, for each x U. Thus g = f 1 is differentiable in f(u). (By definition, this says f is a diffeomorphism.) Exercise 1. Generalize this to f(x) = Ax + φ(x), where A GL(R n ). (That is, state a precise theorem and prove it.) Implicit Function Theorem. Consider f : U R n differentiable, where U R m is open and m > n: m = n + p. Suppose we have a point a U where df(a) is surjective. We would like to use the Inverse Function Theorem to say something about the level set of f through a: M = {x U; f(x) = b}, where b = f(a) R n. The Implicit Function Theorem says that, locally in a neighborhood of a, M coincides with the graph of a map h from an open subset of R p to R n. To make this precise, let K = Ker(df(a)) be the nullspace of df(a), a p-dimensional subspace of R m, and let E R m be a complementary (ndimensional) subspace, so that R m = K E is a direct sum decomposition and the restriction df(a) E is a linear isomorphism from E to R n. We may regard R m as a cartesian product: R m = K E, and write x = (x 1, x 2 ) with respect to this product decomposition. Theorem. Suppose f is strongly differentiable at a U, with df(a) L(R m, R n ) surjective (and m > n). There exists an open neighborhood V U of a = (a 1, a 2 ) in R m, an open neighborhood W 1 of a 1 in K and a differentiable map h : W 1 E so that h(a 1 ) = a 2 and M V coincides with the graph of h: M V := {x V ; f(x) = b} = {(x 1, h(x 1 )); x 1 W 1 }. If f is a C k map, then so is h. If f is C 1 in V, the differential of h at a point x W 1 is: dh(x) = [d 2 f(x, h(x))] 1 d 1 f(x, h(x)) L(K; E), where d 1 f(x, h(x)) L(K; R n ); d 2 f(x, h(x)) Iso(E; R n ). 6
7 Proof. Consider the map f : U K R n : f(x) = (π(x), f(x)), f(a) = (a1, b), where π : R m = K E K is projection onto the factor K. Then f is strongly differentiable at a, with derivative: d f(a)[v] = (π[v], df(a)[v]) K R n, v K E R m. This differential is an isomorphism, since d f(a)[v] = 0 implies π[v] = 0, so v = (0, v 2 ) {0} E, hence df(a)[v] = 0 implies v = 0 (since the restriction of df(a) to {0} E is an isomorphism to R n.) Thus the Inverse Function Theorem implies the existence of neighborhoods V of a in R m, W = W 1 W 2 of (a 1, b) in K R n, so that f : V W is a diffeomorphism, with inverse g : W V of class C k if f is C k. For y 1 W 1, z W 2, g(y 1, z) = (g 1 (y 1, z), g 2 (y 1, z)) is mapped by f to (g 1 (y 1, z), f(g(y 1, z)), and since this must equal (y 1, z), it follows that g 1 (y 1, z) = y 1, for all y 1 W 1. Define: h : W 1 E, h(y 1 ) = g 2 (y 1, b). Clearly h(a 1 ) = g 2 (a 1, b) = a 2, since g(a 1, b) = (a 1, a 2 ) (given f(a 1, a 2 ) = (a 1, f(a 2 )) = (a 1, b).) Since g C k (W, K E), we have h C k (W 1, E). And we see that, for x = (x 1, x 2 ) V K E: f(x) = b f(x) = (x 1, b) g(x 1, b) = x g 2 (x 1, b) = x 2 h(x 1 ) = x 2. To compute the differential of h at x 1 W 1, note that, with G : W 1 R m, G(x 1 ) = (x 1, h(x 1 )): 0 = d(f G)(x 1 ) = d 1 f(x 1, h(x 1 )) + d 2 f(x 1, h(x 1 )) dh(x 1 ) L(K, R n ), where d 1 f(x) L(K, R n ), d 2 f(x) L(E, R n ) are partial derivatives (with respect to the splitting R m = K E), with the second one an isomorphism for x V (taking a smaller V if needed), since d 2 f(a) Iso(E, R n ) and f is C 1 ; and dh(x 1 ) L(K, E). Solving for dh(x 1 ), we find: dh(x 1 ) = [d 2 f(x 1, h(x 1 ))] 1 d 1 f(x 1, h(x 1 )) L(K, E). Remark. In particular dh(a 1 ) = 0, since d 1 f(a) = df(a) K {0} = 0. Definition. For f : U R n of class C 1 (U R m open, m n), a point b R n is a regular value of f if df(x) L(R m, R n ) is surjective, for each x in the level set M b = {x U; f(x) = b}. 7
8 Submersions are open maps. A C 1 map f : U R n (U R m open, m > n is a submersion if df(x) L(R m, R n ) is surjective, for each x U. Recall a map between topological spaces is open if it maps open subsets of X to open subsets of Y. Homeomorphisms are clearly open maps, and the composition of open maps is open. Proposition 2. (i) If f is strongly differentiable at a U, and df(a) is surjective, then there exists a neighborhood V of a so that the restriction f V : V R n is an open map. (ii) If f is a C 1 submersion from U to R n, then f is an open map. Proof. (i) In the proof of the Implicit function Theorem, we found a neighborhood V of a so that the map f(x) = (π(x), f(x)) K R n (where R m = K E is defined by choosing a complement E to the kernel K of df(a)) is a diffeomorphism from V to a neighborhood W 1 W 2 of (a 1, b) in K R n (b = f(a), a = (a 1, a 2 ) with a 1 K, a 2 E.) On V, f = π 2 f, where π 2 : W 1 W 2 W 2 is projection onto the second factor W 2 R n. Since π 2 and f are open, this shows f V is open. (ii) From part (i), for each point x U there is a neighborhood V x U so that f Vx is an open map. If A U is open in U, we have A = x U V x A, so f(a) = x U f(v x A), where W x = f(v x A) is open in R n. Hence f(a) = x U W x is open in R n. Remark. In particular, under the conditions of part(i), the point f(a) is in the interior of f(v ). Images of C k parametrizations. A C k map (k 1) f : U R n (U R n open, n > m) is an immersion if df(x) L(R m, R n ) is injective, for each x U. f is a C k parametrization of its image M = f(u) R n if it is an injective immersion and defines a homeomorphism from U to M, where M R n has the induced topology. Proposition 3. Any image M R n of a C k parametrization φ : W 0 M = f(w 0 ) (W 0 R m open, m < n) is locally a graph. (That is, each point p M admits a neighborhood V M in which M admits a parametrization as the graph of a C k map.) Proof. Let p M, p = φ(x 0 ), x 0 W 0. Consider the subspace T p = dφ(x 0 )[R m ], and a complementary subspace N p R m, which defines a direct sum decomposition R m = T p N p ; let π : R m T p be the associated 8
9 projection. (Note dim(t p ) = m.)the composition π φ : W 0 T p has differential at x 0 given by: d(π φ)(x 0 ) = dπ(p) dφ(x 0 ). This is a linear isomorphism from R m to T p, since π is the identity on T p and dφ(x 0 ) is an isomorphism from R m to T p (φ is an immersion.) By the Inverse Function Theorem, we may find neighborhoods V 0 W 0 of x 0 and D p T p of π(p) so that π φ is a diffeomorphism F : V 0 D p (of class C k since φ is C k.) Let U = φ(v 0 ) M. This is an open neighborhood of p in M, since it coincides with π 1 (D p ) M. Consider g : D p U given by g = φ V0 F 1. Clearly g is a homeomorphism (and of class C k, as the composition of C k maps). And π g = id Dp shows that, with respect to the splitting R m = T p N p, g has the form g(x) = (x, h(x)), for a C k map h : D p N p. Thus g is a C k graph parametrization of the open set U M. Exercise 2. Let h : U R n be a C k map (k 1), U R m open. The graph of h is the subset of R m R n : G = {(x, y) U R n ; y = h(x)} (i) Show that φ : U R m R n, φ(x) = (x, h(x)) is a C k parametrization of G. Hint: to show φ 1 is continuous on G, show that it is Lipschitz (by estimating from below φ(x) φ(y) ), or that it is the restriction to G of the projection from U R n to U. (ii) Show there exists F : U R n R n of class C k, with surjective differential at each point, so that G = F 1 (0) (the level set of 0 R n.) m-dimensional surfaces in R n. Definition. A non-empty subset M R n is an m-dimensional surface of class C k (also known as m-dimensional submanifold of R n, of class C k ) if each p M admits a neighborhood U M (in the topology induced from E) which is the image φ(u 0 ) of a C k parametrization φ : U 0 E (U 0 R m open.) Remark. It can be shown that there is no loss of generality in taking U 0 connected in this definition; in fact we could assume U 0 is homeomorphic to the open ball in R m. 9
10 It follows from the work in the previous section that this definition is equivalent to either of the following two: (i) Each p M admits a neighborhood U M (of the form U = W M, W E open) so that for some C k submersion F : W R p (where p = dim(e) m) we have U = F 1 (0). (ii) For each p M we may find a direct sum decomposition E = T p N p, U 1 T p open, a C k map h : U 1 N p and a neighborhood W of p in E so that U = M W = {(x, h(x)) : x U 1 }. Colloquially, we speak of M being given by local parametrizations, M being locally a regular level set or M being locally a graph. Remark. In the global sense, the three definitions describe different classes of subsets of R n. For instance, no compact surface in R n can be covered by a single parametrization (in particular, no compact surface can be globally a graph). There are also 2-surfaces in R 3 (and compact 2-surfaces in R 4 ) which are not globally level sets for a regular value (although this is always true for a simply-connected 2-surface in R 3.) The Implicit Function Theorem can be stated as saying that, if b R n is a regular value for f : U R n (U R m open, m > n), then M b is locally a graph, hence is a surface in R n (of dimension m n). Example 1. Consider the subset of R 2 : M = {(x, sin 1 ); x > 0} {(x, y); x = 0, y ( 1, 1)}. x This is not a one-dimensional submanifold of R 2, since it can be shown any submanifold is locally connected, and this set isn t: any point on the vertical line segment has a neighborhood in M (in the induced topology) with infinitely many connected components. If we remove the vertical line segment, the resulting set is a submanifold of R 2 (so we see that the disjoint union of two submanifolds of the same dimension is not always a submanifold of R n.) Example 2. Consider the subset of R 2 made up of a circle and one of its tangent lines: M = {(x, y) R 2 ; y = 0 or x 2 + (y 1) 2 = 1}. This is not a submanifold of R 2. Locally near any point, a submanifold must be expressible as a graph, with respect to some direct-sum splitting of R n. 10
11 Thus it cannot have any branching points (as the origin is in this case). If we remove the origin, the resulting set is a submanifold. Tangent spaces. Let M R n be a C k m-surface (k 1, 1 m < n.) The tangent space to M at p is the set of all velocity vectors at p of C 1 curves contained in M. Precisely: T p M = {v R n ; v = α (0), where α : I R n, α(t) M t, α(0) = p}. (Here I R is any fixed open interval containing 0 and α is assumed to be C 1.) Indeterminacy. Clearly many curves α yield the same v. For instance, let φ : I I be a strictly increasing differentiable diffeomorphism of I fixing 0: t = φ(s), φ (s) > 0, φ(0) = 0. Then if φ (0) = 1, we have (α φ) (0) = α (0). A more serious problem is that it is not at all clear that this is a vector space! (At least it is easy to show it is a cone in R n : v T p M, λ R λv T p M.) We need the following proposition: Proposition 4. Let M be a C 1 m-surface in R n, let p M. (i) If M is given near p by a parametrization φ : U 0 R n, φ(x 0 ) = p, φ(u 0 ) = U M, then: T p M = dφ(x 0 )[R m ] = {v R n ; v = dφ(x 0 )[w] for some w R m.} (This is clearly a subspace of R n, of dimension m). (ii) If M is given near p by a graph parametrization (there is a neighborhood W of p in R n = E F and a map h : V F, V E open) so that M W = {(x, h(x)); x V } and p = (x 0, h(x 0 )), x 0 V, then: T p M = {v dh(x 0 )[v], v E.} (iii) If M is given near p as the level set M W = {x W ; F (x) = b}, for some C 1 submersion F : W R n m,w a neighborhood of p in R n, b = F (p), then: T p M = Ker(dF (p)), a subspace of R n. Remark: indeterminacy. The space in (i) might depend on φ (replacing φ by φ ψ, where ψ is a diffeomorphism of V 0 fixing x 0 gives another parametrization with domain V 0 ). Similarly changing the splitting of R n used in (ii) changes the map h, so we might get a different subspace. And the submersion F in (iii) is not uniquely defined, either. 11
12 The fact that these subspaces of R n coincide is a consequence of the proposition, which shows they all coincide with the set given in the geometric definition (as the set of velocity vectors of curves through p.) But the following can be shown directly. If φ : U 0 U M is a local parametrization of a neighborhood of p M with φ(x 0 ) = p and F : U 0 U 0 is a diffeomorphism of U 0 fixing x 0, then (evidently) ψ = φ F is again a parametrization of U, with ψ(x 0 ) = p. Then dψ(x 0 )(R m ) = dφ(x 0 )(R m ), since df (x 0 ) is an isomorphism of R m. Exercise 3. (i) Show that if φ : U 0 U M, ψ : U 0 U M are parametrizations (U 0 R m open) satisfying φ(x 0 ) = ψ(x 0 ) = p M, then dφ(x 0 )(R m ) = dψ(x 0 )(R m ). Hint: use the proof of proposition 5 at the end of this section to find a diffeomorphism F of U 0 fixing x 0 so that ψ = φ F, then the observation in the previous paragraph. (ii) Show that if p R n is a regular value of f : U R n (U R m open, m > n) and φ : R n R n is a diffeomorphism fixing p (φ(p) = p), then p is a regular value for g = φ f, the level sets {x f(x) = p} and {x g(x) = p} are equal (call them M p ) and Ker(df(x)) = Ker(dg(x)) (as subspaces of R m ), for each x M p. Proof (of proposition 4). That the vector spaces in (i) and (ii) are contained in the set of velocity vectors of curves on M through p is clear. To prove that any velocity vector of a curve on M through p is in the vector space in (i) we need proposition 5 below. This shows that if α : I R n is a C 1 curve with image in U M, then γ = φ 1 α : I U 0 is a C 1 curve. Let v 0 = γ (0) R m. Then α (0) = dφ(x 0 )[v 0 ], as we wanted to show. Note that (ii) is a special case of (i). Having verified (i), we know the set of velocity vectors of curves on M through p is a vector space of dimension m. Under the hypothesis of part (iii), any such velocity vector is clearly contained in Ker(dF (p)); since both are m-dimensional vector spaces, they must coincide. Proposition 5. Let M R n be an m-dimensional surface of class C k, f : I R n be a C k map (I R p open). If f(i) U, where U M is the image of a C k parametrization φ : U 0 U (U 0 R m open), then the composition φ 1 f : I R m is of class C k. Proof. It is enough to show φ 1 f is of class C k in a neighborhood of an arbitrary point t 0 I. This would follow easily if we could show that, in some neighborhood V = W M U of p = f(t 0 ) = φ(x 0 ), the inverse 12
13 φ 1 : V U 0 extends to a C k map g : W R m. To see this, consider the splitting R n = E F, where E = dφ(x 0 )(R m ) and F is any complementary subspace of R n. Let {v 1,..., v n m } be a basis of F, and extend φ to Φ : U R n m R n, as follows: n m Φ(x, y) = φ(x) + y i v i, (x, y) U R n m. i=1 The differential of Φ at (x 0, 0) U R n m is: dφ(x 0, 0)[(v, w)] = dφ(x 0 )[v] + w i v i E F, (v, w) R m R n m. It is clear that this is an isomorphism of R n. By the Inverse Function Theorem, there are neighborhoods V 0 U 0 of x 0 in R m, W 0 of 0 in R n m and W of p in R n so that Φ is a C k diffeomorphism from V 0 W 0 to W. Let g = Φ 1 : W V 0 W 0. Since Φ(x, 0) = φ(x) W M := V U for x V 0, we see that the restriction of g to V coincides with (φ 1 ) V. Observing that in the neighborhood f 1 (V ) I of t 0 we have φ 1 f = g f and that the latter composition is C k concludes the proof of the proposition. Problems from [Fleming]. 1. (7, p.147). Let g : U R n be a C 1 map (U R n open), with dg(x) GL(R n ) for all x U. Suppose y 0 g(u), and let ψ(x) = g(x) y 0 2. Show that dψ(x) 0, for any x U. (This means: for any x U, we may find v R n so that dψ(x)[v] 0). Hint: Use fact that if A GL(R n ), we have A T [w] 0 if w 0, so v = A T w satisfies w, A[v] 0. Here the superscript T denotes transpose. 2. (8, p.147). Let g : R n R n be a C 1 map. Suppose there exists c > 0 so that g(x) g(y) c x y, for all x, y R n. Show that: (i) g is injective; (ii) dg(x) GL(R n ) for all x R n ; (iii) g(r n ) = R n. Hint: For (ii), assume dg(x)[v] = 0 for some 0 v R n, and use the definition of differential to contradict the condition given. For (iii): By contradiction, if y 0 g(r n ), consider the function ψ(x) = g(x) y 0 2. By the previous problem, this function has no critical points. On the other hand, ψ attains its infimum (call it M) over R n : let (x n ) be 13
14 a sequence in R n so that ψ(x n ) = g(x n ) y 0 2 M. Then (g(x n )) is a bounded sequence. Show this implies (x n ) is bounded, and therefore has a convergent subsequence. Conclude. 3. (11. p. 160). Let C = (c ij ) GL(R n ) be a symmetric matrix, and consider M = {x R n ; x, Cx = 1} (for the usual inner product in R n.) (i) Show that M is a compact submanifold of R n, of dimension n 1. Hint: M = {x R n F (x) = 1} for a submersion F : R n R. Don t forget to show M is compact! (ii) Show that the equation of the tangent space T x0 M, x 0 M, is: T x0 M = {x R n ; x, Cx 0 = 0}. 14
1. 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 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 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 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 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 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 informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
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 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 informationMath 147, Homework 5 Solutions Due: May 15, 2012
Math 147, Homework 5 Solutions Due: May 15, 2012 1 Let f : R 3 R 6 and φ : R 3 R 3 be the smooth maps defined by: f(x, y, z) = (x 2, y 2, z 2, xy, xz, yz) and φ(x, y, z) = ( x, y, z) (a) Show that f is
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 AND THE POINCARÉ-HOPF THEOREM
DIFFERENTIAL TOPOLOGY AND THE POINCARÉ-HOPF THEOREM ARIEL HAFFTKA 1. Introduction In this paper we approach the topology of smooth manifolds using differential tools, as opposed to algebraic ones such
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 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 informationChapter 1. Smooth Manifolds
Chapter 1. Smooth Manifolds Theorem 1. [Exercise 1.18] Let M be a topological manifold. Then any two smooth atlases for M determine the same smooth structure if and only if their union is a smooth atlas.
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 informationThe Inverse Function Theorem 1
John Nachbar Washington University April 11, 2014 1 Overview. The Inverse Function Theorem 1 If a function f : R R is C 1 and if its derivative is strictly positive at some x R, then, by continuity of
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 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 information1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0
1. Classification of 1-manifolds Theorem 1.1. Let M be a connected 1 manifold. Then M is diffeomorphic either to [0, 1], [0, 1), (0, 1), or S 1. We know that none of these four manifolds are not diffeomorphic
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 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 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 informationLecture Fish 3. Joel W. Fish. July 4, 2015
Lecture Fish 3 Joel W. Fish July 4, 2015 Contents 1 LECTURE 2 1.1 Recap:................................. 2 1.2 M-polyfolds with boundary..................... 2 1.3 An Implicit Function Theorem...................
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 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 informationSMSTC (2017/18) Geometry and Topology 2.
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
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
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 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 informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) October 16, 2015 1 Lecture 11 1.1 The closed graph theorem Definition 1.1. Let f : X Y be any map between topological spaces. We define its
More informationTransversality. Abhishek Khetan. December 13, Basics 1. 2 The Transversality Theorem 1. 3 Transversality and Homotopy 2
Transversality Abhishek Khetan December 13, 2017 Contents 1 Basics 1 2 The Transversality Theorem 1 3 Transversality and Homotopy 2 4 Intersection Number Mod 2 4 5 Degree Mod 2 4 1 Basics Definition. Let
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 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 informationThe theory of manifolds Lecture 3
The theory of manifolds Lecture 3 We recall that a subset, X, of R N is an n-dimensional manifold, if, for every p X, there exists an open set, U R n, a neighborhood, V, of p in R N and a C -diffeomorphism,
More informationINTEGRATION ON MANIFOLDS and GAUSS-GREEN THEOREM
INTEGRATION ON MANIFOLS and GAUSS-GREEN THEOREM 1. Schwarz s paradox. Recall that for curves one defines length via polygonal approximation by line segments: a continuous curve γ : [a, b] R n is rectifiable
More informationTHE JORDAN-BROUWER SEPARATION THEOREM
THE JORDAN-BROUWER SEPARATION THEOREM WOLFGANG SCHMALTZ Abstract. The Classical Jordan Curve Theorem says that every simple closed curve in R 2 divides the plane into two pieces, an inside and an outside
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 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 informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationLECTURE: KOBORDISMENTHEORIE, WINTER TERM 2011/12; SUMMARY AND LITERATURE
LECTURE: KOBORDISMENTHEORIE, WINTER TERM 2011/12; SUMMARY AND LITERATURE JOHANNES EBERT 1.1. October 11th. 1. Recapitulation from differential topology Definition 1.1. Let M m, N n, be two smooth manifolds
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationSelçuk Demir WS 2017 Functional Analysis Homework Sheet
Selçuk Demir WS 2017 Functional Analysis Homework Sheet 1. Let M be a metric space. If A M is non-empty, we say that A is bounded iff diam(a) = sup{d(x, y) : x.y A} exists. Show that A is bounded iff there
More informationMany of you got these steps reversed or otherwise out of order.
Problem 1. Let (X, d X ) and (Y, d Y ) be metric spaces. Suppose that there is a bijection f : X Y such that for all x 1, x 2 X. 1 10 d X(x 1, x 2 ) d Y (f(x 1 ), f(x 2 )) 10d X (x 1, x 2 ) Show that if
More informationLECTURE 11: TRANSVERSALITY
LECTURE 11: TRANSVERSALITY Let f : M N be a smooth map. In the past three lectures, we are mainly studying the image of f, especially when f is an embedding. Today we would like to study the pre-image
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 information7. Let X be a (general, abstract) metric space which is sequentially compact. Prove X must be complete.
Math 411 problems The following are some practice problems for Math 411. Many are meant to challenge rather that be solved right away. Some could be discussed in class, and some are similar to hard exam
More informationALGEBRAIC TOPOLOGY N. P. STRICKLAND
ALGEBRAIC TOPOLOGY N. P. STRICKLAND 1. Introduction In this course, we will study metric spaces (which will often be subspaces of R n for some n) with interesting topological structure. Here are some examples
More informationFunctional Analysis HW #3
Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform
More information1. Classifying Spaces. Classifying Spaces
Classifying Spaces 1. Classifying Spaces. To make our lives much easier, all topological spaces from now on will be homeomorphic to CW complexes. Fact: All smooth manifolds are homeomorphic to CW complexes.
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 informationMath 426 Homework 4 Due 3 November 2017
Math 46 Homework 4 Due 3 November 017 1. Given a metric space X,d) and two subsets A,B, we define the distance between them, dista,b), as the infimum inf a A, b B da,b). a) Prove that if A is compact and
More informationBootcamp. Christoph Thiele. Summer As in the case of separability we have the following two observations: Lemma 1 Finite sets are compact.
Bootcamp Christoph Thiele Summer 212.1 Compactness Definition 1 A metric space is called compact, if every cover of the space has a finite subcover. As in the case of separability we have the following
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
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 informationUSING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION
USING FUNCTIONAL ANALYSIS AND SOBOLEV SPACES TO SOLVE POISSON S EQUATION YI WANG Abstract. We study Banach and Hilbert spaces with an eye towards defining weak solutions to elliptic PDE. Using Lax-Milgram
More informationProblems - Section 17-2, 4, 6c, 9, 10, 13, 14; Section 18-1, 3, 4, 6, 8, 10; Section 19-1, 3, 5, 7, 8, 9;
Math 553 - Topology Todd Riggs Assignment 2 Sept 17, 2014 Problems - Section 17-2, 4, 6c, 9, 10, 13, 14; Section 18-1, 3, 4, 6, 8, 10; Section 19-1, 3, 5, 7, 8, 9; 17.2) Show that if A is closed in Y and
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 information5 Integration with Differential Forms The Poincare Lemma Proper Maps and Degree Topological Invariance of Degree...
Contents 1 Review of Topology 3 1.1 Metric Spaces............................... 3 1.2 Open and Closed Sets.......................... 3 1.3 Metrics on R n............................... 4 1.4 Continuity.................................
More 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 informationNonlinear equations. Norms for R n. Convergence orders for iterative methods
Nonlinear equations Norms for R n Assume that X is a vector space. A norm is a mapping X R with x such that for all x, y X, α R x = = x = αx = α x x + y x + y We define the following norms on the vector
More information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationInverse Function Theorem writeup for MATH 4604 (Advanced Calculus II) Spring 2015
Inverse Function Theorem writeup for MATH 4604 (Advanced Calculus II) Spring 2015 Definition: N := {1, 2, 3,...}. Definition: For all n N, let i n : R n R n denote the identity map, defined by i n (x)
More informationCourse 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 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 informationProblem Set 6: Solutions Math 201A: Fall a n x n,
Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series
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 informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More information1. Simplify the following. Solution: = {0} Hint: glossary: there is for all : such that & and
Topology MT434P Problems/Homework Recommended Reading: Munkres, J.R. Topology Hatcher, A. Algebraic Topology, http://www.math.cornell.edu/ hatcher/at/atpage.html For those who have a lot of outstanding
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 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 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 informationMath 598 Feb 14, Geometry and Topology II Spring 2005, PSU
Math 598 Feb 14, 2005 1 Geometry and Topology II Spring 2005, PSU Lecture Notes 7 2.7 Smooth submanifolds Let N be a smooth manifold. We say that M N m is an n-dimensional smooth submanifold of N, provided
More informationDynamical Systems 2, MA 761
Dynamical Systems 2, MA 761 Topological Dynamics This material is based upon work supported by the National Science Foundation under Grant No. 9970363 1 Periodic Points 1 The main objects studied in the
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
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 informationMath 205C - Topology Midterm
Math 205C - Topology Midterm Erin Pearse 1. a) State the definition of an n-dimensional topological (differentiable) manifold. An n-dimensional topological manifold is a topological space that is Hausdorff,
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 informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationMath Advanced Calculus II
Math 452 - 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
More informationApril 13, We now extend the structure of the horseshoe to more general kinds of invariant. x (v) λ n v.
April 3, 005 - Hyperbolic Sets We now extend the structure of the horseshoe to more general kinds of invariant sets. Let r, and let f D r (M) where M is a Riemannian manifold. A compact f invariant set
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More information225A DIFFERENTIAL TOPOLOGY FINAL
225A DIFFERENTIAL TOPOLOGY FINAL KIM, SUNGJIN Problem 1. From hitney s Embedding Theorem, we can assume that N is an embedded submanifold of R K for some K > 0. Then it is possible to define distance function.
More informationLECTURE 15-16: PROPER ACTIONS AND ORBIT SPACES
LECTURE 15-16: PROPER ACTIONS AND ORBIT SPACES 1. Proper actions Suppose G acts on M smoothly, and m M. Then the orbit of G through m is G m = {g m g G}. If m, m lies in the same orbit, i.e. m = g m for
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More informationIntegration and Manifolds
Integration and Manifolds Course No. 100 311 Fall 2007 Michael Stoll Contents 1. Manifolds 2 2. Differentiable Maps and Tangent Spaces 8 3. Vector Bundles and the Tangent Bundle 13 4. Orientation and Orientability
More informationCHAPTER 3 SUBMANIFOLDS
CHAPTER 3 SUBMANIFOLDS One basic notion that was not addressed in Chapter 1 is the concept of containment: When one manifold is a subset on a second manifold. This notion is subtle in a manner the reader
More informationProblem: A class of dynamical systems characterized by a fast divergence of the orbits. A paradigmatic example: the Arnold cat.
À È Ê ÇÄÁ Ë ËÌ ÅË Problem: A class of dynamical systems characterized by a fast divergence of the orbits A paradigmatic example: the Arnold cat. The closure of a homoclinic orbit. The shadowing lemma.
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
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 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 information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationLectures on Analysis John Roe
Lectures on Analysis John Roe 2005 2009 1 Lecture 1 About Functional Analysis The key objects of study in functional analysis are various kinds of topological vector spaces. The simplest of these are the
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
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 informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationLecture 6: Contraction mapping, inverse and implicit function theorems
Lecture 6: Contraction mapping, inverse and implicit function theorems 1 The contraction mapping theorem De nition 11 Let X be a metric space, with metric d If f : X! X and if there is a number 2 (0; 1)
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More information