HAHN BANACH THEOREMS
|
|
- Opal Shaw
- 7 years ago
- Views:
Transcription
1 HAHN BANACH THEOREMS S.H. KULKARNI Abstract. We give an overview of Hahn-Banach theorems. We present the statements of these theorems alongwith some definitions that are required to understand these statements and make some comments about the relevance, applications etc. Proofs are not given. 1. Introduction The Hahn-Banach theorems are one of the three most important and fundamental theorems in basic Functional Analysis, the other two being the Uniform Boundedness Principle and the Closed Graph Theorem. Usually Hahn-Banach theorems are taught before the other two and most books also present Hahn-Banach theorems ahead of Uniform Boundedness Principle or the Closed Graph Theorem. This may be due to several reasons. The statements, proofs and applications of Hahn-Banach theorems are relatively easier to understand. In particular, the hypotheses do not include completeness of the underlying normed linear spaces and proofs do not involve the use of Baire Category Theorem. In this article, 1 we give an overview of Hahn-Banach theorems. We present the statements of these theorems alongwith some definitions that are required to understand these statements and make some comments about the relevance, applications etc. Detailed proofs are not given as these can be found in any introductory textbook on Functional Analysis for example [1, 4, 6]. There are two classes of theorems commonly known as Hahn-Banach theorems, namely Hahn-Banach theorems in the extension form and Hahn-Banach theorems in the separation form. All these theorems assert the existence of a linear functional with certain properties. Why is it important to know the existence of such functionals? In a large number of applications of practical importance, the objects of study can be viewed as members of a vector space. A study of such objects involves making various measurements/observations. These are functionals on that vector space. As the names suggest, Hahn-Banach theorems in the extension form assert that functionals defined on a subspace of a vector space (frequently with some additional structure, usually with a norm or topology) and having some additional properties (like linearity, 1 An expanded version of a talk given at a Regional Workshop in Analysis, Villupuram. 1
2 2 S.H. KULKARNI continuity) can be extended to the whole space while retaining these additional properties. This is useful in asserting the existence of certain functionals and this in turn can be used in applications involving approximation of certain functions. These theorems and their proofs are analytic in nature. On the other hand, Hahn-Banach theorems in the separation form and also their proofs are geometric in nature. These theorems deal with the following question: Given two disjoint convex sets in a vector space, when is it possible to find a hyperplane such that the two given convex sets lie on the opposite sides of that hyperplane? This information is useful in answering several questions dealing with optimization problems, also known as Mathematical Programming. Hahn-Banach theorems in both these forms are mathematically equivalent. This means that it is possible to prove a Hahn-Banach theorem in the extension form first and then use it to prove a corresponding theorem in the separation form or prove a Hahn-Banach theorem in the separation form first and then use it to prove a corresponding theorem in the extension form. Preference among these two approaches is a matter of personal taste. Each of these approaches can be found in the text books, for example the first approach can be found in [1] whereas the second can be found in [4]. 2. Functionals and their extensions Hahn-Banach theorems are essentially theorems about real vector spaces. Basic theorems are first proved for real vector spaces. These are then extended to the case of complex vector spaces by means of a technical result.(see Lemma 7.1 of [4] and remarks preceding it.) In this article, we shall confine ourselves to real vector spaces. Common examples of real vector spaces are R n, sequence spaces l p, 1 p, function spaces C([a, b]) with pointwise or coordinatewise operations as the case may be. A functional on such a vector space is a real valued function defined on it. Next we list several properties that such a functional may or may not have. Definition 2.1. Let V be a real vector space. A functional on V is a function φ : V R. Such a φ is said to be (1) additive if φ(a + b) = φ(a) + φ(b) for all a, b V, (2) homogeneous if φ(αa) = αφ(a) for all a V and α R, (3) linear if it is additive and homogeneous, (4) subadditive if φ(a + b) φ(a) + φ(b)
3 for all a, b V, (5) positive homogeneous if HAHN BANACH THEOREMS 3 φ(αa) = αφ(a) for all a V and α R with α 0, (6) sublinear if it is subadditive and positive homogeneous, (7) convex if φ((1 t)a + tb) (1 t)φ(a) + tφ(b) for all a, b V and t [0, 1]. Several examples of functionals having some of the above properties and not having some of the other properties can be given. These are easy to construct and can be found in most books on Functional Analysis, including [1, 4, 6]. For example, the functional φ defined on R 2 by φ(x 1, x 2 ) := x 1 + x 2 for (x 1, x 2 ) R 2 is sublinear but not linear. On the other hand, the functional ψ defined on R 2 by ψ(x 1, x 2 ) := 2x 1 + x 2 for (x 1, x 2 ) R 2 is linear. It is obvious that a linear functional satisfies all the above properties. It is a good exercise to construct examples of functionals satisfying one of the above properties but are not linear. We are now in a position to state the first of the Hahn Banach Extension theorems. This is used in proving all the other extension theorems. It says that a linear functional defined on a subspace of a real vector space V and which is dominated by a sublinear functional defined on V has a linear extension which is also dominated by the same sublinear functional. Theorem 2.2. Let V be a real vector space and p be a sublinear functional defined on V. Suppose W is a subspace of V and φ is a linear functional defined on W such that φ(x) p(x) for all x W. Then there exists a linear functional ψ defined on V such that ψ(x) = φ(x) for all x W and ψ(y) p(y) for all y V. Usual proof of this theorem involves two steps.(see [6] for details.) Of course, if W = V, there is nothing to prove. When W is a proper subspace, some x 0 V \ W is chosen and φ is extended to the linear span W 0 of W {x 0 } in such a way that the extension ψ remains dominated by p in W 0. This is the first step. The crucial idea in this step is to choose the value of ψ(x 0 ) in an appropriate manner. The second step makes use of Zorn s Lemma to construct a maximal subspace containing W to which φ can be extended satisfying the required condition. Finally it is shown using the first step that this maximal subspace must coincide with V.
4 4 S.H. KULKARNI Though the above formulation of the Hahn Banach Extension theorem is most basic, the most popular one is stated in the context of normed linear spaces. In order to understand this version, we need to review a few basic definitions. Definition 2.3. Let X be a real vector space. A norm on X is a function. : X R satisfying: (1) x 0 for all x X and x = 0 if and only if x = 0. (2) αx = α x for all x X and α R. (3) x + y x + y for all x, y X. A real normed linear space is a pair (X,. ) where X is a real vector space and. is a norm on X. Examples of real normed linear spaces include R n (with several norms), sequence spaces l p, 1 p, function spaces L p, 1 p, C(X), C([a, b]), C 1 ([a, b]). Among the various norms on R n, the following are more frequently used. For x = (x 1,..., x n ) R n, (1) n x 1 := x j, (2) (3) x 2 := ( j=1 n x j 2 ) 1/2, j=1 x := max j=1...n x j. Definition 2.4. Let (X,. ) be a normed linear space. A linear functional φ on X is said to be bounded if sup{ φ(x) : x X, x 1} is finite. When this is the case, the above quantity is called the norm of φ and denoted by φ. It is easy to show (and is also proved in most textbooks) that a linear functional φ on X is bounded if and only if it is continuous at each x X if and only if it is uniformly continuous on X. Also note that if φ is a bounded linear functional on X, then φ(x) φ x for all x X. See the references at the end, for several examples of bounded as well as unbounded linear functionals. The popular version of the Hahn Banach Extension theorem mentioned above says that every bounded
5 HAHN BANACH THEOREMS 5 linear functional defined on a subspace of a normed linear space has a norm preserving extension to the whole space. Theorem 2.5. Let (X,. ) be a normed linear space, Y a subspace of X and φ a bounded linear functional defined on Y. Then there exists a bounded linear functional ψ defined on X such that φ(y) = ψ(y) for all y Y and ψ = φ. This is proved by observing that the functional p defined on X by p(x) := φ x, x X, is a sublinear functional that dominates φ on Y and using Theorem 2.2. This theorem is frequently used to deal with questions about approximations. Typically we want to know whether an element a X can be approximated by elements in a subspace Y, that is whether a belongs to the closure of Y. For example one may want to know whether a continuous function f defined on the interval [0, 1] can be approximated by polynomials. This amounts to taking X = C([0, 1]) and Y to be the subspace of all polynomials. The following well known corollary of the Hahn Banach Extension theorem helps in answering this question. Corollary 2.6. Let (X,. ) be a normed linear space, Y be a subspace of X and a X. Then a belongs to the closure of Y if and only if there exists no bounded linear functional φ on X such that φ(y) = 0 for all y Y and φ(a) 0. Equivalently, a does not belong to the closure of Y if and only if there exists a bounded linear functional φ on X such that φ(y) = 0 for all y Y and φ(a) 0. Given X, Y and a how does one decide whether such a bounded linear functional exists or not? In general, this is difficult to answer. In order to answer this, we need to have the knowledge of all bounded linear functionals on X. This is a theme of another class of theorems in Functional Analysis known as Riesz Representation Theorems. These theorems give complete description of bounded linear functionals on various concrete normed linear spaces. See the references at the end for more information on these theorems. An interesting application of this idea to the Poisson Integral Formula can be found in [5]. 3. Convex sets and their separation In this section we discuss Hahn-Banach theorems in the separation form. As mentioned in the introduction, these theorems deal with the question of existence of a hyperplane that separates two given disjoint convex subsets. We first need to review a few definitions and notations. Let V be a real vector space, A, B be nonempty subsets of V and α, a real number. Then the symbols A + B and αa have their natural meaning as follows: A + B := {a + b : a A, b B}
6 6 S.H. KULKARNI αa := {αa : a A}. Note that with these notations, A + B = B + A but A+A may not be the same as 2A. A special case of the above that occurs very frequently is when B is a singleton, say {x}. Thus A + x or x + A is the set {x + a : a A}. This is called the translate of A by x for obvious reasons. A subset C of V is said to be convex if for each t with 0 t 1, we have (1 t)c + tc C. In other words, for each x, y C and 0 t 1, (1 t)x + ty C. This is usually expressed by saying that if C contains two points, then it should also contain the line segment joining those two points. We come across several examples of convex sets. For example, every subspace is a convex set. A translate of a subspace by a nonzero element is not a subspace, but it is a convex set. Convex sets and functionals are closely related concepts in the sense that we can associate convex sets with functionals and vice versa. For example, if φ is a convex functional (See Definition 2.1) and α is a real number, then the set {x V : φ(x) α} is a convex set. If φ is a linear functional, then each of the following is a convex set. (1) {x V : φ(x) α}, (2) {x V : φ(x) α}, (3) {x V : φ(x) = α}. Next recall that a subspace is called proper if it is different from the whole space V. A hyperspace is a maximal proper subspace, that is a proper subspace not properly contained in any other proper subspace. If V is of finite dimension, say n, then every subspace of dimension n 1 is a hyperspace. Thus in R 2, every straight line passing through the origin is a hyperspace. Similarly, hyperspaces in R 3 are the planes passing through the origin. It is well known and is also easy to prove that if φ is a nonzero linear functional on V, then the null space of φ defined by N(φ) := {x V : φ(x) = 0} is a hyperspace. Also every hyperspace is a null space of some nonzero linear functional. Next, a hyperplane is a translate of a hyperspace.
7 HAHN BANACH THEOREMS 7 Thus hyperplanes in R 3 are the planes.(this may very well be the reason for the name hyperplane.) Further, if H is a hyperplane, then there exists a nonzero linear functional φ and a vector a V such that H = a + N(φ). Now suppose φ(a) = α. Let h H. Then h = a+y for some y N(φ). Hence φ(h) = φ(a) + φ(y) = α. On the other hand, suppose x V is such that φ(x) = α. Let y = x a. Then φ(y) = 0, that is y N(φ) and x = a + y a + N(φ) = H. Thus we have proved that with every hyperplane H, we can associate a pair (φ, α), where φ is a nonzero linear functional and α is a real number such that H = {x V : φ(x) = α}. For example, consider a plane given by the equation: 2x 1 x 2 + 7x 3 5 = 0 in R 3. Note that this is a hyperplane and the associated pair is (φ, 5) where the functional φ is given by φ(x) := 2x 1 x 2 + 7x 3, x = (x 1, x 2, x 3 ) R 3. Every such hyperplane H divides the whole space V into two convex sets: H l = {x V : φ(x) α} and H r = {x V : φ(x) α} known as halfspaces. We say that two nonempty subsets A and B of V are separated by H if A and B lie on different sides of H, that is A and B are contained in different half spaces formed by H. We are now ready to present the basic separation theorem. Theorem 3.1. Let A and B be nonempty disjoint convex subsets of a real vector space V. Then A and B can be separated by a hyperplane, that is, there exists a nonzero linear functional φ and a real number α such that φ(x) α φ(y) for all x A and y B. A proof of this can be found in [1]. Also note that we can not think of separating nonconvex sets by hyperplanes in this way. For example, suppose A is a circle in R 2 with the centre at the origin and radius 1 and B is the singleton set consisting of the origin. Then no straight line can separate A and B. Recall that straight lines are hyperplanes in R 2. Again as in the case of extension theorems, though the above theorem is very basic, the more popular ones are stated (and proved) in
8 8 S.H. KULKARNI the context of a normed linear space. (See Definition 2.3). Here we are looking for separation of convex sets not by just arbitrary hyperplanes but by closed hyperplanes. This means that the associated linear functionals must be continuous. (See Definition 2.4 and the remarks following it.) The following is usually known as the Hahn Banach Separation Theorem in normed linear spaces. Its proof can be found in [1, 4, 6]. Theorem 3.2. Let A and B be nonempty disjoint convex subsets of a real normed linear space X. Suppose A has an interior point. Then A and B can be separated by a closed hyperplane, that is, there exists a nonzero continuous linear functional φ and a real number α such that φ(x) < α φ(y) for all x A and y B. The following Corollary of this theorem is also very popular and is used in several applications. Corollary 3.3. Let A and B be nonempty disjoint convex subsets of a real normed linear space X. Suppose A is compact and B is closed. Then A and B can be strictly separated by a closed hyperplane, that is, there exists a nonzero continuous linear functional φ and real numbers α and β such that φ(x) < α < β < φ(y) for all x A and y B. As mentioned in the introduction, these separation theorems have applications to the problems of optimization, in particular to a class of problems known as convex programming problems. We only mention a very interesting and famous result known as Farkas Lemma which is a direct consequence of the separation theorem. Theorem 3.4. Let A be a matrix of order m n with real entries and b R m, regarded as a column matrix of order m 1. Then exactly one of the following alternatives hold. (i) The system of equations Ax = b has a nonnegative solution x R n. (Here nonnegative means x j 0 for each j = 1,..., n.) (ii) The system of inequalities y T A 0 and y T b < 0 has a solution y R m. It is easy to see that both the alternatives can not hold simultaneously, because if they do, then there exist x as in (i) and y as in (ii). Then 0 (y T A)x = y T (Ax) = y T b < 0, a contradiction. To prove that one of the alternatives must hold, the convex set C := {Ax : x R n, x 0} R m is considered. If b C, the alternative (i) holds. Otherwise, C and {b} are nonempty disjoint convex sets in R m and hence can be separated by a hyperplane H. A proof consists of noting that with every such
9 HAHN BANACH THEOREMS 9 hyperplane H in R m, we can associate a vector y R m and a real number α such that H = {u R m : y T u = α} and then showing that in this particular case α can be taken to be 0. Details of this proof as well as the application of Farkas Lemma to the duality theory of Linear Programming can be found in [2]. A highly refreshing and readable account of Farkas Lemma and its connection with several problems in Mathematics and Economics is given in [3]. 4. Limitations After having said so many things about the importance, relevance etc. of Hahn Banach theorems, we finally also point out some limitations of these theorems and also of methods based on these theorems. In fact, these limitations are common to many theorems and methods of Functional Analysis. Statements of all these Hahn Banach theorems are existence statements, that is, these statements assert the existence of some linear functionals. However all the proofs are nonconstructive in nature. This means that these proofs give no clue about how to find the linear functional whose existence is asserted by a theorem, even when the vector space under consideration is finite dimensional. (The situation is very similar to various proofs of the Fundamental Theorem of Algebra, none of which say anything about how to find a root of a given polynomial, though the Theorem asserts that every such polynomial must have a root.) For example, suppose we are given two finite sets in R 10. One way of giving these sets would be to give two matrices each having ten rows. Let A and B denote the convex hulls of these two sets. (Recall that a convex hull of a set is the smallest convex set containing the given set.) Suppose we consider the following problem: To determine whether A and B are disjoint and in case these are disjoint, to find a hyperplane in R 10 separating A and B. It may appear at first that the Hahn Banach Separation Theorem may be useful to tackle this problem. It is useful in the sense that if A and B are disjoint, the Theorem says that there exists a hyperplane in R 10 separating A and B. However it says nothing about how to find such a hyperplane. Completely different methods have to be used to tackle this problem. (See [2].) References [1] B. Bollobás, Linear analysis, Cambridge Univ. Press, Cambridge, MR (92a:46001) [2] J. Franklin, Methods of mathematical economics, Springer, New York, MR (82e:90002) [3] J. Franklin, Mathematical methods of economics, Amer. Math. Monthly 90 (1983), no. 4, MR (84e:90001)
10 10 S.H. KULKARNI [4] B. V. Limaye, Functional analysis, Second edition, New Age, New Delhi, MR (97k:46001) [5] W. Rudin, Real and complex analysis, Third edition, McGraw-Hill, New York, MR (88k:00002) [6] A. E. Taylor and D. C. Lay, Introduction to functional analysis, Second edition, John Wiley & Sons, New York, MR (81b:46001) Department of Mathematics, Indian Institute of Technology - Madras, Chennai address: shk@iitm.ac.in
Duality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More information16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationMATH1231 Algebra, 2015 Chapter 7: Linear maps
MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationActually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.
1: 1. Compute a random 4-dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3-dimensional polytopes do you see? How many
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
More informationChapter 5. Banach Spaces
9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationVector Spaces 4.4 Spanning and Independence
Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationMATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3
MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationFIXED POINT SETS OF FIBER-PRESERVING MAPS
FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics
More informationImprecise probabilities, bets and functional analytic methods in Łukasiewicz logic.
Imprecise probabilities, bets and functional analytic methods in Łukasiewicz logic. Martina Fedel joint work with K.Keimel,F.Montagna,W.Roth Martina Fedel (UNISI) 1 / 32 Goal The goal of this talk is to
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More information1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
More informationLectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationModule1. x 1000. y 800.
Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,
More informationarxiv:1203.1525v1 [math.co] 7 Mar 2012
Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined
More informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationThis exposition of linear programming
Linear Programming and the Simplex Method David Gale This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationGröbner Bases and their Applications
Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,
More informationThe Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.
The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,
More information