A Characterization of Polyhedral Convex Sets

Similar documents
Chapter 2 Convex Analysis

POLARS AND DUAL CONES

Week 3: Faces of convex sets

Optimality Conditions for Nonsmooth Convex Optimization

Centrally Symmetric Convex Sets

Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption

Exercises: Brunn, Minkowski and convex pie

A NICE PROOF OF FARKAS LEMMA

GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION

Whitney topology and spaces of preference relations. Abstract

TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS

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

NOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS

NOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017

Convex Analysis and Optimization Chapter 4 Solutions

Extreme points of compact convex sets

4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**

("-1/' .. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS. R. T. Rockafellar. MICHIGAN MATHEMATICAL vol. 16 (1969) pp.

Introduction to Koecher Cones. Michael Orlitzky

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

arxiv: v1 [math.co] 10 Aug 2016

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

Lecture 6 - Convex Sets

Math 341: Convex Geometry. Xi Chen

On the cells in a stationary Poisson hyperplane mosaic

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

CHAPTER 7. Connectedness

On the convexity of piecewise-defined functions

Lecture 1: Convex Sets January 23

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

arxiv: v1 [math.oc] 21 Mar 2015

MAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS

The Relation Between Pseudonormality and Quasiregularity in Constrained Optimization 1

ON DENSITY TOPOLOGIES WITH RESPECT

Geometry and topology of continuous best and near best approximations

Convex Analysis and Optimization Chapter 2 Solutions

ON THE PRODUCT OF SEPARABLE METRIC SPACES

Covering the Plane with Translates of a Triangle

When are Sums Closed?

Appendix B Convex analysis

The Trust Region Subproblem with Non-Intersecting Linear Constraints

CHARACTERIZATION OF (QUASI)CONVEX SET-VALUED MAPS

Convex Analysis and Economic Theory AY Elementary properties of convex functions

Convex Geometry. Carsten Schütt

Jensen s inequality for multivariate medians

ITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI. Received December 14, 1999

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 α.

Chapter 2. Convex Sets: basic results

A Parametric Simplex Algorithm for Linear Vector Optimization Problems

Lecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008

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

Introduction to Convex and Quasiconvex Analysis

AN INTRODUCTION TO CONVEXITY

Math 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.

Chapter 2 Metric Spaces

Introduction to Convex Analysis Microeconomics II - Tutoring Class

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

GEORGIA INSTITUTE OF TECHNOLOGY H. MILTON STEWART SCHOOL OF INDUSTRIAL AND SYSTEMS ENGINEERING LECTURE NOTES OPTIMIZATION III

k-dimensional INTERSECTIONS OF CONVEX SETS AND CONVEX KERNELS

Basic convexity. 1.1 Convex sets and combinations. λ + μ b (λ + μ)a;

Preprint February 19, 2018 (1st version October 31, 2017) Pareto efficient solutions in multi-objective optimization involving forbidden regions 1

Topological properties

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

Chapter 2: Preliminaries and elements of convex analysis

s P = f(ξ n )(x i x i 1 ). i=1

arxiv: v1 [math.mg] 4 Jan 2013

MAT-INF4110/MAT-INF9110 Mathematical optimization

Normal Fans of Polyhedral Convex Sets

LECTURE 15: COMPLETENESS AND CONVEXITY

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION

Key words. Integer nonlinear programming, Cutting planes, Maximal lattice-free convex sets

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity

THREE SPACES PROBLEM FOR LYAPUNOV THEOREM ON VECTOR MEASURE. V. M. Kadets, O. I. Vladimirskaya

ON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES

A New Fenchel Dual Problem in Vector Optimization

Some results on stability and on characterization of K-convexity of set-valued functions

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs

P.S. Gevorgyan and S.D. Iliadis. 1. Introduction

EXTENSION OF LYAPUNOV S CONVEXITY THEOREM TO SUBRANGES

Convex Sets and Minimal Sublinear Functions

Mathematics 530. Practice Problems. n + 1 }

Lifting for conic mixed-integer programming

Lecture 7: Semidefinite programming

Chapter 4. Measure Theory. 1. Measure Spaces

Convex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version

On constraint qualifications with generalized convexity and optimality conditions

Chapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.

Bodies of constant width in arbitrary dimension

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect

Global Maximum of a Convex Function: Necessary and Sufficient Conditions

