1. Introduction
It is not always possible to evaluate definite integrals. Therefore, we use inequalities which estimate the value of integrals. Good examples of these are Hermite–Hadamard inequalities. The Hermite–Hadamard inequality gives a connection between the mean values of a convex function over a closed bounded interval and the function values at the endpoints. Convex functions have a great geometric insight. Convex functions are a fundamental concept in convex optimization. They form an important collection of functions. The classical inequality of Hermite–Hadamard states that the following inequality is valid for convex functions
Actually, this inequality makes an estimate of the value of the integral
It can be easily seen that function
defined by
for
is a convex function. Also, consider function
, defined by
Since the set of points above the graph of function
is a convex subset of the real plane, this function is convex, too. The difference between these two functions is only on the values of the two endpoints. From Lebesgue’s integration theory, for functions
and
, we have equality of
Estimates of Hermite–Hadamard inequality show that for
, we have
This inequality is sharp. Again, the estimate of Hermite–Hadamard inequality shows that for
, we have
This is not a sharp inequality. It is obvious that there is a significant difference between the upper values,
and
. The worse news is that we can choose the endpoint values that are bigger than
and
. As these examples show, in some cases, usage of Hermite–Hadamard inequality is not useful for the right-side estimate of mean value function. Many extensions, generalizations, refinements and variants of the Hermite–Hadamard inequality (1) have been studied by researchers: see [
1,
2,
3] and references therein. One important extension of Hermite–Hadamard is given for the fractional integral. Fractional calculus is a field of mathematical analysis and applied mathematics that studies various properties and applications of integrals and derivatives of arbitrary order, which can be real or complex numbers.
Therefore, fractional calculus is an extension of the integer-order calculus. Recently, due to its broader scope and applications, fractional calculus has become one of the most actively developing fields of mathematical analysis.
Throughout this paper, we assume that and . Unless stated explicitly otherwise, we will assume that is a bounded interval in this paper.
2. Preliminaries and Lemmas
There are many ways in which convex functions can be defined and conceptualized. The following describes the classical case.
Definition 1. A real-valued function ,
on an arbitrary interval (bounded or unbounded, open or closed or neither) is called convex if it satisfies the following condition: for every and for each
If is a convex function, then the function is called concave. Geometrically, a function is convex on the set of points above graph of is a convex subset of the real plane. It is important to note that a convex function may not be continuous at endpoints of interval definition . A convex function may have upward jumps at points and .
Lemma 1 (see [
4])
. Let be convex function. Then, is continuous on the interior of .
Lemma 2 (see Proposition 1.3.5 of [
5])
. Suppose that is a convex function. Then, either is a monotone function on the interior of interval , or there exists a point in the interior of , such that is nondecreasing on the interval and nonincreasing on the interval .
There are four types of finite intervals. These are
,
,
and
. The following theorem actually satisfies all these intervals. We only prove this for interval
. The proofs for the other cases are similar. Without full proof, a case of the following lemma is stated in (see Proposition 1.3.4 of [
5]).
Lemma 3. If
is a bounded convex function, then right-hand limit
and left-hand limit exists in , and the function is defined by also is convex. Moreover, is continuous on .
Proof. We use the sequential definition of the limit. From Lemma 2, a convex function is monotone or can be divided into a monotone nondecreasing and nonincreasing function. Due to on interior of the function is continuous, by monotone convergence theorem and exists. It is now obvious that is continuous on .
By the definition of
for all
, we have
, then for these values, it follows that
Now, let’s show for
, we obtain
Let
be any sequence that satisfies
and
. Then, we obtain
In a similar manner, we can prove that for
, we obtain
Let
,
be any sequences that satisfy
,
and
,
. Then, we have
This ends the proof of Lemma 3. □
Corollary 1. Under the conditions of Lemma 3, we have the following equality Proof. Due to continuity and the monotonicity of function
, integral
is convergent. Therefore, by Lebesgue’s integration theory, we obtain the equality of integrals
This ends the proof of Corollary 1. □
3. Main Results
It is important to be aware that our results about the upper estimation of Hermite–Hadamard inequalities never make an improvement in the lower estimation, but for the sake of completeness, we write the lower estimation in proofs. As is known, inequalities are more useful when they are sharper. The following right-side improvement of Hermite–Hadamard inequality for a convex function is our first result.
Theorem 1. Let
be a convex function. Then, the following inequality holds Proof. The left side of the inequality is exactly the Hermite–Hadamard inequality.
Let
be defined as it is in Lemma 3. Therefore, the function
is continuous and convex. Then, we can write
This ends the proof of Theorem 1. □
Remark 1. If the convex functions
are continuous, then our improved inequality coincides with Hermite–Hadamard inequality. However, if the function is not continuous, then we see the benefits of our Theorem 1. In particular, we can see the difference in example (, defined by
,
and
for
), given in the introduction. If we use the classical Hermite–Hadamard inequality, we obtain the upper bound of the inequality as being However, if we use our new upper bound formula we obtain Hence, we achieve a better upper bound than the inequality of Hermite–Hadamard.
It is worth noting that classical Hermite–Hadamard inequalities are only applied to intervals . In contrast, our following inequality is applied to intervals (and similarly, can be applied to half-open bounded intervals).
Theorem 2. Let
be a convex and bounded function. Then, the following inequality holds Proof. Let
be defined as it is in Lemma 3. Therefore, function
is continuous and convex. Then, we have
This ends the proof of Theorem 2. □
Corollary 2. Suppose
is a function whose restriction to open interval
is convex and integrable. Then, the following inequality holds. Proof. If function is unbounded, then the corollary is obvious. If is bounded, then the corollary is obtained from Theorem 2. □
It is important to be aware of the following remark, which goes beyond convexity. In other words, in the following remark, we show that some nonconvex functions satisfy our improved Hermite–Hadamard inequality.
Remark 2. Although the function
is defined by
,
and for
,
is not convex, because of However, it satisfies our following inequality
Now, let us justify this inequality. By Lemma 3, the function
is defined as
which is equivalent to
for
. It is now obvious that
is a continuous convex function. So, by the
properties of
the integral, we obtain
As another example, consider function
, defined by
for
and
. It is obvious that
is not convex. So, we can not apply Hermite–Hadamard inequality, but we can apply our inequality
which gives
Hereafter, denotes the gamma function evaluated at .
Definition 2. Left-sided Riemann–Liouville fractional integral of order
is defined by Right-sided Riemann–Liouville fractional integral of order
is defined by
Hermite–Hadamard inequality for Riemann–Liouville fractional integrals is showed by Sarikaya et al. in [
6], as follows.
Theorem 3. Let function
be convex and integrable. Then, the following inequalities for the Riemann–Liouville fractional integral satisfy
Theorem 4. Suppose
is a function whose restriction to open interval
is convex and integrable. Then, the following inequalities for the Riemann–Liouville fractional integral satisfy
Proof. Let
be defined as it is in Lemma 3. Therefore, function
is continuous and convex. Therefore, by Theorem 3, we can write
This ends the proof of Theorem 4. □
Remark 3. If the convex functions
are continuous, then our improved inequality coincides with Theorem 3.
Theorem 5. Let
be a convex and integrable function. Let
be defined as it is in Lemma 3. Then, the following inequalities for fractional integral satisfy
with
.
Proof. Let
be defined as it is in Lemma 3. Therefore, function
is continuous and convex. Therefore, by Theorem 3, we can write
This ends the proof of Theorem 5. □
Definition 3. For all
, we have
. The left-sided Riemann–Liouville fractional integral variable order,
, is defined by
and the right-sided Riemann–Liouville fractional integral variable order
is defined by
We refer the reader to [
7] for the details of variable order fractional integrals.
Theorem 6 (see [
8])
. Let and a convex function be integrable and positive. Then, the following inequalities for the fractional integral of variable order satisfy Again, we see that if the convex function is not continuous at the end points of an interval , the inequality will not be sharp, (or is not valid, as in the case of Remark 2). As a result, we obtain the following improvement of the preceding Theorem 6.
Theorem 7. Let
and a convex function
be integrable, positive. Then, the following inequalities for the fractional integral of variable order satisfy
Proof. Let
be defined as it is in Lemma 3. Since
, we have
From the result of Theorem 6 and the convexity of function
, we observe that
This ends the proof of Theorem 7. □
Remark 4. If the convex functions
are continuous, then our improved inequality coincides with Theorem 6.