Next Article in Journal
Shannon Entropy and Herfindahl-Hirschman Index as Team’s Performance and Competitive Balance Indicators in Cyclist Multi-Stage Races
Next Article in Special Issue
Capacity-Achieving Input Distributions of Additive Vector Gaussian Noise Channels: Even-Moment Constraints and Unbounded or Compact Support
Previous Article in Journal
Improved Recurrence Plots Compression Distance by Learning Parameter for Video Compression Quality
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Uniform Treatment of Integral Majorization Inequalities with Applications to Hermite-Hadamard-Fejér-Type Inequalities and f-Divergences

by
László Horváth
Department of Mathematics, University of Pannonia, Egyetem u. 10., 8200 Veszprém, Hungary
Entropy 2023, 25(6), 954; https://doi.org/10.3390/e25060954
Submission received: 4 June 2023 / Revised: 16 June 2023 / Accepted: 17 June 2023 / Published: 19 June 2023
(This article belongs to the Special Issue Shannon Entropy: Mathematical View)

Abstract

:
In this paper, we present a general framework that provides a comprehensive and uniform treatment of integral majorization inequalities for convex functions and finite signed measures. Along with new results, we present unified and simple proofs of classical statements. To apply our results, we deal with Hermite-Hadamard-Fejér-type inequalities and their refinements. 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.

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 x : = x 1 , , x n R n and y : = y 1 , , y n R n .
(a) We say that x is weakly majorized by y , denoted as x w y , if
i = 1 k x i i = 1 k y i , k = 1 , , n ,
where x 1 x 2 x n and y 1 y 2 y n are the entries of x and y , respectively, in decreasing order.
(b) We say that x is majorized by y , denoted as x y , if (1) holds, and in addition,
i = 1 n x i = i = 1 n y i .
The fundamental inequality relating majorization and convexity is the Hardy–Littlewood–Pólya inequality, (see [1]).
Theorem 1.
Let C R be an interval, let f : C R be a convex function, and let x : = x 1 , , x n C n and y : = y 1 , , y n C n .
(a) If x y , then
i = 1 n f x i i = 1 n f y i .
(b) If f is increasing and x w y , then (2) also holds.
Among the weighted versions of the previous result, we highlight the following inequality by Fuchs [2].
Theorem 2.
Let C R be an interval, and let f : C R be a convex function. If x 1 , , x n C n , y 1 , , y n C n and q 1 , , q n are real numbers, such that
(a) x 1 x n and y 1 y n ,
(b) i = 1 k q i x i i = 1 k q i y i   k = 1 , , n 1 ,
(c) i = 1 n q i x i = i = 1 n q i y i ,
then
i = 1 n q i f x i i = 1 n q i f y i .
The notion of majorization can be extended to the continuous case.
Definition 2.
Let φ, ψ : a , b R be decreasing functions. We say that φ is majorized by ψ in symbols φ ψ if
a x φ t d t a x ψ t d t , x a , b
and
a b φ t d t = a b ψ t d t .
The next result is the integral version of the Hardy–Littlewood–Pólya inequality (see [3]).
Theorem 3.
Let φ, ψ : a , b C represent decreasing functions, where C R is an interval. Then, φ is majorized by ψ if and only if
a b f φ t d t a b f ψ t d t
holds 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
a , b f φ d μ a , b f ψ d ν ,
to be valid, where μ and ν are finite signed measures on a σ -algebra containing the Borel sets of a , b , and f is a convex function defined on an interval C R . 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 x + and x , respectively.
The complement of a set A B , with respect to B, is denoted by A c .
The σ -algebra of Borel sets and the σ -algebra of Lebesgue measurable sets on an interval C R are denoted by B C and L C , respectively.
Let X , A be a measurable space. The unit mass at x X (the Dirac measure at x) is denoted by ε x . Let μ be a signed measure on A . The total variation of μ is denoted by μ . The real vector space of μ -integrable real functions on X is denoted by L X , μ .
Let C R be an interval with a nonempty interior. The following notations are introduced for some special functions defined on C:
i d C x : = x , p C , w x : = x w + , n C , w x : = x w x , w C .
We begin with two preparatory lemmas, which are important for what follows and are of interest in their own right.
Lemma 1.
Let a , b R with a < b , and let a , b , A be a measurable space, such that B a , b A and μ is a finite signed measure on A . Assume φ, ψ L a , b , μ .
(a) If
a , x φ d μ a , x ψ d μ , x a , b ,
then
a , x φ d μ a , x ψ d μ , x a , b .
(b) If (4) holds, and α : a , b R is a nonnegative and decreasing function, then
a , b α φ d μ a , b α ψ d μ .
Proof. 
(a) It can be assumed that x a , b . Choose a strictly increasing sequence x n n = 1 in a , x , such that x n x .
Since both set functions
A A φ d μ and A A ψ d μ , A A
are (finite) signed measures on A , and a , x n n = 1 is an increasing sequence converging to a , x , inequality (4) implies that
a , x φ d μ = lim n a , x n φ d μ lim n a , x n ψ d μ = a , x ψ d μ .
(b) Since α is decreasing on the compact interval a , b , it is Borel-measurable and bounded. According to B a , b A , this implies that α φ and α ψ are also μ -integrable.
We first assume that α is a simple decreasing function of the form
α = i = 1 k c i χ I i ,
where
c 1 > > c k 0 ,
I 1 , I k are pairwise disjoint and nonempty intervals with i = 1 k I i = a , b (these intervals can include open, closed, half-open intervals, and singletons; the upper endpoint of I i is the same as the lower endpoint of I i + 1 i = 1 , , k 1 ), and χ I i i = 1 , k denotes the characteristic function of I i with domain a , b . We introduce the intervals
J 0 : = Ø , J i : = l = 1 i I l , i = 1 , , k .
By using (4), part (a), and (6), we obtain
a , b α ψ d μ a , b α φ d μ = i = 1 k c i I i ψ φ d μ = i = 1 k c i J i J i 1 ψ φ d μ
= i = 1 k 1 c i c i + 1 J i ψ φ d μ + c k J k ψ φ d μ 0 .
The general case follows from this and from the well-known result that there exists a sequence α n of nonnegative and decreasing functions, such that each α n has the same structure as (5) and α n α , uniformly, on a , b .
The proof is complete. □
We proceed with a simple but essential statement.
Lemma 2.
Let a , b R with a < b , and let a , b , A be a measurable space, such that B a , b A and μ, ν are finite signed measures on A with μ a , b = ν a , b . Let φ L a , b , μ and ψ L a , b , ν , such that a , b φ d μ = a , b ψ d ν . Then, for every w R , the following two assertions are equivalent.
(a)
a , b p R , w φ d μ a , b p R , w ψ d ν .
(b)
a , b n R , w φ d μ a , b n R , w ψ d ν .
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 A )
A φ : = t a , b φ t w , A ψ : = t a , b ψ t w ,
we obtain that
a , b n R , w φ d μ = A φ c w φ d μ = a , b w φ d μ A φ w φ d μ
= a , b w φ d μ + a , b p R , w φ d μ .
Thus, the conditions μ a , b = ν a , b , a , b φ d μ = a , b ψ d ν and (7) imply that
a , b n R , w φ d μ = a , b w ψ d ν + a , b p R , w φ d μ
a , b w ψ d ν + a , b p R , w ψ d ν
= a , b w ψ d ν A ψ w ψ d ν = a , b n R , w ψ d ν .
The proof is complete. □
The next result contains integral majorization-type inequalities for some special functions.
Lemma 3.
Let a , b R with a < b , and let a , b , A be a measurable space, such that B a , b A . Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on A , let φ : a , b R be a decreasing function, and let ψ L a , b , μ , such that (4) holds.
(ii) Let μ be a finite signed measure on A , and let φ, ψ : a , b R be decreasing functions, such that (4) holds.
(a) If function f is either i d R or p R , w for some w R , then
a , b f φ d μ a , b f ψ d μ .
(b) Assume that
a , b φ d μ = a , b ψ d μ
is also satisfied. If f = n R , w for some w R , then inequality (9) holds too.
Proof. 
We first consider the case where condition (i) is satisfied.
(a) If f = i d R , then the result follows from (4).
Now, assume that f = p R , w for some w R . Using the sets A φ and A ψ introduced in (8), we have
a , b f φ d μ = A φ φ w d μ and a , b f ψ d μ = A ψ ψ w d μ .
Since φ is decreasing, either A φ = a , c or A φ = a , c for some c a , b . If A φ = Ø , inequality (9) trivially follows from (11) and, thus, it can be supposed that A φ is a nonempty interval.
Let A ψ c denote the complement of A ψ with respect to a , b . Then, by the first part of (11) and Lemma 1 (a),
a , b f φ d μ A φ ψ w d μ = A φ A ψ ψ w d μ + A φ A ψ c ψ w d μ ,
and, therefore, it follows from the definition of the set A ψ and from the second part of (11) that
a , b f φ d μ A φ A ψ ψ w d μ A ψ ψ w d μ = a , b f ψ d μ .
(b) It comes from (a) and Lemma 2.
We now turn to the case where condition (ii) is satisfied.
(a) If f = i d R , then the result follows from (4).
Now assume that f = p R , w for some w R .
Using sets A φ and A ψ introduced in (8), we obtain that
f ψ t f φ t = ψ t φ t , t A φ A ψ w φ t , t A φ A ψ c ψ t w , t A φ c A ψ 0 , t A φ c A ψ c ,
where any of the four intersections can be the empty set, their union is a , b , and at least one of the sets A φ A ψ c and A φ c A ψ is empty.
We consider only the case when A φ A ψ c = Ø ; that is, A φ A ψ (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, A φ and A ψ are nonempty intervals. It can be seen that I 1 : = A φ , I 2 : = A φ c A ψ , and I 3 : = A φ c A ψ c are pairwise disjoint and nonempty intervals with I 1 I 2 I 3 = a , b . We define the function α : a , b R by
α t : = 1 , t I 1 ψ t w ψ t φ t , t I 2 0 , t I 3
Then, α is well-defined and nonnegative. It is easy to verify that α t < 1 if t I 2 .
Next, we show that α is decreasing on I 2 ; that is, for all t, s I 2 , t > s
ψ t w ψ t φ t ψ s w ψ s φ s .
This inequality is equivalent to
ψ t w w φ s ψ s w w φ t ,
which is obvious.
To summarize, we can see that α is decreasing.
By (12) and the definition of α , we have
a , b f ψ f φ d μ = a , b α ψ φ d μ ,
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 a , b R with a < b , and let a , b , A be a measurable space, such that B a , b A . Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on A , let φ L a , b , μ , and let ψ : a , b R be an increasing function, such that (4) holds.
(ii) Let μ be a finite signed measure on A , and let φ, ψ : a , b R be increasing functions, such that (4) holds.
(a) If function f is either i d R or n R , w for some w R , then
a , b f φ d μ a , b f ψ d μ .
(b) Assume that (10) is also satisfied. If f = p R , w for some w R , then inequality (13) holds too.
Proof. 
Assume (i) is satisfied.
(a) Under the conditions where ψ is decreasing, φ L a , b , μ , and
a , x ψ d μ a , x φ d μ , x a , b .
It now follows from Lemma 3 (a) that
a , b f ψ d μ a , b f φ d μ ,
where f is either i d R or p R , w for some w R . This gives the result by using a + = a .
(b) By (10),
a , b ψ d μ = a , b φ d μ .
Since a = a + , 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 C R be an interval with the nonempty interior. A function f : C R is called piecewise linear if it is continuous and there exists finite points x 1 < x 2 < < x k in the interior of C, such that the restriction of f to each interval C , x 1 , x 1 , x 2 , …, C x k , is an affine function.
Theorem 4.
Let C R be an interval with a nonempty interior, and let f : C R 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 u < v .
Let y = l 12 x be the equation of the left-hand tangent line to the graph of f at u + v 2 , and let y = l 22 + x be the equation of the right-hand tangent line to the graph of f at u + v 2 . Define function f 1 : C R by
f 1 x : = max l 12 + x , l 22 x .
It is obvious that f 1 is a simple convex function, it is increasing if f is increasing, it is decreasing if f is decreasing, and f 1 f .
Next, we divide interval C into 2 n subintervals of equal widths for some n > 1 . If u = : x 0 < x 1 < < x 2 n : = v is the appropriate partition, then let y = l i n x be the equation of the left-hand tangent line to the graph of f at x i , and let y = l i n + x be the equation of the right-hand tangent line to the graph of f at x i i = 1 , , 2 n 1 . We define the function f n : C R by
f n x : = max 1 i 2 n 1 l i n x , l i n + x .
It is also easy to believe that f n is a simple convex function; it is increasing if f is increasing, and it is decreasing if f is decreasing, f n 1 f n f , and
f x f n x f x 2 n 1 f + x 1 v u 2 n , x x 1 , x 2 n 1 .
It can be seen that f n converges uniformly to f on every compact subinterval of the interior of C and, therefore, f n 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 v C . By the convexity of f,
f v f x 2 n 2 2 n 1 v u f + x 2 n 1 f v f x 2 n 1 2 n v u ,
and, hence,
1 2 f v f x 2 n 2 f + x 2 n 1 v x 2 n 1 f v f x 2 n 1 , n 2 .
Since f is continuous,
lim n f + x 2 n 1 v x 2 n 1 = 0 ,
and, thus, f n v f v .
(ii) Assume that C is an unbounded interval. We consider the case when C is bounded from the left with the left-hand endpoint u R . The other two cases can be treated in an analogous way.
We can proceed similarly to the first part. Let n 1 be an integer, and divide interval C , u + n into n 2 n subintervals of equal width. If this partition is defined by the points u = : x 0 < x 1 < < x n 2 n = u + n , and equations y = l i n x and y = l i n + x mean the same as in (i), then we define function f n : C R by
f n x : = max 1 i n 2 n 1 l i n x , l i n + x .
Then, f n is a simple convex function, it is increasing if f is increasing, it is decreasing if f is decreasing, and f n 1 f n f .
For all fixed k 1 , let f k , n n = 1 be the sequence of functions constructed in (i) the restriction of f to C , u + k . It follows from the definitions of the introduced sequences of functions that for all n k 1 , the restriction of f n to C , u + k is f k , n . By part (i), this implies that f n converges pointwise to f on C.
The proof is complete. □
Remark 1.
It is well known that if C R is a compact interval with a nonempty interior, and f : C R 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 C R be an interval with a nonempty interior, and let f : C R 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:
f x = α x + β + i = 1 k γ i x x i + + x x i , x C
for suitable points x 1 < x 2 < < x k in the interior of C, α, β R , and γ i > 0 i = 1 , , k .
(b) If f is increasing, then f is of the form
f x = α x + β + i = 1 k γ i x x i + , x C
for suitable points x 1 < x 2 < < x k in the interior of C, α 0 , β R and γ i > 0 i = 1 , , k .
(c) If f is decreasing, then f is of the form
f x = α x + β + i = 1 n γ i x x i , x C
for suitable points x 1 < x 2 < < x k in the interior of C, α 0 , β R and γ i > 0 i = 1 , , k .
The final result will be used to obtain Fejér-, especially Hermite-Hadamard type inequalities.
Lemma 4.
Let a , b R with a < b , and let μ be a finite signed measure on B a , b such that
μ A = μ a + b A , A B a , b .
Assume φ, ψ : a , b a , b are μ-integrable functions, such that
φ a + b t = a + b φ t , ψ a + b t = a + b ψ t , t a , b .
(a) If
a , x φ d μ a , x ψ d μ , x a , a + b 2 ,
then
a , x φ d μ a , x ψ d μ , x a , b
and
a , b φ d μ = a , b ψ d μ = a + b 2 μ a , b .
(b) If μ is a measure and
φ t ψ t , t a , a + b 2 ,
then (16) holds.
Proof. 
(a) We divide the proof into six parts.
(i) We define function T : a , a + b 2 a + b 2 , b by T t : = a + b t . Let T μ be the image measure of the restriction of μ to B a , a + b 2 under the mapping T. If B B a + b 2 , b , then by (14),
μ T 1 B = μ a + b B = μ B ,
and, hence, T μ is the restriction of μ to B a + b 2 , b .
(ii) Since
μ a , a + b 2 = μ a + b 2 , b ,
it follows that
a + b 2 μ a + b 2 + a + b μ a , a + b 2 = a + b 2 μ a , b .
According to (15),
φ a + b 2 = ψ a + b 2 = a + b 2 .
For the rest of the proof of (a), assume x a + b 2 , b .
(iii) By (i) and the first part of (15),
a , x φ d μ = a , a + b 2 φ d μ + a + b 2 , x φ d μ = a , a + b 2 φ d μ + a + b 2 , x φ d T μ
= a , a + b 2 φ d μ + a + b x , a + b 2 φ T d μ = a , a + b 2 φ d μ + a + b x , a + b 2 a + b φ d μ
= a , a + b x φ d μ + a + b 2 μ a + b 2 + a + b μ a + b x , a + b 2 .
By using the second part of (15), we can similarly obtain that
a , x ψ d μ = a , a + b x ψ d μ + a + b 2 μ a + b 2 + a + b μ a + b x , a + b 2 .
(iv) Since a + b x a , a + b 2 , (16) and Lemma 1 (a) yield that
a , a + b x φ d μ a , a + b x ψ d μ .
(v) It can be seen that (iv), (21) and (22) imply inequality (17).
(vi) By applying (21) and (22) to x = b , (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 N + we denote the set of positive integers.
The interior of a set H R is denoted by H .
Theorem 5.
Let a , b R with a < b , and let a , b , A be a measurable space, such that B a , b A and μ, ν are finite signed measures on A . Let C R be an interval with a nonempty interior, and let φ, ψ : a , b C be functions, such that φ L a , b , μ and ψ L a , b , ν .
(a) Let F C i denote the set of all increasing and convex functions f : C R for which f φ L a , b , μ and f ψ L a , b , ν . Then, for each f F C i inequality,
a , b f φ d μ a , b f ψ d ν
holds if and only if μ a , b = ν a , b and it is satisfied in the following special cases: function f is either i d C or p C , x x C .
(b) Let F C d denote the set of all decreasing and convex functions f : C R for which f φ L a , b , μ and f ψ L a , b , ν . Then, for each f F C d inequality, (23) holds if and only if μ a , b = ν a , b and it is satisfied in the following special cases: the function f is either i d C or n C , x x C .
(c) Let F C denote the set of all convex functions f : C R for which f φ L a , b , μ and f ψ L a , b , ν . Then, for each f F C inequality, (23) holds if and only if μ a , b = ν a , b and it is satisfied in the following special cases: the function f is either i d C or i d C or p C , x x C .
Proof. 
We first note that if inequality (23) holds for each f F C i , then a , b φ d μ a , b ψ d ν , if (23) holds for each f F C d , then a , b φ d μ a , b ψ d ν , and if (23) holds for each f F C , then
a , b φ d μ = a , b ψ d ν .
(a) The constant functions f 1 , f 2 : C R , f 1 x : = 1 and f 2 x : = 1 belong to F C i and, hence, (23) implies μ a , b = ν a , b . The functions i d C and p C , x x C are increasing and convex, and since φ L a , b , μ , ψ L a , b , ν and μ , ν are finite, they belong to F C i . 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 f n is such a sequence, then f n φ converges pointwise to f φ and f n ψ converges pointwise to f ψ .
By Remark 2 (b), if g is a piecewise linear increasing and convex function on C, then g is of the form
g x = α x + β + i = 1 k γ i x x i + , x C
for suitable points x 1 < x 2 < < x k in the interior of C, α 0 , β R and γ i > 0 i = 1 , , k . Since φ L a , b , μ and μ is finite, g φ L a , b , μ . Similarly, g ψ L a , b , ν and, hence, g F C i .
Since
f n φ max f φ , f 1 φ , f n ψ max f ψ , f 1 ψ ,
the dominated convergence theorem implies that
a , b f n φ d μ a , b f φ d μ and a , b f n ψ d ν a , b f ψ d ν .
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 f n n = 1 from F C i , such that f n is continuous n N + and f n 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 n C , x   x C too.
The proof is complete. □
Remark 3.
(a) By Lemma 2, in part (c) of Theorem 5, “the function f is either i d C or i d C or p C , x x C ” can be replaced by “function f is either i d C or i d C or n C , x x C ”.
(b) It is easy to verify that Theorem 5 (c) contains the following result from Levin and Stečkin [12]: Let H : a , b R be a function with bounded variations, such that H a = 0 . Then
a , b f d H 0
for all continuous and convex functions on a , b if and only if the following three conditions are fulfilled:
H b = 0 , a , b H x d x = 0 , a , x H t d t 0 , x a , b .
(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 inequality
a b p t f φ t d u t a b p t f ψ t d u t ,
to be valid, where f is a convex function, p is a bounded variation on a , b 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 C R be an interval with a nonempty interior, and let f : C R be a convex function. Let a , b R with a < b , and let a , b , A be a measurable space, such that B a , b A .
(a) Suppose that one of the following two conditions is met:
(i) Let μ be a finite measure on A . Assume φ : a , b C is a decreasing function, and ψ : a , b C is a μ-integrable function for which f ψ is also μ-integrable.
(ii) Let μ be a finite signed measure on A . Assume φ, ψ : a , b C are decreasing functions.
(a 1 ) If f is increasing and (4) is satisfied, then
a , b f φ d μ a , b f ψ d μ .
(a 2 ) 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 A . Assume φ : a , b C is a μ-integrable function for which f φ is also μ-integrable, and ψ : a , b C is an increasing function.
(ii) Let μ be a finite signed measure on A . Assume φ, ψ : a , b C are increasing functions.
(b 1 ) If f is decreasing and (4) is satisfied, then
a , b f φ d μ a , b f ψ d μ .
(b 2 ) 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 φ , ψ , f φ , and f ψ are obviously μ -integrable.
(a 1 ) It follows from Theorem 5 (a) by applying Lemma 3 (a).
(a 2 ) It can be proven similarly to (a 1 ) by using Theorem 5 (c) and taking into account Lemma 3.
(b 1 ) It can be proven similarly to (a 1 ) by using Theorem 5 (b) and taking into account Corollary 1 (a).
(b 2 ) It can be proven similarly to (a 1 ) 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 A . In this case, μ has a ν -almost-everywhere uniquely determined density p : a , b R , with respect to ν . Since μ is finite, p is ν -integrable.
Corollary 2.
Let C R be an interval with a nonempty interior, and let f : C R be a convex function. Let a , b R with a < b , let a , b , A , ν be a measure space, such that B a , b A , and ν is a σ-finite measure ν on A , and let p : a , b R be a ν-integrable function.
(a) Suppose that one of the following two conditions is met:
(i) Assume p is nonnegative, φ : a , b C is a decreasing function, and ψ : a , b C is an A -measurable function for which ψ p and f ψ p are ν-integrable.
(ii) Assume that φ, ψ : a , b C are decreasing functions.
(a 1 ) If f is increasing and
a , x φ p d ν a , x ψ p d ν , x a , b
is satisfied, then
a , b f φ p d ν a , b f ψ p d ν .
(a 2 ) If (29) and
a , b φ p d ν = a , b ψ p d ν
are satisfied, then inequality (30) holds too.
(b) Suppose that one of the following two conditions is met:
(i) Assume p is nonnegative, φ : a , b C is a A -measurable function for which φ p and f φ p re ν-integrable, and ψ : a , b C is an increasing function.
(ii) Assume φ, ψ : a , b C are increasing functions.
(b 1 ) If f is decreasing and (29) is satisfied, then
a , b f φ p d ν a , b f ψ p d ν .
(b 2 ) If (29) and (31) are satisfied, then inequality (32) holds too.
Proof. 
Let the set function μ be defined on A by
μ A = A p d ν , A A .
If p is nonnegative, then μ is a measure on A ; otherwise, μ is a signed measure on A .
The result immediately follows from Theorem 6.
The proof is complete. □
This is an important special case of the previous result when A = L a , b , and μ is absolutely continuous with respect to the Lebesgue measure λ on L a , b .
Next, we consider the case when μ is a discrete measure on A .
Corollary 3.
Let C R be an interval with a nonempty interior, and let f : C R be a convex function. Let the index set I be either a finite set of the form 1 , , n for some integer n 1 or N + . Let μ i i I be a sequence of real numbers with i I μ i < .
(a) Suppose that one of the following two conditions is met:
(i) Assume μ i 0 i I , x i i I is a decreasing sequence in C, and y i i I is a sequence in C for which the series i I y i μ i i I f y i μ i are absolutely convergent.
(ii) Assume x i i I and y i i I are decreasing sequences in C.
(a 1 ) If f is increasing and
i = 1 k x i μ i i = 1 k y i μ i , k I
is satisfied, then
i I f x i μ i i I f y i μ i .
(a 2 ) If (33) and
i I x i μ i = i I y i μ i ,
are satisfied, then inequality (34) holds too.
(b) Suppose that one of the following two conditions is met:
(i) Assume μ i 0 i I , x i i I is a sequence in C for which the series i I x i μ i and i I f x i μ i are absolutely convergent, and y i i I is an increasing sequence in C.
(ii) Assume x i i I and y i i I are increasing sequences in C.
(b 1 ) If f is decreasing and (33) is satisfied, then
i I f x i μ i i I f y i μ i .
(b 2 ) If (33) and (35) are satisfied, then inequality (36) holds too.
Proof. 
Let a , b R with a < b , let t i i I be a strictly decreasing sequence in a , b , and let the measure μ be defined on B a , b by
μ : = i I μ i ε t i ,
where the measure ε t i on B a , b is the unit mass at t i i I . Since i I μ i < , μ is a finite set function.
If μ i 0 i I , then μ is a measure on B a , b ; otherwise, μ is a signed measure on B a , b .
(a) Under condition (i), it is not hard to verify that there exist functions φ , ψ : a , b C , such that φ is continuous and decreasing, ψ is Borel-measurable, and
φ t i = x i , ψ t i = y i , i I .
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 a , b R with a < b , and let μ be a finite signed measure on B a , b , such that μ a , b > 0 .
(a) The inequality
f x μ μ a , b a , b f d μ
holds for some x μ a , b and all convex functions f : a , b R if and only if
x μ : = 1 μ a , b a , b t d μ t
and
a , x x t d μ t 0 and x , b t x d μ t 0 , x a , b .
(b) Assume x μ a , b . The inequality
a , b f d μ b x μ b a f a + x μ a b a f b μ a , b
holds for all convex functions f : a , b R if and only if
b x b a a , x t a d μ t + x a b a x , b b t d μ t 0 , x a , b .
Proof. 
(a) By Theorem 5 (c), the assertion is true if and only if
x μ · μ a , b = a , b t d μ t ,
a , b p a , b , x x μ d μ a , b p a , b , x d μ , x a , b
and
a , b n a , b , x x μ d μ a , b n a , b , x d μ , x a , b
are satisfied.
By μ a , b > 0 , (38) is equivalent to (42).
It is obvious that x μ a , b is equivalent to
a , b b t d μ t 0 and a , b t a d μ t 0 .
By elementary calculations, we can obtain that inequalities (43) and (44) hold exactly if
0 x , b t x d μ t , if x x μ , b 0 a , x x t d μ t , if x a , x μ .
The remaining task is to prove that (45) implies (39). Since
x , b t x d μ t = μ a , b x μ x + a , x x t d μ t , x a , b ,
the first inequality in (39) follows from μ a , b > 0 and (45). The second inequality in (39) can be handled in a similar way.
(b) Let the function φ l : a , b a , b be defined by
φ l t = b , if t a , x μ x μ , if t = x μ a , if t x μ , b ,
and introduce the measure λ ^ : = μ a , b b a λ on B a , b .
Then
a , b φ l d λ ^ = a , b t d μ t ,
and
a , b f φ l d λ ^ = b x μ b a f a + x μ a b a f b μ a , b
for all convex functions f : a , b R .
It now follows from Theorem 5 (c) that inequality (40) holds for all convex functions f : a , b R if and only if
a , b p a , b , x d μ a , b p a , b , x φ l d λ ^ , x a , b
and
a , b n a , b , x d μ a , b n a , b , x φ l d λ ^ , x a , b
are satisfied; however, some easy calculations show that both inequalities are equivalent to (41).
The proof is complete. □
Remark 5.
(a) The number x μ 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 B a , b , for which the measure of a , b 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 d 2 d x 2 with homogeneous boundary conditions y a = y b = 0 . 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 x μ a , b 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 B 0 , 3 is defined by
μ : = 2 ε 0 ε 1 ε 2 + ε 3 ,
then 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 form
f 0 2 f 0 f 1 f 2 + f 3
which is obviously fulfilled by the convexity of f. The form of inequality (40) is
2 f 0 f 1 f 2 + f 3 f 0
which is not true in general.
(ii) If the measure μ on B 0 , 2 is defined by
μ : = ε + 2 ε 1 + 2 ε 2 ,
then 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 form
f 2 f 0 + 2 f 1 + 2 f 2
which does not hold in general. The form of inequality (40) is
f 0 + 2 f 1 + 2 f 2 3 f 2
which comes from the convexity of f.
(g) It follows from Theorem 7 (a) and (b) that inequalities
f x μ 1 μ a , b a , b f d μ b x μ b a f a + x μ a b a f b .
are satisfied for all convex functions f : a , b R 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 a , b R with a < b , and let μ be a finite measure on B a , b , such that μ a , b > 0 . Assume φ 1 , φ 0 , ψ 1 , ψ 0 : a , b a , b are increasing functions, such that
a , x φ 0 d μ a , x φ 1 d μ a , x t d μ t a , x ψ 1 d μ a , x ψ 0 d μ , x a , b
and
a , b φ 0 d μ = a , b φ 1 d μ = a , b ψ 1 d μ = a , b ψ 0 d μ = a , b t d μ t
are satisfied. Then, for all convex functions f : a , b R , we have
f x μ μ a , b
a , b f ψ 0 d μ a , b f ψ 1 d μ a , b f d μ a , b f φ 1 d μ a , b f φ 0 d μ
b x μ b a f a + x μ a b a f b μ a , b .
Proof. 
Inequalities in (50) are immediate consequences of Theorem 6 (b 2 ).
To prove (49), introduce the increasing function ψ u : a , b a , b , ψ u t : = x μ .
By Theorem 6 (b 2 ), it is enough to show that
a , x ψ 0 d μ a , x ψ u d μ , x a , b .
We argue indirectly and suppose there exists an x a , b , such that (52) does not hold. Since ψ 0 is increasing, it follows that
x μ · μ a , x < a , x ψ 0 d μ ψ 0 x μ a , x .
The strict inequality in (53) implies that μ a , x > 0 and, hence, x μ < ψ 0 x . Since ψ 0 is increasing, this and the firs part of (53) yield that
a , b ψ 0 d μ = a , x ψ 0 d μ + x , b ψ 0 d μ > x μ · μ a , x + x μ · μ x , b
= x μ · μ a , b = a , b t d μ t
which contradicts (48).
To prove (51), it follows from the convexity of f that
f φ 0 t b φ 0 t b a f a + φ 0 t a b a f b , t a , b .
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 φ λ : a , b a , b 0 λ 1 by
φ λ t : = 1 λ φ 1 t + λ φ 0 t .
Then it is easy to verify that for each λ 0 , 1 , the function φ λ is also increasing.
By the first inequality in (47),
a , x φ 0 d μ a , x φ λ d μ a , x φ 1 d μ , x a , b , λ 0 , 1 ,
and by (48),
a , b φ λ d μ = a , b t d μ t , λ 0 , 1 .
Now, by applying Theorem 6 (b 2 ), the convexity of f, and the fourth inequality in (50), we have that
a , b f φ 1 d μ a , b f φ λ d μ
1 λ a , b f φ 1 d μ + λ a , b f φ 0 d μ a , b f φ 0 d μ .
Similarly, if we define the functions ψ λ : a , b a , b 0 λ 1 by
ψ λ t : = 1 λ ψ 1 t + λ ψ 0 t ,
then
a , b f ψ 0 d μ a , b f ψ λ d μ
1 λ a , b f ψ 1 d μ + λ a , b f ψ 0 d μ a , b f ψ 1 d μ .
(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 a , b R with a < b , and let μ be a finite signed measure on B a , b , such that (14) holds.
(a) The inequality
f a + b 2 μ a , b a , b f d μ
holds for all convex functions f : a , b R if and only if
a , x x t d μ t 0 , x a , b .
(b) The inequality
a , b f d μ f a + f b 2 μ a , b
holds for all convex functions f : a , b R if and only if (41) is satisfied.
(c) Assume μ is a measure and φ 1 , φ 0 ψ 1 , ψ 0 : a , b a , b are increasing functions, such that
a , x φ 0 d μ a , x φ 1 d μ a , x t d μ t a , x ψ 1 d μ a , x ψ 0 d μ , x a , b
and
a , b φ 0 d μ = a , b φ 1 d μ = a , b ψ 1 d μ = a , b ψ 0 d μ = a + b 2 μ a , b
are satisfied. Then, for all convex functions f : a , b R , we have
f a + b 2 μ a , b
a , b f ψ 0 d μ a , b f ψ 1 d μ a , b f d μ a , b f φ 1 d μ a , b f φ 0 d μ
f a + f b 2 μ a , b + f a + b 2 f a + f b 2 μ a + b 2 .
Proof. 
Since the identity function on a , b satisfies (15), it follows from (18) that x μ = a + b 2 . 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 need to prove (57).
We introduce the increasing function φ l : a , b a , b ,
φ l t : = a , a t < a + b 2 a + b 2 , t = a + b 2 b , a + b 2 < t b .
By (18),
a , b t d μ t = a , b φ l d μ = a + b 2 μ a , b .
Next, we show that
a , x φ 0 d μ a , x φ l d μ , x a , b .
This is obvious if x a , a + b 2 . For x = a + b 2 , suppose that, on the contrary,
a , a + b 2 φ 0 d μ < a , a + b 2 φ l d μ = a μ a , a + b 2 + a + b 2 μ a + b 2 .
Then by using (58), (59) and φ 0 t b t a , b , we obtain
a + b 2 μ a , b = a , b φ 0 d μ = a , a + b 2 φ 0 d μ + a + b 2 , b φ 0 d μ
< a μ a , a + b 2 + a + b 2 μ a + b 2 + a + b 2 , b φ 0 d μ
a μ a , a + b 2 + a + b 2 μ a + b 2 + b μ a + b 2 , b
= a + b 2 μ a , b
which is a contradiction.
Finally, assume that there exists x a + b 2 , b , such that
a , x φ 0 d μ < a , x φ l d μ
= a μ a , a + b 2 + a + b 2 μ a + b 2 + b μ a + b 2 , x .
This implies by using (58) that
a + b 2 μ a , b = a , b φ 0 d μ < a μ a , a + b 2 + a + b 2 μ a + b 2
+ b μ a + b 2 , x + x , b φ 0 d μ .
Since φ 0 is increasing, it now follows from (14) that
a + b 2 μ a , b < a + b 2 μ a , b + μ x , b φ 0 b b a + b 2 μ a , b
which is also a contradiction.
Now, Theorem 6 (b 2 ) can be applied.
The proof is complete. □
Remark 7.
Let a , b R with a < b , and let μ be a finite measure on B a , b , 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 φ 1 , φ 0 ψ 1 , ψ 0 satisfy the symmetry property (15) and
a , x φ 0 d μ a , x φ 1 d μ a , x t d μ t a , x ψ 1 d μ a , x ψ 0 d μ , x a , a + b 2 .
(ii) The functions φ 1 , φ 0 ψ 1 , ψ 0 satisfy the symmetry property (15), and
φ 0 t φ 1 t t ψ 1 t ψ 0 t , t a , a + b 2 .
Really, by Lemma 4 (a), (60) implies (54) and (55), and by Lemma 4 (b), (61) implies (60).
(b) We proved in Theorem 9 that
f a + b 2 μ a , b a , b f d μ f a + f b 2 μ a , b ,
moreover, (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 B a , b .
Corollary 4.
Let a , b R with a < b , and let p : a , b R be a nonnegative and Lebesgue-integrable function for which
p t = p a + b t , t a , b .
Let φ 1 , φ 0 ψ 1 , ψ 0 : a , b a , b be increasing functions, such that
a x φ 0 p d λ a x φ 1 p d λ a x t p t d λ t a x ψ 1 p d λ a x ψ 0 p d λ , x a , b
and
a b φ 0 p d λ = a b φ 1 p d λ = a b ψ 1 p d λ = a b ψ 0 p d λ = b 2 a 2 2
are satisfied. If f : a , b R is a convex function, then
f a + b 2 a b p d λ
a b f ψ 0 p d λ a b f ψ 1 p d λ a b f p d λ a b f φ 1 p d λ a b f φ 0 p d λ
f a + f b 2 a b p d λ .
Proof. 
By (63), the measure μ defined on B a , b by
μ A : = A p d λ
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 φ 1 , φ 0 ψ 1 , ψ 0 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 inequality
f a + b 2 a b p d λ a b f p d λ f a + f b 2 a b p d λ
and especially the Hermite-Hadamard inequality
f a + b 2 a b f d λ f a + f b 2
are 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).

5. Application to f-Divergences

The following notion was introduced by Csiszár in [19,20].
Definition 4.
Let f : 0 , 0 , be a convex function, and let p : = p 1 , , p n and q : = q 1 , , q n be positive probability distributions. The f-functional divergence is
I f ( p , q ) : = i = 1 n q i f p i q i .
It is possible to use nonnegative probability distributions in the f-functional divergence, by defining
f 0 : = lim t 0 + f t ; 0 f 0 0 : = 0 ; 0 f a 0 : = lim t 0 + t f a t , a > 0 .
The basic inequality (which comes from the discrete Jensen inequality)
I f ( p , q ) f 1
is one of the key properties of f-divergences.
The refinement of inequality (66) is the subject of several papers (for a non-exhaustive list, see [21] and references therein, and papers [22,23,24,25]). In the following statement, we present a necessary and sufficient condition for the inequality
I f ( p , q ) I f ( u , v )
to be satisfied; thus, we obtain a necessary and sufficient condition for refining inequality (66) by another f-divergence.
Theorem 10.
Let X : = 1 , , n for some n 1 , and let Y : = 1 , , m for some m 1 . Let p : = p 1 , , p n , q : = q 1 , , q n , u : = u 1 , , u m and v : = v 1 , , v m be positive probability distributions. Let c 1 > c 2 > > c k be the different elements of p i q i i = 1 n and u j v j j = 1 m in decreasing order 1 k m + n . For every convex function f : 0 , 0 , inequality
i = 1 n q i f p i q i = I f ( p , q ) I f ( u , v ) = j = 1 m v j f u j v j
holds if and only if
j Y u j v j c l u j i X p i q i c l p i
c l j Y u j v j c l v j i X p i q i c l q i , l = 1 , , k .
Proof. 
Let a , b 0 , , such that a c k < c 1 b .
Define the probability measures μ and ν on B a , b by
ν : = i = 1 n q i ε p i / q i and μ : = j = 1 m v j ε u j / v j ,
and let φ , ψ : a , b 0 , , φ t = ψ t : = t .
Then φ L a , b , μ , ψ L a , b , ν , f φ L a , b , μ , f ψ L a , b , ν and
I f ( p , q ) = a , b ψ d ν and I f ( u , v ) = a , b φ d μ .
By Theorem 5 (c), inequality (67) holds if and only if it is satisfied in the following special cases: function f is p 0 , , x x 0 , . This means that inequality (67) holds if and only if
j Y u j v j x v j u j v j x i X p i q i x q i p i q i x , x 0 , ,
or, equivalently,
j Y u j v j x u j i X p i q i x p i
x j Y u j v j x v j i X p i q i x q i , x 0 , .
It follows that it is enough to prove the equivalence of (68) and (69).
It is obvious that (69) implies (68).
Conversely, assume (68) is satisfied, and let c l + 1 < x c l for some 1 l < k .
Then
j Y u j v j c l u j i X p i q i c l p i + j Y u j v j = c l + 1 u j i X p i q i = c l + 1 p i
= j Y u j v j c l + 1 u j i X p i q i c l + 1 p i
c l + 1 j Y u j v j c l + 1 v j i X p i q i c l + 1 q i
= c l + 1 j Y u j v j c l v j i X p i q i c l q i
+ c l + 1 j Y u j v j = c l + 1 v j i X p i q i = c l + 1 q i
= c l + 1 j Y u j v j c l v j i X p i q i c l q i
+ j Y u j v j = c l + 1 u j i X p i q i = c l + 1 p i ,
and, therefore,
j Y u j v j c l u j i X p i q i c l p i c l + 1 j Y u j v j c l v j i X p i q i c l q i .
It now follows from (68) and (70) that
j Y u j v j x u j i X p i q i x p i = j Y u j v j c l u j i X p i q i c l p i
c l j Y u j v j c l v j i X p i q i c l q i
= c l j Y u j v j x v j i X p i q i x q i
and
j Y u j v j x u j i X p i q i x p i c l + 1 j Y u j v j x v j i X p i q i x q i
and these imply (69).
The proof is complete. □
Remark 9.
We emphasize that the test for the inequalities in (68) is finite and easily verifiable.

6. Conclusions

In this paper, we studied majorization-type integral inequalities by using finite signed measures. Necessary and sufficient conditions were given for the inequalities under consideration to be satisfied. In order to achieve this goal, we generalized the statement on the approximation of convex functions defined on compact intervals by piecewise linear convex functions to arbitrary intervals. This in itself is an interesting and useful result. To apply these results, we first dealt with Hermite-Hadamard–Fejér-type inequalities and their refinements. Along with new results, we obtained unified and simple proofs of some classical statements. Finally, we obtained 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, where proofs are based on different ideas, can be treated in a uniform way by this method. The results obtained and the methods used can be useful in many areas. Finally, we established a necessary and sufficient condition for when a fundamental inequality of f-divergences can be refined by another f-divergence.

Funding

Research supported by the Hungarian National Research, Development, and Innovation Office grant no. K139346.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares that he has no conflict of interest.

References

  1. Niculescu, C.; Persson, L.E. Convex Functions and Their Applications; A Contemporary Approach; Springer: Berlin/Heidelberg, Germany, 2006; pp. 1–255. [Google Scholar]
  2. Fuchs, L. A new proof of an inequality of Hardy, Littlewood and Pólya. Mat. Tidsskr. B 1947, 53–54. [Google Scholar]
  3. Pečarić, J.; Proschan, F.; Tong, Y.L. Convex Functions, Partial Orderings and Statistical Applications; Academic Press: Cambridge, MA, USA, 1992; pp. 1–467. [Google Scholar]
  4. Borell, C. Integral inequalities for generalized concave or convex functions. J. Math. Anal. Appl. 1973, 43, 419–440. [Google Scholar] [CrossRef] [Green Version]
  5. Maligranda, L.; Pečarić, J.; Persson, L.E. Weighted Favard and Berwald inequalities. J. Math. Anal. Appl. 1995, 190, 248–262. [Google Scholar] [CrossRef] [Green Version]
  6. Pečarić, J. Note on an integral inequality of Ky Fan and G. G. Lorentz. Am. Math. Mon. 1981, 88, 275–276. [Google Scholar] [CrossRef]
  7. Pečarić, J. On some inequalities for functions with nondecreasing increments. J. Math. Anal. Appl. 1984, 98, 188–197. [Google Scholar] [CrossRef] [Green Version]
  8. Barnett, N.S.; Cerone, P.; Dragomir, S.S. Majorisation inequalities for Stieltjes integrals. Appl. Math. Lett. 2009, 22, 416–421. [Google Scholar] [CrossRef] [Green Version]
  9. Fink, A.M. A best possible Hadamard inequality. Math. Inequal. Appl. 1998, 1, 223–230. [Google Scholar] [CrossRef]
  10. Florea, A.; Niculescu, C.P. A Hermite-Hadamard inequality for convex-concave symmetric functions. Bull. Math. Soc. Sci. Math. Roum. 2007, 50, 149–156. [Google Scholar]
  11. Popoviciu, T. Sur quelques propriétés des fonctions d’une ou de deux variables réelles. Mathematica 1934, 8, 1–85. [Google Scholar]
  12. Levin, V.I.; Stečkin, S.B. Inequalities. Am. Math. Soc. Transl. 1960, 14, 1–22. [Google Scholar]
  13. El Farissi, A. Simple proof and refinement of Hermite-Hadamard inequality. J. Math. Inequal. 2010, 4, 365–369. [Google Scholar] [CrossRef] [Green Version]
  14. Idris, M. A note on the refinement of Hermite-Hadamard inequality. J. Phys. Conf. Ser. 2021, 2106, 012006. [Google Scholar] [CrossRef]
  15. Pavić, Z. Improvements of the Hermite-Hadamard inequality. J. Inequal. Appl. 2015, 2015, 222. [Google Scholar] [CrossRef] [Green Version]
  16. Simić, S. Further improvements of Hermite-Hadamard integral inequality. Kragujev. J. Math. 2019, 43, 259–265. [Google Scholar]
  17. Simić, S.; Bin-Mohsin, B. Some improvements of the Hermite-Hadamard integral inequality. Symmetry 2020, 12, 117. [Google Scholar] [CrossRef] [Green Version]
  18. Horváth, L. Some notes on Jensen-Mercer’s type inequalities; extensions and refinements with applications. Math. Inequal. Appl. 2021, 24, 1093–1111. [Google Scholar] [CrossRef]
  19. Csiszár, I. Information measures: A critical survey. In Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions, Random Processes; Academia Prague: Prague, Czech Republic, 1978; Volume B, pp. 73–86. [Google Scholar]
  20. Csiszár, I. Information-type measures of difference of probability distributions and indirect observations. Stud. Sci. Math. Hungar. 1967, 2, 299–318. [Google Scholar]
  21. Khan, M.A.; Khan, K.A.; Pečarić, Đ.; Pečarić, J. Some New Improvements of Jensen’s Inequality, Jensen’s Type Inequalities in Information Theory; Element: Zagreb, Croatia, 2020; pp. 1–148. [Google Scholar]
  22. Dragomir, S.S. A new refinement of Jensen’s inequality in linear spaces with applications. Math. Comput. Model. 2010, 52, 1497–1505. [Google Scholar] [CrossRef] [Green Version]
  23. Horváth, L.; Pečarić, Đ.; Pečarić, J. Estimations of f- and Rényi divergences by using a cyclic refinement of the Jensen’s inequality. Bull. Malays. Math. Sci. Soc. 2019, 42, 933–946. [Google Scholar] [CrossRef]
  24. Khan, M.A.; Al-Sahwi, Z.M.; Chu, Y.M. New estimations for Shannon and Zipf–Mandelbrot entropies. Entropy 2018, 20, 608. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  25. Khan, M.A.; Faisal, S.; Khan, S. Estimation of Jensen’s gap through an integral identity with applications to divergence. Innov. J. Math. 2022, 1, 99–114. [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.

Share and Cite

MDPI and ACS Style

Horváth, L. Uniform Treatment of Integral Majorization Inequalities with Applications to Hermite-Hadamard-Fejér-Type Inequalities and f-Divergences. Entropy 2023, 25, 954. https://doi.org/10.3390/e25060954

AMA Style

Horváth L. Uniform Treatment of Integral Majorization Inequalities with Applications to Hermite-Hadamard-Fejér-Type Inequalities and f-Divergences. Entropy. 2023; 25(6):954. https://doi.org/10.3390/e25060954

Chicago/Turabian Style

Horváth, László. 2023. "Uniform Treatment of Integral Majorization Inequalities with Applications to Hermite-Hadamard-Fejér-Type Inequalities and f-Divergences" Entropy 25, no. 6: 954. https://doi.org/10.3390/e25060954

APA Style

Horváth, L. (2023). Uniform Treatment of Integral Majorization Inequalities with Applications to Hermite-Hadamard-Fejér-Type Inequalities and f-Divergences. Entropy, 25(6), 954. https://doi.org/10.3390/e25060954

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop