1 Introduction

Hudzik and Maligranda [1] defined the s-convex function as: A function f:[0,)R is said to be s-convex or f belongs to the class K s i , if for all x,y[0,) and μ,ν[0,1], the following inequality holds:

f(μx+νy) μ s f(x)+ ν s f(y),

for some fixed s(0,1].

Note that, if μ s + ν s =1, the above class of convex functions is called s-convex functions in first sense and represented by K s 1 and if μ+ν=1, the above class is called s-convex in second sense and represented by K s 2 .

It may be noted that every 1-convex function is convex. In [1], they also discussed a few results connecting with s-convex functions in second sense and some new results about Hadamard’s inequality for s-convex functions are discussed in [2], while on the other hand there are many important inequalities connecting with 1-convex (convex) functions [2].

The Simpson’s inequality is very important and well known in the literature. This inequality is stated as: If f:[a,b]R be four times continuously differentiable mapping on (a,b) and f 4 = Sup x ( a , b ) | f 4 (x)|<. Then

| 1 3 [ f ( a ) + f ( b ) 2 + 2 f ( a + b 2 ) ] 1 b a a b f(x)dx| 1 2 , 880 f 4 ( b a ) 4 .

Recently, many others [16] developed and discussed error estimates of the Simpson’s inequality interms of refinement, counterparts, generalizations and new Simpson’s type inequalities.

In [3], Dragomir et al. proved the following recent developments on Simpson’s inequality for which the remainder is expressed interms of lower derivatives than the fourth.

Theorem 1.1 Suppose f:[a,b]R is a differentiable mapping whose derivative is continuous on (a,b) and f L[a,b]. Then

| 1 3 [ f ( a ) + f ( b ) 2 + 2 f ( a + b 2 ) ] 1 b a a b f(x)dx| b a 3 f 1 ,
(1.1)

where f 1 = a b | f (x)|dx.

Note that the bound of (1.1) for L-Lipschitzian mapping is 5 36 L(ba) [3].

Theorem 1.2 Suppose f:[a,b]R is an absolutely continuous mapping on [a,b] whose derivative belongs to L p [a,b]. Then the following inequality holds:

(1.2)

where 1 p + 1 q =1 and p>1.

In [7], Kirmaci established the following Hermite-Hadamard type inequality for differentiable convex functions as the following.

Theorem 1.3 Let f:IRR be a differentiable function on I 0 (interior of I), where a,bI with a<b. If the mapping | f | is convex on [a,b], then

| 1 b a a b f(x)dxf ( a + b 2 ) | b a 8 [ | f ( a ) | + | f ( b ) | ] .
(1.3)

For generalizations of (1.3), we refer to [810].

In [4] and [5], Dragomir and Fitzpatrick presented the following inequalities.

Theorem 1.4 [4]

Let f:[a,b]R be a L-Lipschitzian mapping on [a,b]. Then

| a b f(x) ( b a ) 3 [ f ( a ) + f ( b ) 2 + 2 f ( a + b 2 ) ] | 5 36 L ( b a ) 2 .
(1.4)

Theorem 1.5 [5]

Suppose that f:[0,)[0,) is a convex function in the second sense, where s(0,1) and let a,b[0,), a<b. If f L 1 [a,b], then

2 s 1 f ( a + b 2 ) 1 b a a b f(x)dx f ( a ) + f ( b ) s + 1 .
(1.5)

The constant k= 1 s + 1 is the best possible in the second inequality in (1.5). The above inequalities are sharp.

In [11], Mishen presented the class of (α,m)-convex functions as the following.

Definition 1.6 A function f:[0,b)R is said to be (α,m)-convex, where (α,m) [ 0 , 1 ] 2 , if for every x,y[0,b] and λ[0,1], the following inequality holds:

f ( λ y + m ( 1 λ ) x ) λ α f(y)+m ( 1 λ α ) f(x),

where (α,m) [ 0 , 1 ] 2 , for some fixed m(0,1].

