When are Sums Closed?
|
|
- Hortense Alexander
- 5 years ago
- Views:
Transcription
1 Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 20: When are Sums Closed? 20.1 Is a sum of closed sets closed? Example shows that the sum of two closed sets need not be closed. To state sufficient conditions for the sum to be closed we must make a fairly long digression Asymptotic cones A cone is a nonempty subset of R m closed under multiplication by nonnegative scalars. That is, C is a cone if whenever x C and λ R +, then λx C. A cone is nontrivial if it contains a point other than zero Definition Let E R m. The asymptotic cone of E, denoted AE is the set of all possible limits z of sequences of the form (λ n x n ) n, where each x n E, each λ n > 0, and λ n 0. Let us call such a sequence a defining sequence for z. This definition is equivalent to that in Debreu [1], and generalizes the notion of the recession cone of a convex set. This form of the definition was chosen because it makes most properties of asymptotic cones trivial consequences of the definition. The recession cone 0 + F of a closed convex set F is the set of all directions in which F is unbounded, that is, 0 + F = {z R m : ( x F ) ( α 0 ) [ x + αz F ]}. (See Rockafellar [3, Theorem 8.2].) Lemma (a) AE is indeed a cone. (b) If E F, then AE AF. (c) A(E + x) = AE for any x R m. (cc) 0 + E AE. (d) AE 1 A(E 1 + E 2 ). (e) A i I E i i I AE i. (f) AE is closed. KC Border: for Ec 181, src: AsymptoticCones v ::14.10
2 KC Border When are Sums Closed? 20 2 (g) If E is convex, then AE is convex. (h) If E is closed and convex, then AE = 0 + E. (The asymptotic cone really is a generalization of the recession cone.) (i) If C is a cone, then AC = C. (j) A i I E i i I AE i. The reverse inclusion need not hold. (k) If E + F is convex, then AE + AF A(E + F ). (l) A set E R m is bounded if and only if AE = {0}. Proof : Here are proofs of selected parts. treated as an exercise. The others are easy, and should be (cc) 0 + E AE. Let z 0 + E. Then for any n > 0 and any x E, we have x + nz E. But (x + nz) z, so z AE. 1 n (d) AE 1 A(E 1 + E 2 ). For x 2 E 2, by definition E 1 + x 2 E 1 + E 2, so by (b), A(E 1 + x 2 ) A(E 1 + E 2 ), so by (c), AE 1 A(E 1 + E 2 ). (f) AE is closed. Let x n be a sequence in AE with x n x. For each n there is a sequence λ n,m x n,m with lim m λ n,m x n,m = x n, λ n,m 0 as m, x n,m E, and each λ n,m > 0. Then for each k there is N k such that for all n N k, x n x < 1/k, and M k such that for all m M k, λ Nk,mx Nk,m x Nk < 1/k, and L k such that for all m L k, λ Nk,m < 1/k. Set P k = max{m k, L k }, y k = x Nk,P k, and λ k = λ Nk,P k. Then each λ k > 0, λ k 0 and λ k y k x < 2/k, so x AE. (g) If E is convex, then AE is convex. Let x, y AE and α [0, 1]. Since AE is a cone, αx AE and (1 α)y AE. Thus there are defining sequences λ n x n αx and γ n y n (1 α)y. Since E is convex, z n = λn γ n+λ n x n + γn γ n+λ n y n E for each n. Set δ n = γ n + λ n > 0. Then δ n 0 and δ n z n = λ n x n + γ n y n αx + (1 α)y. Thus αx + (1 α)y AE. (h) If E is closed and convex, then AE = 0 + E. In light of (cc), it suffices to prove that AE 0 + E, so let z AE, x E, and α 0. We wish to show that x + αz E. By definition of AE there is a sequence λ n z n z with z n E, λ n > 0, and λ n 0. Then for n large enough 0 αλ n < 1, so (1 αλ n )x + αλ n z n E as E is convex. But (1 αλ n )x + αλ n z n x + αz. Since E is closed, x + αz E. v ::14.10 src: AsymptoticCones KC Border: for Ec 181,
3 KC Border When are Sums Closed? 20 3 (i) If C is a cone, then AC = C. It is easy to show that C AC, as 1 nx x is a defining sequence. Since n AC is closed by (f), we have C AC. On the other hand if λ n 0 and x n C, then λ n x n C, as C is a cone, so AC C. (j) A i I E i i I AE i. The reverse inclusion need not hold. By (b), A i I E i AE j for each j, so A i I E i i I AE i. For a failure of the reverse inclusion, consider the even nonnegative integers E 1 = {0, 2, 4,...} and the odd nonnegative integers E 2 = {1, 3, 5,...}. Then E 1 E 2 =, so A(E 1 E 2 ) =, but AE 1 = AE 2 = AE 1 AE 2 = R +. But what if each E i is convex? (k) If E + F is convex, then AE + AF A(E + F ). Let z belong to AE + AF. Then there exist defining sequences (λ n x n ) E and (α n y n ) F with λ n x n + α n y n z. Let x E and y F. (If either E or F is empty, the result is trivial.) Then ( λ n (x n + y ) ) E + F and ( αn (x + y n ) ) E + F, so (λ n + α n ) is a defining sequence for z in E + F. ( λn (x n + y ) + α ) n (x + y n ) z, λ n + α n λ n + α n (l) A set E R m is bounded if and only if AE = {0}. If E is bounded, clearly AE = {0}. If E is not bounded, let {x n } be an unbounded sequence in E. Then λ n = x n 1 0 and (λ n x n ) is a sequence on the unit sphere, which is compact. Thus there is a subsequence converging to some x in the unit sphere. Such an x is a nonzero member of AE Example The asymptotic cone of a non-convex set need not be convex. Let E = {(x, y) R 2 : y = 1, x > 0}. This hyperbola is not convex and its x asymptotic cone is the union of the nonnegative x- and y-axes. But the asymptotic cone of a non-convex set may be convex. Just think of the integers in R Example It need not be the case that A(E + F ) AE + AF, even if E and F are closed and convex. For instance, let E be the set of points lying above a standard parabola: E = {(x, y) : y x 2 }. The asymptotic cone of E, which is the same as its recession cone, is just the positive y-axis: AE = {(0, y) : y 0}. KC Border: for Ec 181, src: AsymptoticCones v ::14.10
4 KC Border When are Sums Closed? 20 4 So AE + A( E) is just the y-axis. A ( E + ( E) ) = R 2. Thus Now observe that E + ( E) = R 2, so AE + A( E) A ( E + ( E) ) When a sum of closed sets is closed We now turn to the question of when a sum of closed sets is closed. The following definition may be found in Debreu [1, 1.9. m., p. 22] Definition Let C 1,..., C n be cones in R m. We say that they are positively semi-independent if whenever x i C i for each i = 1,..., n, x x n = 0 = x 1 = = x n = 0. Clearly, any subcollection of a collection of semi-independent cones is also semi-independent. Note that in Example , A( E) = A(E), so these nontrivial asymptotic cones are not positively semi-independent Theorem (Closure of the sum of sets) Let E, F R m be closed and nonempty. Suppose that AE and AF are positively semi-independent. (That is, x AE, y AF and x + y = 0 together imply that x = y = 0.) Then E + F is closed, and A(E + F ) AE + AF. The proof relies on the following simple lemma, which is closely related to Lemma 1 in Gale and Rockwell [2] Lemma Under the hypotheses of Theorem , if (λ n ) is a bounded sequence of real numbers with each λ n > 0, (x n ) is a sequence in E, and (y n ) is a sequence in F, and if λ n (x n +y n ) converges to some point, then there is a common subsequence along which both (λ k x k ) and (λ k y k ) converge. Proof : It suffices to prove that both (λ n x n ) and (λ n y n ) are bounded sequences. Suppose by way of contradiction that λ n (x n + y n ) converges to some point, but say (λ n x n ) is unbounded. Since (λ n ) is bounded, it must be the case that both λ n x n and x n, so for large enough n we have λx n > 0. Thus for large n we may divide by λ n x n and define ˆx n = λ n λ n x n x n, ŷ n = λ n λ n x n y n, ẑ n = λ n λ n x n (x n + y n ), and observe that ẑ n = ˆx n + ŷ n. v ::14.10 src: AsymptoticCones KC Border: for Ec 181,
5 KC Border When are Sums Closed? 20 5 But ( λ n (x n + y n ) ) is convergent, and hence bounded, so ẑ n 0. In addition the sequence (ˆx n ) lies on the unit sphere, so it has a convergent subsequence, say ˆx k ˆx, where ˆx = 1. Then ŷ k = ẑ k ˆx k ˆx. But ŷ k = (λ k / λ k x k )y k, and λ k / λ k x k 0, so (λ k / λ k x k )y k is a defining sequence that puts ˆx AF. But a similar argument shows that ˆx AE. Since AE and AF are positively semi-independent, it follows that ˆx = 0, contradicting ˆx = 1. Thus (λ n x n ), is a bounded sequence, and by a similar argument so is (λ n y n ), so they have common subsequence on which they both converge. Proof of Theorem : First, E + F is closed: Let x n + y n z with {x n } E, {y n } F. By Lemma (with λ n = 1 for all n) there is a common subsequence with x k x and y k y. Since E and F are closed, x E and y F. Therefore z = x + y E + F, so E + F is closed. To see that A(E + F ) AE + AF, let z A(E + F ). That is, z is the limit of a defining sequence ( λ n (x n + y n ) ), where x n E and y n F. Since λ n 0, it is a bounded sequence. Thus by Lemma there is a common convergent subsequence, and by definition lim k λ k x k AE and lim k λ k y k AF, so z AE + AF Corollary Let E i R m, i = 1,..., n, be closed and nonempty. If AE i, i = 1,..., n, are positively semi-independent, then n i=1 E i is closed, and A n i=1 E i n i=1 AE i. Proof : This follows from Theorem by induction on n Corollary Let E, F R m be closed and let F be compact. Then E + F is closed. Proof : A compact set is bounded, so by Lemma (l) its asymptotic cone is {0}. Apply Theorem When is an intersection of closed sets bounded? Proposition Let E i R m, i = 1,..., n, be nonempty. If n i=1 AE i = {0}, then n i=1 E i is bounded. Proof : By Lemma (l), n i=1 E i is bounded if and only if A ( n i=1 E i ) = {0}. But by Lemma (j), A ( n i=1 E i ) n i=1 AE i, and the proposition follows. KC Border: for Ec 181, src: AsymptoticCones v ::14.10
6 KC Border When are Sums Closed? 20 6 References [1] G. Debreu Theory of value: An axiomatic analysis of economic equilibrium. Number 17 in Cowles Foundation Monographs. New Haven: Yale University Press. [2] D. Gale and R. Rockwell The Malinvaud eigenvalue lemma: Correction and amplification. Econometrica 44(6): [3] R. T. Rockafellar Convex analysis. Number 28 in Princeton Mathematical Series. Princeton: Princeton University Press. v ::14.10 src: AsymptoticCones KC Border: for Ec 181,
Division of the Humanities and Social Sciences. Sums of sets, etc.
Division of the Humanities and Social Sciences Sums of sets, etc. KC Border September 2002 Rev. November 2012 Rev. September 2013 If E and F are subsets of R m, define the sum E + F = {x + y : x E; y F
More informationTechnical Results on Regular Preferences and Demand
Division of the Humanities and Social Sciences Technical Results on Regular Preferences and Demand KC Border Revised Fall 2011; Winter 2017 Preferences For the purposes of this note, a preference relation
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 0: Vector spaces 0.1 Basic notation Here are some of the fundamental sets and spaces
More informationRockefellar s Closed Functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Fall 2018 Winter 2019 Topic 21: Rockefellar s Closed Functions 21.1 Closed convex functions Convex analysts
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 7: Quasiconvex Functions I 7.1 Level sets of functions For an extended real-valued
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
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 informationLECTURE 3 LECTURE OUTLINE
LECTURE 3 LECTURE OUTLINE Differentiable Conve Functions Conve and A ne Hulls Caratheodory s Theorem Reading: Sections 1.1, 1.2 All figures are courtesy of Athena Scientific, and are used with permission.
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 informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
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 informationConstrained maxima and Lagrangean saddlepoints
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 10: Constrained maxima and Lagrangean saddlepoints 10.1 An alternative As an application
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationWeek 3: Faces of convex sets
Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal
More information2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.
Chapter 2. Basic Topology. 2.3 Compact Sets. 2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α. 2.32 Definition A subset
More informationCalculus and Maximization I
Division of the Humanities and Social Sciences Calculus and Maximization I KC Border Fall 2000 1 Maxima and Minima A function f : X R attains a global maximum or absolute maximum over X at x X if f(x )
More informationMAT-INF4110/MAT-INF9110 Mathematical optimization
MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:
More informationINVERSE LIMITS AND PROFINITE GROUPS
INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological
More informationOn duality gap in linear conic problems
On duality gap in linear conic problems C. Zălinescu Abstract In their paper Duality of linear conic problems A. Shapiro and A. Nemirovski considered two possible properties (A) and (B) for dual linear
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationChapter 2. Convex Sets: basic results
Chapter 2 Convex Sets: basic results In this chapter, we introduce one of the most important tools in the mathematical approach to Economics, namely the theory of convex sets. Almost every situation we
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationLecture 1: Convex Sets January 23
IE 521: Convex Optimization Instructor: Niao He Lecture 1: Convex Sets January 23 Spring 2017, UIUC Scribe: Niao He Courtesy warning: These notes do not necessarily cover everything discussed in the class.
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 informationElements of Convex Optimization Theory
Elements of Convex Optimization Theory Costis Skiadas August 2015 This is a revised and extended version of Appendix A of Skiadas (2009), providing a self-contained overview of elements of convex optimization
More informationDivision of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45
Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.
More informationConvex analysis and profit/cost/support functions
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 Convex analysts may give one of two
More informationA Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions
A Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions Angelia Nedić and Asuman Ozdaglar April 16, 2006 Abstract In this paper, we study a unifying framework
More informationTitle: The existence of equilibrium when excess demand obeys the weak axiom
Title: The existence of equilibrium when excess demand obeys the weak axiom Abstract: This paper gives a non-fixed point theoretic proof of equilibrium existence when the excess demand function of an exchange
More informationConvex Sets. Prof. Dan A. Simovici UMB
Convex Sets Prof. Dan A. Simovici UMB 1 / 57 Outline 1 Closures, Interiors, Borders of Sets in R n 2 Segments and Convex Sets 3 Properties of the Class of Convex Sets 4 Closure and Interior Points of Convex
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 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationCHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).
CHAPTEER - TWO SUBGROUPS Definition 2-1. Let (G, ) be a group and H G be a nonempty subset of G. The pair ( H, ) is said to be a SUBGROUP of (G, ) if ( H, ) is group. Example. ( Z, + ) is subgroup of (
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 informationOn Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)
On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued
More informationSOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction
ACTA MATHEMATICA VIETNAMICA 271 Volume 29, Number 3, 2004, pp. 271-280 SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM NGUYEN NANG TAM Abstract. This paper establishes two theorems
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationMATH 426, TOPOLOGY. p 1.
MATH 426, TOPOLOGY THE p-norms In this document we assume an extended real line, where is an element greater than all real numbers; the interval notation [1, ] will be used to mean [1, ) { }. 1. THE p
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
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 informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationDue date: Monday, February 6, 2017.
Modern Analysis Homework 3 Solutions Due date: Monday, February 6, 2017. 1. If A R define A = {x R : x A}. Let A be a nonempty set of real numbers, assume A is bounded above. Prove that A is bounded below
More informationPOLARS AND DUAL CONES
POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More information106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)
106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More information4. Convex Sets and (Quasi-)Concave Functions
4. Convex Sets and (Quasi-)Concave Functions Daisuke Oyama Mathematics II April 17, 2017 Convex Sets Definition 4.1 A R N is convex if (1 α)x + αx A whenever x, x A and α [0, 1]. A R N is strictly convex
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationAustin Mohr Math 730 Homework. f(x) = y for some x λ Λ
Austin Mohr Math 730 Homework In the following problems, let Λ be an indexing set and let A and B λ for λ Λ be arbitrary sets. Problem 1B1 ( ) Show A B λ = (A B λ ). λ Λ λ Λ Proof. ( ) x A B λ λ Λ x A
More informationMT804 Analysis Homework II
MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
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 informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationIntroduction to Convex Analysis Microeconomics II - Tutoring Class
Introduction to Convex Analysis Microeconomics II - Tutoring Class Professor: V. Filipe Martins-da-Rocha TA: Cinthia Konichi April 2010 1 Basic Concepts and Results This is a first glance on basic convex
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationIntroductory notes on stochastic rationality. 1 Stochastic choice and stochastic rationality
Division of the Humanities and Social Sciences Introductory notes on stochastic rationality KC Border Fall 2007 1 Stochastic choice and stochastic rationality In the standard theory of rational choice
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationSome Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets Santanu S. Dey and Diego A. Morán R. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationA Characterization of Polyhedral Convex Sets
Journal of Convex Analysis Volume 11 (24), No. 1, 245 25 A Characterization of Polyhedral Convex Sets Farhad Husseinov Department of Economics, Bilkent University, 6533 Ankara, Turkey farhad@bilkent.edu.tr
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationConvex Analysis and Optimization Chapter 2 Solutions
Convex Analysis and Optimization Chapter 2 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
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 informationAppendix A: Separation theorems in IR n
Appendix A: Separation theorems in IR n These notes provide a number of separation theorems for convex sets in IR n. We start with a basic result, give a proof with the help on an auxiliary result and
More informationMAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers.
MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3 (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers. (a) Define d : V V + {0} by d(x, y) = 1 ξ j η j 2 j 1 + ξ j η j. Show that
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More 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 informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationSummary Notes on Maximization
Division of the Humanities and Social Sciences Summary Notes on Maximization KC Border Fall 2005 1 Classical Lagrange Multiplier Theorem 1 Definition A point x is a constrained local maximizer of f subject
More informationCS411 Notes 3 Induction and Recursion
CS411 Notes 3 Induction and Recursion A. Demers 5 Feb 2001 These notes present inductive techniques for defining sets and subsets, for defining functions over sets, and for proving that a property holds
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) November 6, 2015 1 Lecture 18 1.1 The convex hull Let X be any vector space, and E X a subset. Definition 1.1. The convex hull of E is the
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationA Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions
A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions Angelia Nedić and Asuman Ozdaglar April 15, 2006 Abstract We provide a unifying geometric framework for the
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationSome notes on Coxeter groups
Some notes on Coxeter groups Brooks Roberts November 28, 2017 CONTENTS 1 Contents 1 Sources 2 2 Reflections 3 3 The orthogonal group 7 4 Finite subgroups in two dimensions 9 5 Finite subgroups in three
More information