Preprint
Article

This version is not peer-reviewed.

Harmonically m-Convex Set-Valued Function

Submitted:

03 April 2025

Posted:

07 April 2025

You are already at the latest version

Abstract
This research introduces the concept of harmonically m-convex set-valued functions, combining harmonically m-convex functions and set-valued mappings. We establish fundamental properties and derive a Hermite-Hadamard-type inequality for these functions, generalizing classical results in convex analysis. The study provides a theoretical foundation with potential applications in optimization, variational analysis, and mathematical economics, where set-valued mappings are essential. This work advances the understanding of harmonic convexity in the context of set-valued analysis, offering new insights for both theoretical and applied mathematics.
Keywords: 
;  ;  ;  ;  

1. Introduction

Convexity is a fundamental concept in mathematics with profound applications across various fields of science and engineering. Over the past few decades, the study of convexity has expanded significantly, leading to the development of new generalizations and variants that have enriched the theory and its applications. Among these, harmonic convexity has emerged as a particularly interesting extension, offering unique properties and applications. Harmonic convex functions, introduced by Anderson et al. [1] and further explored by I. Iscan [5], exhibit properties analogous to those of classical convex functions, making them a valuable tool in mathematical analysis. Building on these foundations, Noor et al. [16] introduced the broader class of harmonic h-convex functions, which generalizes many known classes of harmonic convex functions and provides a unified framework for their study.
In parallel, the concept of m-convexity, introduced by G. Toader [19], has gained attention for its ability to model intermediate convexity properties between classical convexity and star-shapedness. This notion has been extended to set-valued functions, which have been a subject of intense research since their introduction by C. Berge [3]. Set-valued functions, which map points to sets rather than single values, have found applications in optimization, control theory, and economics, particularly in problems involving set constraints and inclusions. Recent works, such as those by T. Lara et al. [7], have explored m-convex set-valued functions, providing characterizations, algebraic properties, and examples that highlight their theoretical and practical significance.
Integral inequalities, such as the Hermite-Hadamard inequality, have been a central focus in the study of convex functions and their generalizations. For harmonically convex set-valued functions, Santana et al. [18] established important results, including Hermite-Hadamard and Fejér inequalities, as well as a Bernstein-Doetsch-type theorem. These results have opened new avenues for research and applications in areas such as optimization and variational analysis.
This research introduces the novel concept of harmonically m-convex set-valued functions, which combines the ideas of harmonic convexity, m-convexity, and set-valued mappings. We explore the fundamental properties and characteristics of these functions, providing a comprehensive theoretical framework. Additionally, we derive a new Hermite-Hadamard-type inequality for harmonically m-convex set-valued functions, generalizing classical results and offering new insights into their behavior. This work not only advances the theoretical understanding of convexity and its generalizations but also provides tools with potential applications in optimization, economics, and engineering. By bridging the gap between harmonic convexity and set-valued analysis, this research contributes to the growing body of knowledge in convex analysis and its interdisciplinary applications.

2. Preliminary

As part of our research it is necessary to provide the reader with some preliminary definitions used throughout this investigation in order to lay the foundations for the development of this work.
Definition 1 
(see [6]). Let X a linear space and m ( 0 , 1 ] . A nonempty subset D of X is said to be harmonic m-convex, if for all x , y D and t [ 0 , 1 ] , we have:
m x y t m x + ( 1 t ) y D .
In this case İ. İscan in [6] generalized the harmonically convex function definition introduced in [5] to harmonically ( α , m ) -convex function:
Definition 2 
(see [6]). Let f : D ( 0 , ) R a function. Then, f is said to be harmonically ( α , m ) -convex function if for all α , t [ 0 , 1 ] , m ( 0 , 1 ] and x , y D , we have:
f m x y t m x + ( 1 t ) y t α f ( y ) + m ( 1 t ) α f ( x ) .
Note that if we considered α = 1 in (1), f is said to be a harmonically m-convex function and satisfies the following:
f m x y t m x + ( 1 t ) y t f ( y ) + m ( 1 t ) f ( x ) .
For this kind of functions in [6] obtain the following result:
Theorem 1 
(see [6]). Let f : ( 0 , ) R be a harmonically m-convex function with m ( 0 , 1 ] . If 0 < a < b < and f L [ a , b ] , then one has the inequality:
a b b a a b f ( x ) x 2 d x m i n f ( a ) + f b m 2 , f ( b ) + f a m 2 .
In the other hand, G. Santana et al. [18] in 2018, introduced the definition of harmonically convex set-valued functions, extending the definition given by İ. İscan for real functions (see [5]).
Definition 3 
(see [18]). Let X and Y linear spaces, D a harmonically convex subset of X and F : D X n ( Y ) a set-valued function. Then F is said harmonically convex function if for all x , y D and t [ 0 , 1 ] , we have:
t F ( y ) + ( 1 t ) F ( x ) F x y t x + ( 1 t ) y
Remark 1. 
Throughout this paper n ( Y ) will denote the family of nonempty subsets of Y.
For this kind of functions they obtain many results as algebraic properties, Hermite-Hadamard and Fejer type inequalities and Bernstein-Doetsch type result.
To prove certain algebraic properties of the results in this research, we use two definitions established by T. Lara et al. in 2014 [7].
Definition 4 
(see [7]). Let F 1 , F 2 : D X n ( Y ) be two set-valued functions (or multifunctions) then:
  • The union of F 1 and F 2 is a set-valued function F 1 F 2 : D n ( Y ) given by ( F 1 F 2 ) ( x ) = F 1 ( x ) F 2 ( x ) for each x D .
  • The sum of F 1 and F 2 is the function F 1 + F 2 : D n ( Y ) defined in its usual form ( F 1 + F 2 ) ( x ) = F 1 ( x ) + F 2 ( x ) for each x D .
