When are Sums Closed?

Similar documents
Division of the Humanities and Social Sciences. Sums of sets, etc.

Technical Results on Regular Preferences and Demand

Convex Analysis and Economic Theory Winter 2018

Rockefellar s Closed Functions

Convex Analysis and Economic Theory Winter 2018

Convex Analysis and Economic Theory AY Elementary properties of convex functions

A NICE PROOF OF FARKAS LEMMA

LECTURE 3 LECTURE OUTLINE

Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption

Appendix B Convex analysis

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

Constrained maxima and Lagrangean saddlepoints

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Week 3: Faces of convex 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 α.

Calculus and Maximization I

MAT-INF4110/MAT-INF9110 Mathematical optimization

INVERSE LIMITS AND PROFINITE GROUPS

On duality gap in linear conic problems

Convex Analysis and Economic Theory Winter 2018

1 Directional Derivatives and Differentiability

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Chapter 2. Convex Sets: basic results

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Lecture 1: Convex Sets January 23

Lecture 7 Monotonicity. September 21, 2008

Elements of Convex Optimization Theory

Division of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45

Convex analysis and profit/cost/support functions

A Unified Analysis of Nonconvex Optimization Duality and Penalty Methods with General Augmenting Functions

Title: The existence of equilibrium when excess demand obeys the weak axiom

Convex Sets. Prof. Dan A. Simovici UMB

Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS

Math 117: Topology of the Real Numbers

5 Set Operations, Functions, and Counting

CHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).

Introduction to Real Analysis Alternative Chapter 1

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)

SOME STABILITY RESULTS FOR THE SEMI-AFFINE VARIATIONAL INEQUALITY PROBLEM. 1. Introduction

Real Analysis Notes. Thomas Goller

Complete Induction and the Well- Ordering Principle

Optimality Conditions for Nonsmooth Convex Optimization

MATH 426, TOPOLOGY. p 1.

Part V. Chapter 19. Congruence of integers

Math 341: Convex Geometry. Xi Chen

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

We want to show P (n) is true for all integers

Course 212: Academic Year Section 1: Metric Spaces

Due date: Monday, February 6, 2017.

POLARS AND DUAL CONES

Lecture Notes on Metric Spaces

Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.

106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)

Chapter 2: Linear Independence and Bases

NOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017

4. Convex Sets and (Quasi-)Concave Functions

Lecture 4: Completion of a Metric Space

MA651 Topology. Lecture 10. Metric Spaces.

Problem Set 2: Solutions Math 201A: Fall 2016

Austin Mohr Math 730 Homework. f(x) = y for some x λ Λ

MT804 Analysis Homework II

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

l(y j ) = 0 for all y j (1)

In N we can do addition, but in order to do subtraction we need to extend N to the integers

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

Introduction to Convex Analysis Microeconomics II - Tutoring Class

2.2 Some Consequences of the Completeness Axiom

Some Results Concerning Uniqueness of Triangle Sequences

Properties of Linear Transformations from R n to R m

Properties of the Integers

a + 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.

Introductory notes on stochastic rationality. 1 Stochastic choice and stochastic rationality

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets

Introduction to Topology

A Characterization of Polyhedral Convex Sets

Chapter 2. Metric Spaces. 2.1 Metric Spaces

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Chapter 4. Measure Theory. 1. Measure Spaces

Convex Analysis and Optimization Chapter 2 Solutions

Chapter 1. Preliminaries

NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

Exercise Solutions to Functional Analysis

Appendix A: Separation theorems in IR n

MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 3. (1) Let V be the vector space of all bounded or unbounded sequences of complex numbers.

Existence and Uniqueness

Topological properties

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures

HW 4 SOLUTIONS. , x + x x 1 ) 2

Summary Notes on Maximization

CS411 Notes 3 Induction and Recursion

REAL AND COMPLEX ANALYSIS

Notes for Functional Analysis

MATH 117 LECTURE NOTES

CHAPTER 7. Connectedness

A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions

M17 MAT25-21 HOMEWORK 6

Some notes on Coxeter groups

Transcription:

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 0.2.2 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. 20.2 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. 20.2.1 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].) 20.2.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, 2018 2019 src: AsymptoticCones v. 2018.10.23::14.10

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. 2018.10.23::14.10 src: AsymptoticCones KC Border: for Ec 181, 2018 2019

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. 20.2.3 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 1. 20.2.4 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, 2018 2019 src: AsymptoticCones v. 2018.10.23::14.10

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) ). 20.3 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]. 20.3.1 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 1 + + 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 20.2.4, A( E) = A(E), so these nontrivial asymptotic cones are not positively semi-independent. 20.3.2 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]. 20.3.3 Lemma Under the hypotheses of Theorem 20.3.2, 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. 2018.10.23::14.10 src: AsymptoticCones KC Border: for Ec 181, 2018 2019

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 20.3.2: First, E + F is closed: Let x n + y n z with {x n } E, {y n } F. By Lemma 20.3.3 (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 20.3.3 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. 20.3.4 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 20.3.2 by induction on n. 20.3.5 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 20.2.2(l) its asymptotic cone is {0}. Apply Theorem 20.3.2. 20.4 When is an intersection of closed sets bounded? 20.4.1 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 20.2.2(l), n i=1 E i is bounded if and only if A ( n i=1 E i ) = {0}. But by Lemma 20.2.2(j), A ( n i=1 E i ) n i=1 AE i, and the proposition follows. KC Border: for Ec 181, 2018 2019 src: AsymptoticCones v. 2018.10.23::14.10

KC Border When are Sums Closed? 20 6 References [1] G. Debreu. 1959. Theory of value: An axiomatic analysis of economic equilibrium. Number 17 in Cowles Foundation Monographs. New Haven: Yale University Press. http://cowles.econ.yale.edu/p/cm/m17/m17-all.pdf [2] D. Gale and R. Rockwell. 1976. The Malinvaud eigenvalue lemma: Correction and amplification. Econometrica 44(6):1323 1324. http://www.jstor.org/stable/1914264 [3] R. T. Rockafellar. 1970. Convex analysis. Number 28 in Princeton Mathematical Series. Princeton: Princeton University Press. v. 2018.10.23::14.10 src: AsymptoticCones KC Border: for Ec 181, 2018 2019