arxiv: v1 [math.oc] 15 Apr 2016

On Directed Sets and their Suprema

Constraint qualifications for convex inequality systems with applications in constrained optimization

Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach

Chapter 1. Preliminaries

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.

Numerical Optimization

Vector Variational Principles; ε-efficiency and Scalar Stationarity

Restricted versions of the Tukey-Teichmüller Theorem that are equivalent to the Boolean Prime Ideal Theorem

AN INTERSECTION FORMULA FOR THE NORMAL CONE ASSOCIATED WITH THE HYPERTANGENT CONE

Transcription:

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 Received September 26, 22 Revised manuscript received December 12, 23 This paper describes a class of convex closed sets, S, in R n for which the following property holds: for every correspondence defined on a probability space with relative open values in S its integral is a relative open subset of S. It turns out, that the only closed convex sets in R n having this property are generalized polyhedral convex sets. In particular, the only compact convex sets in R n having this property are polytopes. Keywords: Polyhedral convex sets, correspondence, locally convex sets Mathematics Subject Classification: 52B99 1. Introduction This note describes a class of closed convex sets, S, in R n for which the following property holds: for every correspondence defined on a probability space with relative open values in S its integral is a relative open subset of S. It turns out, that the only convex closed sets in R n having this property (named in sequel the relative openness of integral property, r.o.i. property,) are generalized polyhedral convex sets (see Definition 2.1 below). In particular, the only compact convex sets in R n having the r.o.i. property are polytopes. This study bears on a theorem on the integral of correspondences due to Grodal [1]. Grodal used this theorem to study the closedness and continuity of the core and the set of Pareto optimal allocations. First, we formulate here a result which drops the convexity assumption in Grodal s theorem on correspondences. Its proof can be found in Husseinov [2], where it is used to strengthen Grodal s results on the core and Pareto optimal allocations to economies with nonconvex preferences. We start with some notations. As usual, A A = (A\A ) (A \A) is the symmetric difference of two sets A and A. X, int X, ri X, and co X will denote the boundary, interior, relative interior and convex hull of a set X in R n, respectively. The set of all positive integers is denoted by N. For a correspondence F : T R n, where (T, Σ, µ) is a measure space, and a µ measurable set A T we use a short notation A F for A F (t)dµ(t). Instead of T F we write F. We denote as L F the set of all integrable selections of correspondence F. Theorem 1.1. Let (T, Σ, µ) be a measure space and let X : T R n be a measurable convex-valued correspondence. Let furthemore, ϕ : T R n be a measurable correspondence such that ϕ(t) is a relative open subset of X(t) almost everywhere on T. Then int ( Xdµ) ( ϕdµ) = int ( ϕdµ). ISSN 944-6532 / $ 2.5 c Heldermann Verlag

