Abstract
We derive the Levinson type generalization of the Jensen and the converse Jensen inequality for real Stieltjes measure, not necessarily positive. As a consequence, also the Levinson type generalization of the Hermite-Hadamard inequality is obtained. Similarly, we derive the Levinson type generalization of Giaccardi’s inequality. The obtained results are then applied for establishing new mean-value theorems. The results from this paper represent a generalization of several recent results.
Keywords: Jensen’s inequality, converse Jensen’s inequality, Hermite-Hadamard’s inequality, Giaccardi’s inequality, Levinson’s inequality, Green function, mean-value theorems
Introduction and preliminary results
The well-known Jensen inequality asserts that for a convex function we have
| 1.1 |
where for , and are nonnegative real numbers such that .
Steffensen [1] showed that inequality (1.1) also holds in the case when is a monotonic n-tuple of numbers from the interval I and is an arbitrary real n-tuple such that (), , where . His result is called the Jensen-Steffensen inequality.
Boas [2] gave the integral analog of the Jensen-Steffensen inequality.
Theorem 1.1
[2]
Let be a continuous convex function, where I is the range of the continuous monotonic function (either increasing or decreasing) , and let be either continuous or of bounded variation satisfying
Then
| 1.2 |
The generalization of this result is also given by Boas in [2]. It is the so-called Jensen-Boas inequality (see also [3]).
Theorem 1.2
[2]
If is either continuous or of bounded variation satisfying
for all , , , and , and if f is continuous and monotonic (either increasing or decreasing) in each of the n intervals , then inequality (1.2) holds.
The following theorem states the well-known Levinson inequality.
Theorem 1.3
[4]
Let satisfy and let , be such that , , and
| 1.3 |
Then the following inequality is valid:
| 1.4 |
where and denote the weighted arithmetic means.
Numerous papers have been devoted to extensions and generalizations of this result, as well as to weakening the assumptions under which inequality (1.4) is valid (see for instance [5–8], and [9]).
A function is called k-convex if for all choices of distinct points . If the kth derivative of a convex function exists, then , but may not exist (for properties of divided differences and k-convex functions see [3]).
Remark 1.4
- (i)
- (ii)
- (iii)
-
(iv)
Witkowski [9] showed that it is enough to assume that f is 3-convex in Mercer’s assumptions. Furthermore, Witkowski weakened the assumption (1.6) and showed that equality can be replaced by inequality in a certain direction.
Furthermore, Baloch, Pečarić, and Praljak in their paper [5] introduced a new class of functions that extends 3-convex functions and can be interpreted as functions that are ‘3-convex at point ’. They showed that is the largest class of functions for which Levinson’s inequality (1.4) holds under Mercer’s assumptions, i.e. that if and only if inequality (1.4) holds for arbitrary weights , and sequences and that satisfy for .
We give the definition of the class extended to an arbitrary interval I.
Definition 1.5
Let and , where is the interior of I. We say that () if there exists a constant D such that the function is concave (convex) on and convex (concave) on .
Remark 1.6
For the class the following useful results hold (see [5]):
- (1)
If , , and exists, then .
- (2)
The function is 3-convex (3-concave), if and only if () for every .
Jakšetić, Pečarić, and Praljak in [10] gave the following Levinson type generalization of the Jensen-Boas inequality.
Theorem 1.7
[10]
Let and let and be continuous monotonic functions (either increasing or decreasing) with ranges and , respectively. Let and be continuous or of bounded variation satisfying
for all , , , and , and
for all , , , and . If is continuous and if
holds, then
| 1.7 |
On the other hand, in [11] Pečarić, Perić, and Rodić Lipanović generalized the Jensen inequality (1.2) for a real Stieltjes measure. They considered the Green function G defined on by
| 1.8 |
which is convex and continuous with respect to both s and t. The function G is continuous under s and continuous under t, and it can easily be shown by integrating by parts that any function , , can be represented by
| 1.9 |
Using that fact, the authors in [11] gave the conditions under which inequality (1.2) holds for a real Stieltjes measure, which is not necessarily positive nor increasing. This result is stated in the following theorem.
Theorem 1.8
[11]
Let be continuous function and interval such that the image of g is a subset of . Let be continuous function or the function of bounded variation, such that and
Then the following two statements are equivalent:
- (1)
- For every continuous convex function
holds.1.10 - (2)
- For all
holds, where the function is defined in (1.8).1.11
Furthermore, the statements (1) and (2) are also equivalent if we change the sign of inequality in both (1.10) and (1.11).
Note that for every continuous concave function inequality (1.10) is reversed, i.e. the following corollary holds.
Corollary 1.9
[11]
Let the conditions from the previous theorem hold. Then the following two statements are equivalent:
- (1′)
For every continuous concave function the reverse inequality in (1.10) holds.
- (2′)
For all inequality (1.11) holds, where the function G is defined in (1.8).
Moreover, the statements (1′) and (2′) are also equivalent if we change the sign of inequality in both statements (1′) and (2′).
The main aim of our paper is to give a Levinson type generalization of the result from Theorem 1.8. In that way, a generalization of Theorem 1.7 for real Stieltjes measure, not necessarily positive nor increasing, will also be obtained.
Main results
In order to simplify the notation, throughout this paper we use the following notation:
The following theorem states our main result.
Theorem 2.1
Let and be continuous functions, an interval and such that and . Let and be continuous functions or functions of bounded variation such that and and such that
and
| 2.1 |
holds.
If for all and for all we have
| 2.2 |
where the function G is defined in (1.8), then for every continuous function we have
| 2.3 |
The statement also holds if we reverse all signs of inequalities in (2.2) and (2.3).
Proof
Let be continuous function on and let , where D is the constant from Definition 1.5.
Since the function ϕ is continuous and concave on and for all (2.2) holds, from Corollary 1.9 it follows that
When we rearrange the previous inequality, we get
| 2.4 |
Since the function ϕ is continuous and convex on and for all (2.2) holds, from Theorem 1.8 it follows that
and after rearranging we get
| 2.5 |
Inequality (2.3) follows directly by combining inequalities (2.4) and (2.5), and taking into account the condition (2.1). □
Corollary 2.2
Let the conditions from the previous theorem hold.
Remark 2.3
It is obvious from the proof of the previous theorem that if we replace the equality (2.1) by a weaker condition
| 2.6 |
then (2.3) becomes
Since the function φ belongs to class , we have (see [5]), so if additionally φ is convex (resp. concave), the condition (2.6) can be further weakened to
Remark 2.4
It is easy to see that Theorem 2.1 further generalizes the Levinson type generalization of the Jensen-Boas inequality given in Theorem 1.7. Namely, if in Theorem 2.1 we set the functions f and g to be monotonic, and the functions λ and μ to satisfy
for all , , , and , and
for all , , , and , then since the function G is continuous and convex in both variables, we can apply the Jensen inequality and see that for all and inequalities (2.2) hold, so we get exactly Theorem 1.7.
Discrete case
In this section we give the results for the discrete case. The proofs are similar to those in the integral case given in the previous section, so we will state these results without the proofs.
In Levinson’s inequality (1.3) and its generalizations (see [5]) we see that () are positive real numbers. Here, we will give a generalization of that result, allowing to also be negative, with the sum not equal to zero, but with a supplementary demand on and given by using the Green function G defined in (1.8).
Here we use the common notation: for real n-tuples and we set , () and . Analogously, for real m-tuples and we define , () and ȳ.
We already know from the first section that we can represent any function , , in the form (1.9), where the function G is defined in (1.8), and by some calculation it is easy to show that the following holds:
Using that fact the authors in [11] derived the analogous results of Theorem 1.8 and Corollary 1.9 for discrete case, and here, similarly as in the previous section, we get the following results.
Theorem 3.1
Let be an interval and . Let , () be such that and , and let , () be such that and and let
| 3.1 |
If for all and for all we have
| 3.2 |
where the function G is defined in (1.8), then for every continuous function we have
| 3.3 |
where D is the constant from Definition 1.5.
Inequality (3.3) is reversed if we change the signs of inequalities in (3.2).
Corollary 3.2
Let the conditions from the previous theorem hold.
Remark 3.3
Theorem 3.1 is the generalization of Levinson’s type inequality given in [5]. Namely, since the function G is convex in both variables, in the case when all and we can apply the Jensen inequality and we see that for all and inequalities (3.2) hold. Now from Theorem 3.1 and Corollary 3.2 we get the result from [5].
Remark 3.4
We can replace the equality from the condition (3.1) by a weaker condition in the analogous way as in Remark 2.3 from the previous section.
Converses of the Jensen inequality
The Jensen inequality for convex functions implies a whole series of other classical inequalities. One of the most famous ones amongst them is the so-called Edmundson-Lah-Ribarič inequality which states that, for a positive measure μ on and a convex function ϕ on (), if f is any μ-measurable function on such that for , one has
| 4.1 |
where .
It was obtained in 1973. by Lah and Ribarič in their paper [12]. Since then, there have been many papers written on the subject of its generalizations and converses (for instance, see [13] and [3]).
In [14] the authors gave a Levinson type generalization of inequality (4.1) for positive measures. In this section we will obtain a similar result involving signed measures, with a supplementary demand by using the Green function G defined in (1.8). In order to do so, we first need to state a result from [11], which gives us a version of the Edmundson-Lah-Ribarič inequality for signed measures.
Theorem 4.1
[11]
Let be continuous function and be an interval such that the image of g is a subset of . Let be such that for all . Let be continuous function or the function of bounded variation, and . Then the following two statements are equivalent:
- (1)
- For every continuous convex function
holds, where .4.2 - (2)
- For all
holds, where the function is defined in (1.8).4.3
Furthermore, the statements and are also equivalent if we change the sign of inequality in both (4.2) and (4.3).
Note that for every continuous concave function inequality (4.2) is reversed, i.e. the following corollary holds.
Corollary 4.2
[11]
Let the conditions from the previous theorem hold. Then the following two statements are equivalent:
- (1′)
For every continuous concave function the reverse inequality in (4.2) holds.
- (2′)
For all inequality (4.3) holds, where the function G is defined in (1.8).
Moreover, the statements (1′) and (2′) are also equivalent if we change the sign of inequality in both statements (1′) and (2′).
In the following theorem we give the Levinson type generalization of the upper result, and we use a similar method to Section 2 of this paper.
Theorem 4.3
Let and be continuous functions, an interval and such that and , where and . Let and be continuous functions or functions of bounded variation such that and and
| 4.4 |
If for all we have
| 4.5 |
and for all we have
| 4.6 |
where the function G is defined in (1.8), then for every continuous function we have
| 4.7 |
The statement also holds if we reverse all signs of inequalities in (4.5), (4.6) and (4.7).
Proof
Let be continuous function on and let , where D is the constant from Definition 1.5.
Since the function ϕ is continuous and concave on and for all (4.5) holds, from Corollary 4.2 it follows that
When we rearrange the previous inequality, we get
| 4.8 |
Since the function ϕ is continuous and convex on and for all (4.6) holds, from Theorem 4.1 it follows that
and after rearranging we get
| 4.9 |
Inequality (4.7) follows directly by combining inequalities (4.8) and (4.9), and taking into account the condition (4.4). □
Corollary 4.4
Let the conditions from the previous theorem hold.
-
(i)
If for all the inequality in (4.5) holds, and for all the inequality in (4.6) holds, then for every continuous function the reverse inequalities in (4.7) hold.
-
(ii)
If for all the reversed inequality in (4.5) holds, and for all the reversed inequality in (4.6) holds, then for every continuous function the inequalities in (4.7) hold.
Remark 4.5
It is obvious from the proof of the previous theorem that if we replace the equality (4.4) by a weaker condition
| 4.10 |
then (4.7) becomes
Since (see [5]), if additionally φ is convex (resp. concave), the condition (4.10) can be further weakened to
Discrete form of the converses of the Jensen inequality
In this section we give the Levinson type generalization for converses of Jensen’s inequality in discrete case. The proofs are similar to those in the integral case given in the previous section, so we give these results with the proofs omitted.
As we can represent any function , , in the form (1.9), where the function G is defined in (1.8), by some calculation it is easy to show that the following holds:
Using that fact the authors in [11] derived analogous results of Theorem 4.1 and Corollary 4.2 for discrete case.
In [14] the authors obtained the following Levinson type generalization of the discrete Edmundson-Lah-Ribarič inequality.
Theorem 5.1
[14]
Let . If , , , for and are such that and
where and , then for every we have
Our first result is a generalization of the result from [14] stated above, in which it is allowed for to also be negative, with the sum not equal to zero, but with supplementary demands on and given by using the Green function G defined in (1.8).
Theorem 5.2
Let be an interval and . Let , , (), and , , () be such that and and
| 5.1 |
If for all we have
| 5.2 |
and for all we have
| 5.3 |
where , and the function G is defined in (1.8), then for every continuous function we have
| 5.4 |
The statement also holds if we reverse all signs of the inequalities in (5.2), (5.3), and (5.4).
Remark 5.3
If we set all to be positive, then Theorem 5.2 becomes the result from [14] which is stated above in Theorem 5.1.
Corollary 5.4
Let the conditions from the previous theorem hold.
-
(i)
If for all inequality (5.2) holds and for all inequality (5.3) holds, then for every continuous function the reverse inequalities in (5.4) hold.
-
(ii)
If for all the reversed inequality in (5.2) holds and for all the reversed inequality in (5.3) holds, then for every continuous function (5.4) holds.
Remark 5.5
We can replace the equality from the condition (5.1) by a weaker condition in the analogous way as in Remark 4.5 from the previous chapter.
The Hermite-Hadamard inequality
The classical Hermite-Hadamard inequality states that for a convex function the following estimation holds:
| 6.1 |
Its weighted form is proved by Fejér in [15]: If is a convex function and nonnegative integrable function, symmetric with respect to the middle point , then the following estimation holds:
| 6.2 |
Fink in [16] discussed the generalization of (6.1) by separately looking the left and right side of the inequality and considering certain signed measures. In their paper [17], the authors gave a complete characterization of the right side of the Hermite-Hadamard inequality.
Rodić Lipanović, Pečarić, and Perić in [11] obtained the complete characterization for the left and the right side of the generalized Hermite-Hadamard inequality for the real Stieltjes measure.
In this section a Levinson type generalization of the Hermite-Hadamard inequality for signed measures will be given as a consequence of the results given in Sections 2 and 4.
Here we use the following notation:
Corollary 6.1
Let be an interval and and let and . Let and be continuous functions or functions of bounded variation such that , and , , and such that
| 6.3 |
If for all and for all the inequalities
| 6.4 |
hold, where the function G is defined in (1.8), then for every continuous function we have
| 6.5 |
The statement also holds if we reverse all signs of the inequalities in (6.4) and (6.5).
Remark 6.2
Let the conditions from the previous corollary hold.
-
(i)
If for all and inequalities (6.4) hold, then for every continuous function the reverse inequalities in (6.5) hold.
-
(ii)
If for all and the reversed inequalities in (6.4) hold, then for every continuous function (6.5) holds.
Note that for the Levinson type generalization of the left-side inequality of the generalized Hermite-Hadamard inequality it is necessary to demand that and .
Remark 6.3
If in Remark 2.3 we put and , we can obtain weaker conditions instead of equality (6.3) under which inequality (6.5) holds.
Similarly, from the results given in the fourth section we get the Levinson type generalization of the right-side inequality of the generalized Hermite-Hadamard inequality. Here we allow that the mean value x̃ goes outside of the interval and ỹ outside of the interval .
Corollary 6.4
Let be an interval and , and let and . Let and be continuous functions or functions of bounded variation such that and and such that
| 6.6 |
If for all we have
| 6.7 |
and for all we have
| 6.8 |
where the function G is defined in (1.8), then for every continuous function we have
| 6.9 |
The statement also holds if we reverse all signs of the inequalities in (6.7), (6.8) and (6.9).
Remark 6.5
Let the conditions from the previous theorem hold.
-
(i)
If for all inequality (6.7) holds and for all inequality (6.8) holds, then for every continuous function the reverse inequalities in (6.9) hold.
-
(ii)
If for all the reversed inequality in (6.7) holds and for all the reversed inequality in (6.8) holds, then for every continuous function (6.9) holds.
Remark 6.6
If in Remark 4.5 we put and , we can obtain analogous weaker conditions instead of equality (6.6) under which inequality (6.9) holds.
It is easy to see that for and the conditions (6.4), (6.7) and (6.8) are always fulfilled. In that way we can obtain a Levinson type generalization of both sides in the classical weighted Hermite-Hadamard inequality.
Corollary 6.7
Let be an interval and , and let and .
-
(i)If holds, then for every continuous function
-
(ii)If holds, then for every continuous function
If , then the inequalities in (i) and (ii) are reversed.
The inequalities of Giaccardi and Petrović
The well-known Petrović inequality [18] for convex function is given by
| 7.1 |
where are nonnegative numbers such that , .
The following generalization of (7.1) is given by Giaccardi (see [3] and [19]).
Theorem 7.1
Giaccardi, [19]
Let be a nonnegative n-tuple and be a real n-tuple such that
If is a convex function, then
| 7.2 |
where
In this section we will use an analogous technique as in the previous sections to obtain a Levinson type generalization of the Giaccardi inequality for n-tuples p of real numbers which are not necessarily nonnegative. As a simple consequence, we will obtain a Levinson type generalization of the original Giaccardi inequality (7.2). In order to do so, we first need to state two results from [11].
Theorem 7.2
[11]
Let , , () be such that . Then the following two statements are equivalent:
- (1)
- For every continuous convex function
holds.7.3 - (2)
- For all
holds, where the function is defined in (1.8).7.4
Moreover, the statements (1) and (2) are also equivalent if we change the sign of the inequality in both inequalities, in (7.3) and in (7.4).
Corollary 7.3
[11]
Under the conditions from the previous theorem, the following two statements are also equivalent:
- (1′)
For every continuous concave function the reverse inequality in (7.3) holds.
- (2′)
For all inequality (7.4) holds.
Moreover, the statements (1′) and (2′) are also equivalent if we change the sign of inequality in both statements (1′) and (2′).
Our first result is a Levinson type generalization of the Giaccardi inequality for n-tuples p and m-tuples q of arbitrary real numbers instead of nonnegative real numbers.
Theorem 7.4
Let be an interval and such that and . Let p and x be n-tuples of real numbers, and let q and y be m-tuples of real numbers such that , , and
| 7.5 |
Let
| 7.6 |
where
| 7.7 |
If and for all and the function G defined in (1.8) the inequalities
| 7.8 |
| 7.9 |
hold, then for every continuous function we have
| 7.10 |
The statement also holds if we reverse all signs of the inequalities in (7.8), (7.9), and (7.10).
Proof
We follow the same idea as in the proof of Theorem 4.3 from Section 4. We apply Theorem 7.2 and Corollary 7.3 to the function , which is concave on and convex on . We set , on , and then we set and on , as well as consider the signs of and . We omit the details. □
Corollary 7.5
Let the assumptions from the previous theorem hold.
-
(i)
If and and if for all inequality (7.8) holds and inequality (7.9) is reversed, then (7.10) holds.
-
(ii)
If and and if for all inequality (7.8) is reversed and inequality (7.9) holds, then (7.10) holds.
Statements (i) and (ii) also hold if we reverse the signs in all of the inequalities.
Corollary 7.6
Let the assumptions from the previous theorem hold.
-
(i)
If and if for all inequalities (7.8) and (7.9) hold, then for every continuous function the reversed inequality in (7.10) holds.
-
(ii)
If and if for all inequalities (7.8) and (7.9) are reversed, then for every continuous function (7.10) holds.
-
(iii)
If and and if for all inequality (7.8) holds and inequality (7.9) is reversed, then for every continuous function the reversed inequality in (7.10) holds.
-
(iv)
If and and if for all inequality (7.8) is reversed and inequality (7.9) holds, then for every continuous function the reversed inequality in (7.10) holds.
Statements (iii) and (iv) also hold if we reverse the signs in all of the mentioned inequalities.
Remark 7.7
One needs to notice that if we set () and () to be positive, Theorem 7.4 becomes the Levinson type generalization of the original Giaccardi inequality (7.2).
Remark 7.8
As in the previous sections, we can replace the equality (7.6) by a weaker condition
| 7.11 |
and then (7.10) becomes
Since (see [5]), if additionally φ is convex (resp. concave), the condition (7.11) can be further weakened to
Mean-value theorems
Let and be continuous functions, an interval and such that and . Let and be continuous functions or functions of bounded variation such that and , and let be a continuous function.
Motivated by the results obtained in previous sections, we define the following linear functionals which, respectively, represent the difference between the right and the left side of inequalities (2.3) and (4.7):
| 8.1 |
where , ;
| 8.2 |
where and .
We have:
In the following two theorems we give the mean-value theorems of the Lagrange and Cauchy type, respectively.
Theorem 8.1
Let and be continuous functions, an interval and such that and . Let and be continuous functions or functions of bounded variation such that , . Let and be linear functionals defined above, and let .
- (i)
- (ii)
Proof
Since is continuous on , it attains its minimum and maximum value on , i.e. there exist and . The functions defined by
are 3-convex because and , so from Remark 1.6 it follows that they belong to the class . From Theorem 2.1 it follows that and , and from Theorem 4.3 it follows that and and so we get
| 8.5 |
| 8.6 |
where . Since the function φ̃ is 3-convex, we have , so by applying Theorem 2.1 (resp. Theorem 4.3) we get (resp. ). If (resp. ), then (8.5) implies (resp. (8.6) implies ), so (8.3) (resp. (8.4)) holds for every . Otherwise, dividing (8.5) by (resp. (8.6) by ) we get
and continuity of ensures the existence of satisfying (8.3) (resp. satisfying (8.4)). □
Theorem 8.2
Let the conditions from Theorem 8.1 hold. Let . If and , then there exist such that
and
Proof
Let us define a function by . Due to the linearity of we have . Theorem 8.1 implies that there exist such that
where . Now we have , because otherwise we would have , which is a contradiction with the assumption . So we have
and this gives us the first claim of the theorem. The second claim is proved in an analogous manner, by observing the linear functional instead of . □
Remark 8.3
Note that if in Theorem 8.2 we set the function ψ to be , we get exactly Theorem 8.1.
Remark 8.4
Note that if we set the functions f, g, λ, and μ from our theorems to fulfill the conditions from Jensen’s integral inequality or Jensen-Steffensen’s, or Jensen-Brunk’s, or Jensen-Boas’ inequality, then - applying that inequality on the function G which is continuous and convex in both variables - we see that in these cases for all , inequalities in (2.2) hold, and so from our results we directly get the results from the paper [10].
Remark 8.5
If in the definition of the functional (resp. ) we set and , then we get a functional that represents the difference between the right and the left side of the left-hand part (resp. right-hand part) of the generalized Hermite-Hadamard inequality. In the same manner, adequate results of Lagrange and Cauchy type for those functionals can be derived directly from Theorem 8.1 and Theorem 8.2.
Discrete case
Let and . Let , () be such that , and let , () be such that . Let be a continuous function.
As before, motivated by the discrete results obtained in previous sections, we define the following linear functionals which, respectively, represent the difference between the right and the left side of inequalities (3.3), (5.4), and (7.10):
| 8.7 |
where , ;
| 8.8 |
where and ;
| 8.9 |
where the conditions (7.5) hold and are defined in (7.7).
We have:
The following two results are mean-value theorems of the Lagrange and Cauchy type, respectively, and they are obtained in an analogous way to the theorems of the same type in the previous sections, so we omit the proof.
Theorem 8.6
Let be an interval and . Let , () be such that and let , () be such that . Let , , and be the linear functionals defined above, and let .
- (i)
- (ii)
- (iii)
Theorem 8.7
Let the conditions of Theorem 8.6 hold and let . If , , and , then there exist such that all of the following statements hold:
| 8.13 |
| 8.14 |
| 8.15 |
Remark 8.8
Note that if in Theorem 8.7 we set the function ψ to be , we get exactly Theorem 8.6.
As a consequence of the previous two theorems, we now give some further results in which we give explicit conditions on () and () for (8.10) and (8.13) to hold, where using the properties of the function G we can skip the supplementary conditions on that function.
Corollary 8.9
Let , () and , (), and let .
Proof
Note that implies that and , so we can set the interval to be and to be . The function G is convex, so by Jensen’s inequality we see that the inequalities in (3.2) hold for all , . Now we can apply Theorem 8.6 and Theorem 8.7 to get the statements of this corollary. □
Corollary 8.10
Let be monotonic n-tuple, () and be monotonic m-tuple, (). Let be a real n-tuple such that
and be a real m-tuple such that
Let .
Proof
Suppose that . We have
so it follows that . Furthermore,
so . We see that we have obtained , that is, . In an analogous way we can get . Therefore, as well as in the proof of the previous corollary, we can set the interval to be and to be . By the Jensen-Steffensen inequality we see that for the convex function G the inequalities in (3.2) hold for all , . Now the statements of this corollary follow directly from Theorem 8.6 and Theorem 8.7. □
Acknowledgements
This research is supported by Croatian Science Foundation under the project 5435.
Footnotes
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.
Contributor Information
Rozarija Mikić, Email: rjaksic@ttf.hr.
Josip Pečarić, Email: pecaric@element.hr.
Mirna Rodić, Email: mrodic@ttf.hr.
References
- 1.Steffensen JF. On certain inequalities and methods of approximation. J. Inst. Actuar. 1919;51:274–297. [Google Scholar]
- 2.Boas RP. The Jensen-Steffensen inequality. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1970;302-319:1–8. [Google Scholar]
- 3.Pečarić JE, Proschan F, Tong YL. Convex Functions, Partial Orderings, and Statistical Applications. San Diego: Academic Press; 1992. [Google Scholar]
- 4.Levinson N. Generalisation of an inequality of Ky Fan. J. Math. Anal. Appl. 1964;8:133–134. doi: 10.1016/0022-247X(64)90089-7. [DOI] [Google Scholar]
- 5.Baloch IA, Pečarić J, Praljak M. Generalization of Levinson’s inequality. J. Math. Inequal. 2015;9(2):571–586. doi: 10.7153/jmi-09-49. [DOI] [Google Scholar]
- 6.Bullen PS. An inequality of N. Levinson. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1985;421-460:109–112. [Google Scholar]
- 7.Mercer AMcD. Short proof of Jensen’s and Levinson’s inequality. Math. Gaz. 2010;94:492–495. doi: 10.1017/S0025557200001820. [DOI] [Google Scholar]
- 8.Pečarić J. On an inequality of N. Levinson. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1980;678-715:71–74. [Google Scholar]
- 9. Witkowski, A: On Levinson’s inequality. RGMIA Research Report Collection 15, Art. 68 (2012)
- 10.Jakšetić J, Pečarić J, Praljak M. Generalized Jensen-Steffensen inequality and exponential convexity. J. Math. Inequal. 2015;9(4):1287–1302. [Google Scholar]
- 11.Pečarić J, Perić I, Rodić Lipanović M. Uniform treatment of Jensen type inequalities. Math. Rep. 2014;16(66)(2):183–205. [Google Scholar]
- 12.Lah P, Ribarič M. Converse of Jensen’s inequality for convex functions. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1973;412-460:201–205. [Google Scholar]
- 13. Edmundson, HP: Bounds on the expectation of a convex function of a random variable. The Rand Corporation, Paper No. 982 (1956)
- 14.Jakšić R, Pečarić J. Levinson’s type generalization of the Edmundson-Lah-Ribarič inequality. Mediterr. J. Math. 2016;13(1):483–496. doi: 10.1007/s00009-014-0478-y. [DOI] [Google Scholar]
- 15.Fejér L. Über die Fourierreihen, II. Math. Naturwiss. Anz. Ungar. Akad. Wiss. 1906;24:369–390. [Google Scholar]
- 16.Fink AM. A best possible Hadamard inequality. Math. Inequal. Appl. 1998;1:223–230. [Google Scholar]
- 17.Florea A, Niculescu CP. A Hermite-Hadamard inequality for convex-concave symmetric functions. Bull. Math. Soc. Sci. Math. Roum. 2007;50(98)(2):149–156. [Google Scholar]
- 18.Petrović M. Sur une fonctionnelle. Publ. Math. Univ. Belgrade. 1932;1:149–156. [Google Scholar]
- 19.Vasić PM, Pečarić JE. On the Jensen inequality for monotone functions I. An. Univ. Vest. Timiş., Ser. Mat.-Inform. 1979;1:95–104. [Google Scholar]
