1. Introduction
The theory of majorization is a useful mathematical tool, and many important and interesting inequalities can be obtained by combining it with the theory of convex functions. The basic concepts of majorization include the following binary relations for finite sequences of real numbers:
Definition 1. Let and .
(a) We say that is weakly majorized by , denoted as , ifwhere and are the entries of and , respectively, in decreasing order. (b) We say that is majorized by , denoted as , if (1) holds, and in addition, The fundamental inequality relating majorization and convexity is the Hardy–Littlewood–Pólya inequality, (see [
1]).
Theorem 1. Let be an interval, let be a convex function, and let and .
(b) If f is increasing and , then (2) also holds. Among the weighted versions of the previous result, we highlight the following inequality by Fuchs [
2].
Theorem 2. Let be an interval, and let be a convex function. If , and are real numbers, such that
(a) and ,
(b) ,
(c) ,
The notion of majorization can be extended to the continuous case.
Definition 2. Let φ, be decreasing functions. We say that φ is majorized by ψ in symbols ifand The next result is the integral version of the Hardy–Littlewood–Pólya inequality (see [
3]).
Theorem 3. Let φ, represent decreasing functions, where is an interval. Then, φ is majorized by ψ if and only ifholds for every continuous and convex function f on C, such that the integrals exist. In the results related to the previous statement (majorization-type inequalities for integrals, see, e.g., the papers [
4,
5,
6,
7]), the conditions on the convex function are generally the same; it is defined on a compact interval and it is continuous. The proofs are usually based on different methods; the pointwise approximation of convex functions by smooth convex functions is a frequently used technique. Definition 2 can be naturally generalized by using measures and even signed measures, so Theorem 3 has extensions in these directions; see, e.g., the papers [
7,
8]. In this paper, we provide a general framework that offers a comprehensive and uniform treatment of the problem by providing conditions for the inequality
to be valid, where
and
are finite signed measures on a
-algebra containing the Borel sets of
, and
f is a convex function defined on an interval
. We obtain previously known results and solve this problem in new cases. We emphasize that neither the compactness of interval
C nor the continuity of function
f is required. The proofs only use the approximability of convex functions by piecewise linear convex functions (no smoothness condition is used). This result is well known when
C is a compact interval (see [
1]). We extend this statement to convex functions defined on arbitrary intervals, and show that the approximating sequence can always be chosen to be an increasing sequence. By using this, necessary and sufficient conditions are given for the inequality (
3) to be fulfilled. As a consequence, some majorization-type inequalities for integrals are obtained. To apply these results, we deal with Hermite-Hadamard-Fejér-type inequalities and their refinements. Along with new results, we obtain unified and simple proofs of classical statements of Fink [
9] and Florea and Niculescu [
10]. We present a general method to refine both sides of Hermite-Hadamard-Fejér-type inequalities. The results of many papers on the refinement of the Hermite-Hadamard inequality, whose proofs are based on different ideas, can be treated in a uniform way by this method. Finally, we establish a necessary and sufficient condition for when a fundamental inequality of
f-divergences can be refined by another
f-divergence.
2. Preliminary Results
Positive and negative parts of a real number x are denoted by and , respectively.
The complement of a set , with respect to B, is denoted by .
The -algebra of Borel sets and the -algebra of Lebesgue measurable sets on an interval are denoted by and , respectively.
Let be a measurable space. The unit mass at (the Dirac measure at x) is denoted by . Let be a signed measure on . The total variation of is denoted by . The real vector space of -integrable real functions on X is denoted by .
Let
be an interval with a nonempty interior. The following notations are introduced for some special functions defined on
C:
We begin with two preparatory lemmas, which are important for what follows and are of interest in their own right.
Lemma 1. Let with , and let be a measurable space, such that and μ is a finite signed measure on . Assume φ, .
(b) If (4) holds, and is a nonnegative and decreasing function, then Proof. (a) It can be assumed that . Choose a strictly increasing sequence in , such that .
Since both set functions
are (finite) signed measures on
, and
is an increasing sequence converging to
, inequality (
4) implies that
(b) Since is decreasing on the compact interval , it is Borel-measurable and bounded. According to , this implies that and are also -integrable.
We first assume that
is a simple decreasing function of the form
where
are pairwise disjoint and nonempty intervals with
(these intervals can include open, closed, half-open intervals, and singletons; the upper endpoint of
is the same as the lower endpoint of
), and
denotes the characteristic function of
with domain
. We introduce the intervals
By using (
4), part (a), and (
6), we obtain
The general case follows from this and from the well-known result that there exists a sequence
of nonnegative and decreasing functions, such that each
has the same structure as (
5) and
, uniformly, on
.
The proof is complete. □
We proceed with a simple but essential statement.
Lemma 2. Let with , and let be a measurable space, such that and μ, ν are finite signed measures on with . Let and , such that . Then, for every , the following two assertions are equivalent.
Proof. We only prove that (b) follows from (a); the converse statement can be handled similarly. By introducing the sets (these sets may be empty, and they belong to
)
we obtain that
Thus, the conditions
,
and (
7) imply that
The proof is complete. □
The next result contains integral majorization-type inequalities for some special functions.
Lemma 3. Let with , and let be a measurable space, such that . Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on , let be a decreasing function, and let , such that (4) holds. (ii) Let μ be a finite signed measure on , and let φ, be decreasing functions, such that (4) holds. (a) If function f is either or for some , then (b) Assume thatis also satisfied. If for some , then inequality (9) holds too. Proof. We first consider the case where condition (i) is satisfied.
(a) If
, then the result follows from (
4).
Now, assume that
for some
. Using the sets
and
introduced in (
8), we have
Since
is decreasing, either
or
for some
. If
, inequality (
9) trivially follows from (
11) and, thus, it can be supposed that
is a nonempty interval.
Let
denote the complement of
with respect to
. Then, by the first part of (
11) and Lemma 1 (a),
and, therefore, it follows from the definition of the set
and from the second part of (
11) that
(b) It comes from (a) and Lemma 2.
We now turn to the case where condition (ii) is satisfied.
(a) If
, then the result follows from (
4).
Now assume that for some .
Using sets
and
introduced in (
8), we obtain that
where any of the four intersections can be the empty set, their union is
, and at least one of the sets
and
is empty.
We consider only the case when
; that is,
(the other cases can be treated in a similar way). It can be supposed that the other three intersections are not empty. Since
and
are decreasing,
and
are nonempty intervals. It can be seen that
,
, and
are pairwise disjoint and nonempty intervals with
. We define the function
by
Then, is well-defined and nonnegative. It is easy to verify that if .
Next, we show that
is decreasing on
; that is, for all
t,
,
This inequality is equivalent to
which is obvious.
To summarize, we can see that is decreasing.
By (
12) and the definition of
, we have
and, hence, Lemma 1 (b) can be applied.
(b) It can be treated similarly to (b) under the condition of (i).
The proof is complete. □
The next result is a simple consequence of the previous lemma.
Corollary 1. Let with , and let be a measurable space, such that . Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on , let , and let be an increasing function, such that (4) holds. (ii) Let μ be a finite signed measure on , and let φ, be increasing functions, such that (4) holds. (a) If function f is either or for some , then (b) Assume that (10) is also satisfied. If for some , then inequality (13) holds too. Proof. Assume (i) is satisfied.
(a) Under the conditions where
is decreasing,
, and
It now follows from Lemma 3 (a) that
where
f is either
or
for some
. This gives the result by using
.
Since , Lemma 3 (b) can be applied.
We can prove it in a similar manner if (ii) is satisfied.
The proof is complete. □
In the next statement, we will investigate the approximation of convex functions defined on intervals by monotone sequences of simple convex functions.
Definition 3. Let be an interval with the nonempty interior. A function is called piecewise linear if it is continuous and there exists finite points in the interior of C, such that the restriction of f to each interval , , …, is an affine function.
Theorem 4. Let be an interval with a nonempty interior, and let be a continuous convex function.
(a) Function f is the pointwise limit of an increasing sequence of piecewise linear convex functions on C.
(b) If f is increasing, then f is the pointwise limit of an increasing sequence of piecewise linear, increasing, and convex functions on C.
(c) If f is decreasing, then f is the pointwise limit of an increasing sequence of piecewise linear, decreasing, and convex functions on C.
(d) In all three cases, the convergence is uniform on every compact subinterval of C.
Proof. (i) Assume first that C is a bounded interval with endpoints .
Let
be the equation of the left-hand tangent line to the graph of
f at
, and let
be the equation of the right-hand tangent line to the graph of
f at
. Define function
by
It is obvious that is a simple convex function, it is increasing if f is increasing, it is decreasing if f is decreasing, and .
Next, we divide interval
C into
subintervals of equal widths for some
. If
is the appropriate partition, then let
be the equation of the left-hand tangent line to the graph of
f at
, and let
be the equation of the right-hand tangent line to the graph of
f at
. We define the function
by
It is also easy to believe that
is a simple convex function; it is increasing if
f is increasing, and it is decreasing if
f is decreasing,
, and
It can be seen that converges uniformly to f on every compact subinterval of the interior of C and, therefore, converges pointwise to f on the interior of C.
Suppose that at least one of the endpoints belongs to
C. We consider the case when
. By the convexity of
f,
and, hence,
Since
f is continuous,
and, thus,
.
(ii) Assume that C is an unbounded interval. We consider the case when C is bounded from the left with the left-hand endpoint . The other two cases can be treated in an analogous way.
We can proceed similarly to the first part. Let
be an integer, and divide interval
into
subintervals of equal width. If this partition is defined by the points
, and equations
and
mean the same as in (i), then we define function
by
Then, is a simple convex function, it is increasing if f is increasing, it is decreasing if f is decreasing, and .
For all fixed , let be the sequence of functions constructed in (i) the restriction of f to . It follows from the definitions of the introduced sequences of functions that for all , the restriction of to is . By part (i), this implies that converges pointwise to f on C.
The proof is complete. □
Remark 1. It is well known that if is a compact interval with a nonempty interior, and is a continuous convex function, then f is the pointwise limit of a sequence of piecewise linear convex functions on C. Its origins can be traced back to the paper by Popoviciu [11]. Our results can be applied to every continuous convex function defined on any type of interval, and the approximating sequence is increasing. Remark 2. Let be an interval with a nonempty interior, and let be a piecewise linear convex function. If C is compact, then it is well known (see [1]) that f has a simple structure. The same is true for the functions described in Definition 3, and the proof can be copied as well. For the sake of completeness, and because we need representations in the proofs, we provide them. (a) Function f has the following form:for suitable points in the interior of C, α, , and . (b) If f is increasing, then f is of the formfor suitable points in the interior of C, , and . (c) If f is decreasing, then f is of the formfor suitable points in the interior of C, , and . The final result will be used to obtain Fejér-, especially Hermite-Hadamard type inequalities.
Lemma 4. Let with , and let μ be a finite signed measure on such thatAssume φ, are μ-integrable functions, such that (b) If μ is a measure andthen (16) holds. Proof. (a) We divide the proof into six parts.
(i) We define function
by
. Let
be the image measure of the restriction of
to
under the mapping
T. If
, then by (
14),
and, hence,
is the restriction of
to
.
(ii) Since
it follows that
For the rest of the proof of (a), assume .
(iii) By (i) and the first part of (
15),
By using the second part of (
15), we can similarly obtain that
(iv) Since
, (
16) and Lemma 1 (a) yield that
(v) It can be seen that (iv), (
21) and (
22) imply inequality (
17).
(vi) By applying (
21) and (
22) to
, (
18) follows from (
20).
(b) According to the nonnegativity of
and (
19), inequality (
16) obviously holds.
The proof is complete. □
3. Majorization-Type Theorems for Integrals
The key to a further discussion lies in the following result.
By we denote the set of positive integers.
The interior of a set is denoted by .
Theorem 5. Let with , and let be a measurable space, such that and μ, ν are finite signed measures on . Let be an interval with a nonempty interior, and let φ, be functions, such that and .
(a) Let denote the set of all increasing and convex functions for which and . Then, for each inequality,holds if and only if and it is satisfied in the following special cases: function f is either or . (b) Let denote the set of all decreasing and convex functions for which and . Then, for each inequality, (23) holds if and only if and it is satisfied in the following special cases: the function f is either or . (c) Let denote the set of all convex functions for which and . Then, for each inequality, (23) holds if and only if and it is satisfied in the following special cases: the function f is either or or . Proof. We first note that if inequality (
23) holds for each
, then
, if (
23) holds for each
, then
, and if (
23) holds for each
, then
(a) The constant functions
,
,
and
belong to
and, hence, (
23) implies
. The functions
and
are increasing and convex, and since
,
and
,
are finite, they belong to
. This shows that the condition is necessary.
To prove sufficiency, we distinguish two cases.
(i) Assume that f is continuous.
By Theorem 4 (b), f is the pointwise limit of an increasing sequence of piecewise linear, increasing, and convex functions on C. If is such a sequence, then converges pointwise to and converges pointwise to .
By Remark 2 (b), if
g is a piecewise linear increasing and convex function on
C, then
g is of the form
for suitable points
in the interior of
C,
,
and
. Since
and
is finite,
. Similarly,
and, hence,
.
Since
the dominated convergence theorem implies that
In summary, it is enough to prove (
23) for piecewise linear increasing and convex functions on
C. Since such a function is of the form (
25), it follows from the condition.
(ii) Assume that f is not continuous at the right-hand endpoint of the interval C.
Then, it is not hard to believe that there exists a decreasing sequence
from
, such that
is continuous
and
converges pointwise to
f on
C. In this case, (
26) is also satisfied and, therefore, the result follows from the first part of the proof and the dominated convergence theorem.
(b) It can be proven similarly to (a) by using Theorem 4 (c) and taking Remark 2 (c) into account.
(c) It can be proven similarly to (a) by using Theorem 4 (a) and taking Remark 2 (a) into account. In the sufficiency part of the proof, we can apply Lemma 2, which shows that (
23) holds for
too.
The proof is complete. □
Remark 3. (a) By Lemma 2, in part (c) of Theorem 5, “the function f is either or or ” can be replaced by “function f is either or or ”.
(b) It is easy to verify that Theorem 5 (c) contains the following result from Levin and Stečkin [12]: Let be a function with bounded variations, such that . Thenfor all continuous and convex functions on if and only if the following three conditions are fulfilled: (c) It can be easily seen that the main results of Theorem 6 and Theorem 7 in the paper by Barnett, Cerone, and Dragomir [8] are also special cases of Theorem 5 (c). They provide some sufficient conditions for the inequalityto be valid, where f is a convex function, p is a bounded variation on and is nonnegative, u is increasing, and the Stietjes integral is used. Their proofs are specific; The notions of sub-differential and a Chebyshev-type inequality are used. The next result is a special case of Theorem 5. It more closely follows the usual form of majorization inequalities for integrals.
Theorem 6. Let be an interval with a nonempty interior, and let be a convex function. Let with , and let be a measurable space, such that .
(a) Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on . Assume is a decreasing function, and is a μ-integrable function for which is also μ-integrable.
(ii) Let μ be a finite signed measure on . Assume φ, are decreasing functions.
(a) If f is increasing and (4) is satisfied, then (a) If (4) and (10) are satisfied, then inequality (27) holds too. (b) Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on . Assume is a μ-integrable function for which is also μ-integrable, and is an increasing function.
(ii) Let μ be a finite signed measure on . Assume φ, are increasing functions.
(b) If f is decreasing and (4) is satisfied, then (b) If (4) and (10) are satisfied, then inequality (28) holds too. Proof. (a) The proof is valid even under conditions (i) and (ii).
The functions , , , and are obviously -integrable.
(a) It follows from Theorem 5 (a) by applying Lemma 3 (a).
(a) It can be proven similarly to (a) by using Theorem 5 (c) and taking into account Lemma 3.
(b) It can be proven similarly to (a) by using Theorem 5 (b) and taking into account Corollary 1 (a).
(b) It can be proven similarly to (a) by using Theorem 5 (c) and taking into account Corollary 1.
The proof is complete. □
It is worth mentioning the following two special cases of Theorem 6 separately.
First, we consider the case when is absolutely continuous with respect to a -finite measure on . In this case, has a -almost-everywhere uniquely determined density , with respect to . Since is finite, p is -integrable.
Corollary 2. Let be an interval with a nonempty interior, and let be a convex function. Let with , let be a measure space, such that , and ν is a σ-finite measure ν on , and let be a ν-integrable function.
(a) Suppose that one of the following two conditions is met:
(i) Assume p is nonnegative, is a decreasing function, and is an -measurable function for which and are ν-integrable.
(ii) Assume that φ, are decreasing functions.
(a) If f is increasing andis satisfied, then (a) If (29) andare satisfied, then inequality (30) holds too. (b) Suppose that one of the following two conditions is met:
(i) Assume p is nonnegative, is a -measurable function for which and re ν-integrable, and is an increasing function.
(ii) Assume φ, are increasing functions.
(b) If f is decreasing and (29) is satisfied, then (b) If (29) and (31) are satisfied, then inequality (32) holds too. Proof. Let the set function
be defined on
by
If p is nonnegative, then is a measure on ; otherwise, is a signed measure on .
The result immediately follows from Theorem 6.
The proof is complete. □
This is an important special case of the previous result when , and is absolutely continuous with respect to the Lebesgue measure on .
Next, we consider the case when is a discrete measure on .
Corollary 3. Let be an interval with a nonempty interior, and let be a convex function. Let the index set I be either a finite set of the form for some integer or . Let be a sequence of real numbers with .
(a) Suppose that one of the following two conditions is met:
(i) Assume , is a decreasing sequence in C, and is a sequence in C for which the series are absolutely convergent.
(ii) Assume and are decreasing sequences in C.
(a) If f is increasing andis satisfied, then (a) If (33) andare satisfied, then inequality (34) holds too. (b) Suppose that one of the following two conditions is met:
(i) Assume , is a sequence in C for which the series and are absolutely convergent, and is an increasing sequence in C.
(ii) Assume and are increasing sequences in C.
(b) If f is decreasing and (33) is satisfied, then (b) If (33) and (35) are satisfied, then inequality (36) holds too. Proof. Let
with
, let
be a strictly decreasing sequence in
, and let the measure
be defined on
by
where the measure
on
is the unit mass at
. Since
,
is a finite set function.
If , then is a measure on ; otherwise, is a signed measure on .
(a) Under condition (i), it is not hard to verify that there exist functions
, such that
is continuous and decreasing,
is Borel-measurable, and
If (ii) holds, then can also be chosen as a continuous and decreasing function.
We can apply Theorem 6 (a).
(b) It can be verified in a similar manner as (a).
The proof is complete. □
Remark 4. The result contains the weighted version of the Hardy–Littlewood–Pólya inequality and Fuchs inequality (see Theorem 1 and Theorem 2), and even extends them to countably infinite sequences.
4. Hermite-Hadamard-Fejér-Type Inequalities
The first statement includes known results in a single framework.
Theorem 7. Let with , and let μ be a finite signed measure on , such that .
(a) The inequalityholds for some and all convex functions if and only ifand (b) Assume . The inequalityholds for all convex functions if and only if Proof. (a) By Theorem 5 (c), the assertion is true if and only if
and
are satisfied.
By
, (
38) is equivalent to (
42).
It is obvious that
is equivalent to
By elementary calculations, we can obtain that inequalities (
43) and (
44) hold exactly if
The remaining task is to prove that (
45) implies (
39). Since
the first inequality in (
39) follows from
and (
45). The second inequality in (
39) can be handled in a similar way.
(b) Let the function
be defined by
and introduce the measure
on
.
Then
and
for all convex functions
.
It now follows from Theorem 5 (c) that inequality (
40) holds for all convex functions
if and only if
and
are satisfied; however, some easy calculations show that both inequalities are equivalent to (
41).
The proof is complete. □
Remark 5. (a) The number defined in (38) is called the barycenter of μ. (b) The part (a) of Theorem 7 was discovered by Fink [9]. The idea of his proof is different from the one we use; it is based on the integral representation of convex functions. Finite signed measures on , for which the measure of is positive and (39) holds, are called Steffensen–Popoviciu measures. (c) In [9], Fink also presented a sufficient but not necessary condition for the satisfaction of inequality (40). Part (b) of Theorem 7, which is the complete characterization of the measures for which (40) holds, is given by Florea and Niculescu in [10]. Their proof is a modification of Fink’s argument, which is based on the integral representation of twice continuously differentiable convex functions using the Green function of the operator with homogeneous boundary conditions . This is also different from the method we follow. (d) We emphasize that the same natural technique is used to prove Theorem 7 (a) and (b). This may be new.
(e) Condition (41) does not imply in general. This can be illustrated by elementary examples. (f) For the sake of completeness, we provide examples of measures that satisfy exactly one of the following conditions: (39) or (41). (i) If the measure μ on is defined bythen some straightforward calculation shows that condition (39) is satisfied, but (41) does not hold. In this case, the barycenter of μ is 0, and inequality (37) has the formwhich is obviously fulfilled by the convexity of f. The form of inequality (40) iswhich is not true in general. (ii) If the measure μ on is defined bythen it is also easy to show that condition (41) is satisfied, but (39) does not hold. Now, the barycenter of μ is 2, and inequality (37) has the formwhich does not hold in general. The form of inequality (40) iswhich comes from the convexity of f. (g) It follows from Theorem 7 (a) and (b) that inequalitiesare satisfied for all convex functions if and only if both conditions (39) and (41) are true. It is still an open question on how to write up the joint fulfillment of conditions (39) and (41) in a compact form. In the next result, we deal with refinements of inequalities given in (
46).
Theorem 8. Let with , and let μ be a finite measure on , such that . Assume , , , are increasing functions, such thatandare satisfied. Then, for all convex functions , we have Proof. Inequalities in (
50) are immediate consequences of Theorem 6 (b
).
To prove (
49), introduce the increasing function
,
.
By Theorem 6 (b
), it is enough to show that
We argue indirectly and suppose there exists an
, such that (
52) does not hold. Since
is increasing, it follows that
The strict inequality in (
53) implies that
and, hence,
. Since
is increasing, this and the firs part of (
53) yield that
which contradicts (
48).
To prove (
51), it follows from the convexity of
f that
By integrating both sides of this inequality and using (
48), we obtain the result.
The proof is complete. □
Remark 6. Assume that the conditions of Theorem 8 are satisfied.
(a) We obtain a method to refine both sides of inequalities (46) in Theorem 8. (b) It is worth noting that further refinements of (46) can be obtained using the following observation: Define the functions by Then it is easy to verify that for each , the function is also increasing.
By the first inequality in (47),and by (48), Now, by applying Theorem 6 (b), the convexity of f, and the fourth inequality in (50), we have that Similarly, if we define the functions bythen (c) The results of many papers on the refinement of the Hermite-Hadamard inequality, whose proofs are based on different ideas, can be treated in a uniform way, taking into account the previous remark. See, for example, Theorem 1.1 in [13], Theorem 2.1 and Theorem 2.2 in [14], Theorem 3.1 and Theorem 3.4 in [15], Theorem 2.1, Theorem 2.7, and Theorem 2.8 in [16], and Theorem 1 in [17]. (d) A different approach to refining Fejér-, especially Hermite-Hadamard inequalities, can be found in [18]. Now, we present general extensions of Fejér-, especially Hermite-Hadamard inequalities. Moreover, an efficient method is obtained for refining such inequalities.
Theorem 9. Let with , and let μ be a finite signed measure on , such that (14) holds. (a) The inequalityholds for all convex functions if and only if (b) The inequalityholds for all convex functions if and only if (41) is satisfied. (c) Assume μ is a measure and , , are increasing functions, such thatandare satisfied. Then, for all convex functions , we have Proof. Since the identity function on
satisfies (
15), it follows from (
18) that
. By using this and the symmetry of the measure, Theorem 7 (a) and (b) imply (a) and (b), respectively.
Inequality (
56) comes from Theorem 7 (
49).
We introduce the increasing function
,
This is obvious if
. For
, suppose that, on the contrary,
Then by using (
58), (
59) and
, we obtain
which is a contradiction.
Finally, assume that there exists
, such that
This implies by using (
58) that
Since
is increasing, it now follows from (
14) that
which is also a contradiction.
Now, Theorem 6 (b) can be applied.
The proof is complete. □
Remark 7. Let with , and let μ be a finite measure on , such that (14) holds. (a) Conditions (54) and (55) in the previous statement can be replaced by one of the following more easily checked conditions: (i) The functions , , satisfy the symmetry property (15) and (ii) The functions , , satisfy the symmetry property (15), and Really, by Lemma 4 (a), (60) implies (54) and (55), and by Lemma 4 (b), (61) implies (60). (b) We proved in Theorem 9 thatmoreover, (57) refines the right-hand side of (62). The theorem also yields refinements of both the left-hand and right-hand inequalities in (62). Next, we highlight the following special case of the previous result, where we assume that is absolutely continuous with respect to the Lebesgue measure on .
Corollary 4. Let with , and let be a nonnegative and Lebesgue-integrable function for whichLet , , be increasing functions, such thatandare satisfied. If is a convex function, then Proof. By (
63), the measure
defined on
by
satisfies (
14) and, thus, Theorem 9 (c) can be applied.
The proof is complete. □
Remark 8. Assume the conditions of Corollary 4 are satisfied.
(a) Similar to Remark 7 (a), if the functions , , satisfy the symmetry property (15), then any of conditions (60) and (61) may be used instead of (64). (b) It can be seen that Fejér’s inequalityand especially the Hermite-Hadamard inequalityare very special cases of Theorem 9. (c) In Corollary 4, we also obtained a method (see Remark 7 (c)) for refining both the left-hand side and the right-hand side inequality of (65).