246 F. Husseinov / A Characterization of Polyhedral Convex Sets This theorem allows to strengthen Grodal s results on the continuity of the core and the Pareto optimal allocations of economies with nonconvex preferences. A natural question concerning Theorem 1.1 is the following. Is it true that under the assumptions of Theorem 1.1, ϕdµ is a relative open subset in Xdµ? The following simple example shows that the answer is in negative. Example 1.2. Let D be a closed circle in R 2 of radius 1 and with the center at point (, 1). Define ϕ : (, 1] D by ϕ(t) = {x D : x < t} for t (, 1]. Clearly, 1 ϕ(t)dt, but is not a relative interior point of 1 ϕ(t)dt in D. In fact, no point of D, except, belongs to 1 ϕ(t)dt. Indeed, take a D, a, and assume, on the contrary, a 1 ϕ(t)dt. Then there exists f L ϕ such that a = 1 f(t)dt. Denote by L the line tangent to D at a. Then if f(t) L on a set of positive measure, we would have a = 1 f(t)dt L. So f(t) L for almost all t (, 1]. Since L D = {a}, and ϕ(t) D for all t (, 1], it follows that f(t) = a almost everywhere on (, 1]. So, we obtain a ϕ(t) almost everywhere on (, 1]. But from the definition of ϕ(t) we have a ϕ(t) for t (, a ). This contradiction proves the assertion. In mathematical economics correspondences with values in a convex (polyhedral) cone, frequently arise. For example, in the classical model of economy involving finitely many (n) different commodities the commodity space is assumed to be the nonnegative orthant R+. n So, the above question is of particular interest, from the viewpoint of mathematical economics, in the case, where X(t) = X is a convex (polyhedral) cone. The idea of Example 1.2 can be extended to show that the answer, in general, is still in negative. Example 1.3. Put D 1 = {x R 3 : x 2 1 + x 2 2 1 and x 3 = 1}, and let C be a cone generated by D 1. Define ϕ : (, 1] C in the following way ϕ(t) = C H(t) where H(t) is that of the two open half-spaces in R 3 defined by the plane through point a(t) = (1,, 1 + t) and coordinate axis x 2, which contains the point (1,, ). Clearly, a() = (1,, 1) ϕ(t) for every t (, 1]. Hence (1,, 1) 1 ϕ(t)dt. But obviously, no point from the relative boundary of D 1 except (1,, 1) belongs to 1 ϕ(t)dt. Hence, (1,, 1) is not a relative interior point of 1 ϕ(t)dt in C. 2. Characterization of polyhedral convex sets We will show that the answer to the above question is in positive in the case of a polyhedral convex cone. Moreover, it will be shown here that for every polyhedral convex set P in R n the following property holds: for an arbitrary probability space (T, Σ, µ), and for an arbitrary correspondence ϕ : T P with relative open values in P, its integral ϕ is a relative open subset of P. It turns out, that polyhedral convex sets form the maximal class of sets in R n possessing this property. To formulate this result we need the following definition. Definition 2.1. A set P in R n is said to be a generalized polyhedral convex set if for each a >, the intersection C a S, where C a = [ a, a] n, is a polytope. Now we are ready to formulate a theorem which characterizes sets with the r.o.i. property.

F. Husseinov / A Characterization of Polyhedral Convex Sets 247 Before we introduce two notions that are used in a proof of this theorem. Definition 2.2. A local cone with the vertex x is an intersection of a convex cone with the vertex at x and an open ball with the center at x. Definition 2.3. A set S in R n is said to be locally conical if for each x S there exsits an open ball B r (x) with center at x such that B r (x) S is a local cone with vertex at x. Theorem 2.4. A convex closed set P in R n possesses the relative openness of integral property, if and only if it is a generalized polyhedral convex set. Proof. Without loss of generality, we assume that P has the full dimension n. First show that if a set P in R n is a generalized polyhedral set, then it possesses the r.o.i. property. This will be done in five steps. Proofs of steps 1,3 and 4 are carried by induction on the dimension n. In all three proofs the case n = 1 is simple. Step 1. For every two relative open subsets A, B in P and α, β, α + β = 1, the set αa + βb is relative open in P. Indeed, let z αa + βb. Then z = αx + βy for some x A, y B. If either x or y is an interior point of P, then obviously, z is an interior point of αa + βb. Assume x, y P. Then two cases are possible: x = y and x y. Consider the case x = y. Then there exists r > such that B r (x) P A B. Since A B αa + βb it follows that B r (x) P αa + βb. That is x is a relative interior point of αa + βb. Let now x y. We will consider two subcases (a) z int P and (b) z P. (a) Denote (x, y) = {(1 t)x + ty < t < 1}. If z int P, then there exists x, y (x, y) int P such that x A, y B and z = αx + βy. Then there exists r > such that B r (x ) A and B r (y ) B. Clearly, B r (z ) = αb r (x ) + βb r (y ) αa + βb. So, z is an interior point of αa + βb. (b) Let z ri F, where F is a maximal proper face of P. Let A A and B B be two convex relative open subsets in P containing x and y, respectively. Then by the induction assumption B r (z) = B r (z) F αa + βb for some r >. Since A and B are relative open, there are x A \ F and y B \ F. Then αx + βy (αa + βb ) \ F. Clearly, co ({αx + βy } B r (z)) αa + βb is a neighborhood of z in P which is contained in αa + βb. So, z is a relative interior point of αa + βb. Let z αa + βb belong to the relative interior of a face F of dimension smaller than n 1. Let F j (j = 1,..., m) be the collection of all maximal proper faces of P containing F. By the induction assumption there exists a convex relative open set U j F j, z U j, such that U j αa + βb (j = 1,..., m). Put U = co( m U j ), and show that U αa+βb (j = 1,..., m). This will finish the proof, because, since U j are relative open in F j (j = 1,..., m), we have that U is relative open in P. Let u U. Then u = m γ ju j, for some u j U j (j = 1,..., m), γ j and m γ j = 1. Then u j = αx j +βy j for some x j A, y j B (j = 1,..., m). It follows that u = γ j u j = α γ j x j + β γ j y j = αx + βy, where x = m γ ju j A and y = m γ jy j B. So, x A, y B, and hence u αa + βb. So, Step 1 is proved.

248 F. Husseinov / A Characterization of Polyhedral Convex Sets Step 2. It follows easily from Step 1 that for an arbitrary finitely many open sets A 1,..., A m P and α 1,..., α m, m α j = 1, m α ja j is relative open in P. Indeed, assume that the assertion is correct for less than m sets. If some of α j is zero, then by the induction assumption m α ja j is relative open in P. Assume α j >, j = 1,..., m. Then m 1 m 1 α j α j A j = α m A m + β β A j, where β = α j. By the induction assumption B = m 1 α j A β j is relative open in P. Then by Step 1, m α ja j = α m A m + (1 α m )B is relative open in P. Step 3. Let A 1, A 2,... be a sequence of relative open sets in P and α j a nonnegative series with sum 1. Then α ja j is a relative open subset of P. Without loss of generality, we can assume that A j (j N) are convex. Let x = α jx j, where x j A j (j N), be an arbitrary point in α ja j. If x is an interior point of P, then by Theorem 1.1, x is an interior point of α ja j. Let now x be a relative interior point of some (n 1) face F of P. Since B j = A j F (j N) is relative open in F, by the induction assumption x is an interior point of α jb j in F. Let a 1,..., a n be affinely independent points in α jb j such that x ri co {a 1,..., a n }. For every j N fix a point x j A j \ F such that x j x j < 1 (j N). Then 2 j α ja j is convex clearly, the series α jx j is convergent and its sum, x F. Since and a 1,..., a n, x α ja j, the simplex Σ with vertices at these points is contained in α ja j. Clearly, Σ is a neighborhood of x in P. Hence x is an interior point of α ja j relative to P. Let now x ri F, where F is a face of P of dimension smaller than n 1, and let F k (k = 1,..., m) be the collection of all (n 1) dimensional faces of P containing x. Then by the induction assumption x is an interior point of α j(a j F k ) (k = 1,..., m) relative to F k, that is there exists U k (k = 1,..., m) a convex neighborhood of x in F k α ja j is convex. Then such that U k α ja j. Since A j (j N) are convex, co ( m k=1 U k), which is a neighborhood of x in α ja j, is contained in α ja j. Step 4. In this step we show that for a generalized polyhedral set P, an atomless probability space (T, Σ, µ) and a correspondence ϕ : T P with relative open values, ϕ is relative open in P. Take z ϕ. Let x L ϕ be such that z = x. If z is an interior point of P, then by Theorem 1.1, z int ( ϕ). Let z P, and let F j (j = 1,..., m) be the collection of all maximal proper faces of P containing z. Since z F j (j = 1,..., m), it follows that for some measurable set T T of full measure, x(t) m F j for all t T. Since set ϕ(t) is relative open in P, sets ϕ j (t) = ϕ(t) F j are relative open in F j (j = 1,..., m) for all t T. Extend ϕ j (j = 1,..., m) into T putting ϕ j (t) = F j (j = 1,..., m) for t T \ T. Then ϕ j : T F j (j = 1,..., m) are measurable correspondences with nonempty relative open values. By the induction assumption, set ϕ j is relative open in F j for j = 1,..., m. Since z ϕ j (j = 1,..., m), there exist relative open sets U j F j (j = 1,..., m) such that z U j ϕ j (j = 1,..., m). Clearly U = co ( m U j ) is a neighborhood of z in P. Since

F. Husseinov / A Characterization of Polyhedral Convex Sets 249 set ϕ j (t) ϕ(t) almost everywhere on T, we have U j ϕ (j = 1,..., m). By Lyapunov Theorem [3], ϕ is a convex set. Hence it contains U. So z is a relative interior point of ϕ. Step 5. This step concludes the proof of the fact that every generalized polyhedral convex set possesses the r.o.i. property. Let A k (k M), where M N, be the set of all atoms in T and let T = T \ ( k M A k ). Then ϕ = T ϕ + k M α kϕ k, where ϕ k = ϕ(a k ) for k M. Denote α = µ(t ). If α > denote µ (E) = 1 α µ(e) for sets from Σ(T ), where Σ(T ) = {E Σ : E T }. Then (T, Σ(T ), µ ) is a probability space and by Step 4, ϕ = T ϕdµ is a relative open subset of P. Obviously, ϕ = T ϕdµ = 1 α T ϕdµ. So ϕ = α ϕ + k M α kϕ k, where ϕ k (k M ) are relative open sets in P, and α k >, k M α k = 1. By Step 3, ϕ is a relative open subset of P. In the next two steps we show that if a set P in R n possesses the r.o.i. property, then it is a generalized polyhedral convex set. Step 6. If a convex closed set P in R n possesses the r.o.i.p. then P is locally conical. Obviously, P is locally conical at x int P. Assume P is not locally conical at x P. Then for each ε > there exists x ε B ε (x) ( P ) such that [x, x ε ] P. Let H ε be a supporting hyperplane of P at x ε. Then x H ε. Otherwise, [x, x ε ] H ε, and hence [x, x ε ] P. Define ϕ : (, 1] P, putting ϕ(t) = B t (x) P for t (, 1]. It is easily shown that x ε ϕ for all ε >. Indeed, since x H ε, x belongs to the open halfspace H ε + defined by H ε, closure of which contains P. Then there exists r > such that B r (x) H ε +. Since ϕ(t) B t (x) for each t (, 1] it follows that ϕ(t) H ε + for t (, r]. This implies that for y( ) L ϕ, y H ε +. Since x ε H ε +, we have from here x ε ϕ for all ε >. So {x ε : ε > } ( ϕ) =, and x ε x < ε for all ε >. That is, we have points in P arbitrarily close to x, not lying in ϕ. Therefore x is not a relative interior point of ϕ. Thus, P does not possess the r.o.i. property. So, we have showed that if P possesses the r.o.i. property, then P is locally conical. Step 7. A locally conical convex closed set is a generalized polyhedral convex set. So, let P be a locally conical convex closed set. Then P [ a, a] n, as the intersection of two locally conical sets, is locally conical for every a >. Hence, it suffices to show that every locally conical convex compact set P is a polytope. Show that every extreme point x in P is isolated. Let C = B r (x) P be a local cone with the vertex at x. Then for an arbitrary point y C, y x we have y ri{(1 t)x+ty t [, b]} C for some number b > 1. So y is not an extreme point of C. We conclude that x is the only extreme point of P in B r (x). Since P is compact and every extreme point in P is isolated it follows that P has only finitely many extreme points. Indeed, assume that there are infinitely many extreme points in P. Then by compactness of P, we have that there exists a convergent sequence {x k } of extreme points with x k x l for k l. Let x k x. Since P is locally conical, there exists r >, such that C = B r (x) P is a local cone. For sufficiently large index k we have x k B r (x). Since x k is an extreme point of P, it is an extreme point of C. But we showed above that in the local cone C all points, perhaps except x, are not extreme points. The obtained contradiction proves that P has only finitely many extreme points. According to the representation theorem [4, Theorem 18.5] P is the convex hull

25 F. Husseinov / A Characterization of Polyhedral Convex Sets of its extreme points. Then P is a polytope. The theorem is proved. Theorem 2.4 contains the following characterization of polytopes. Corollary 2.5. A convex compact set in R n is a polytope if and only if it possesses the relative openness of integral property. When P is a cone in R n Theorem 2.4 implies the following Corollary 2.6. A convex closed cone in R n is polyhedral if and only if it possesses the relative openness of integral property. Acknowledgements. The author is thankful to an anonymous referee for careful reading of the paper resulted in a good many improvements. References [1] B. Grodal: A theorem on correspondences and continuity of the core, in: Differential Games and Related Topics, H. W. Kuhn, G. P. Szego (eds.), North-Holland, Amsterdam (1971) 221 233. [2] F. V. Hüsseinov: Theorems on correspondences and stability of the core, Economic Theory 22(4) (23) 893 92. [3] A. Lyapunov: Sur les fonctions-vecteurs complement additives, Bull. Acad. Sci. USSR, Ser. Math. 4 (194) 465 478. [4] R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton (197).