Definition 5 
(see [7]). Let X , Y , Z be linear spaces and D be a subset of X. Then:
  • If F 1 : D n ( Y ) and F 2 : D n ( Z ) , then the cartesian product function of F 1 and F 2 is the set-valued function F 1 × F 2 : D n ( Y ) × n ( Z ) given by ( F 1 × F 2 ) ( x ) = F 1 ( x ) × F 2 ( x ) for each x D .
  • If F 1 : D n ( Y ) and F 2 : n ( Y ) n ( Z ) , then the composition function of F 1 and F 2 is the set-valued function F 2 F 1 : D n ( Z ) given by
    ( F 2 F 1 ) ( x ) = F 2 ( F 1 ( x ) ) = y F 1 ( x ) F 2 ( y ) ,
    for each x D .
Following the idea establish in [18], in this paper we extend that definition and introduce a new concept of convexity, combining the definitions of harmonically m-convex functions and set-valued functions. Then we define the following:
Definition 6. 
Let X and Y be linear spaces, D a harmonically m-convex subset of X and F : D X n ( Y ) a set-valued function. It said that F is said harmonically m-convex function if for all x , y D , t [ 0 , 1 ] , and m ( 0 , 1 ] , we have:
t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y .
We have some examples of this kind of function.
Example 1. 
Let f 1 , ( f 2 ) : [ a , b ] R R be harmonically m-convex functions with f 1 ( x ) f 2 ( x ) for all x [ a , b ] . Then, the set-valued function F : D X n ( Y ) defined by F ( x ) = [ f 1 ( x ) , f 2 ( x ) ] is harmonically m-convex.
In fact, since f 1 and f 2 are harmonically m-convex functions, then for all x , y D , t [ 0 , 1 ] and m ( 0 , 1 ] , we have:
f 1 m x y t m x + ( 1 t ) y t f 1 ( y ) + m ( 1 t ) f 1 ( x ) ,
and
f 2 m x y t m x + ( 1 t ) y ( t f 2 ( y ) + m ( 1 t ) f 2 ( x ) ) ,
if we multiply ( 1 ) to both sides of the last inequality, we have:
f 2 m x y t m x + ( 1 t ) y t f 2 ( y ) + m ( 1 t ) f 2 ( x ) ,
Then,
[ t f 1 ( y ) + m ( 1 t ) f 1 ( x ) , t f 2 ( y ) + m ( 1 t ) f 2 ( x ) ] f 1 m x y t m x + ( 1 t ) y , f 2 m x y t m x + ( 1 t ) y
from (3) we obtain with a elementary calculus that
t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y .
Example 2. 
Let H R 3 a harmonically m-convex subset, F : R n ( R ) a set-valued function defined by F ( x ) = f ( x ) H , where f ( x ) = x 2 is a harmonically m-convex function.
Then, since f ( x ) = x 2 is a harmonically m-convex function by definition, we have for all x , y D , t [ 0 , 1 ] and m ( 0 , 1 ] that
m x y t m x + ( 1 t ) y 2 t ( y ) 2 + m ( 1 t ) ( x ) 2 ,
using the harmonically m-convex properties of H we have to
( t ( y ) 2 + m ( 1 t ) ( x ) 2 ) H m x y t m x + ( 1 t ) y 2 H ,
then,
( t ( y ) 2 + m ( 1 t ) ( x ) 2 ) H = t ( y ) 2 H + m ( 1 t ) ( x ) 2 H = t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y .
Thus F is a harmonically m-convex set-valued function.

