1. Introduction
The term convexity is one of the most elegant, natural and fundamental notations in mathematics, and for the first time in the year 1934, it was used widely in the classical and tremendous book
Inequalities, which is written by great mathematicians Hardy, Littlewood and Pólya [
1]. The theory of convexity presents a very impressive, remarkable and mesmerizing field of research activities. This theory has a large number of potential applications in many absorbing and worthy fields of research. Furthermore, this theory also plays a magnificent role in many different areas, such as information theory, coding theory, optimization, engineering and inequality theory. Mathematicians have proposed several new notions of classical convexity in the literature (see [
2,
3,
4,
5,
6,
7,
8]) and focused on the concept of convex functions, generalizing its variant forms in different ways using innovative ideas and fruitful techniques. In this aspect, integral inequalities have performed a vital role in defining real-world problems. In this setting, Hermite–Hadamard [
9] type inequalities are influential in convexity theory.
Theories of inequality along with convexity properties play an essential part in the present-day mathematical investigation. In literature there exists several well-known mathematical inequalities, but the Hermite–Hadamard inequality is considered the most and holds a special place in the subject of convex analysis. This inequality asserts that the mean value of the integral of the convex function on an interval, say [a,b], interpolates between the mapping of the arithmetic means of the limit points of the interval and the arithmetic mean of the mappings of the limits of the interval [a,b]. This inequality uncovers the connection among the integral mean of a convex function, mean of mappings and mapping of the arithmetic mean of limits of the integration. A large number of research articles have been written during the last decade by several mathematicians who give new proof, generalizations, extensions and refinements of this inequality. The subject inequalities have a lot of investigations and applications in the variability of applied science, for example, coding theory, geometric function theory, impulsive diffusion equations, numerical analysis and fractional calculus. For the attention of the readers, see the references [
10,
11,
12].
In 1985, G. Toader [
13] for the first time explored the new family of convex functions, namely
m–convex functions. After the contribution of Toader, Latif [
14] and Kalsoom [
15] polished the idea of preinvexity and explored the new notion of preinvexity namely
m–preinvexity. Recently, Toplu [
16] investigated an
n–polynomial convexity and established a new version of Hermite–Hadamard type inequality for the newly introduced function. Noor and his team then generalized the concept of
n–polynomial convexity to
n–polynomial harmonic convexity. Moreover, some refinements of this class of convexity are being widely studied by Tariq and his collaborators for
n–polynomial exponentially convex function. Now, we list some of their work on
n–polynomial convexity for references, where they introduced
n–polynomial exponentially convex function [
17], generalized harmonic exponential convex function [
18], generalized exponential type convex function [
19], studied some of algebraic properties and presented a few new kinds of Hermite–Hadamard type inequalities. Very recently, İşcan [
20] in his paper introduced a new function, namely an
n–polynomial
s–type convex function. Park et al. [
21] and Chen et al. [
22] investigated n–polynomial p-convexity and established some related integral inequalities. Awan et al. [
23] generalized the harmonic convex function to n–polynomial harmonically convex function and presented related Hermite–Hadamard inequalities.
The aim of this paper is to introduce a new class of n-polynomial preinvex function called n–polynomial s-type m-preinvex function. We elaborate on some algebraic properties and examples in the manner of the newly introduced definition. The new version of Hermite–Hadamard and its refinements in the support of this newly introduced concept are investigated.
2. Preliminaries
Now, we present some known concepts which have helped us extensively throughout the paper to establish our main results.
Definition 1 ([
24])
. A set is said to be m–invex w.r.t , if holds for every , and . Example 1 ([
24])
. Let and Then, the above set for all the mentioned conditions is an m–invex set but not convex set.
In the year 1988, mathematicians Weir and Mond [
25] used the idea of invex set and explored the idea of preinvexity.
Definition 2 ([
25])
. Suppose be an invex set w.r.t . Then, is known as preinvex w.r.t η if Later on, several mathematicians studied and collaborated their thoughts on the concept of preinvexity. For some related works, we refer the readers to see the published articles [
26,
27,
28,
29].
From the last current decade, several mathematicians improved and worked on the concept of preinvex function in variant ways. Recently, Kalsoom [
15] investigated and explored a generalized version of preinvexity i.e., generalized
m–preinvex function, which is stated as:
Definition 3. Suppose ψ is said to be a generalized m–preinvex with respect to for fixed , ifholds for every . Definition 4 ([
20])
. A non-negative function is said to be s–type convex function if ∀ , and if Definition 5 ([
16])
. A non-negative real-valued function is known as n–polynomial convex function, if holds for every , , and . Mohan and Neogy [
30] gave the following hypothesis which is widely used in the concept of preinvexity.
Condition-C: Let
be an open invex subset with respect to
. For any
and
,
For any
and
from Condition C, we have
The above Condition C is also presented by the name of extended Condition C in the sense of
m–preinvexity by Ting Song Du [
31].
Extended Condition-C: Let
be an open
m–invex subset with respect to
, for any
,
. We then have
Definition 6 ([
3])
. Suppose ∀, then an inequality of the form is known as similarly ordered. Studying the above concepts and energized by the ongoing research activities, the article is structured as follows. In
Section 3, we discuss the notion of
n–polynomial
s–type
m–preinvexity and studied related properties.
Section 4 deals with establishing a new sort of Hermite–Hadamard type inequality. In
Section 5, two new integral identities are established, based on these identities and with the help of the new notion of preinvexity, some refinements and estimations of Hermite–Hadamard type inequality are given. In the last
Section 6, a brief conclusion and the future scopes are discussed.
3. Generalized Preinvex Function and Its Properties
Here, we are going to elaborate the new notion for convex functions which is called generalized preinvex function, i.e., n–polynomial s–type m–preinvex function, and study some of its algebraic properties and examples.
Definition 7. Suppose be a nonempty m–invex set w.r.t . Then, is known as n–polynomial s–type m–preinvex ifholds for every , , and . Remark 1. If , then Definition 7 is directly reduced to the definition of preinvexity which was explored by Weir et al. [25]. If and , then Definition 7 is directly reduced to the s–type convex function which was explored by İşcan et al. [20]. If and , then Definition 7 is directly reduced to definition of convex function which was investigated by Niculescu et al. [3]. Lemma 1. Suppose , , and , then the following inequalitiesare hold. Proof. The proof is obvious. □
Lemma 2. Suppose , , and , then the following inequalitiesare hold. Proof. The proof is obvious. □
Proposition 1. Suppose , , and , then every non-negative m–preinvex function is an n–polynomial s–type m–preinvex function.
Proof. According to the property of
m–preinvexity and Lemma 1, we have
□
Proposition 2. Suppose , , and , then every non-negative s–type m–preinvex function is an n–polynomial s–type m–preinvex function.
Proof. According to the property of
s–type
m–preinvexity and Lemma 2, we have
□
Proposition 3. Every non-negative n–polynomial s–type m–preinvex function for , , , and is an –preinvex function with .
Proof. Using the definition of
n–polynomial
s–type
m–preinvexity for
,
,
and the condition for
, we have
□
From the above proposition, one can easily observe that the newly defined preinvexity is very large concerning the previously known functions, such as preinvex functions and convex functions. This is the most beautiful aspect of the proposed new Definition 7.
Now, we demonstrate examples in support of the new idea.
Example 2. is a non–negative convex function, but every convex is a preinvex function (see [32]). Thus, due to this reason, it is a non-negative m–preinvex function if . By using Proposition 1, it is an n–polynomial s–type m–preinvex function. Example 3. is a non–negative convex function, but every convex is preinvex function (see [32]). For this reason, it is non-negative m-preinvex function if . By using Proposition 1, it is an n-polynomial s-type m-preinvex function. Now, we explore and elaborate some examples regarding the newly introduced idea. We can see that is preinvex but not convex.
Thus, next we will present some examples for the introduced n-polynomial s-type m-preinvex function w.r.t on , but it is a non-negative and not convex function.
Example 4. Suppose be defined by
and
The non-negative function is m–preinvex but not convex. According to Proposition 1, it is an n–polynomial s–type m–preinvex function with respect to η on X if .
Example 5. Let be defined by
and
. The above non-negative function is m–preinvex but not convex. According to Proposition 1, it is an n–polynomial s–type preinvex function if .
Theorem 1. Let If are two n–polynomial s–type m–preinvex functions, then
is also an n–polynomial s–type m–preinvex function.
is also an n–polynomial s–type m–preinvex function.
Proof. This is the required proof. □
Theorem 2. Suppose , , and . Let and be an n–polynomial s–type m–preinvex and non-decreasing function respectively. Then, is also an n–polynomial s–type m–preinvex function w.r.t same η.
Remark 2. Considering in the above Theorem 2, then Considering in the above Theorem 2, then Considering and in the above Theorem 2, then Theorem 3. Let be a family of n–polynomial s–type m–preinvex function with respect to η and . Then, ψ is an n–polynomial s–type m–preinvex function with respect to η for , , and is an interval.
Proof. Let
,
,
and
then
This is the required proof. □
Theorem 4. If is an n–polynomial s–type m–preinvex function with respect to η for , and then the set is an m–invex set.
Proof. Since
,
are
n–polynomial
s–type
m–preinvex functions with respect to
for
,
and
then for all
,
holds, where
When
, we know
and
, from the above inequality, which yields that
That is, . Hence, is an m–invex set. □
Theorem 5. If is an n–polynomial s–type m–preinvex function on m–invex set w.r.t η for , and then the function ψ is also generalized quasi m–preinvex function on m–invex set w.r.t η.
Proof. Since
is an
n–polynomial
s–type
m–preinvex function w.r.t
for
,
and
and we assume that
, then for all
, we have
In the same manner, if we let
for all
, we can also get
That is, is generalized quasi m–preinvex function on m–invex set with respect to . □
Theorem 6. If (i = 1, 2, …, n) are n–polynomial s–type m–preinvex functions on w.r.t for , and thenis also an n–polynomial s–type m–preinvex function on w.r.t η for and . Proof. The proof is obvious. □
Theorem 7. If (i = 1, 2, …, n) are n–polynomial s–type m–preinvex functions on w.r.t for , and then the functionis also an n–polynomial s–type m–preinvex function on w.r.t η for and . Proof. The proof is obvious. □
Theorem 8. Let is an n–polynomial s–type m–preinvex function w.r.t for , and . Assuming that ψ is monotonic decreasing, η is monotonic increasing regarding m for fixed and . If ψ is an n–polynomial s–type –preinvex function on with respect to η, then ψ is an n–polynomial s–type –preinvex function on with respect to η.
Proof. Since
is an
n–polynomial
s–type
–preinvex function, for all
,
Combining the monotone decreasing of the function
with the monotone increasing of the mapping
regarding
m for fixed
and
, it follows that
and
Following the above inequalities, we have
This is the required proof. □
Theorem 9. Let If both functions are n–polynomial s–type m–preinvex, similarly ordered functions and for , and , the product of these functions is an n–polynomial s–type m–preinvex function.
Proof. For
,
and
then
□
Remark 3. Taking and in Theorem 5, then