On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

Affine selections of convex set-valued functions

Summary It is shown that every convex set-valued function defined on a cone with a cone-basis in a real linear space with compact values in a real locally convex space has an affine selection. Similar results can be obtained for midconvex set-valued functions.     

Additive selections of superadditive set-valued functions

Summary A set-valued functionF from a coneC with a cone-basis of a topological vector spaceX into the family of all non-empty compact convex subsets of a locally convex spaceY is called superadditive provided thatF(x) + F(y) F(x + y), for allx, y C. We show that every superadditive set-valued function admits an additive selection.Dedicated to Professor Otto Haupt on his 100th birthday     

On the structure of singular sets of convex functions

Whenf is a convex function ofR ^h, andk is an integer with 0<k, then the set ^k (f)=x:dim(f(x)k may be covered by countably many manifolds of dimensionh–k and classC ² except an _h–k negligible subset.The author is supported by INdAM     

Some representations of midconvex set-valued functions

Summary In this note we establish conditions under which every midconvex set-valued function can be represented as sum of an additive function and a convex set-valued function. These results improve some theorems obtained in [8], [10] and [3]. Some results on local Jensen selections of midconvex set-valued functions are also given.     

On functions behaving like additive functions

Let 0 < 1. In the paper we consider the following inequality: |f(x + y) – f(x) – f(y)| min{|f(x + y)|, |f(x) + f(y)|}, wheref: R R. Solutions and continuous solutions of this inequality are investigated. They have similar properties as additive functions, e.g. if the solution is bounded above (below) on a set of positive inner Lebesgue measure then it is continuous. Some sufficient condition for this inequality is also given.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday     

A functional inequality for real-analytic functions

Summary Forf ( C ⁿ() and 0 t x letJ _n (f, t, x) = (–1)ⁿ f(–x)f ⁽ⁿ⁾(t) +f(x)f ⁽ⁿ⁾ (–t). We prove that the only real-analytic functions satisfyingJ _n (f, t, x) 0 for alln = 0, 1, 2, are the exponential functionsf(x) = c e ^x,c, . Further we present a nontrivial class of real-analytic functions satisfying the inequalitiesJ ₀ (f, x, x) 0 and ₀ ^x (x – t)^{n – 1}J_n(f, t, x)dt 0 (n 1).     

Functional inequality characterizing nonnegative concave functions in (0, ∞) k

Summary In the present note we prove that every functionf: (0, ) [0, ) satisfying the inequalityaf(s) + bf(t) f(as + bt), s, t > 0, for somea andb such that 0 <a < 1 <a + b must be of the formf(t) = f(1)t, (t > 0). This improves our recent result in [2], where the inequality is assumed to hold for alls, t 0, and gives a positive answer to the question raised there.An analogue for functions of several real variables of the above result characterizes concave functions. Conjugate functions and some relations to Hölder's and Minkowski's inequalities are mentioned.     

A functional inequality characterizing convex functions,conjugacy and a generalization of Hölder's and Minkowski's inequalities

Summary The main result says that, iff: _{+ +} satisfies the functional inequalityaf(s) + bf(t) f (as + bt) (s,t 0) for somea, b such that 0 <a < 1 <a + b, thenf(t) = f(1)t, (t 0). A relevant result for the reverse inequality is also discussed. Applying these results we determine the form of all functionsf: _k ⁺ ₊ satisying the above inequalities. This leads to a characterization of both concave and convex functions defined on ₊ ^k–1 , to a notion of conjugate functions and to a general inequality which contains Hölder's and Minkowski's inequalities as very special cases.     

On a problem of Davison

Summary The present note gives an elementary positive answer to a question asked by Davison in the Twenty-seventh International Symposium on Functional Equations.     

Another characterization of convexity for set-valued maps

We give a new necessary and sufficient condition for convexity of a set-valued map F between Banach spaces. It is established for a closed map F having nonconvex values. The main tool in this paper is the coderivative of F which is constructed with the help of an abstract subdifferential notion of Penot . A detailed discussion is devoted to special cases when the contingent, the Fréchet and the Clarke-Rockafellar subdifFerentials Sixe used as this abstract subdifferential.