1 Introduction

Let μ be a positive measure on X such that μ(X)=1. If f is a real-valued function in L 1 (μ), a<f(x)<b for all xX and φ is convex on (a,b), then

φ ( X f d μ ) X (φf)dμ.
(1)

The inequality (1) is known as Jensen’s inequality [1].

In recent years, there have been many extensions, refinements and similar results of the inequality (1). Recall that the function F:Δ=[a,b]×[c,d]R is convex on Δ if

F ( λ x + ( 1 λ ) z , λ y + ( 1 λ ) w ) λF(x,y)+(1λ)F(z,w)

holds for all (x,y),(z,w)Δ and λ[0,1]. A function F:ΔR is called co-ordinated convex on Δ if the partial functions F y :[a,b]R, F y (u)=F(u,y) and F x :[c,d]R, F x (v)=F(x,v) are convex for all x[a,b] and y[c,d]. Note that every convex function F:ΔR is co-ordinated convex, but the converse is not generally true; see [2]. Also note that if F is a convex function on R 2 and g, h are real-valued functions such that D g = D h =R, then f(t)=F(g(t),h(t)) may be not convex on ℝ.

In this paper under suitable conditions, we expand Jensen’s inequality to two-variable convex functions and deduce some further important inequalities. Finally, we find a lower bound for the integral

1 a b ( g ( x ) h ( x ) ) d x a b h ( x ) g ( x ) F(x,y)dydx,

where F is convex on the convex bounded area by y=g(x), y=h(x) and x=a, x=b.

2 Main results

Theorem 1 Let p be a non-negative continuous function on [a,b] such that a b p(x)dx>0. If g and h are real-valued continuous functions on [a,b] and

m 1 g(x) M 1 , m 2 h(x) M 2

for all x[a,b], and F is convex on

Δ=[ m 1 , M 1 ]×[ m 2 , M 2 ],

then

F ( a b g ( t ) p ( t ) d t a b p ( t ) d t , a b h ( t ) p ( t ) d t a b p ( t ) d t ) a b F ( g ( t ) , h ( t ) ) p ( t ) d t a b p ( t ) d t
(2)

and

F ( a b g ( t ) d t b a , a b h ( t ) d t b a ) 1 b a a b F ( g ( t ) , h ( t ) ) dt.
(3)

The inequalities hold in reversed order if f is concave on Δ.

Proof Denote

α(x)= a x g ( t ) p ( t ) d t a x p ( t ) d t

and

β(x)= a x h ( t ) p ( t ) d t a x p ( t ) d t .

Then by L’Hospital’s rule, we have lim x a α(x)=g(a) and lim x a β(x)=h(a). So, α and β are continuous on [a,b]. Denote

H(x)=F ( α ( x ) , β ( x ) ) a x F ( g ( t ) , h ( t ) ) p ( t ) d t a x p ( t ) d t .

We will show that H(b)0. We have

H ( x ) = F ( α ( x ) , β ( x ) ) α α ( x ) + F ( α ( x ) , β ( x ) ) β β ( x ) F ( g ( x ) , h ( x ) ) p ( x ) a x p ( t ) d t + p ( x ) a x F ( g ( t ) , h ( t ) ) p ( t ) d t ( a x p ( t ) d t ) 2 .

By the convexity of F, we obtain

F ( g ( x ) , h ( x ) ) F ( α ( x ) , β ( x ) ) F ( α ( x ) , β ( x ) ) α ( g ( x ) α ( x ) ) + F ( α ( x ) , β ( x ) ) β ( h ( x ) β ( x ) ) .

So, we get

H ( x ) ( α ( x ) , β ( x ) ) α α ( x ) + ( α ( x ) , β ( x ) ) β β ( x ) p ( x ) a x p ( t ) d t [ F ( α ( x ) , β ( x ) ) + ( α ( x ) , β ( x ) ) α ( g ( x ) α ( x ) ) + F ( α ( x ) , β ( x ) ) β ( h ( x ) β ( x ) ) ] + p ( x ) a x F ( g ( t ) , h ( t ) ) p ( t ) d t ( a x p ( t ) d t ) 2 .

Hence,

H ( x ) ( α ( x ) , β ( x ) ) α [ α ( x ) p ( x ) a x p ( t ) d t ( g ( x ) α ( x ) ) ] + ( α ( x ) , β ( x ) ) β [ β ( x ) p ( x ) a x p ( t ) d t ( h ( x ) β ( x ) ) ] p ( x ) F ( α ( x ) , β ( x ) ) a x p ( t ) d t + p ( x ) a x F ( g ( t ) , h ( t ) ) g ( t ) d t ( a x p ( t ) d t ) 2 .

By easy calculation, we see that

α (x) p ( x ) a x p ( t ) d t ( g ( x ) α ( x ) ) = β (x) p ( x ) a x p ( t ) d t ( h ( x ) β ( x ) ) =0.

Therefore,

H (x) p ( x ) a x p ( t ) d t [ F ( α ( x ) , β ( x ) ) a x F ( g ( t ) , h ( t ) ) p ( t ) d t a x p ( t ) d t ] = p ( x ) a x P ( t ) d t H(x).

Thus,

( a x p ( t ) d t ) H (x)+p(x)H(x)0 [ ( a x p ( t ) d t ) H ( x ) ] 0.

So,

( a b p ( t ) d t ) H(b)0H(b)0.

The proof is complete. For the proof of (3), set p(x)=1.

Note the inequalities (2) and (3) are sharp because F(x,y)=1. □

Corollary 1 Let g and h be real-valued continuous functions. Then we have

  1. (i)

    for 1 p + 1 q =1, p,q>1,

    a b | g ( t ) | | h ( t ) | dt ( a b | g ( t ) | p d t ) 1 p ( a b | h ( t ) | q d t ) 1 q Holder’s inequality,
  2. (ii)

    for p1,

  3. (iii)

    for p1,

    ( a b | g ( t ) + h ( t ) | p d t ) 1 p ( a b | g ( t ) | p d t ) 1 p + ( a b | h ( t ) | p d t ) 1 p Minkowski’s inequality ,

    (iv)

    ln ( e 1 b a a b g ( t ) d t + e 1 b a a b h ( t ) d t ) 1 b a a b ln ( e g ( t ) + e h ( t ) ) dt.

Proof (i) The function

F(x,y)= | x | 1 p | y | 1 q ( 1 p + 1 q = 1 ) ,

is concave, so by the inequality (3), we have

( a b | g ( t ) | d t ) 1 p ( b a ) 1 p × ( a b | h ( t ) | d t ) 1 q ( b a ) 1 q a b | g ( t ) | 1 p | h ( t ) | 1 q d t b a .

Hence,

a b | g ( t ) | 1 p | h ( t ) | 1 q dt ( a b | g ( t ) | d t ) 1 p ( a b | h ( t ) | d t ) 1 q .

Now, set |g(t)| | g ( t ) | p and |h(t)| | h ( t ) | q . We obtain

a b | g ( t ) | | h ( t ) | dt ( a b | g ( t ) | p d t ) 1 p + ( a b | h ( t ) | q d t ) 1 q .
  1. (ii)

    The function F(x,y)= ( | x | p + | y | p ) 1 p is convex for p1 and is concave for p<1. So, by the inequality (3), we have

    [ ( a b | g ( t ) | d t ) p ( b a ) p + ( a b | h ( t ) | d t ) p ( b a ) p ] 1 p a b ( | g ( t ) | p + | h ( t ) | p ) 1 p d t b a

so

a b ( | g ( t ) | p + | h ( t ) | p ) 1 p dt [ ( a b | g ( t ) | d t ) p + ( a b | h ( t ) | d t ) p ] 1 p .

Now, set |g(t)| | g ( t ) | 1 p and |h(t)| | h ( t ) | 1 p . We get

a b ( | g ( t ) | + | h ( t ) | ) 1 p dt [ ( a b | g ( t ) | 1 p d t ) p + ( a b | h ( t ) | 1 p d t ) p ] 1 p .

So,

( a b ( | g ( t ) | + | h ( t ) | ) 1 p d t ) p ( a b | g ( t ) | 1 p d t ) p + ( a b | h ( t ) | 1 p d t ) p .

The proof of (iii) is similar to that of (ii) and can be omitted. For the proof of (iv), note f(x,y)=ln( e x + e y ) is convex on R 2 . Now, apply the inequality (3). □

Remark 1 By similar assumptions, we can prove Theorem 1 for an n-variable convex function F on R n and obtain the inequality

F ( a b g 1 ( t ) d t b a , , a b g n ( t ) d t b a ) 1 b a a b F ( g 1 ( t ) , , g n ( t ) ) dt.

In particular, we can obtain a similar inequality for Holder and Minkowski inequalities. For example, by the concavity of

F( t 1 , t 2 ,, t n )= i = 1 n | t i | 1 p i ( i = 1 n 1 p i = 1 ) ,

we can get the inequality

a b ( i = 1 n | g i | ) dt i = 1 n ( a b | g i | p i ) 1 p i .

3 Hermite-Hadamard inequality

Let f:[a,b]R be a convex function, then the following inequality is known as the Hermite-Hadamard inequality [3] and [4]:

f ( a + b 2 ) 1 b a a b f(x)dx f ( a ) + f ( b ) 2 .
(4)

In [5], Dragomir established the following similar inequality (4) for convex functions on the co-ordinates on a rectangle from the plane R 2 .

Theorem 2 Suppose f:=[a,b]×[c,d]R is a convex function on the co-ordinates on △. Then one has the inequalities

f ( a + b 2 , c + d 2 ) 1 ( b a ) ( d c ) a b c d f ( x , y ) d y d x f ( a , c ) + f ( a , d ) + f ( b , c ) + f ( b , d ) 4 .

Also Dragomir investigated the Hermite-Hadamard inequality on the disk [6] and [7].

In [8], Matejíčka proved the left-hand side of the Hermite-Hadamard inequality of several variables for a convex function on certain convex compact sets. In the following theorem, we prove the left-hand side of the Hermite-Hadamard inequality in another way and as a result of Theorem 2.

Theorem 3 Letbe a bounded area by a convex function h and a concave function g on [a,b] such that for any x[a,b], g(x)h(x). Also, let F be a two-variable convex function on △. Then one has the inequality

F ( a b x ( g ( x ) h ( x ) ) d x a b ( g ( x ) h ( x ) ) d x , 1 2 a b ( g 2 ( x ) h 2 ( x ) ) d x a b ( g ( x ) h ( x ) ) d x ) a b h ( x ) g ( x ) F ( x , y ) d y d x a b ( g ( x ) h ( x ) ) d x .

Proof Since F is convex on △, hence f is co-ordinated convex on △. So, F x :[h(x),g(x)]R, F x (y)=F(x,y) is convex on [h(x),g(x)] for all x[a,b]. By the left-hand side of the Hermite-Hadamard inequality (4), we have

( g ( x ) h ( x ) ) F ( x , g ( x ) + h ( x ) 2 ) h ( x ) g ( x ) F(x,y)dy.

Integrating this inequality on [a,b], we obtain

a b ( g ( x ) h ( x ) ) F ( x , g ( x ) + h ( x ) 2 ) dx a b h ( x ) g ( x ) F(x,y)dydx.

So,

a b ( g ( x ) h ( x ) ) F ( x , g ( x ) + h ( x ) 2 ) d x a b ( g ( x ) h ( x ) ) d x 1 a b ( g ( x ) h ( x ) ) d x a b h ( x ) g ( x ) F(x,y)dydx.

Now, let p(x)=g(x)h(x). By the inequality (2), we get

F ( a b x ( g ( x ) h ( x ) ) d x a b ( g ( x ) h ( x ) ) d x , 1 2 a b ( g 2 ( x ) h 2 ( x ) ) d x a b ( g ( x ) h ( x ) ) d x ) a b ( g ( x ) h ( x ) ) F ( x , g ( x ) + h ( x ) 2 ) d x a b ( g ( x ) h ( x ) ) d x a b ( g ( x ) h ( x ) ) F ( x , g ( x ) + h ( x ) 2 ) d x a b ( g ( x ) h ( x ) ) d x .

The proof is complete. □