- Open Access
Several integral inequalities and an upper bound for the bidimensional Hermite-Hadamard inequality
Journal of Inequalities and Applications volume 2013, Article number: 27 (2013)
In this paper we prove several integral inequalities and we find an upper bound of the Hermite-Hadamard inequality for a convex function on a bounded area from the plane in special cases.
Let f be a convex function on . Then we have the following inequality, which is called Hermite-Hadamard inequality:
There are many extensions, generalizations and similar results of inequality (1.1). In , Fejer established the following weighted generalization of inequality (1.1).
Theorem 1.1 If is a convex function, then the inequality
holds, where is non-negative, integrable and symmetric about .
In , Yang and Tseng proved the following theorem which refines inequality (1.2).
Theorem 1.2 Let f and w be defined as in Theorem 1.1. If is defined by
then P is convex, increasing on and for all ,
In this paper, we find an upper bound for , where f is a convex function on and g is non-negative increasing (or decreasing) on , and . Finally, in Section 3 we find an upper bound for the following integral:
2 Integral inequalities
Theorem 2.1 Let be a differentiable convex function and be a continuous function.
If g is decreasing on , then
If g is increasing on , then
We will show that . We have
By the extended mean value theorem (Cauchy’s theorem), we have
On the other hand, by the convexity of f and decreasing of g, we obtain
Since g is non-negative,
which implies that H is decreasing. Hence, . The proof is complete.
Then we have
By the mean value theorem (Lagrange’s theorem), there exist and such that
By the convexity of f and increasing of g, we obtain
Therefore, H is decreasing and . The proof is complete. □
Theorem 2.2 Let be a convex function and be an integrable function such that . Then
So, we get
Corollary 2.1 Let be a convex function and g be a non-negative integrable function. Then
The proof is similar to the proof of theorem.
3 Right bidimensional Hermite-Hadamard inequality
Let us consider the bidimensional interval in . Recall that the mapping is convex on △ if
holds for all and . A function is called co-ordinated convex on △ if the partial mappings , and , are convex for all and . Note that every convex function is co-ordinated convex, but the converse is not generally true; see .
Dragomir in  established the following similar inequality of the Hermite-Hadamard inequality for a co-ordinated convex function on a rectangle from the plane .
Theorem 3.1 Suppose that is co-ordinated convex on △. Then one has the inequalities
Now, let △ be a convex area from the plane , bounded by a convex function and a concave function and , , such that for any , . Also, let F be a two-variable convex function on △. In  and , the following inequality is proved:
In this paper, we want to find an upper bound for the integral
For this purpose, we reach to the following integral:
It is well known that if is increasing relative to y and is convex on , then is convex on , but we have no information about the convexity of generally. So, in special cases, we will find an upper bound for the integral (3.1).
Theorem 3.2 Let △ be a bounded area by a convex function and a concave function on such that for any , and is increasing on . Also, let F be a two-variable convex function on △ such that and are convex on . Then one has the inequality
Proof Since F is convex on △, hence F is co-ordinated convex on △. So, , is convex on for all . By the right-hand side of Hermite-Hadamard inequality (1.1), we have
Integrating this inequality on , we obtain
Since is increasing and , are convex on , by Theorem 2.1(i), we have
The proof is complete. □
Theorem 3.3 Let △ be a bounded area by a convex function h and a concave function g on such that for any , . Also, let F be a two-variable convex function on △ such that and are convex on . Then one has the inequality
By a similar way to the proof of Theorem 3.2, we have
Since is convex, by Theorem 2.2 , we obtain
The proof is complete. □
In the following theorem, we prove the assertion of Theorem 3.3 with weak conditions.
Theorem 3.4 Let △, g and h be defined as in Theorem 3.3. Also, let F be a two-variable convex function on △ such that
then we have
Then we have
Since F is convex, so it is co-ordinated convex. Hence, by the right-hand side of the Hermite-Hadamard inequality, we obtain
On the other hand, we have
Now, multiplying each term by
and using the fact
By a similar way, we obtain
Then it follows that
Now, notice that if , were convex on , we can deduce the assertion of Theorem 3.3. Since F is convex on △, we have
By a similar way, we have
Note that . Therefore, H is decreasing and
The proof is complete. □
Remark 3.1 Notice that since g is concave and h is convex on , so is decreasing and is increasing on . By the mean value theorem, we have
In particular, if we have , then . So, if , then
In the following theorem, we find an upper bound of the Hermite-Hadamard inequality for a co-ordinated convex function.
Theorem 3.5 Let △, g and h be defined as in Theorem 3.3. Also, let F be a convex function only relative to y, that is, , is convex for all . If , then
Since F is convex relative to y, by the right-hand side of the Hermite-Hadamard inequality, we obtain
So, H is decreasing on . That is, . □
Example 4.1 Let and △ be bounded by , on . Then is decreasing on and , are convex on . By Theorem 3.2, we have
By easy calculation, we see that
Example 4.2 Let F, g and h be defined as in Example 4.1. By Theorem 3.3, we have
Example 4.3 Let and △ be bounded by , on . Then is not decreasing on and also is not convex on . So, g, h and F do not hold in the hypothesis of Theorems 3.2 and 3.3. But we have
Thus, we can apply Theorem 3.4
Example 4.4 Let and △ be bounded by , and on . Then F is not convex on △, but it is convex relative to y, we have
Hence, by Theorem 3.5, we have
Fejér L: Über die Fourierreihen, II. Math. Naturwiss. Anz Ungar. Akad. Wiss. 1906, 24: 369–390. (In Hungarian)
Yang GS, Tseng KH: On certain integral inequalities related to Hermite-Hadamard inequalities. J. Math. Anal. Appl. 1999, 239: 180–187. 10.1006/jmaa.1999.6506
Dragomir, SS, M Pearce, CE: Selected Topics on Hermite-Hadamard Inequalities. RGMIA Monographs, Victoria University (2000)
Dragomir SS: On the Hadamard’s inequality for convex function on the co-ordinated in a rectangle from the plane. Taiwan. J. Math. 2001, 5: 775–788.
Matejika L: Elementary proof of the left multidimensional Hermite-Hadamard inequality on certain convex sets. J. Math. Inequal. 2010, 4(2):259–270.
Zabandan G, Kılıçman A: A new version of Jensen’s inequality and related results. J. Inequal. Appl. 2012., 2012: Article ID 238. doi:10.1186/1029–242X-2012–238
The authors express their sincere thanks to the referees for the careful and detailed reading of the manuscript and very helpful suggestions that improved the manuscript substantially. The authors also gratefully acknowledge that this research was partially supported by the University Putra Malaysia under the Research University Grant Scheme 05-01-09-0720RU.
Authors declare that they have no competing interest.
Both the authors contributed equally in preparation as well as in typing and further both authors read the proof and approved the modifications.
About this article
Cite this article
Zabandan, G., Kılıçman, A. Several integral inequalities and an upper bound for the bidimensional Hermite-Hadamard inequality. J Inequal Appl 2013, 27 (2013) doi:10.1186/1029-242X-2013-27
- Continuous Function
- Convex Function
- Integrable Function
- Weak Condition
- Partial Mapping