Separation in General Normed Vector Spaces 1
|
|
- Oliver Elliott
- 6 years ago
- Views:
Transcription
1 John Nachbar Washington University March 12, 2016 Separation in General Normed Vector Spaces 1 1 Introduction Recall the Basic Separation Theorem for convex sets in R N. Theorem 1. Let A R N be non-empty, closed, and convex. If 0 / A then there is a v R N, v 0, such that v a v v for all a A. The goal here is to extend this result to general normed vector spaces over the reals. (See the notes on Vector Spaces and Norms.) I have stated the Basic Separation Theorem for R N using inner products. The next section discusses the fact that this approach does not generalize. In general vector spaces, it is necessary instead to work with real-valued linear functions. In R N, such functions can always be represented as inner products. In general vector spaces, this is no longer true. 2 Linear Functions Given a vector space X, a function F : X R is linear iff for any x, ˆx X and any θ R, 1. F (θx) = θf (x), 2. F (x + ˆx) = F (x) + F (ˆx). Taking θ = 0, the first condition implies that the graph of a linear function always goes through the origin: F (0) = 0. It is common to use the word functional to describe a real-valued function defined on a general vector space. To avoid excess jargon, I call a functional simply a real-valued function. In R N, but not more generally, a real-valued function is linear iff it can be written as an inner product. Thus, for R N, writing the Basic Separation Theorem in terms of the inner product v x is equivalent to writing the theorem in terms of the linear function F (x) = v x. Theorem 2. F : R N R is linear iff there is a v R N such that for all x R N, F (x) = x v. 1 cbna. This work is licensed under the Creative Commons Attribution-NonCommercial- ShareAlike 4.0 License. 1
2 Proof 1.. Let e n be the n coordinate vector: e n = (0,..., 0, 1, 0,..., 0), with a 1 in the n place. Define v n = F (e n ). Then, for any x = (x 1,..., x n ) = n x ne n, the linearity of F impies that F (x) = F ( x n e n ) = n x nf (e n ) = n x nv n = x v. 2.. Almost immediate. For a general vector space X, let X denote the set of real-valued linear functions defined on X. X is called the dual space of X. The above theorem says that R N is self-dual: every real-valued linear function F on R N is identified with an element v R N, and conversely. Abusing notation, (R N ) = R N. One can also show that, similarly, (L 2 ) = L 2. But not all vector spaces are self-dual. Consider l. For many v, x l, v x is not even well defined. For example, if v = (1, 1,... ) then v v should be n (v n) 2, but the latter is infinite. One can partially fix this problem by restricting v to l 1, the normed vector space consisting of the points in R that are absolutely summable, x 1 = n x n <. For any v l 1, the function F : l R given by F (x) = v x = n v nx n is well defined. Therefore l 1 (l ). Unfortunately, l 1 is a proper subset of (l ) : there exist elements of (l ) that cannot be represented as inner products with elements of l 1, and in fact cannot be represented as inner products in any standard sense. The canonical examples are the Banach Limits, real-valued linear functions on l whose existence is implied by the Hahn-Banach Extension Theorem, given below. Because they have no inner product representation, Banach Limits are hard to visualize, but they operate somewhat like limits of averages, lim n 1 N N x n. Unlike limits of averages, which are not defined if the limit does not exist, Banach Limits are defined for all x l. Banach Limits have occasionally been used in economic theory to formulate the utility functions of decision makers who are, loosely speaking, infinitely patient. In any vector space, a plane is, by definition, the level set of a real-valued linear function. The fact that there are elements of (l ) that have no inner-product interpretation means that there are planes in l that cannot be represented via n=1 2
3 inner products. Since such planes may be needed for separation, the implication is that the Basic Separation Theorem for general normed vector spaces cannot rely on inner products. 3 The Basic Separation Theorem. Theorem 3. Let X be a normed vector space and let A be a non-empty, closed, convex subset of X. If 0 / A then there is a linear function F : X R and an r > 0 such that for all a A, F (a) > r. The Basic Separation Theorem is a consequence of the Hahn-Banach Extension Theorem, which I state and prove in the next section. The Basic Separation Theorem can be used in turn to establish the Separating Hyperplane Theorem for closed convex sets, at least one of which is compact, exactly as in R N. Generalizing the Supporting Hyperplane Theorem is less straightforward. In R N, the Supporting Hyperplane Theorem says that if A is non-empty, closed, and convex and x is not an interior point of A then there is a linear function F : X R such that for all a A, F (a) F (x ). For general normed vector spaces, a condition stronger than x is not be an interior point of A is needed. 4 The Hahn-Banach Extension Theorem The Hahn-Banach Theorem is a relative of the Supporting Hyperplane Theorem. It is stated for special types of convex sets, namely convex sets generated by sublinear functions. A function p : X R is sublinear iff for any x, ˆx X and any θ R, θ 0, 1. p(θx) = θp(x), 2. p(x + ˆx) p(x) + p(ˆx). By the first property, if p is sublinear then p(0) = 0. Any linear function is sublinear. An example of a sublinear function that is not linear is p : R R, p(x) = x. More generally, in any normed vector space, the norm is sublinear. Any sublinear function is convex: p(θ(x) + (1 θ)ˆx) p(θx) + p((1 θ)ˆx) = θp(x) + (1 θ)p(ˆx). Recall that a function is convex iff its epigraph, which is the set of points lying on or above the graph, is convex. Thus, the epigraph of a sublinear function is convex. In fact, one can readily verify that the epigraph of a sublinear function is a closed, convex, cone. The epigraph of p : R R, p(x) = x provides illustration. The Hahn-Banach theorem is a statement about supporting this cone at the origin, which is the cone s vertex. Theorem 4 (Hahn-Banach Extension Theorem). Let W be a vector subspace of a vector space X. Let f : W R be linear and p : X R be sublinear. If for all x W, f(x) p(x), then there is a linear function F : X R such that, 3
4 1. For all x W, f(x) = F (x), 2. For all x X, F (x) p(x). To interpret the statement of the Hahn-Banach Theorem, focus on the finite dimensional case: X = R N. The epigraph of p is then a closed, convex cone in R N+1. If F (x) p(x) for all x R N then the graph of F, which is a plane in R N+1, lies on or below the cone determined by the epigraph of p: the graph of F supports this cone at the origin. Thus if W = {0}, in which case f is trivially defined by f(0) = 0, then Hahn-Banach says that the closed convex cone generated by the epigraph of p can be supported at the origin, something we already knew from the Supporting Hyperplane Theorem. Hahn-Banach generalizes this in two ways. First, and most importantly, it allows X to be a general vector space rather than just X = R N. Second, it accommodates some restrictions on the supporting plane. If one already has a real-valued linear function f that supports the epigraph of p on a subspace W, then the Hahn-Banach Theorem says that one can find a real-valued linear function F, agreeing with f on W, that supports the epigraph of p on all of X. That is, the supporting plane through 0 defined by F must contain the lower dimensional plane through 0 defined by f. 5 Proof of the Hahn Banach Extension Theorem Proof of Theorem 4. The proof below is complete with one exception, which I flag. Let W g, W h be vector subspaces of X and let g : W g R, h : W h R be real-valued continuous functions such that for all x W g, g(x) p(x) and for all x W h, h(x) p(x). Say that h extends g iff 1. W g W h, 2. For all x W g, h(x) = g(x). Say that h is a proper extension of g if h is an extension of g and W g W h. Consider the set of all extensions of f. This set is not empty (it contains f). If g and h are both extensions of f, write g < h iff h is a proper extension of g. This partially orders the set of extensions of f. By the Hausdorff Maximality Principle, which is equivalent to the Axiom of Choice, there exists a maximal linearly (i.e., totally or completely) ordered set of extensions of f. Take one such set and call it E. Maximality means that E cannot be enlarged by adding as an element another extension of f: any extension not already in E is non-comparable to at least some elements in E. 2 2 By way of analogy, consider R 2 with the standard order: (x 1, x 2) (ˆx 1, ˆx 2) iff x 1 ˆx 1 and 4
5 Define W F = g E W g. If x W F, x W g for some g E. For any g for which x W g, define F (x) = g(x). This definition is unambiguous because E is a linearly ordered set of extensions: any g for which x W g gives the same value. Since g(x) p(x) for every g E and every x W g, F (x) p(x). F is thus an extension of every g E. Since E is maximal, this implies that F E (since, otherwise, E {F } would be linearly ordered and strictly contain E). Since F is an extension of every element of E, F is the maximal element in E. It remains to show that, in fact, W F = X. This part of the proof looks like an induction argument. Take any g E. If W g = X then g = F and I am done. Suppose then that W g X. Then there is a y X, y / W g. The proof proceeds by defining an extension h of g on the vector subspace W h spanned by W g and y. That is, I claim that if I have an extension g defined on a subspace W g then I can extend g to an h, not necessarily in E, that is defined on a subspace W h that contains W g and is one dimension larger. Because of linearity, and the fact that h must agree with g on W g, h is entirely pinned down by choice of h(y). I need to show that I can choose h(y) in such a way that h(x) p(x) for all x W h. Consider, by way of example, the case X = R, p(x) = x, and W g = {0}, hence g is defined trivially by g(0) = 0. Take y = 1. I need to specify h(1) = b, in which case h(x) = bx. If x > 0 then bx p(x) = x implies b 1. If x < 0 then bx p(x) = x implies, since x < 0, b 1. Therefore, take b [ 1, 1]. Somewhat more generally, continue to take X = R, W = {0}, and y = 1, but now consider an arbitrary sublinear p : R R. For x > 0, bx p(x) implies, since p is sublinear, b (1/x)p(x) = p(x/x) = p(1). Similarly, for x < 0, bx p(x) implies, since x < 0, b (1/x)p(x). Since x < 0, 1/x > 0, and hence, since p is sublinear, ( 1/x)p(x) = p( 1). Therefore, I need b (1/x)p(x) = ( 1/x)p(x) = p( 1). Since p is sublinear, 0 = p(0) = p(1 1) p(1) + p( 1), hence p( 1) p(1). Therefore, take b [ p( 1), p(1)]. The general case is similar but the interval for b depends on g (which was trivial in the examples above) as well as p. The argument is somewhat tedious, so I omit it. Take it as established, therefore, that if W g X then there is an h that is a proper extension of g. This implies that if g were the maximal element of E then E is not maximal (since E {h} would be linearly ordered). By contraposition, since E is maximal, g is not maximal. In summary, if W g X then g is not maximal. Since F is maximal, it follows by contraposition that W F = X. If X = R N then the second half of the proof, the induction-like argument, is x 2 ˆx 2. Then the set, call it S, corresponding to the x 1 axis, S = {x R 2 : x 2 = 0}, is a maximal linearly ordered set. To see that it is maximal, consider any x = (x 1, x 2) with x 2 0. Then S {x} is not linearly ordered. For example, if x = (0, 1) then x is not ordered with respect to (1, 0) S. There are many, many other maximal linearly ordered subsets of R 2. For example, both {x R 2 : x 1 = 0} and {x R 2 : x 1 = x 2} are maximal linearly ordered sets. 5
6 sufficient. One starts with an f defined on a subspace, and then extends f one dimension at a time until one has enlarged the domain to be all of R N. But if X is infinite dimensional, the induction-like argument does not suffice. For example, if X = R then the induction-like argument shows that it is possible to extend a function defined on a finite dimensional subspace to functions with domains that, while strictly larger, are still finite-dimensional. The induction-like argument does not, by itself, show that there is any extension to all of R, an infinite dimensional space. To establish the existence of such an extension requires extra machinery. In the proof, this gap in the induction-like argument is filled by the Axiom of Choice, in the form of the Hausdorff Maximality Principle. Hahn-Banach does not, strictly speaking, require the Axiom of Choice. But it does require something stronger than the combined remaining axioms of standard set theory. And the Hahn-Banach Theorem in and of itself implies the existence of non-measurable sets, which is one way of expressing the fact that the Hahn-Banach Theorem is a highly non-trivial result. 6 Proof of Theorem 3 (the Basic Separation Theorem) Proof of Theorem 3. Since 0 / A and A is closed, there is a δ > 0 such that N δ (0) = {x X : x < δ} A c. Pick any element a A and pick ˆr > 0 such that δ > ˆra = ˆr a. Finally, pick any r (0, ˆr). Define C = a A + N δ (0). Since A is convex, C is convex. Since a A and 0 N δ (0), 0 C. On the other hand, a / C: if a C then there is an a A and a b N δ (0) such that a = a a + b, which implies a = b N δ (0); by contraposition, since no element of A is in N δ (0), a / C. Define p : X R by p(x) = inf{γ R + : (1/γ)x C}. Informally, p(x) measures the fractional distance of x to the boundary of C. If x C then p(x) 1. If x C, then p(x) 1. If x is on the boundary of C, then p(x) = 1. If C is unbounded along the ray from the origin through x, then p(x) = 0. I prove below that p is sublinear. If C = N 1 (0) then p is the standard norm on X. More generally, if C is bounded then p is the norm on X for which C is the unit ball at the origin. If C is not bounded then p does not satisfy property 1 in the definition of a norm; in this case, p is a pseudo norm. Let W be the one-dimensional subspace spanned by x and define the linear function f : W R by f(x) = θ iff x = θa. Thus f(a ) = 1. I claim that f(x) p(x) for any x W. Take θ R such that x = θa. Hence f(x) = θ. Since a / C, p(a ) 1. If θ > 0 then, since p is sublinear, p(θa ) = θp(a ) θ. Hence if θ > 0 then p(x) f(x). If θ 0 then f(x) 0. Hence, since p(x) 0 for any x, if θ 0 then f(x) p(x). By Hahn-Banach, there is an extension of f to a real-valued linear function F defined on all of X such that for all x X, F (x) p(x). By linearity, for any 6
7 x X, F (a ) F (x) + F (ˆra ) = F (a x + ra ) p(a x + ra ). If x = a A, then a a + ra C and hence p(a a + ra ) 1. Moreover, F (a ) = f(a ) = 1 and F (ˆra ) = f(ˆra ) = ˆr. Combining all this implies or 1 F (a) + ˆr 1 F (a) ˆr > r. as was to be shown. Finally, it remains to show that p is sublinear. 1. For property 1 of sublinear functions, take any x X and any θ R +. For any γ R +, (1/γ)x C iff (1/(θγ))θx C. The claim then follows from the definition of p. 2. For property 2 of sublinear functions, take any x, ˆx X. Take any γ, ˆγ R such that (1/γ)x, (1/ˆγ)ˆx C. Since C is convex, and since 1 (x + ˆx) = γ γ + ˆγ γ + ˆγ (1/γ)x + ˆγ γ + ˆγ (1/ˆγ)ˆx is a convex combination of two elements of C, (1/(γ + ˆγ))(x + ˆx) C. Therefore, by definition of p, for any such γ, ˆγ, p(x + ˆx) γ + ˆγ. The claim follows by taking the infimum of the right-hand side over all γ, ˆγ R + such that (1/γ)x C and (1/ˆγ)ˆx C. 7
Convexity in R N Supplemental Notes 1
John Nachbar Washington University November 1, 2014 Convexity in R N Supplemental Notes 1 1 Introduction. These notes provide exact characterizations of support and separation in R N. The statement of
More informationFinite-Dimensional Cones 1
John Nachbar Washington University March 28, 2018 1 Basic Definitions. Finite-Dimensional Cones 1 Definition 1. A set A R N is a cone iff it is not empty and for any a A and any γ 0, γa A. Definition 2.
More informationConcave and Convex Functions 1
John Nachbar Washington University March 6, 2017 Concave and Convex Functions 1 1 Basic Definitions Definition 1 Let C R N be convex and let f : C R 1 (a) f is concave iff for any a, b C and any θ [0,
More informationConcave and Convex Functions 1
John Nachbar Washington University March 27, 2018 Concave and Convex Functions 1 1 Basic Definitions. Definition 1. Let C R N be non-empty and convex and let f : C R. 1. (a) f is concave iff for any a,
More informationExistence of Optima. 1
John Nachbar Washington University March 1, 2016 Existence of Optima. 1 1 The Basic Existence Theorem for Optima. Let X be a non-empty set and let f : X R. The MAX problem is f(x). max x X Thus, x is a
More informationFinite Dimensional Optimization Part III: Convex Optimization 1
John Nachbar Washington University March 21, 2017 Finite Dimensional Optimization Part III: Convex Optimization 1 1 Saddle points and KKT. These notes cover another important approach to optimization,
More informationMultivariate Differentiation 1
John Nachbar Washington University February 23, 2017 1 Preliminaries. Multivariate Differentiation 1 I assume that you are already familiar with standard concepts and results from univariate calculus;
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 informationA NICE PROOF OF FARKAS LEMMA
A NICE PROOF OF FARKAS LEMMA DANIEL VICTOR TAUSK Abstract. The goal of this short note is to present a nice proof of Farkas Lemma which states that if C is the convex cone spanned by a finite set and if
More informationFinite Dimensional Optimization Part I: The KKT Theorem 1
John Nachbar Washington University March 26, 2018 1 Introduction Finite Dimensional Optimization Part I: The KKT Theorem 1 These notes characterize maxima and minima in terms of first derivatives. I focus
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
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 informationEconomics 204 Fall 2012 Problem Set 3 Suggested Solutions
Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.
More informationFixed Point Theorems 1
John Nachbar Washington University in St. Louis October 10, 2017 1 Overview Fixed Point Theorems 1 Definition 1. Given a set X and a function f : X X, x X is a fixed point of f iff f(x ) = x. Many existence
More informationR N Completeness and Compactness 1
John Nachbar Washington University in St. Louis October 3, 2017 R N Completeness and Compactness 1 1 Completeness in R. As a preliminary step, I first record the following compactness-like theorem about
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 informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationNumbers 1. 1 Overview. 2 The Integers, Z. John Nachbar Washington University in St. Louis September 22, 2017
John Nachbar Washington University in St. Louis September 22, 2017 1 Overview. Numbers 1 The Set Theory notes show how to construct the set of natural numbers N out of nothing (more accurately, out of
More informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationThe Arzelà-Ascoli Theorem
John Nachbar Washington University March 27, 2016 The Arzelà-Ascoli Theorem The Arzelà-Ascoli Theorem gives sufficient conditions for compactness in certain function spaces. Among other things, it helps
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationInduced Norms, States, and Numerical Ranges
Induced Norms, States, and Numerical Ranges Chi-Kwong Li, Edward Poon, and Hans Schneider Abstract It is shown that two induced norms are the same if and only if the corresponding norm numerical ranges
More informationMath 5052 Measure Theory and Functional Analysis II Homework Assignment 7
Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Prof. Wickerhauser Due Friday, February 5th, 2016 Please do Exercises 3, 6, 14, 16*, 17, 18, 21*, 23*, 24, 27*. Exercises marked
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationMath General Topology Fall 2012 Homework 8 Solutions
Math 535 - General Topology Fall 2012 Homework 8 Solutions Problem 1. (Willard Exercise 19B.1) Show that the one-point compactification of R n is homeomorphic to the n-dimensional sphere S n. Note that
More informationOverview of normed linear spaces
20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural
More informationBanach Spaces V: A Closer Look at the w- and the w -Topologies
BS V c Gabriel Nagy Banach Spaces V: A Closer Look at the w- and the w -Topologies Notes from the Functional Analysis Course (Fall 07 - Spring 08) In this section we discuss two important, but highly non-trivial,
More informationLecture 5: The Bellman Equation
Lecture 5: The Bellman Equation Florian Scheuer 1 Plan Prove properties of the Bellman equation (In particular, existence and uniqueness of solution) Use this to prove properties of the solution Think
More informationFunctional Analysis HW #5
Functional Analysis HW #5 Sangchul Lee October 29, 2015 Contents 1 Solutions........................................ 1 1 Solutions Exercise 3.4. Show that C([0, 1]) is not a Hilbert space, that is, there
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationCONTENTS. 4 Hausdorff Measure Introduction The Cantor Set Rectifiable Curves Cantor Set-Like Objects...
Contents 1 Functional Analysis 1 1.1 Hilbert Spaces................................... 1 1.1.1 Spectral Theorem............................. 4 1.2 Normed Vector Spaces.............................. 7 1.2.1
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 informationCHAPTER 5. Birkhoff Orthogonality and a Revisit to the Characterization of Best Approximations. 5.1 Introduction
CHAPTER 5 Birkhoff Orthogonality and a Revisit to the Characterization of Best Approximations 5.1 Introduction The notion of orthogonality in an arbitrary normed space, with the norm not necessarily coming
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationReal Analysis, 2nd Edition, G.B.Folland Elements of Functional Analysis
Real Analysis, 2nd Edition, G.B.Folland Chapter 5 Elements of Functional Analysis Yung-Hsiang Huang 5.1 Normed Vector Spaces 1. Note for any x, y X and a, b K, x+y x + y and by ax b y x + b a x. 2. It
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
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 informationBanach-Alaoglu theorems
Banach-Alaoglu theorems László Erdős Jan 23, 2007 1 Compactness revisited In a topological space a fundamental property is the compactness (Kompaktheit). We recall the definition: Definition 1.1 A subset
More informationMATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES
MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of
More informationSubdifferential representation of convex functions: refinements and applications
Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential
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 informationFunctional Analysis I
Functional Analysis I Course Notes by Stefan Richter Transcribed and Annotated by Gregory Zitelli Polar Decomposition Definition. An operator W B(H) is called a partial isometry if W x = X for all x (ker
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 informationDavid Hilbert was old and partly deaf in the nineteen thirties. Yet being a diligent
Chapter 5 ddddd dddddd dddddddd ddddddd dddddddd ddddddd Hilbert Space The Euclidean norm is special among all norms defined in R n for being induced by the Euclidean inner product (the dot product). A
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 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationTopological vectorspaces
(July 25, 2011) Topological vectorspaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Natural non-fréchet spaces Topological vector spaces Quotients and linear maps More topological
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 informationConvergence in shape of Steiner symmetrized line segments. Arthur Korneychuk
Convergence in shape of Steiner symmetrized line segments by Arthur Korneychuk A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Mathematics
More informationYour first day at work MATH 806 (Fall 2015)
Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationConvex Optimization Notes
Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =
More informationApplied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.
Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define
More informationDefinition 1.1. A partially ordered set (M, ) is a set M equipped with a binary relation, called a partial ordering, satisfying
1 Zorn s Lemma Definition 1.1. A partially ordered set (M, ) is a set M equipped with a binary relation, called a partial ordering, satisfying (a) x x for every x M. (b) If x y and y x, then x = y. (c)
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationLecture 7 Monotonicity. September 21, 2008
Lecture 7 Monotonicity September 21, 2008 Outline Introduce several monotonicity properties of vector functions Are satisfied immediately by gradient maps of convex functions In a sense, role of monotonicity
More informationThe Skorokhod reflection problem for functions with discontinuities (contractive case)
The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
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 informationFunctional Analysis HW #1
Functional Analysis HW #1 Sangchul Lee October 9, 2015 1 Solutions Solution of #1.1. Suppose that X
More informationBanach-Alaoglu, boundedness, weak-to-strong principles Paul Garrett 1. Banach-Alaoglu theorem
(April 12, 2004) Banach-Alaoglu, boundedness, weak-to-strong principles Paul Garrett Banach-Alaoglu theorem: compactness of polars A variant Banach-Steinhaus theorem Bipolars Weak
More informationl(y j ) = 0 for all y j (1)
Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that
More informationYour first day at work MATH 806 (Fall 2015)
Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies
More informationMAA6617 COURSE NOTES SPRING 2014
MAA6617 COURSE NOTES SPRING 2014 19. Normed vector spaces Let X be a vector space over a field K (in this course we always have either K = R or K = C). Definition 19.1. A norm on X is a function : X K
More informationCHAPTER II THE HAHN-BANACH EXTENSION THEOREMS AND EXISTENCE OF LINEAR FUNCTIONALS
CHAPTER II THE HAHN-BANACH EXTENSION THEOREMS AND EXISTENCE OF LINEAR FUNCTIONALS In this chapter we deal with the problem of extending a linear functional on a subspace Y to a linear functional on the
More informationFunctional Analysis
The Hahn Banach Theorem : Functional Analysis 1-9-06 Extensions of Linear Forms and Separation of Convex Sets Let E be a vector space over R and F E be a subspace. A function f : F R is linear if f(αx
More informationMAT 449 : Problem Set 4
MAT 449 : Problem Set 4 Due Thursday, October 11 Vector-valued integrals Note : ou are allowed to use without proof the following results : The Hahn-Banach theorem. The fact that every continuous linear
More informationConvexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.
Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed
More information1 Review of last lecture and introduction
Semidefinite Programming Lecture 10 OR 637 Spring 2008 April 16, 2008 (Wednesday) Instructor: Michael Jeremy Todd Scribe: Yogeshwer (Yogi) Sharma 1 Review of last lecture and introduction Let us first
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 informationIntroduction to Bases in Banach Spaces
Introduction to Bases in Banach Spaces Matt Daws June 5, 2005 Abstract We introduce the notion of Schauder bases in Banach spaces, aiming to be able to give a statement of, and make sense of, the Gowers
More informationThe Banach-Tarski paradox
The Banach-Tarski paradox 1 Non-measurable sets In these notes I want to present a proof of the Banach-Tarski paradox, a consequence of the axiom of choice that shows us that a naive understanding of the
More informationGEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect
GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, 2018 BORIS S. MORDUKHOVICH 1 and NGUYEN MAU NAM 2 Dedicated to Franco Giannessi and Diethard Pallaschke with great respect Abstract. In
More informationAn introduction to some aspects of functional analysis
An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
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 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 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 informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationarxiv: v1 [math.fa] 16 Jun 2011
arxiv:1106.3342v1 [math.fa] 16 Jun 2011 Gauge functions for convex cones B. F. Svaiter August 20, 2018 Abstract We analyze a class of sublinear functionals which characterize the interior and the exterior
More information(c) For each α R \ {0}, the mapping x αx is a homeomorphism of X.
A short account of topological vector spaces Normed spaces, and especially Banach spaces, are basic ambient spaces in Infinite- Dimensional Analysis. However, there are situations in which it is necessary
More informationSet theory and topology
arxiv:1306.6926v1 [math.ho] 28 Jun 2013 Set theory and topology An introduction to the foundations of analysis 1 Part II: Topology Fundamental Felix Nagel Abstract We provide a formal introduction into
More informationNormed Vector Spaces and Double Duals
Normed Vector Spaces and Double Duals Mathematics 481/525 In this note we look at a number of infinite-dimensional R-vector spaces that arise in analysis, and we consider their dual and double dual spaces
More informationAxioms of separation
Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically
More informationA glimpse into convex geometry. A glimpse into convex geometry
A glimpse into convex geometry 5 \ þ ÏŒÆ Two basis reference: 1. Keith Ball, An elementary introduction to modern convex geometry 2. Chuanming Zong, What is known about unit cubes Convex geometry lies
More information18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)
18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating
More informationExtreme points of compact convex sets
Extreme points of compact convex sets In this chapter, we are going to show that compact convex sets are determined by a proper subset, the set of its extreme points. Let us start with the main definition.
More informationA Simple Computational Approach to the Fundamental Theorem of Asset Pricing
Applied Mathematical Sciences, Vol. 6, 2012, no. 72, 3555-3562 A Simple Computational Approach to the Fundamental Theorem of Asset Pricing Cherng-tiao Perng Department of Mathematics Norfolk State University
More informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationBoundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption
Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption Chiaki Hara April 5, 2004 Abstract We give a theorem on the existence of an equilibrium price vector for an excess
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationFunctional Analysis (H) Midterm USTC-2015F haha Your name: Solutions
Functional Analysis (H) Midterm USTC-215F haha Your name: Solutions 1.(2 ) You only need to anser 4 out of the 5 parts for this problem. Check the four problems you ant to be graded. Write don the definitions
More informationC 1 convex extensions of 1-jets from arbitrary subsets of R n, and applications
C 1 convex extensions of 1-jets from arbitrary subsets of R n, and applications Daniel Azagra and Carlos Mudarra 11th Whitney Extension Problems Workshop Trinity College, Dublin, August 2018 Two related
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 informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More information