Note that (α,m){(0,0),(α,0),(1,0),(1,m)(1,1),(α,1)}. One receives the following classes of functions respectively: increasing, α-starshaped, starshaped, m-convex, convex and α-convex. Denote by K m α (b), the set of all (α,m)-convex function on [0,b] with f(0)0. For recent results and generalizations referring m-convex and (α,m)-convex functions, we refer to [12, 13] and [14].

In this paper, we establish some new inequalities of Simpson’s type based on (α,m)-convexity for differentiable mappings. This contributes to new better estimates than presented already. Some applications for special means of real numbers and error estimates for some numerical quadrature rules are also given. By using these results, without discussing the higher derivatives, which may not exist, not be bounded and may be difficult to investigate, we find the error estimate of Simpson’s formula.

2 Main results

Before proceeding toward our main theorem regarding generalization of Simpson’s inequality using (α,m)-convex function, we begin with the following lemma.

Lemma 2.1 Let f:IRR be differentiable mapping on I 0 (interior of I), where a,bI such that a<b. Then we have the following inequality:

(2.1)

where

k(λ)={ λ 1 6 , λ [ 0 , 1 2 ] , λ 5 6 , λ [ 1 2 , 1 ] .

Proof

Consider

I = 0 1 k ( λ ) f ( λ b + m ( 1 λ ) a ) d λ = 0 1 / 2 ( λ 1 6 ) f ( λ b + m ( 1 λ ) a ) d λ + 1 / 2 1 ( λ 5 6 ) f ( λ b + m ( 1 λ ) a ) d λ .

Using integration by parts, we have

I = ( λ 1 6 ) f ( λ b + m ( 1 λ ) a ) b m a | 0 1 2 0 1 2 f ( λ b + m ( 1 λ ) a ) b m a d λ + ( λ 5 6 ) f ( λ b + m ( 1 λ ) a ) b m a | 1 2 1 1 2 1 f ( λ b + m ( 1 λ ) a ) b m a d λ = 1 6 ( b m a ) [ f ( m a ) + 4 f ( m a + b 2 ) + f ( b ) ] 0 1 f ( λ b + m ( 1 λ ) a ) b m a d λ .

Let we substitute, x=λb+m(1λ)a, and dx=(bma)dλ, which gives (bma). I= 1 6 [f(ma)+4f( m a + b 2 )+f(b)] 1 b m a m a b f(x)dλ. This proves as required. □

In the following result, we have another refinement of the Simpson’s inequality via (α,m)-convex functions.

Theorem 2.2 Let f be defined as in Lemma 2.1. If the mapping | f | is (α,m)-convex on [a,b], for (α,m) [ 0 , 1 ] 2 . Then we have the following inequality:

(2.2)

where v 1 = 6 α 9 ( 2 ) α + ( 5 ) α + 2 ( 6 ) α + 3 α 12 18 ( α + 1 ) ( α + 2 ) and v 2 =( 5 36 v 1 ).

Proof Using Lemma 2.1 and (α,m)-convexity of | f |, we have

By simple calculations, we have

0 1 / 2 λ α |λ 1 6 |dλ+ 1 / 2 1 λ α |λ 5 6 |dλ= 6 α 9 ( 2 ) α + ( 5 ) α + 2 ( 6 ) α + 3 α 12 18 ( α + 1 ) ( α + 2 ) .

Also,

The proof is completed. □

Now, we conclude the following corollaries.

Corollary 2.3 Let f be defined as in Theorem 2.2. If the mapping | f | is (α,m)-convex on [a,b], (α,m) [ 0 , 1 ] 2 . Then we have the following inequality:

(2.3)

Observation 1 It is observed that the above midpoint inequality (2.3) is better than the inequality (1.1) presented by Dragomir [12].

The upper bound of the midpoint inequality for the first derivative is presented as:

Corollary 2.4 By substituting f(ma)=f( m a + b 2 )=f(b), in inequality (2.2), we get

| 1 b m a m a b f(x)dxf ( m a + b 2 ) |(bma) [ v 1 | f ( b ) | + m v 2 | f ( a ) | ] ,
(2.4)

where v 1 = 6 α 9 ( 2 ) α + ( 5 ) α + 2 ( 6 ) α + 3 α 12 18 ( α + 1 ) ( α + 2 ) and v 2 =( 5 36 v 1 ).

Corollary 2.5 Putting α=1, and m=1, in the above inequality (2.4), we get

| 1 b a a b f(x)dxf ( a + b 2 ) | 5 ( b a ) 72 [ | f ( a ) | + | f ( b ) | ] .
(2.5)

Observation 2 It is observed that the above midpoint inequality (2.5) seems better than the inequality (1.3) presented by Kiramic [7].

By applying Holder’s inequality, we obtain the following theorem.

Theorem 2.6 Let f be defined as in Theorem 2.2 with 1 p + 1 q =1. If the mapping | f | p / ( p 1 ) is (α,m)-convex on [a,b], for (α,m) [ 0 , 1 ] 2 and p>1. Then we have the following inequality:

(2.6)

Proof

Using Holder’s inequality and by Lemma 2.1, we get

By simple calculations, we get

0 1 / 2 | ( λ 1 6 ) | p dλ= 1 / 2 1 | ( λ 5 6 ) | p dλ= 1 + 2 p + 1 6 p + 1 ( p + 1 ) .
(2.7)

Also the (α,m)-convexity of | f | p / ( p 1 ) implies that

(2.8)
(2.9)

Therefore, by combining (2.7), (2.8) and (2.9), we get the required result. The proof is completed. □

Corollary 2.7 Let f be defined as in Theorem 2.6. If the mapping | f | p / ( p 1 ) is (α,m)-convex on [a,b], for (α,m) [ 0 , 1 ] 2 with p>1 and 1 p + 1 q =1. Then we have the following inequality:

(2.10)

Corollary 2.8 By putting | f (ma)|=| f (b)|=0, in Theorem 2.6, we get

(2.11)

In the following corollary, we have the mid point inequality for powers in terms of the first derivative.

Corollary 2.9 By substituting f(ma)=f( m a + b 2 )=f(b) in Theorem 2.6, we get

(2.12)

In the following theorem, we obtain another form of Simpson inequality for powers in term of the first derivative.

Theorem 2.10 Let f be defined as in Theorem 2.6. If the mapping | f | q is (α,m)-convex on [a,b], for (α,m) [ 0 , 1 ] 2 and q1. We have the following inequality:

(2.13)

where u 1 = ( 3 α ) ( 2 1 α ) + 3 ( α ) ( 2 1 α ) + 3 ( 2 α ) 6 3 ( α + 1 ) ( α + 2 ) , , u 3 = ( 5 α + 2 ) ( 3 α ) ( 2 1 α ) 3 ( α ) ( 2 1 α ) 21 ( 2 α ) + 6 ( α ) 24 6 3 ( α + 1 ) ( α + 2 ) and u 4 =( 5 72 u 3 ).

Proof

From Lemma 2.1, and using power mean inequality, we have

The (α,m)-convexity of | f | q gives that

0 1 2 |λ 1 6 || f ( λ b + m ( 1 λ ) a ) | q dλ u 1 | f (b) | q +m u 2 | f (a) | q .
(2.14)

Also

1 / 2 1 | ( λ 5 6 ) || f ( λ b + m ( 1 λ ) a ) | q dλm u 4 | f (a) | q + u 3 | f (b) | q .
(2.15)

By simple calculations, we have

0 1 / 2 | ( λ 1 6 ) |dλ= 1 / 2 1 | ( λ 5 6 ) |dλ= 5 72 .
(2.16)

Our required result is obtained by combining inequalities (2.14), (2.15) and (2.16). The proof is completed. □

Corollary 2.11 Let f be as in Theorem 2.10 and α=1, the inequality holds for s-convex functions:

(2.17)

Moreover, if α=1, m=1, the inequality holds for convex function. If | f (x)|Q, xI, then we have

| 1 6 [ f ( a ) + 4 f ( a + b 2 ) + f ( b ) ] 1 b a a b f(x)dx| 5 ( b a ) 36 Q.
(2.18)

Observation 3 It is observed that the inequality (2.18) with m=1 gives an improvement for the inequality (1.4).

The following corollary gives the refinement of inequality (2.13).

Corollary 2.12 Let f be as in Theorem 2.10, then we have the following inequality:

(2.19)

where v 1 =( 3 α )( 2 1 α )+3(α)( 2 1 α )+3( 2 α ), and v 2 =( 5 α + 2 )( 3 α )( 2 1 α )3(α)( 2 1 α )21( 2 α )+6(α)24. Further, if α=1, we get

(2.20)

Proof Let us take inequality (2.13), for p>1, q=p/(p1). Suppose that

Take 0<1/q<1, for q>1 and by using the well-known fact,

j = 1 n ( ξ j + ψ j ) r j = 1 n ξ j r + j = 1 n ψ j r ,

we consider 0<r<1, ξ 1 , ξ 2 ,, ξ n 0 and ψ 1 , ψ 2 ,, ψ n 0. For n=2, we have

The proof is completed. □

3 Application to Simpson’s formula

Suppose D be the partition of the interval [a,b], with h i =( x i + 1 x i )/2 and suppose that D:a= x 0 < x 1 << x n 1 < x n =b. Since the Simpson’s formula is:

S n (f,D)= i = 0 n 1 f ( x i ) + 4 f ( x i + h i ) + f ( x i + 1 ) 6 ( x i + 1 x i ).
(3.1)

We know that if the function f:[a,b]R, is differentiable such that the fourth derivative of f(x) exists on (a,b) and K= max x ( a , b ) | f ( 4 ) (x)|<, we have

I= a b f(x)dx= S n (f,D)+ E n S (f,D),
(3.2)

where the error term E n S (f,D) of the integral I by Simpson’s formula S n (f,D) fulfils the following:

| E n S (f,D)| K 90 i = 0 n 1 ( x i + 1 x i ) 5 .
(3.3)

Clearly, (3.2) cannot be applied, if the fourth derivative of f is not bounded on (a,b). Some new error estimates for the Simpson’s rule in terms of first and second derivative are presented as follows.

Proposition 3.1 Let f be defined as in Corollary 2.3. If the mapping | f | is (α,m)-convex on [a,b], then for every division D of [a,b], in (3.2), we have

| E n S (f,D)| 5 72 i = 0 n 1 ( x i + 1 m x i ) 2 [ | f ( m x i ) | + | f ( x i + 1 ) | ] .

Proof Let D be the division of the subintervals [ x i + 1 x i ] (i=0,1,,n1). By applying Corollary 2.3 on the subintervals, we get

Using the (α,m)-convexity of | f |, by summing over i from 0 to n1, and by triangle inequality, we get

| S n (f,D) a b f(x)dx| 5 72 i = 0 n 1 ( x i + 1 m x i ) 2 [ | m f ( x i ) | + | f ( x i + 1 ) | ] .

The proof is completed. □

The proof of following proposition is same as of Proposition 3.1 and by using Corollary 2.9.

Proposition 3.2 Let f be defined as in Proposition 3.1. If | f | p / ( p 1 ) is (α,m)-convex on [a,b], p>1, then for every division D of [a,b], in (3.2), we have

| E n S ( f , D ) | ( 1 + 2 p + 1 6 p + 1 ( p + 1 ) ) 1 / p ( 1 2 1 q ) × i = 0 n 1 ( x i + 1 m x i ) 2 [ ( | f ( m x i ) | q + | f ( m x i + x i + 1 2 ) | q ) 1 / q + ( | f ( m x i + x i + 1 2 ) | q + | f ( x i + 1 ) | q ) 1 / q ] .

4 Application to the midpoint formula

Suppose D be the partition of the interval [a,b], with h i =( x i + 1 x i )/2 and suppose that D:a= x 0 < x 1 << x n 1 < x n =b. Since the midpoint formula is:

M(f,D)= i = 0 n 1 ( x i + 1 x i )f ( x i + x i + 1 2 ) .
(4.1)

We know that, if the function f:[a,b]R, is differentiable such that second derivative of f(x) on (a,b) exists and K= max x ( a , b ) | f 2 (x)|<, then

I= a b f(x)dx=M(f,D)+ E M (f,D).
(4.2)

Where the error term E M (f,D) of the integral I by the mid point formula M(f,D) fulfils the following:

| E M (f,D)| K ˜ 24 i = 0 n 1 ( x i + 1 x i ) 3 .
(4.3)

Here, we derive some new better error estimates for the remainder term E M (f,D) in terms of the first derivative which are refined estimates as compared to presented in [10].

Proposition 4.1 Let f be defined as in Corollary 2.5. If the mapping | f | is (α,m)-convex on [a,b], then for every division D of [a,b], in (4.2), we have

| E M (f,D)| 5 72 i = 0 n 1 ( x i + 1 x i ) 2 [ | f ( x i ) | + | f ( x i + 1 ) | ] .

Proof Let D be the division of the subintervals [ x i + 1 x i ] (i=0,1,,n1). By applying Corollary 2.5 on the subintervals, we get

|( x i + 1 x i )f ( x i + 1 + x i 2 ) x i x i + 1 f(x)dx| 5 ( x i + 1 x i ) 2 72 [ | f ( x i ) | + | f ( x i + 1 ) | ] .

Using the (α,m)-convexity of | f |, by summing over i from 0 to n1, and by triangle inequality, we get

| E M (f,D)| 5 72 i = 0 n 1 ( x i + 1 x i ) 2 [ | f ( x i ) | + | f ( x i + 1 ) | ] .

The proof is completed. □

The proof of following proposition is same as of Proposition 4.1, by putting m=1 in Corollary 2.9.

Proposition 4.2 Let f be defined as in Proposition 4.1. If | f | p / ( p 1 ) is (α,m)-convex on [a,b], p>1, then for every division D of [a,b], in (4.2), we have

| E M ( f , D ) | ( 1 + 2 p + 1 6 p + 1 ( p + 1 ) ) 1 / p ( 1 2 1 q ) × i = 0 n 1 ( x i + 1 x i ) 2 [ ( | f ( x i ) | q + | f ( x i + x i + 1 2 ) | q ) 1 / q + ( | f ( x i + x i + 1 2 ) | q + | f ( x i + 1 ) | q ) 1 / q ] .

5 Application to some special means

We now consider the applications of our main theorem to the special means.

  1. (a)

    The arithmetic mean:

    A=A(a,b):= a + b 2 ,a,b>0.
  2. (b)

    The logarithmic mean:

    L=L(a,b)={ a , if  a = b , b a ln b ln a , if  a b , a,b>0.
  3. (c)

    The p-logarithmic mean:

    L p L p (a,b)={ a , if  a = b , b p + 1 a p + 1 ( p + 1 ) ( b a ) , if  a b , p{1,0}:a,b>0.

It is well known that L P is monotonic nondecreasing over pR with L 1 :=L and L 0 :=I. In particular, we have LA.

Suppose that α(0,1] and φ,ϕ,χR. Consider the function g:[0,)[0,) as

g(t)={ φ , t = 0 , ϕ t α + χ , t > 0

for ϕ0 and 0χφ, we have g K α 2 [1]. Thus, by taking φ=χ=0, ϕ=1, we get g:[0,)[0,) implies: g(t)= t α , g K α 2 .

Consider f:[a,b]R (0<a<b), f(x)= x α , α(0,1]. Then we have the following means:

Now using the results of Section 2, some new inequalities are derived for the above means.

Proposition 5.1 Let f:[a,b]R, 0<a<b and nN. Then we have

(5.1)

Proof The assertion follows by taking m=1 and from inequality (2.2) applied to the mapping f(x)= x α , x[a,b] with nN.

Moreover, by setting α=1 in inequality (5.1), we get

|A(a,b)L(a,b)| 5 36 (ba).

 □

Proposition 5.2 Let f:[a,b]R, 0<a<b and nN. Then we have

(5.2)

Proof The assertion follows by taking m=1 and from inequality (2.6) applied to the mapping f(x)= x α , x[a,b] and nN.

Moreover, by setting α=1 in inequality (5.2), we get

|A(a,b)L(a,b)|2(ba) ( 1 + 2 p + 1 6 p + 1 ( p + 1 ) ) 1 / p .

 □