Hahn-Banach Theorem Is a Relative of the Supporting Hyperplane Theorem

Total Page:16

File Type:pdf, Size:1020Kb

Hahn-Banach Theorem Is a Relative of the Supporting Hyperplane Theorem John Nachbar Washington University March 12, 2016 Separation in General Normed Vector Spaces1 1 Introduction N Recall the Basic Separation Theorem for convex sets in R . N Theorem 1. Let A ⊆ R be non-empty, closed, and convex. If 0 2= A then there is N a v 2 R , v 6= 0, such that v · a ≥ v · v for all a 2 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.) N I have stated the Basic Separation Theorem for R 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 N R , 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^ 2 X and any θ 2 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." N In R , but not more generally, a real-valued function is linear iff it can be written N as an inner product. Thus, for R , 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. N N N Theorem 2. F : R ! R is linear iff there is a v 2 R such that for all x 2 R , F (x) = x · v. 1cbna. This work is licensed under the Creative Commons Attribution-NonCommercial- ShareAlike 4.0 License. 1 Proof 1. ). Let en be the n coordinate vector: en = (0;:::; 0; 1; 0;:::; 0), with a 1 in n P n the n place. Define vn = F (e ). Then, for any x = (x1; : : : ; xn) = n xne , P n P n P the linearity of F impies that F (x) = F ( xne ) = n xnF (e ) = n xnvn = x · v. 2. (. Almost immediate. For a general vector space X, let X∗ denote the set of real-valued linear functions ∗ N defined on X. X is called the dual space of X. The above theorem says that R is N \self-dual:" every real-valued linear function F on R is identified with an element N N ∗ N v 2 R , and conversely. Abusing notation, (R ) = R . One can also show that, ∗ similarly, (L2) = L2. But not all vector spaces are self-dual. Consider `1. For many v; x 2 `1, v · x is P 2 not even well defined. For example, if v = (1; 1;::: ) then v · v should be n(vn) , but the latter is infinite. One can partially fix this problem by restricting v to `1, the normed vector space 1 consisting of the points in R that are absolutely summable, X kxk1 = jxnj < 1: n 1 1 P For any v 2 ` , the function F : ` ! R given by F (x) = v · x = n vnxn is well defined. Therefore `1 ⊆ (`1)∗. Unfortunately, `1 is a proper subset of (`1)∗: there exist elements of (`1)∗ that cannot be represented as inner products with elements of `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 `1 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, N 1 X lim xn: n!1 N n=1 Unlike limits of averages, which are not defined if the limit does not exist, Banach Limits are defined for all x 2 `1. 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 (`1)∗ that have no inner-product interpretation means that there are planes in `1 that cannot be represented via 2 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 2= A then there is a linear function F : X ! R and an r > 0 such that for all a 2 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 N as in R . Generalizing the Supporting Hyperplane Theorem is less straightforward. N In R , 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 2 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^ 2 X and any θ 2 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) = jxj. 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) = jxj 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 2 W , f(x) ≤ p(x), then there is a linear function F : X ! R such that, 3 1. For all x 2 W , f(x) = F (x), 2. For all x 2 X, F (x) ≤ p(x). To interpret the statement of the Hahn-Banach Theorem, focus on the finite N dimensional case: X = R . The epigraph of p is then a closed, convex cone in N+1 N N+1 R . If F (x) ≤ p(x) for all x 2 R then the graph of F , which is a plane in R , 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 = f0g, 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 N X to be a general vector space rather than just X = R . 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 Theorem4 . The proof below is complete with one exception, which I flag. Let Wg;Wh be vector subspaces of X and let g : Wg ! R, h : Wh ! R be real-valued continuous functions such that for all x 2 Wg, g(x) ≤ p(x) and for all x 2 Wh, h(x) ≤ p(x). Say that h extends g iff 1. Wg ⊆ Wh, 2. For all x 2 Wg, h(x) = g(x). Say that h is a proper extension of g if h is an extension of g and Wg 6= Wh. Consider the set of all extensions of f. This set is not empty (it contains f).
Recommended publications
  • On the Cone of a Finite Dimensional Compact Convex Set at a Point
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector On the Cone of a Finite Dimensional Compact Convex Set at a Point C. H. Sung Department of Mathematics University of Califmia at San Diego La Joll41, California 92093 and Department of Mathematics San Diego State University San Diego, California 92182 and B. S. Tam* Department of Mathematics Tamkang University Taipei, Taiwan 25137, Republic of China Submitted by Robert C. Thompson ABSTRACT Four equivalent conditions for a convex cone in a Euclidean space to be an F,-set are given. Our result answers in the negative a recent open problem posed by Tam [5], characterizes the barrier cone of a convex set, and also provides an alternative proof for the known characterizations of the inner aperture of a convex set as given by BrBnsted [2] and Larman [3]. 1. INTRODUCTION Let V be a Euclidean space and C be a nonempty convex set in V. For each y E C, the cone of C at y, denoted by cone(y, C), is the cone *The work of this author was supported in part by the National Science Council of the Republic of China. LINEAR ALGEBRA AND ITS APPLICATIONS 90:47-55 (1987) 47 0 Elsevier Science Publishing Co., Inc., 1987 52 Vanderbilt Ave., New York, NY 10017 00243795/87/$3.50 48 C. H. SUNG AND B. S. TAM { a(r - Y) : o > 0 and x E C} (informally called a point’s cone). On 23 August 1983, at the International Congress of Mathematicians in Warsaw, in a short communication session, the second author presented the paper [5] and posed the following open question: Is it true that, given any cone K in V, there always exists a compact convex set C whose point’s cone at some given point y is equal to K? In view of the relation cone(y, C) = cone(0, C - { y }), the given point y may be taken to be the origin of the space.
    [Show full text]
  • The Hahn-Banach Theorem and Infima of Convex Functions
    The Hahn-Banach theorem and infima of convex functions Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan first CORE meeting, LMU Munich, 7 May, 2016 Normed spaces Definition A normed space is a linear space E equipped with a norm k · k : E ! R such that I kxk = 0 $ x = 0, I kaxk = jajkxk, I kx + yk ≤ kxk + kyk, for each x; y 2 E and a 2 R. Note that a normed space E is a metric space with the metric d(x; y) = kx − yk: Definition A Banach space is a normed space which is complete with respect to the metric. Examples For 1 ≤ p < 1, let p N P1 p l = f(xn) 2 R j n=0 jxnj < 1g and define a norm by P1 p 1=p k(xn)k = ( n=0 jxnj ) : Then lp is a (separable) Banach space. Examples Classically the normed space 1 N l = f(xn) 2 R j (xn) is boundedg with the norm k(xn)k = sup jxnj n is an inseparable Banach space. However, constructively, it is not a normed space. Linear mappings Definition A mapping T between linear spaces E and F is linear if I T (ax) = aTx, I T (x + y) = Tx + Ty for each x; y 2 E and a 2 R. Definition A linear functional f on a linear space E is a linear mapping from E into R. Bounded linear mappings Definition A linear mapping T between normed spaces E and F is bounded if there exists c ≥ 0 such that kTxk ≤ ckxk for each x 2 E.
    [Show full text]
  • On Order Preserving and Order Reversing Mappings Defined on Cones of Convex Functions MANUSCRIPT
    ON ORDER PRESERVING AND ORDER REVERSING MAPPINGS DEFINED ON CONES OF CONVEX FUNCTIONS MANUSCRIPT Lixin Cheng∗ Sijie Luo School of Mathematical Sciences Yau Mathematical Sciences Center Xiamen University Tsinghua University Xiamen 361005, China Beijing 100084, China [email protected] [email protected] ABSTRACT In this paper, we first show that for a Banach space X there is a fully order reversing mapping T from conv(X) (the cone of all extended real-valued lower semicontinuous proper convex functions defined on X) onto itself if and only if X is reflexive and linearly isomorphic to its dual X∗. Then we further prove the following generalized “Artstein-Avidan-Milman” representation theorem: For every fully order reversing mapping T : conv(X) → conv(X) there exist a linear isomorphism ∗ ∗ ∗ U : X → X , x0, ϕ0 ∈ X , α> 0 and r0 ∈ R so that ∗ (Tf)(x)= α(Ff)(Ux + x0)+ hϕ0, xi + r0, ∀x ∈ X, where F : conv(X) → conv(X∗) is the Fenchel transform. Hence, these resolve two open questions. We also show several representation theorems of fully order preserving mappings de- fined on certain cones of convex functions. For example, for every fully order preserving mapping S : semn(X) → semn(X) there is a linear isomorphism U : X → X so that (Sf)(x)= f(Ux), ∀f ∈ semn(X), x ∈ X, where semn(X) is the cone of all lower semicontinuous seminorms on X. Keywords Fenchel transform · order preserving mapping · order reversing mapping · convex function · Banach space 1 Introduction An elegant theorem of Artstein-Avidan and Milman [5] states that every fully order reversing (resp.
    [Show full text]
  • Contents 1. Introduction 1 2. Cones in Vector Spaces 2 2.1. Ordered Vector Spaces 2 2.2
    ORDERED VECTOR SPACES AND ELEMENTS OF CHOQUET THEORY (A COMPENDIUM) S. COBZAS¸ Contents 1. Introduction 1 2. Cones in vector spaces 2 2.1. Ordered vector spaces 2 2.2. Ordered topological vector spaces (TVS) 7 2.3. Normal cones in TVS and in LCS 7 2.4. Normal cones in normed spaces 9 2.5. Dual pairs 9 2.6. Bases for cones 10 3. Linear operators on ordered vector spaces 11 3.1. Classes of linear operators 11 3.2. Extensions of positive operators 13 3.3. The case of linear functionals 14 3.4. Order units and the continuity of linear functionals 15 3.5. Locally order bounded TVS 15 4. Extremal structure of convex sets and elements of Choquet theory 16 4.1. Faces and extremal vectors 16 4.2. Extreme points, extreme rays and Krein-Milman's Theorem 16 4.3. Regular Borel measures and Riesz' Representation Theorem 17 4.4. Radon measures 19 4.5. Elements of Choquet theory 19 4.6. Maximal measures 21 4.7. Simplexes and uniqueness of representing measures 23 References 24 1. Introduction The aim of these notes is to present a compilation of some basic results on ordered vector spaces and positive operators and functionals acting on them. A short presentation of Choquet theory is also included. They grew up from a talk I delivered at the Seminar on Analysis and Optimization. The presentation follows mainly the books [3], [9], [19], [22], [25], and [11], [23] for the Choquet theory. Note that the first two chapters of [9] contains a thorough introduction (with full proofs) to some basics results on ordered vector spaces.
    [Show full text]
  • Some Applications of the Hahn-Banach Separation Theorem 1
    Some Applications of the Hahn-Banach Separation Theorem 1 Frank Deutsch , Hein Hundal, Ludmil Zikatanov January 1, 2018 arXiv:1712.10250v1 [math.FA] 29 Dec 2017 1We dedicate this paper to our friend and colleague Professor Yair Censor on the occasion of his 75th birthday. Abstract We show that a single special separation theorem (namely, a consequence of the geometric form of the Hahn-Banach theorem) can be used to prove Farkas type theorems, existence theorems for numerical quadrature with pos- itive coefficients, and detailed characterizations of best approximations from certain important cones in Hilbert space. 2010 Mathematics Subject Classification: 41A65, 52A27. Key Words and Phrases: Farkas-type theorems, numerical quadrature, characterization of best approximations from convex cones in Hilbert space. 1 Introduction We show that a single separation theorem|the geometric form of the Hahn- Banach theorem|has a variety of different applications. In section 2 we state this general separation theorem (Theorem 2.1), but note that only a special consequence of it is needed for our applications (Theorem 2.2). The main idea in Section 2 is the notion of a functional being positive relative to a set of functionals (Definition 2.3). Then a useful characterization of this notion is given in Theorem 2.4. Some applications of this idea are given in Section 3. They include a proof of the existence of numerical quadrature with positive coefficients, new proofs of Farkas type theorems, an application to determining best approximations from certain convex cones in Hilbert space, and a specific application of the latter to determine best approximations that are also shape-preserving.
    [Show full text]
  • Complemented Brunn–Minkowski Inequalities and Isoperimetry for Homogeneous and Non-Homogeneous Measures
    Complemented Brunn{Minkowski Inequalities and Isoperimetry for Homogeneous and Non-Homogeneous Measures Emanuel Milman1 and Liran Rotem2 Abstract Elementary proofs of sharp isoperimetric inequalities on a normed space (Rn; k·k) equipped with a measure µ = w(x)dx so that wp is homogeneous are provided, along with a characterization of the corresponding equality cases. When p 2 (0; 1] and in addition wp is assumed concave, the result is an immediate corollary of the Borell{Brascamp{Lieb extension of the classical Brunn{Minkowski inequality, providing a new elementary proof of a recent result of Cabr´e{RosOton{Serra. When p 2 (−1=n; 0), the relevant property turns out to be a novel \q{complemented Brunn{Minkowski" inequality: n n n 8λ 2 (0; 1) 8 Borel sets A; B ⊂ R such that µ(R n A); µ(R n B) < 1 ; n n q n q 1=q µ∗(R n (λA + (1 − λ)B)) ≤ (λµ(R n A) + (1 − λ)µ(R n B) ) ; p 1 1 which we show is always satisfied by µ when w is homogeneous with q = p + n; in par- ticular, this is satisfied by the Lebesgue measure with q = 1=n. This gives rise to a new class of measures, which are \complemented" analogues of the class of convex measures introduced by Borell, but which have vastly different properties. The resulting isoperi- metric inequality and characterization of isoperimetric minimizers extends beyond the re- cent results of Ca~nete{Rosalesand Howe. The isoperimetric and Brunn-Minkowski type inequalities also extend to the non-homogeneous setting, under a certain log-convexity assumption on the density.
    [Show full text]
  • Bootstrapping the Mazur–Orlicz-König Theorem and the Hahn–Banach Lagrange Theorem
    Journal of Convex Analysis Volume 25 (2018), No. 2, 1–xx Bootstrapping the Mazur–Orlicz-König Theorem and the Hahn–Banach Lagrange Theorem Stephen Simons Department of Mathematics, University of California, Santa Barbara, CA 93106-3080, U.S.A. [email protected] Dedicated to Antonino Maugeri on the occasion of his 70th birthday. Received: December 25, 2015 Accepted: August 4, 2016 We give some extensions of König’s extension of the Mazur–Orlicz theorem. These extensions include generalizations of a surprising recent result of Sun Chuanfeng, and generalizations to the product of more than two spaces of the “Hahn–Banach–Lagrange” theorem. Keywords: Sublinear functional, convex function, affine function, Hahn–Banach theorem, Mazur–Orlicz–König theorem. 2010 Mathematics Subject Classification: 46A22, 46N10. 1. Introduction In this paper, all vector spaces are real. We shall use the terms sublinear, linear, convex, concave and affine in their usual senses. This paper is about extensions of the Mazur–Orlicz theorem, which first ap- peared in [5]: Let E be a vector space, S : E ! R be sublinear and C be a nonempty convex subset of E. Then there exists a linear map L: E ! R such that L ≤ S on E and infC L = infC S: Early improvements and applications of this result were given, in chronological order, by Sikorski [6], Pták [4], König [1], Landsberg–Schirotzek [3] and König [2]. By a convex–affine version of a known result we mean that it corresponds to the known result with the word sublinear in the hypothesis replaced by convex and the word linear in the conclusion replaced by affine.
    [Show full text]
  • Constructing Sublinear Expectations on Path Space
    Constructing Sublinear Expectations on Path Space Marcel Nutz∗ Ramon van Handel† January 21, 2013 Abstract We provide a general construction of time-consistent sublinear ex- pectations on the space of continuous paths. It yields the existence of the conditional G-expectation of a Borel-measurable (rather than quasi-continuous) random variable, a generalization of the random G- expectation, and an optional sampling theorem that holds without exceptional set. Our results also shed light on the inherent limitations to constructing sublinear expectations through aggregation. Keywords Sublinear expectation; G-expectation; random G-expectation; Time- consistency; Optional sampling; Dynamic programming; Analytic set AMS 2000 Subject Classification 93E20; 60H30; 91B30; 28A05 1 Introduction d We study sublinear expectations on the space Ω= C0(R+, R ) of continuous arXiv:1205.2415v3 [math.PR] 11 Apr 2013 paths. Taking the dual point of view, we are interested in mappings P ξ 0(ξ)= sup E [ξ], 7→ E P ∈P where ξ is a random variable and is a set of probability measures, possibly P non-dominated. In fact, any sublinear expectation with certain continuity ∗Dept. of Mathematics, Columbia University, New York. [email protected] The work of MN is partially supported by NSF grant DMS-1208985. †Sherrerd Hall rm. 227, Princeton University, Princeton. [email protected] The work of RvH is partially supported by NSF grant DMS-1005575. 1 properties is of this form (cf. [10, Sect. 4]). Under appropriate assumptions on , we would like to construct a conditional expectation (ξ) at any P Eτ stopping time τ of the the filtration generated by the canonical process {Ft} B and establish the tower property ( (ξ)) = (ξ) for stopping times σ τ, (1.1) Eσ Eτ Eσ ≤ a property also known as time-consistency in this context.
    [Show full text]
  • The Constructive Hahn-Banach Theorem, Revisited
    The constructive Hahn-Banach theorem, revisited Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Workshop: Constructive Mathematics HIM Bonn, 6{10 August, 2018 The Hahn-Banach theorem The Hahn-Banach theorem is a central tool in functional analysis, which is named after the mathematicians Hans Hahn and Stefan Banach who proved it independently in the late 1920s. The theorem has several forms. I The continuous extension theorem which allows the extension of a bounded linear functional defined on a subspace of a normed space to the whole space; I The separation theorem which allows a separation of two convex subsets of a normed space by a hyperplane, and has numerous uses in convex analysis (geometry); I The dominated extension theorem which is the most general form of the theorem, and allows the extension of a linear functional defined on a subspace of a normed space, and dominated by a sublinear function, to the whole space. Normed spaces Definition 1 A normed space is a linear space E equipped with a norm k · k : E ! R such that I kxk = 0 $ x = 0, I kaxk = jajkxk, I kx + yk ≤ kxk + kyk, for each x; y 2 E and a 2 R. Note that a normed space E is a metric space with the metric d(x; y) = kx − yk: Definition 2 A Banach space is a normed space which is complete with respect to the metric. Examples For 1 ≤ p < 1, let N P1 p lp = f(xn) 2 R j n=0 jxnj < 1g and define a norm by P1 p 1=p k(xn)k = ( n=0 jxnj ) : Then lp is a (separable) Banach space.
    [Show full text]
  • Multi-Dimensional Central Limit Theorems and Laws of Large
    Multi-dimensional central limit theorems and laws of large numbers under sublinear expectations Ze-Chun Hu∗ and Ling Zhou Nanjing University Abstract In this paper, we present some multi-dimensional central limit theorems and laws of large numbers under sublinear expectations, which extend some previous results. Keywords central limit theorem, laws of large numbers, sublinear expectation MSC(2000): 60H10, 60H05 1 Introduction The classic central limit theorems and strong (weak) laws of large numbers play an important role in the development of probability theory and its applications. Recently, motivated by the risk measures, superhedge pricing and modeling uncertain in finance, Peng [1, 2, 3, 4, 5, 6] initiated the notion of independent and identically distributed (IID) random variables under sublinear expectations, and proved the central limit theorems and the weak law of large numbers among other things. In [7], Hu and Zhang obtained a central limit theorem for capacities induced by sublinear expectations. In [8], Li and Shi proved a central limit theorem without the requirement of identical distribution, which extends Peng’s central limit theorems in [2, 4]. In [9], Hu proved that for any arXiv:1211.1090v2 [math.PR] 19 Jun 2013 continuous function ψ satisfying the growth condition ψ(x) C(1+ x p) for some C > 0,p 1 depending on ψ, central limit theorem under sublinear| expectations| ≤ | obtained| by Peng [4] still≥ holds. In [10], Zhang obtained a central limit theorem for weighted sums of independent random variables under sublinear expectations, which extends the results obtained by Peng, Li and Shi. Now we recall the existing results about the laws of large numbers under sublinear expec- tations.
    [Show full text]
  • Notes, We Review Useful Concepts in Convexity and Normed Spaces
    Mastermath, Spring 2019 Lecturers: D. Dadush, J. Briet Geometric Functional Analysis Lecture 0 Scribe: D. Dadush Review of Convexity and Normed Spaces In these notes, we review useful concepts in convexity and normed spaces. As a warning, many of the statements made here will not be proved. For detailed proofs, one is recommended to look up reference books in functional and convex analysis. The intent here is for these notes to serve as a reference for the basic language for the course. The reader may thus skim the material upon first reading, and then reread more carefully later during the course if the relevant concepts remain unclear. 1 Basic Convexity In this section, we will focus on convexity theorems in a finite dimensional real vector space, which will identify with Rn or subspaces theoreof. For vectors x, y 2 Rn, we define the standard T n n inner product hx, yi := x y = ∑i=1 xiyi. For two sets A, B ⊆ R and scalars c, d 2 R, we define the Minkowski sum cA + dB = fca + db : a 2 A, b 2 Bg. A convex set K ⊆ Rn is a set for which the line segment between any two points is in the set, or formally for which 8x, y 2 K, l 2 [0, 1], lx + (1 − l)y 2 K. A useful equivalent definition is that a non-empty set K is convex if 8a, b ≥ 0, aK + bK = (a + b)K. If K = −K, K is said to be symmetric. If K is compact with non-empty interior, then K is a convex body.
    [Show full text]
  • Topological Vector Spaces
    An introduction to some aspects of functional analysis, 3: Topological vector spaces Stephen Semmes Rice University Abstract In these notes, we give an overview of some aspects of topological vector spaces, including the use of nets and filters. Contents 1 Basic notions 3 2 Translations and dilations 4 3 Separation conditions 4 4 Bounded sets 6 5 Norms 7 6 Lp Spaces 8 7 Balanced sets 10 8 The absorbing property 11 9 Seminorms 11 10 An example 13 11 Local convexity 13 12 Metrizability 14 13 Continuous linear functionals 16 14 The Hahn–Banach theorem 17 15 Weak topologies 18 1 16 The weak∗ topology 19 17 Weak∗ compactness 21 18 Uniform boundedness 22 19 Totally bounded sets 23 20 Another example 25 21 Variations 27 22 Continuous functions 28 23 Nets 29 24 Cauchy nets 30 25 Completeness 32 26 Filters 34 27 Cauchy filters 35 28 Compactness 37 29 Ultrafilters 38 30 A technical point 40 31 Dual spaces 42 32 Bounded linear mappings 43 33 Bounded linear functionals 44 34 The dual norm 45 35 The second dual 46 36 Bounded sequences 47 37 Continuous extensions 48 38 Sublinear functions 49 39 Hahn–Banach, revisited 50 40 Convex cones 51 2 References 52 1 Basic notions Let V be a vector space over the real or complex numbers, and suppose that V is also equipped with a topological structure. In order for V to be a topological vector space, we ask that the topological and vector spaces structures on V be compatible with each other, in the sense that the vector space operations be continuous mappings.
    [Show full text]