3. Main Results

The results obtained in this paper are based on the developments and ideas of İ. Iscan en [6] and T. Lara et al. in [7]. The following proposition establishes a property over harmonic m-convex set.
Proposition 1. 
Let harmonic m-convex ( m 1 ) subset D of X is said to be starshaped if, for all x in D and all t in the interval ( 0 , 1 ] , the point t x also belongs to D. That is:
t D D .
Proof. 
Let D be a harmonically m-convex subset of X. If D is an empty set, there is nothing to prove. If, on the contrary, we consider D a nonempty set, let x D then the point x = m a b t m a + ( 1 t ) b D for everything a , b D and t [ 0 , 1 ] . Thus, [ m , 1 ] x = { r x : m r 1 } D , in particular m x D . If m = 0 , then [ 0 , 1 ] x D , we got the desired result.
In the case m > 0 , we similarly repeat the previous argument for m x (instead of x), in this case we have to [ m 2 , m ] x = [ m , 1 ] m x D .
Inductively, we have that [ m n , m n 1 ] x D for all n N . Therefore ( 0 , 1 ] x = n = 1 [ m n , m n 1 ] x D . Thus D satisfies t D D for t ( 0 , 1 ] . □
For harmonically m-convex set-valued functions we obtain the following results:
Proposition 2. 
Let F 1 , F 2 : D n ( Y ) be harmonically m-convex set-valued functions with F 1 ( x ) F 2 ( x ) (or F 2 ( x ) F 1 ( x ) ) for each x D . Then the union of F 1 and F 2 ( F 1 F 2 ) is a harmonically m-convex set-valued function.
Proof. 
Let F 1 , F 2 be harmonically m-convex set-valued function with x , y D , t [ 0 , 1 ] and m ( 0 , 1 ] . Let’s assume F 1 ( x ) F 2 ( x ) (in the case F 2 ( x ) F 1 ( x ) is analogous) for each x D , then:
t ( F 1 F 2 ) ( y ) + m ( 1 t ) ( F 1 F 2 ) ( x ) = t ( F 1 ( y ) F 2 ( y ) ) + m ( 1 t ) ( F 1 ( x ) F 2 ( x ) = t F 2 ( y ) + m ( 1 t ) F 2 ( x ) F 2 m x y t m x + ( 1 t ) y = F 1 m x y t m x + ( 1 t ) y F 2 m x y t m x + ( 1 t ) y = ( F 1 F 2 ) m x y t m x + ( 1 t ) y .
Proposition 3. 
If F : D X n ( Y ) is a harmonically m-convex set-valued function, then the image of F of any harmonically m-convex subset of D is a m-convex set of Y.
Proof. 
Let A be a harmonically m-convex subset of D X and a , b F ( A ) = z A F ( z ) . Then a F ( x ) and b F ( y ) for some x , y A . Thus, for all t [ 0 , 1 ] and m ( 0 , 1 ] , we have to:
t b + m ( 1 t ) a t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y .
Since A is harmonically m-convex set, we have m x y t m x + ( 1 t ) y A and t b + m ( 1 t ) a F ( A ) for all t [ 0 , 1 ] . Which implies that F ( A ) is a m-convex set of Y. □
Corollary 1. 
If F : D X n ( Y ) is a harmonically m-convex set-valued function, then the range of F is a m-convex set of Y.
Proof. 
If we consider A = D in Proposition 10 we get that R a n g ( F ) = F ( D ) . □
Proposition 4. 
A set-valued function F : D n ( Y ) is harmonically m-convex, if and only if,
t F ( B ) + m ( 1 t ) F ( A ) F m A B t m A + ( 1 t ) B ,
for each A , B D , t [ 0 , 1 ] and m ( 0 , 1 ] .
Proof. ( ) Let A , B be arbitrary subsets of D, t [ 0 , 1 ] and m ( 0 , 1 ] . Let x t ( F ( B ) = b B F ( b ) ) + m ( 1 t ) F ( ( A ) = a A F ( a ) , that is to say x t F ( b ) + m ( 1 t ) F ( a ) for some a A and b B . Since F is harmonically m-convex and a , b D , it follows that:
t F ( b ) + m ( 1 t ) F ( a ) F m a b t m a + ( 1 t ) b ,
moreover, m a b t m a + ( 1 t ) b m A B t m A + ( 1 t ) B and, in consequence,
F m a b t m a + ( 1 t ) b F m A B t m A + ( 1 t ) B .
Therefore, x F m A B t m A + ( 1 t ) B .
( ) For x , y D t [ 0 , 1 ] and m ( 0 , 1 ] , the result is obtained by replacing A = { x } and B = { y } in (7) and we obtain the desired result
t F ( { y } ) + m ( 1 t ) F ( { x } ) F m { x } { y } t m { x } + ( 1 t ) { y } .
Then, F is a harmonically m-convex set-valued function. □
In the following, consider that for nonempty linear space subsets A , B , C , D and α a scalar, the following properties are true:
  • α ( A × B ) = α A × α B ,
  • ( A × C ) + ( B × D ) = ( A + B ) × ( C + D ) ,
  • Si A B y C D then A × C B × D .
Proposition 5. 
Let F 1 : D n ( Y ) and F 2 : D n ( Z ) harmonically m-convex set-valued functions. Then the cartesian product F 1 × F 2 is a harmonically m-convex set-valued function.
Proof. 
Let x , y D and t [ 0 , 1 ] , then:
t ( F 1 × F 2 ) ( y ) + m ( 1 t ) ( F 1 × F 2 ) ( x ) = [ t F 1 ( y ) × t F 2 ( y ) ] + [ m ( 1 t ) F 1 ( x ) × m ( 1 t ) F 2 ( x ) ] = ( t F 1 ( y ) + m ( t 1 ) F 1 ( x ) ) × ( t F 2 ( y ) + m ( t 1 ) F 2 ( x ) ) F 1 m x y t m x + ( 1 t ) y × F 2 m x y t m x + ( 1 t ) y = ( F 1 × F 2 ) m x y t m x + ( 1 t ) y .
The following proposition establishes that the harmonically m-convex set-valued function are closed under the sum and the product by a scalar.
Proposition 6. 
Let X , Y be two linear spaces. If D is a harmonically m-convex subset of X and F , G : D X n ( Y ) two harmonically m-convex set-valued functions. Then λ F + G is a harmonically m-convex set-valued function, for all λ.
Proof. 
Let x , y D X , t [ 0 , 1 ] and m ( 0 , 1 ] . Since F and G are harmonically m-convex set-valued functions, we have:
t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y ,
and,
t G ( y ) + m ( 1 t ) G ( x ) G m x y t m x + ( 1 t ) y .
Thus,
t ( λ F + G ) ( y ) + m ( 1 t ) ( λ F + G ) ( x ) = [ t ( λ F ( y ) ) + m ( 1 t ) ( λ F ( x ) ) ] + [ t G ( y ) + m ( 1 t ) G ( x ) ] λ F m x y t m x + ( 1 t ) y + G m x y t m x + ( 1 t ) y = ( λ F + G ) m x y t m x + ( 1 t ) y .
Proposition 7. 
Let x , Y be two linear spaces. If D is a harmonically m-convex subset of X and F , G : D X n ( Y ) two harmonically m-convex set-valued functions then ( F · G ) ( x ) is also harmonically m-convex set-valued function.
Proof. 
First, from [18], we have that.
F ( x 1 ) G ( x 2 ) + F ( x 2 ) G ( x 1 ) F ( x 1 ) G ( x 1 ) + F ( x 2 ) G ( x 2 ) .
Then, for t [ 0 , 1 ] and x 1 , x 2 D :
( F · G ) m x 1 x 2 m t x 1 + ( 1 t ) x 2 = F m x 1 x 2 m t x 1 + ( 1 t ) x 2 · G m x 1 x 2 m t x 1 + ( 1 t ) x 2 [ t F ( x 1 ) + m ( 1 t ) F ( x 2 ) ] [ t G ( x 1 ) + m ( 1 t ) G ( x 2 ) ] = t 2 F ( x 1 ) G ( x 1 ) + m t ( 1 t ) F ( x 1 ) G ( x 2 ) + m t ( 1 t ) F ( x 2 ) G ( x 1 ) + m 2 ( 1 t ) 2 F ( x 2 ) G ( x 2 ) = t 2 F ( x 1 ) G ( x 1 ) + m t ( 1 t ) [ F ( x 1 ) G ( x 2 ) + F ( x 2 ) G ( x 1 ) ] m 2 ( 1 t ) 2 F ( x 2 ) G ( x 2 ) t 2 F ( x 1 ) G ( x 1 ) + m t ( 1 t ) [ F ( x 1 ) G ( x 1 ) + F ( x 2 ) G ( x 2 ) ] + m 2 ( 1 t ) 2 F ( x 2 ) G ( x 2 ) = t [ t + m ( 1 t ) ] F ( x 1 ) G ( x 1 ) + [ m ( 1 t ) [ t + m ( 1 t ) ] F ( x 2 ) G ( x 2 ) ] t F ( x 1 ) G ( x 1 ) + m ( 1 t ) F ( x 2 ) G ( x 2 ) .
This shows that the product of two harmonically m-convex set-valued functions is again harmonically m-convex set-valued function. □
The following result follows the idea of İ. İscan in [6]. To integrate set-valued functions we use the definition given by R. J. Aumann, and if a function satisfies the requirements of being integrable under this integral definition given, we say that a set-valued function F is Aumann integrable under a certain domain (see [2]).
Theorem 2. 
Let X , Y linear spaces, D be a harmonically m-convex subset of X and F : D X n ( Y ) a harmonically m-convex set-valued Aumann integrable function, then
min inf F ( a ) + m F b m 2 , inf m F a m + F ( b ) 2 a b b a a b F ( x ) x 2 d x .
Proof. 
Let F : D X n ( Y ) be a harmonically m-convex set-valued function, for every x , y D we have to
t F ( y ) + m ( 1 t ) F x m F x y t x + ( 1 t ) y = F m x m y t m x m + ( 1 t ) y ,
Then, we have the following:
t F ( b ) + m ( 1 t ) F a m F a b t a + ( 1 t ) b ,
and
t F ( a ) + m ( 1 t ) F b m F a b t b + ( 1 t ) a ,
for every t [ 0 , 1 ] , m ( 0 , 1 ] and a , b D . Integrating both sides of (8) on [ 0 , 1 ] with respect to t, we get that
0 1 t F ( b ) + m ( 1 t ) F a m d t 0 1 F a b t a + ( 1 t ) b d t .
Integrating the left side of (9) we have:
0 1 t F ( b ) + m ( 1 t ) F a m d t = F ( b ) + m F a m 2 .
By the Aumann integral definition we get, that integral on the right hand of (9) is defined as:
0 1 F a b t a + ( 1 t ) b d t = 0 1 f a b t a + ( 1 t ) b d t : f ( x ) F ( x ) t [ 0 , 1 ] .
But,
0 1 f a b t a + ( 1 t ) b d t = a b b a a b f ( x ) x 2 d x ,
then
a b b a a b f ( x ) x 2 d x : f ( x ) F ( x ) x [ a , b ] = a b b a a b F ( x ) x 2 d x .
In consecuense:
F ( b ) + m F a m 2 a b b a a b F ( x ) x 2 d x .
Similarly, we have that:
F ( a ) + m F b m 2 a b b a a b F ( x ) x 2 d x ,
so the required result is obtained.
min inf F ( a ) + m F b m 2 , inf m F a m + F ( b ) 2 a b b a a b F ( x ) x 2 d x .

4. Results

The results obtained in this paper are based on the developments and ideas of İ. Iscan en [6] and T. Lara et al. in [7]. The following proposition establishes a property over harmonic m-convex set.
Proposition 8. 
Let harmonic m-convex ( m 1 ) subset D of X is said to be starshaped if, for all x in D and all t in the interval ( 0 , 1 ] , the point t x also belongs to D. That is:
t D D .
Proof. 
Let D be a harmonically m-convex subset of X. If D is an empty set, there is nothing to prove. If, on the contrary, we consider D a nonempty set, let x D then the point x = m a b t m a + ( 1 t ) b D for everything a , b D and t [ 0 , 1 ] . Thus, [ m , 1 ] x = { r x : m r 1 } D , in particular m x D . If m = 0 , then [ 0 , 1 ] x D , we got the desired result.
In the case m > 0 , we similarly repeat the previous argument for m x (instead of x), in this case we have to [ m 2 , m ] x = [ m , 1 ] m x D .
Inductively, we have that [ m n , m n 1 ] x D for all n N . Therefore ( 0 , 1 ] x = n = 1 [ m n , m n 1 ] x D . Thus D satisfies t D D for t ( 0 , 1 ] . □
For harmonically m-convex set-valued functions we obtain the following results:
Proposition 9. 
Let F 1 , F 2 : D n ( Y ) be harmonically m-convex set-valued functions with F 1 ( x ) F 2 ( x ) (or F 2 ( x ) F 1 ( x ) ) for each x D . Then the union of F 1 and F 2 ( F 1 F 2 ) is a harmonically m-convex set-valued function.
Proof. 
Let F 1 , F 2 be harmonically m-convex set-valued function with x , y D , t [ 0 , 1 ] and m ( 0 , 1 ] . Let’s assume F 1 ( x ) F 2 ( x ) (in the case F 2 ( x ) F 1 ( x ) is analogous) for each x D , then:
t ( F 1 F 2 ) ( y ) + m ( 1 t ) ( F 1 F 2 ) ( x ) = t ( F 1 ( y ) F 2 ( y ) ) + m ( 1 t ) ( F 1 ( x ) F 2 ( x ) = t F 2 ( y ) + m ( 1 t ) F 2 ( x ) F 2 m x y t m x + ( 1 t ) y = F 1 m x y t m x + ( 1 t ) y F 2 m x y t m x + ( 1 t ) y = ( F 1 F 2 ) m x y t m x + ( 1 t ) y .
Proposition 10. 
If F : D X n ( Y ) is a harmonically m-convex set-valued function, then the image of F of any harmonically m-convex subset of D is a m-convex set of Y.
Proof. 
Let A be a harmonically m-convex subset of D X and a , b F ( A ) = z A F ( z ) . Then a F ( x ) and b F ( y ) for some x , y A . Thus, for all t [ 0 , 1 ] and m ( 0 , 1 ] , we have to:
t b + m ( 1 t ) a t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y .
Since A is harmonically m-convex set, we have m x y t m x + ( 1 t ) y A and t b + m ( 1 t ) a F ( A ) for all t [ 0 , 1 ] . Which implies that F ( A ) is a m-convex set of Y. □
Corollary 2. 
If F : D X n ( Y ) is a harmonically m-convex set-valued function, then the range of F is a m-convex set of Y.
Proof. 
If we consider A = D in Proposition 10 we get that R a n g ( F ) = F ( D ) . □
Proposition 11. 
A set-valued function F : D n ( Y ) is harmonically m-convex, if and only if,
t F ( B ) + m ( 1 t ) F ( A ) F m A B t m A + ( 1 t ) B ,
for each A , B D , t [ 0 , 1 ] and m ( 0 , 1 ] .
Proof. ( ) Let A , B be arbitrary subsets of D, t [ 0 , 1 ] and m ( 0 , 1 ] . Let x t ( F ( B ) = b B F ( b ) ) + m ( 1 t ) F ( ( A ) = a A F ( a ) , that is to say x t F ( b ) + m ( 1 t ) F ( a ) for some a A and b B . Since F is harmonically m-convex and a , b D , it follows that:
t F ( b ) + m ( 1 t ) F ( a ) F m a b t m a + ( 1 t ) b ,
moreover, m a b t m a + ( 1 t ) b m A B t m A + ( 1 t ) B and, in consequence,
F m a b t m a + ( 1 t ) b F m A B t m A + ( 1 t ) B .
Therefore, x F m A B t m A + ( 1 t ) B .
( ) For x , y D t [ 0 , 1 ] and m ( 0 , 1 ] , the result is obtained by replacing A = { x } and B = { y } in (7) and we obtain the desired result
t F ( { y } ) + m ( 1 t ) F ( { x } ) F m { x } { y } t m { x } + ( 1 t ) { y } .
Then, F is a harmonically m-convex set-valued function. □
In the following, consider that for nonempty linear space subsets A , B , C , D and α a scalar, the following properties are true:
  • α ( A × B ) = α A × α B ,
  • ( A × C ) + ( B × D ) = ( A + B ) × ( C + D ) ,
  • Si A B y C D then A × C B × D .
Proposition 12. 
Let F 1 : D n ( Y ) and F 2 : D n ( Z ) harmonically m-convex set-valued functions. Then the cartesian product F 1 × F 2 is a harmonically m-convex set-valued function.
Proof. 
Let x , y D and t [ 0 , 1 ] , then:
t ( F 1 × F 2 ) ( y ) + m ( 1 t ) ( F 1 × F 2 ) ( x ) = [ t F 1 ( y ) × t F 2 ( y ) ] + [ m ( 1 t ) F 1 ( x ) × m ( 1 t ) F 2 ( x ) ] = ( t F 1 ( y ) + m ( t 1 ) F 1 ( x ) ) × ( t F 2 ( y ) + m ( t 1 ) F 2 ( x ) ) F 1 m x y t m x + ( 1 t ) y × F 2 m x y t m x + ( 1 t ) y = ( F 1 × F 2 ) m x y t m x + ( 1 t ) y .
The following proposition establishes that the harmonically m-convex set-valued function are closed under the sum and the product by a scalar.
Proposition 13. 
Let X , Y be two linear spaces. If D is a harmonically m-convex subset of X and F , G : D X n ( Y ) two harmonically m-convex set-valued functions. Then λ F + G is a harmonically m-convex set-valued function, for all λ.
Proof. 
Let x , y D X , t [ 0 , 1 ] and m ( 0 , 1 ] . Since F and G are harmonically m-convex set-valued functions, we have:
t F ( y ) + m ( 1 t ) F ( x ) F m x y t m x + ( 1 t ) y ,
and,
t G ( y ) + m ( 1 t ) G ( x ) G m x y t m x + ( 1 t ) y .
Thus,
t ( λ F + G ) ( y ) + m ( 1 t ) ( λ F + G ) ( x ) = [ t ( λ F ( y ) ) + m ( 1 t ) ( λ F ( x ) ) ] + [ t G ( y ) + m ( 1 t ) G ( x ) ] λ F m x y t m x + ( 1 t ) y + G m x y t m x + ( 1 t ) y = ( λ F + G ) m x y t m x + ( 1 t ) y .
Proposition 14. 
Let x , Y be two linear spaces. If D is a harmonically m-convex subset of X and F , G : D X n ( Y ) two harmonically m-convex set-valued functions then ( F · G ) ( x ) is also harmonically m-convex set-valued function.
Proof. 
First, from [18], we have that.
F ( x 1 ) G ( x 2 ) + F ( x 2 ) G ( x 1 ) F ( x 1 ) G ( x 1 ) + F ( x 2 ) G ( x 2 ) .
Then, for t [ 0 , 1 ] and x 1 , x 2 D :
( F · G ) m x 1 x 2 m t x 1 + ( 1 t ) x 2 = F m x 1 x 2 m t x 1 + ( 1 t ) x 2 · G m x 1 x 2 m t x 1 + ( 1 t ) x 2 [ t F ( x 1 ) + m ( 1 t ) F ( x 2 ) ] [ t G ( x 1 ) + m ( 1 t ) G ( x 2 ) ] = t 2 F ( x 1 ) G ( x 1 ) + m t ( 1 t ) F ( x 1 ) G ( x 2 ) + m t ( 1 t ) F ( x 2 ) G ( x 1 ) + m 2 ( 1 t ) 2 F ( x 2 ) G ( x 2 ) = t 2 F ( x 1 ) G ( x 1 ) + m t ( 1 t ) [ F ( x 1 ) G ( x 2 ) + F ( x 2 ) G ( x 1 ) ] m 2 ( 1 t ) 2 F ( x 2 ) G ( x 2 ) t 2 F ( x 1 ) G ( x 1 ) + m t ( 1 t ) [ F ( x 1 ) G ( x 1 ) + F ( x 2 ) G ( x 2 ) ] + m 2 ( 1 t ) 2 F ( x 2 ) G ( x 2 ) = t [ t + m ( 1 t ) ] F ( x 1 ) G ( x 1 ) + [ m ( 1 t ) [ t + m ( 1 t ) ] F ( x 2 ) G ( x 2 ) ] t F ( x 1 ) G ( x 1 ) + m ( 1 t ) F ( x 2 ) G ( x 2 ) .
This shows that the product of two harmonically m-convex set-valued functions is again harmonically m-convex set-valued function. □
The following result follows the idea of İ. İscan in [6]. To integrate set-valued functions we use the definition given by R. J. Aumann, and if a function satisfies the requirements of being integrable under this integral definition given, we say that a set-valued function F is Aumann integrable under a certain domain (see [2]).
Theorem 3. 
Let X , Y linear spaces, D be a harmonically m-convex subset of X and F : D X n ( Y ) a harmonically m-convex set-valued Aumann integrable function, then
min inf F ( a ) + m F b m 2 , inf m F a m + F ( b ) 2 a b b a a b F ( x ) x 2 d x .
Proof. 
Let F : D X n ( Y ) be a harmonically m-convex set-valued function, for every x , y D we have to
t F ( y ) + m ( 1 t ) F x m F x y t x + ( 1 t ) y = F m x m y t m x m + ( 1 t ) y ,
Then, we have the following:
t F ( b ) + m ( 1 t ) F a m F a b t a + ( 1 t ) b ,
and
t F ( a ) + m ( 1 t ) F b m F a b t b + ( 1 t ) a ,
for every t [ 0 , 1 ] , m ( 0 , 1 ] and a , b D . Integrating both sides of (8) on [ 0 , 1 ] with respect to t, we get that
0 1 t F ( b ) + m ( 1 t ) F a m d t 0 1 F a b t a + ( 1 t ) b d t .
Integrating the left side of (9) we have:
0 1 t F ( b ) + m ( 1 t ) F a m d t = F ( b ) + m F a m 2 .
By the Aumann integral definition we get, that integral on the right hand of (9) is defined as:
0 1 F a b t a + ( 1 t ) b d t = 0 1 f a b t a + ( 1 t ) b d t : f ( x ) F ( x ) t [ 0 , 1 ] .
But,
0 1 f a b t a + ( 1 t ) b d t = a b b a a b f ( x ) x 2 d x ,
then
a b b a a b f ( x ) x 2 d x : f ( x ) F ( x ) x [ a , b ] = a b b a a b F ( x ) x 2 d x .
In consecuense:
F ( b ) + m F a m 2 a b b a a b F ( x ) x 2 d x .
Similarly, we have that:
F ( a ) + m F b m 2 a b b a a b F ( x ) x 2 d x ,
so the required result is obtained.
min inf F ( a ) + m F b m 2 , inf m F a m + F ( b ) 2 a b b a a b F ( x ) x 2 d x .

Acknowledgments

Special thanks to Dr. Nelson Merentes for his invaluable guidance on the problem and his contributions of articles for review.

References

  1. Anderson, G. D.; Vamanamurthy, M. K.; Vuorinen, M. Generalized convexity and inequalities. Journal of Mathematical Analysis and Applications 2007, 335(2), 1294–1308. [Google Scholar] [CrossRef]
  2. Aumann, R. J. Integrals of set-valued functions. Journal of mathematical analysis and applications 1965, 12(1), 1–12. [Google Scholar] [CrossRef]
  3. Berge, C. Topological Space: Including a treatment of Multi-Valued functions, vector spaces and convexity; Dover Publications, INC. Mineola, New York., 1963. [Google Scholar]
  4. Geletu, A. Introduction to topological spaces and set-valued maps (Lecture notes); Department of Operations Research & Stochastics Ilmenau University of Technology, 2006. [Google Scholar]
  5. İscan, İ. Hermite-Hadamard type inequalities for harmonically convex functions. Hacettepe Journal of Mathematics and statistics 2014, 43(6), 935–942. [Google Scholar] [CrossRef]
  6. İscan, İ. Hermite-Hadamard type inequalities for harmonically (α,m)-convex functions. Hacettepe Journal of Mathematics and Statistics 2016, 45(2), 381–390. [Google Scholar] [CrossRef]
  7. Lara., T.; Merentes, N.; Quintero, R.; Rosales, E. On m-convexity of set-valued functions. Advance in Operator Theory 2019, 4(14), 767–783. [Google Scholar] [CrossRef]
  8. Leiva, H.; Merentes, N.; Nikodem, K.; Sánchez, J. L. Strongly convex set-valued maps. Journal of Global Optimization 2013, 57(3), 695–705. [Google Scholar] [CrossRef]
  9. Matkowski, J.; Nikodem, K. Convex set-valued functions on (0, +1) and their conjugate. Rocznik Nauk.-Dydakt. Prace Mat. No. 15 1998, 103–107. [Google Scholar]
  10. Mejıa, O.; Merentes, N.; Nikodem, K. Strongly concave set-valued maps. Mathematica Aeterna 2014, 4, 477–487. [Google Scholar]
  11. Merentes, N.; Ribas, S. El desarrollo del concepto de función convexa; Ediciones IVIC, Caracas-Venezuela, 2013. [Google Scholar]
  12. Narváez, D. X.; Restrepo, G. Funciones Multivaluadas. Facultad de Ciencias Naturales y Exactas Universidad del Valle. Revista de Ciencias, septiembre 20. 2011. [Google Scholar]
  13. Nikodem, K. On concave and midpoint concave set-valued functions. Glasnik Mat. Ser. III 1987, 22(42), 69–76. [Google Scholar]
  14. Nikodem, K. A characterization of midconvex set-valued functions. Acta Universitatis Carolinae. Mathematica et Physica 1989, 30(2), 125–129. [Google Scholar]
  15. Nikodem, K.; Sánchez, J. L.; Sánchez, L. Jensen and Hermite-Hadamard inequalities for strongly convex set-valued maps. Mathematica Aeterna 2014, 4(8), 979–987. [Google Scholar]
  16. Noor, M. A.; Noor, K. I.; Awan, M. U.; Costache, S. Some integral inequalities for harmonically h-convex functions. Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys 2015, 77(1), 5–16. [Google Scholar]
  17. Sadowska, E. A sandwich with convexity for set-valued functions. Mathematica Pannonica 1996, 7(1), 163–169. [Google Scholar]
  18. Santana, G.; González, L.; Merentes, N. Funciones conjunto valuadas armónicamente convexas. Divulgaciones Matemáticas 2019, 19(1), 20–33. [Google Scholar]
  19. Toader, G. H. Some generalizations of the convexity. In Proc. Colloq. Approx. Optim; Cluj-Napoca, October 1984; Vol. 329, p. p. 338. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated