1 Historical background and introduction

The following double inequality is well known in the literature as Hadamard’s inequality:

Let f:IRR be a convex function defined on an interval I of real numbers, a,bI and a<b, we have

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

Both inequalities hold in the reversed direction if f is concave.

It was first discovered by Hermite in 1881 in the Journal Mathesis (see [1]). Inequality (1.1) was nowhere mentioned in the mathematical literature until 1893. Beckenbach, a leading expert on the theory of convex functions, wrote that inequality (1.1) was proven by Hadamard in 1893 (see [2]). In 1974 Mitrinovič found Hermite’s note in Mathesis. That is why, inequality (1.1) was known as the Hermite-Hadamard inequality.

A function f:[a,b]RR is said to be convex if whenever x,y[a,b] and t[0,1], the following inequality holds:

f ( t x + ( 1 t ) y ) tf(x)+(1t)f(y).

We say that f is concave if (−f) is convex. This definition has its origins in Jensen’s results from [3] and has opened up the most extended, useful and multi-disciplinary domain of mathematics, namely, convex analysis. Convex curves and convex bodies have appeared in mathematical literature since antiquity and there are many important results related to them.

In [4], Miheşan introduced the class of (α,m)-convex functions in the following way: The function f:[0,b]R is said to be (α,m)-convex, where (α,m) [ 0 , 1 ] 2 , if for every x,y[0,b] and t[0,1], we have

f ( t x + m ( 1 t ) y ) t α f(x)+m ( 1 t α ) f(y).

This class is usually denoted by K m α (b).

In [5], the concept of geometrically convex functions was introduced as follows.

Definition 1 A function f:I R + R + is said to be a geometrically convex function if

f ( x t y 1 t ) [ f ( x ) ] t [ f ( y ) ] 1 t

for all x,yI and t[0,1].

In [6], the definition of m- and (α,m)-geometric convexity was introduced as follows.

Definition 2 Let f(x) be a positive function on [0,b] and m(0,1]. If

f ( x t y m ( 1 t ) ) [ f ( x ) ] t [ f ( y ) ] m ( 1 t )

holds for all x,y[0,b] and t[0,1], then we say that the function f(x) is m-geometrically convex on [0,b].

It is clear that when m=1, m-geometrically convex functions become geometrically convex functions.

Definition 3 Let f(x) be a positive function on [0,b] and (α,m)(0,1]×(0,1]. If

f ( x t y m ( 1 t ) ) [ f ( x ) ] t α [ f ( y ) ] m ( 1 t α )

holds for all x,y[0,b] and t[0,1], then we say that the function f(x) is (α,m)-geometrically convex on [0,b].

If α=m=1, the (α,m)-geometrically convex function becomes a geometrically convex function on [0,b].

Lemma 1 For x,y[0,) and m,t(0,1], if x<y and y1, then

x t y m ( 1 t ) tx+(1t)y.
(1.2)

For some recent results connected with geometrically convex functions, see [59].

Definition 4 Let a,bR, a,b0 and |a||b|. Logarithmic mean for real numbers was introduced as follows:

L(a,b)= a b ln | a | ln | b | .

Theorem 1 (see [10])

Let f,g:[a,b]R be integrable functions, both increasing or both decreasing. Furthermore, let p:[a,b] R + be an integrable function. Then

a b p(x)f(x)dx a b p(x)g(x)dx a b p(x)dx a b p(x)f(x)g(x)dx.
(1.3)

If one of the functions f or g is nonincreasing and the other nondecreasing, then the inequality in (1.3) is reversed. Inequality (1.3) is known in the literature as the Chebyshev inequality and so are the following special cases of (1.3):

1 b a a b f(x)dx a b g(x)dx a b f(x)g(x)dx

and

0 1 f(x)dx 0 1 g(x)dx 0 1 f(x)g(x)dx.

In order to prove our main results, we need the following lemma (see [11]).

Lemma 2 Let f:IRR be a twice differentiable function on I , a,bI with a<b and f L 1 [a,b]. Then the following equality holds:

f ( a ) + f ( b ) 2 1 b a a b f(x)dx= ( b a ) 2 2 0 1 t(1t) f ( t a + ( 1 t ) b ) dt.

In [12], some inequalities of Hermite-Hadamard type for differentiable convex mappings were proven using the following lemma.

Lemma 3 Let f:IRR be a twice differentiable function on I , a,b I with a<b. If f L 1 [a,b], then

1 b a a b f ( x ) d x f ( a + b 2 ) = ( b a ) 2 4 0 1 m ( t ) [ f ( t a + ( 1 t ) b ) + f ( ( 1 t ) a + t b ) ] d t ,

where

m(t)= { t 2 , t [ 0 , 1 2 ) , ( 1 t ) 2 , t [ 1 2 , 1 ] .

In this paper, we establish some integral inequalities of Hermite-Hadamard type related to geometrically convex functions and (α,m)-geometrically convex functions.

2 Results for geometrically convex functions

We will establish some new results connected with the right-hand side of (1.1).

Theorem 2 Let f:I R + R + be a twice differentiable function on I , a,bI with a<b and f L 1 [a,b]. If | f | q is geometrically convex and monotonically decreasing on [a,b] for p>1 and t[0,1], then we have

| f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p { L ( | f ( a ) | q , | f ( b ) | q ) } 1 q ,
(2.1)

where 1 p + 1 q =1.

Proof From Lemma 2 with the properties of modulus and using the Hölder inequality, we have

| f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 2 0 1 t ( 1 t ) | f ( t a + ( 1 t ) b ) | d t ( b a ) 2 2 ( 0 1 ( t t 2 ) p d t ) 1 p ( 0 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q = ( b a ) 2 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( 0 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q .
(2.2)

We used the beta and gamma functions to evaluate the integral

0 1 ( t t 2 ) p d t = 0 1 t p ( 1 t ) p d t = β ( p + 1 , p + 1 ) , β ( x , x ) = 2 1 2 x β ( 1 2 , x ) and β ( x , y ) = Γ ( x ) Γ ( y ) Γ ( x + y ) .

Thus, we have

β(p+1,p+1)= 2 1 2 ( p + 1 ) Γ ( 1 2 ) Γ ( p + 1 ) Γ ( 3 2 + p ) ,
(2.3)

where Γ( 1 2 )= π .

Since | f | q is geometrically convex and monotonically decreasing on [a,b], we obtain

a t b 1 t t a + ( 1 t ) b , | f ( t a + ( 1 t ) b ) | q | f ( a t b 1 t ) | q .

Therefore, we have

I = 0 1 | f ( t a + ( 1 t ) b ) | q d t 0 1 | f ( a t b 1 t ) | q d t 0 1 [ | f ( a ) | t | f ( b ) | 1 t ] q d t = L ( | f ( a ) | q , | f ( b ) | q ) .
(2.4)

By making use of inequalities (2.3) and (2.4) in (2.2), we obtain (2.1). This completes the proof. □

Theorem 3 Let f:I R + R + be a twice differentiable function on I , a,bI with a<b and f L 1 [a,b]. If | f | q is geometrically convex and monotonically decreasing on [a,b] for q1 and t[0,1], then the following inequality holds:

| f ( a ) + f ( b ) 2 1 b a a b f(x)dx| ( b a ) 2 2 ( 1 6 ) 1 p | f (b)|N(t,q),

where

N(t,q)= ( 0 1 t ( 1 t ) ( | f ( a ) | | f ( b ) | ) q t d t ) 1 q .

Proof From Lemma 2 and using the well-known power-mean inequality, we have

| f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 2 0 1 t ( 1 t ) | f ( t a + ( 1 t ) b ) | d t ( b a ) 2 2 ( 0 1 t ( 1 t ) d t ) 1 1 q ( 0 1 t ( 1 t ) | f ( t a + ( 1 t ) b ) | q d t ) 1 q = ( b a ) 2 2 ( 1 6 ) 1 1 q ( 0 1 t ( 1 t ) | f ( t a + ( 1 t ) b ) | q d t ) 1 q .

Since | f | q is geometrically convex and monotonically decreasing on [a,b], we have

| f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 2 ( 1 6 ) 1 1 q ( 0 1 t ( 1 t ) [ | f ( a ) | t | f ( b ) | 1 t ] q d t ) 1 q = ( b a ) 2 2 ( 1 6 ) 1 1 q | f ( b ) | ( 0 1 t ( 1 t ) ( | f ( a ) | | f ( b ) | ) q t d t ) 1 q ,

which completes the proof. □

Corollary 1 In Theorem 3, since ( 1 6 ) 1 p <1, for p>1, we have

| f ( a ) + f ( b ) 2 1 b a a b f(x)dx| ( b a ) 2 2 | f (b)|N(t,q).

Now, we will establish some new results connected with the left-hand side of (1.1).

Theorem 4 Let f:I R + R + be a twice differentiable function on I , a,bI with a<b and f L 1 [a,b]. If | f | q is geometrically convex and monotonically decreasing on [a,b] and t[0,1], then we have the following inequality:

| 1 b a a b f(x)dxf ( a + b 2 ) | ( b a ) 2 8 ( 2 p + 1 ) 1 p { L ( | f ( a ) | q , | f ( b ) | q ) } 1 q ,

where 1 p + 1 q =1.

Proof From Lemma 3 and using the well-known Hölder integral inequality, we get

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 ( 0 1 | m ( t ) | p d t ) 1 p { ( 0 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q + ( 0 1 | f ( ( 1 t ) a + t b ) | q d t ) 1 q } .

Since | f | q is geometrically convex and monotonically decreasing on [a,b], we know that for t[0,1],

| f ( t a + ( 1 t ) b ) | q | f ( a t b 1 t ) | q { | f ( a ) | t | f ( b ) | 1 t } q .

Hence

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 16 ( 2 p + 1 ) 1 p { [ 0 1 ( | f ( a ) | t | f ( b ) | 1 t ) q d t ] 1 q + [ 0 1 ( | f ( a ) | 1 t | f ( b ) | t ) q d t ] 1 q } = ( b a ) 2 8 ( 2 p + 1 ) 1 p { L ( | f ( a ) | q , | f ( b ) | q ) } 1 q ,

where we have used the fact that

0 1 |m(t) | p dt= 0 1 2 t 2 p dt+ 1 2 1 ( 1 t ) 2 p dt= 1 4 p ( 2 p + 1 ) ,

which completes the proof. □

Corollary 2 In Theorem 4, since 1 ( 2 p + 1 ) 1 p <1, for p>1, we have

| 1 b a a b f(x)dxf ( a + b 2 ) | ( b a ) 2 8 { L ( | f ( a ) | q , | f ( b ) | q ) } 1 q .

Theorem 5 Let f: I R + R + be a twice differentiable function on I , a,bI with a<b and f L 1 [a,b]. If | f | q is geometrically convex and monotonically decreasing on [a,b] and q1, then we have

| 1 b a a b f(x)dxf ( a + b 2 ) | ( b a ) 2 4 ( 1 12 ) 1 p { | f ( a ) | A ( t , q ) + | f ( b ) | B ( t , q ) } ,

where

A(t,q)= ( 0 1 | m ( t ) | ( | f ( b ) | | f ( a ) | ) q t d t ) 1 q ,B(t,q)= ( 0 1 | m ( t ) | ( | f ( a ) | | f ( b ) | ) q t d t ) 1 q .

Proof From Lemma 3 and using the well-known power-mean inequality, we get

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 ( 0 1 | m ( t ) | d t ) 1 p { ( 0 1 | m ( t ) | | f ( t a + ( 1 t ) b ) | q d t ) 1 q + ( 0 1 | m ( t ) | | f ( ( 1 t ) a + t b ) | q d t ) 1 q } .

Since | f | q is geometrically convex and monotonically decreasing on [a,b], we have

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 ( 12 ) 1 p { ( 0 1 | m ( t ) | [ | f ( a ) | t | f ( b ) | 1 t ] q d t ) 1 q + ( 0 1 | m ( t ) | [ | f ( a ) | 1 t | f ( b ) | t ] q d t ) 1 q } = ( b a ) 2 4 ( 12 ) 1 p { ( 0 1 | m ( t ) | ( | f ( b ) | | f ( a ) | ) q t d t ) 1 q + ( 0 1 | m ( t ) | ( | f ( a ) | | f ( b ) | ) q t d t ) 1 q } ,

where we have used the fact that

0 1 |m(t)|dt= 0 1 2 t 2 dt+ 1 2 1 ( 1 t ) 2 dt= 1 12 ,

which completes the proof. □

Corollary 3 In Theorem 5, since ( 1 12 ) 1 p <1, for p>1, we have the following inequality:

| 1 b a a b f(x)dxf ( a + b 2 ) | ( b a ) 2 4 { | f ( a ) | A ( t , q ) + | f ( b ) | B ( t , q ) } .

3 Results for (α,m)-geometrically convex functions

Theorem 6 Let f:[0,b] R + be a twice differentiable function, a[0,b] and f L 1 [a,b]. If | f | q is (α,m)-geometrically convex and monotonically decreasing on [a,b] for b1, p>1, (α,m) ( 0 , 1 ] 2 and t(0,1], we have

| f ( a ) + f ( b ) 2 1 b a a b f(x)dx| ( b a ) 2 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p | f (b) | m M(t,q,α),

where 1 p + 1 q =1 and

M(t,q,α)= ( 0 1 [ | f ( a ) | | f ( b ) | m ] q t α d t ) 1 q .

Proof From Lemma 2 with the properties of modulus and using the Hölder inequality, we have

| f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 2 0 1 t ( 1 t ) | f ( t a + ( 1 t ) b ) | d t ( b a ) 2 2 ( 0 1 ( t t 2 ) p d t ) 1 p ( 0 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q = ( b a ) 2 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( 0 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q .

Since | f | q is (α,m)-geometrically convex and monotonically decreasing on [a,b], by using (1.2) we obtain

I = 0 1 | f ( t a + ( 1 t ) b ) | q d t 0 1 | f ( a t b m ( 1 t ) ) | q d t 0 1 [ | f ( a ) | t α | f ( b ) | m ( 1 t α ) ] q d t = | f ( b ) | m q 0 1 ( | f ( a ) | | f ( b ) | m ) q t α d t .

So, we have

| f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( | f ( b ) | m q 0 1 ( | f ( a ) | | f ( b ) | m ) q t α d t ) 1 q = ( b a ) 2 | f ( b ) | m 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( 0 1 ( | f ( a ) | | f ( b ) | m ) q t α d t ) 1 q ,

which completes the proof. □

Corollary 4 In Theorem 6,

  1. (i)

    If | f (a)|<| f (b) | m , then we get

    | f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 | f ( b ) | m 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( 0 1 ( | f ( a ) | | f ( b ) | m ) q t α d t ) 1 q ( b a ) 2 | f ( b ) | m 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( 0 1 ( | f ( a ) | | f ( b ) | m ) q α t d t ) 1 q = ( b a ) 2 | f ( b ) | m 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p × ( | f ( a ) | q α | f ( b ) | m q α | f ( b ) | m q α [ ln | f ( a ) | q α ln | f ( b ) | m q α ] ) 1 q = ( b a ) 2 | f ( b ) | m ( 1 α ) 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p ( L [ | f ( a ) | q α , | f ( b ) | m q α ] ) 1 q ,

where we used the fact that if 0<μ1, 0<t and α1, we have

μ t α μ α t .
  1. (ii)

    If | f (a)|=| f (b) | m , then we get

    | f ( a ) + f ( b ) 2 1 b a a b f ( x ) d x | ( b a ) 2 | f ( b ) | m 2 ( 2 1 2 p π Γ ( 1 + p ) Γ ( 3 2 + p ) ) 1 p .

Theorem 7 Let f:[0,b] R + be a twice differentiable function, a[0,b] and f L 1 [a,b]. If | f | and | f | q are (α,m)-geometrically convex and monotonically decreasing on [a,b] for a,b1, p>1, (α,m) ( 0 , 1 ] 2 and t[0,1], we have

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 16 { 1 3 [ | f ( b ) | m 0 1 2 K d t + | f ( a ) | m 0 1 2 G d t ] + 1 ( 4 p + 2 ) 1 p [ | f ( b ) | m ( 1 2 1 K q d t ) 1 q + | f ( a ) | m ( 1 2 1 G q d t ) 1 q ] } ,
(3.1)

where K= ( | f ( a ) | | f ( b ) | m ) t α , G= ( | f ( b ) | | f ( a ) | m ) t α and 1 p + 1 q =1.

Proof By using Lemma 3 and the properties of absolute value, we have

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 { 0 1 2 t 2 | f ( t a + ( 1 t ) b ) | d t + 0 1 2 t 2 | f ( ( 1 t ) a + t b ) | d t + 1 2 1 ( 1 t ) 2 | f ( t a + ( 1 t ) b ) | d t + 1 2 1 ( 1 t ) 2 | f ( ( 1 t ) a + t b ) | d t } = ( b a ) 2 4 { I 1 + I 2 + I 3 + I 4 } .

Since t 2 is increasing on [0, 1 2 ] and | f | is decreasing, by applying the Chebyshev inequality to I 1 and I 2 and by applying the Hölder inequality to I 3 and I 4 , we get

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 { 2 0 1 2 t 2 d t 0 1 2 | f ( t a + ( 1 t ) b ) | d t + 2 0 1 2 t 2 d t 0 1 2 | f ( ( 1 t ) a + t b ) | d t + ( 1 2 1 ( 1 t ) 2 p d t ) 1 p ( 1 2 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q + ( 1 2 1 ( 1 t ) 2 p d t ) 1 p ( 1 2 1 | f ( ( 1 t ) a + t b ) | q d t ) 1 q } = ( b a ) 2 4 { 1 12 ( 0 1 2 | f ( t a + ( 1 t ) b ) | d t + 0 1 2 | f ( ( 1 t ) a + t b ) | d t ) + 1 ( 2 p + 1 ) 1 p 2 2 p + 1 p ( ( 1 2 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q + ( 1 2 1 | f ( ( 1 t ) a + t b ) | q d t ) 1 q ) } .

As | f | is decreasing, | f | and | f | q are (α,m)-geometrically convex, from (1.2) we have

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 { 1 12 ( 0 1 2 | f ( a t b m ( 1 t ) ) | d t + 0 1 2 | f ( a m ( 1 t ) b t ) | d t ) + 1 ( 2 p + 1 ) 1 p 2 2 p + 1 p ( ( 1 2 1 | f ( a t b m ( 1 t ) ) | q d t ) 1 q + ( 1 2 1 | f ( a m ( 1 t ) b t ) | q d t ) 1 q ) } ( b a ) 2 4 { 1 12 ( 0 1 2 | f ( a ) | t α | f ( b ) | m ( 1 t α ) d t + 0 1 2 | f ( a ) | m ( 1 t α ) | f ( b ) | t α d t ) + 1 ( 2 p + 1 ) 1 p 2 2 p + 1 p [ ( 1 2 1 [ | f ( a ) | t α | f ( b ) | m ( 1 t α ) ] q d t ) 1 q + ( 1 2 1 [ | f ( a ) | m ( 1 t α ) | f ( b ) | t α ] q d t ) 1 q ] } ,

which is the desired result. □

Corollary 5 Under the conditions of Theorem 7, if we choose f is symmetric about a + b 2 , then we have

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 | f ( b ) | m 8 { 1 3 0 1 2 K d t + 1 ( 4 p + 2 ) 1 p ( 1 2 1 K q d t ) 1 q } .

Proof From (3.1) and by using the symmetric property of f , we get

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 4 { 1 12 ( 0 1 2 | f ( t a + ( 1 t ) b ) | d t + 0 1 2 | f ( ( 1 t ) a + t b ) | d t ) + 1 ( 2 p + 1 ) 1 p 2 2 p + 1 p ( ( 1 2 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q + ( 1 2 1 | f ( ( 1 t ) a + t b ) | q d t ) 1 q ) } = ( b a ) 2 4 { 1 6 0 1 2 | f ( t a + ( 1 t ) b ) | d t + 2 ( 2 p + 1 ) 1 p 2 2 p + 1 p ( 1 2 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q } = ( b a ) 2 8 { 1 3 0 1 2 | f ( t a + ( 1 t ) b ) | d t + 1 ( 2 p + 1 ) 1 p 2 1 p ( 1 2 1 | f ( t a + ( 1 t ) b ) | q d t ) 1 q } .

By using (α,m)-geometric convexity of | f | and | f | q and similar calculations, we get

| 1 b a a b f ( x ) d x f ( a + b 2 ) | ( b a ) 2 8 { 1 3 0 1 2 | f ( a t b m ( 1 t ) ) | d t + 1 ( 2 p + 1 ) 1 p 2 1 p ( 1 2 1 | f ( a t b m ( 1 t ) ) | q d t ) 1 q } ( b a ) 2 8 { 1 3 0 1 2 [ | f ( a ) | t α | f ( b ) | m ( 1 t α ) ] d t + 1 ( 4 p + 2 ) 1 p ( 1 2 1 [ | f ( a ) | t α | f ( b ) | m ( 1 t α ) ] q d t ) 1 q } = ( b a ) 2 | f ( b ) | m 8 { 1 3 0 1 2 ( | f ( a ) | | f ( b ) | m ) t α d t + 1 ( 4 p + 2 ) 1 p ( 1 2 1 ( | f ( a ) | | f ( b ) | m ) q t α d t ) 1 q } .

So, the proof is completed. □