Skip to main content
Springer logoLink to Springer
. 2018 Sep 12;2018(1):237. doi: 10.1186/s13660-018-1826-4

Generalized Steffensen’s inequality by Lidstone interpolation and Montogomery’s identity

Asfand Fahad 1,, Josip Pečarić 2,3, Muhammad Imran Qureshi 1
PMCID: PMC6154077  PMID: 30839666

Abstract

By using a Lidstone interpolation, Green’s function and Montogomery’s identity, we prove a new generalization of Steffensen’s inequality. Some related inequalities providing generalizations of certain results given in (J. Math. Inequal. 9(2):481–487, 2015) have also been obtained. Moreover, from these inequalities, we formulate linear functionals and describe their properties.

Keywords: Steffensen’s inequality, Green’s function, Montogomery’s identity, (n+1)-convex function at a point

Introduction

Steffensen [12] proved the following inequality: if f,h:[α,β]R, 0h1, and f is decreasing, then

αβf(t)h(t)dtαα+γf(t)dt,where γ=αβh(t)dt. 1

Since then, a generalization and an improvement of Steffensen’s inequality has been a topic of interest of several mathematicians, for example see [10] and the references therein. One generalization of Steffensen’s inequality is given by Pečarić [8].

Theorem 1

Consider any non-decreasing real valued functions g on [a,b] and f on interval I (where I is such that it contains all a, b, g(a) and g(b)) such that g is differentiable. Consider the conditions (i) g(x)x and (ii) g(x)x.

  1. If (i) holds, then
    abf(t)g(t)dtg(a)g(b)f(t)dt. 2
  2. If (ii) holds, then inequality in part (a) is reversed.

Remark 1

In Theorem 1 one may take g as an absolutely continuous function instead of differentiable function because if f is non-decreasing then the function F(x)=axf(t)dt is well defined and F=f holds almost everywhere on I. Then if g is any absolutely continuous and non-decreasing function then the substitution z=g(t) in the integral is justified (see [5, Corollary 20.5]), so

F(g(b))F(g(a))=g(a)g(b)f(z)dz=abf(g(t))g(1)(t)dtabf(t)g(1)(t)dt, 3

where the last inequality holds when g satisfies condition (i).

Recently, Fahad, Pečarić and Praljak proved a generalization [4] of (1) by improving the results given in [8] and [11]. The following is a consequence of a result given in [4].

Corollary 1

Consider any non-decreasing, differentiable and real valued functions g and f on [a,b] and interval I, respectively, (where I is such that it contains all a, b, g(a) and g(b)). If f is convex, then:

  1. If g satisfies condition (i) given in Theorem 1, then
    f(g(b))f(g(a))+abf(t)g(t)dt. 4
  2. If g satisfies condition (ii) given in Theorem 1, then the reverse of the above inequality holds.

The above corollary gives (3) and consequently Steffensen’s inequality. Now, we present some other consequences from results in [4].

Corollary 2

Let f:[0,b]R be a differentiable convex function with f(0)=0 and let h:[0,b][0,+) be another function.

  1. If 0xh(t)dtx for every x[0,b], then
    f(0bh(t)dt)0bf(t)h(t)dt. 5
  2. If x0xh(t)dt for every x[0,b], then the reverse of the above inequality holds.

Corollary 3

Let f and h be as in Corollary 2 and let k:[0,b][0,+) and denote K(t)=tbk(x)dx.

  1. If 0xh(t)dtx for every x[0,b], then
    0bk(x)f(0xh(t)dt)dx0bK(t)f(t)h(t)dt. 6
  2. If x0xh(t)dt for every x[0,b], then the reverse of the above inequality holds.

The goal of this paper is to obtain generalized Steffensen’s inequality by proving generalization of (4). Moreover, inequalities (5) and (6) can be used to obtain classical Hardy-type inequalities; see [4]. Keeping in view the importance of (5) and (6) we obtain their generalizations as well. In our construction, we use Green’s function, Montogomery’s identity and Lidstone interpolation. The following lemma is given in [7].

Lemma 1

For a function fC2([a,b]), see [13], we have

f(x)=bxbaf(a)+xabaf(b)+abG,1(x,s)f(s)ds, 7
f(x)=f(a)+(xa)f(b)+abG,2(x,s)f(s)ds, 8
f(x)=f(b)+(bx)f(a)+abG,3(x,s)f(s)ds, 9
f(x)=f(b)(ba)f(b)+(xa)f(a)+abG,4(x,s)f(s)ds, 10
f(x)=f(a)+(ba)f(a)(bx)f(b)+abG,5(x,s)f(s)ds, 11

where

G,1(x,s)={(xb)(sa)baif asx,(sb)(xa)baif x<sb, 12
G,2(x,s)={asif asx,axif x<sb, 13
G,3(x,s)={xbif asx,sbif x<sb, 14
G,4(x,s)={xaif asx,saif x<sb, 15

and

G,5(x,s)={bsif asx,bxif x<sb. 16

Consider the following functions on [a,b]×[a,b]:

p1(x,s)={sabaif asx,sbbaif x<sb, 17
p2(x,s)={0if asx,1if x<sb, 18
p3(x,s)={1if asx,0if x<sb. 19

Clearly,

pi(x,s)=G,ix(x,s)for all i=1,2,3,p2(x,s)=G,5x(x,s)andp3(x,s)=G,4x(x,s). 20

Throughout the calculations in the main results, we will use pi(x,s) corresponding to G,i(x,s) for i=1,2,3 and for G4(x,s), and G5(x,s), p3(x,s) and p2(x,s), respectively.

Now, we consider the following simple lemma.

Lemma 2

Let fC1[a,b] and pi(x,s), for i=1,2,3 be as defined above then

f(x)=1baabf(s)ds+abp1(x,s)f(s)ds, 21
f(x)=f(b)+abp2(x,s)f(s)ds, 22

and

f(x)=f(a)+abp3(x,s)f(s)ds. 23

Proof

For fix i=1,2,3 consider

abpi(x,s)f(s)ds=axpi(x,s)f(s)ds+xbpi(x,s)f(s)ds.

By replacing specific value of pi(x,s) and simplifying we get the required identities. □

We conclude the section by recalling the Lidstone interpolation and some of its properties. The details related to the Lidstone interpolation can be found in [1]. We start with the following lemma given in [1].

Lemma 3

If fC(2n)([0,1]), then

f(x)=PL(x)+eL(x)=k=0n1[f(2k)(0)Λk(1x)+f(2k)(1)Λk(x)]+01Gn(x,s)f(2n)(s)ds, 24

where Λk is a Lidstone polynomial; see [1]. Moreover,

G1(x,s)=G(x,s)={(x1)sif sx,(s1)xif xs, 25

is a homogeneous Green’s function of the differential operator d2ds2 on [0,1], and with the successive iterates of G(x,s)

Gn(x,s)=01G1(x,u)Gn1(u,s)du,n2. 26

From the lemma it is not difficult to conclude that a function fC(2n)([a,b]) can be represented by using a Lidstone interpolation in the following way:

f(s)=i=0n1(ba)2if(2i)(a)Λi(bsba)+i=0n1(ba)2if(2i)(b)Λi(saba)+(ba)2n1abGn(saba,ξaba)f(2n)(ξ)dξ. 27

The following remark describes the positivity of the Green’s function of the Lidstone interpolation.

Remark 2

Clearly G1(x,s)0 and (26) yields Gn(x,s)0 for even n and Gn(x,s)0 for odd n for every x,s[0,1].

The next section contains the main results of the paper.

Main results

Throughout this section we use the following notations: S1(f,g,a,b)=f(g(a))f(g(b))+abf(t)g(t)dt, S2(f,h,b)=0bf(t)h(t)dtf(0bh(t)dt) and S3(f,h,k,b)=0bK(t)f(t)×h(t)dt0bk(x)f(0xh(t)dt)dx. We start the section with the following theorem which enables us to obtain a generalization of (4).

Theorem 2

Let nN with n2 and f:[a,b]R be 2n times differentiable function. Let g:[a,b]R be a non-decreasing function with g(a),g(b)[a,b] then:

  1. For j=1,2,4,5, we have
    S1(f,g,a,b)=i=0n2(ba)2i[f(2i+2)(a)abS1(G,j(,s),g,a,b)Λi(bsba)ds+f(2i+2)(b)abS1(G,j(,s),g,a,b)Λi(saba)ds]+(ba)2n3abS1(G,j(,s),g,a,b)abGn1(saba,ξaba)f(2n)(ξ)dξds.
  2. If f(a)=0 then
    S1(f,g,a,b)=i=0n2(ba)2i[f(2i+2)(a)abS1(G,3(,s),g,a,b)Λi(bsba)ds+f(2i+2)(b)abS1(G,3(,s),g,a,b)Λi(saba)ds]+(ba)2n3abS1(G,3(,s),g,a,b)abGn1(saba,ξaba)f(2n)(ξ)dξds,

where G,j(x,s) is given by (12)(16).

Proof

  1. We prove it for the case when j=1, the other cases j=2,4,5 are similar to this proof. By using (7) and (21) for f and f, respectively, we have
    S1(f,g,a,b)=f(g(a))f(g(b))+abf(t)g(t)dt=bg(a)baf(a)+g(a)abaf(b)+abG,1(g(a),s)f(s)dsbg(b)baf(a)g(b)abaf(b)abG,1(g(b),s)f(s)ds+ab[f(b)f(a)ba+abp1(t,s)f(s)ds]g(t)dt.
    By simplifying and using Fubini’s theorem, we have
    S1(f,g,a,b)=g(b)g(a)baf(a)g(b)g(a)baf(b)+ab[G,1(g(a),s)G,1(g(b),s)]f(s)ds+f(b)f(a)ba(g(b)g(a))+ababp1(t,s)g(t)f(s)dtds=abS1(G,1(,s),g,a,b)f(s)ds.
    Further, by substituting n with n1 in (27) for f, we get
    S1(f,g,a,b)=abS1(G,1(,s),g,a,b)(i=0n2(ba)2if(2i+2)(a)Λi(bsba)+i=0n2(ba)2if(2i+2)(b)Λi(saba)+(ba)2n3abGn1(saba,ξaba)f(2n)(ξ)dξ)ds,
    which upon simplification gives the required identities.
  2. The proof is similar to part (a) except the use of the assumption f(a)=0.

 □

The following theorem gives a generalized Steffensen’s inequality.

Theorem 3

Let nN with n2 and let f:[a,b]R be 2n times differentiable and g:[a,b]R be a non-decreasing with g(a),g(b)[a,b].

  1. If f is 2n-convex and n is odd, then
    S1(f,g,a,b)i=0n2(ba)2i[f(2i+2)(a)abS1(G,j(,s),g,a,b)Λi(bsba)ds+f(2i+2)(b)abS1(G,j(,s),g,a,b)Λi(saba)ds]
    for j=1,2,,5, where f(a)=0 for j=3.
  2. If f is 2n-convex and n is even, then the reverse of the inequality in part (a) holds.

  3. Iff is 2n-convex and n is odd, then the reverse of the inequality in part (a) holds.

  4. Iff is 2n-convex and n is even, then inequality in part (a) holds.

Proof

  1. For fix s and any j{1,2,3,4,5}, the function G,j(,s) is convex and differentiable and since g is non-decreasing, therefore Corollary 1(a) gives S1(G,j(,s),g,a,b)0. Moreover, 2n-convexity of f implies f(2n)(x)0 for x[a,b]. Since n1 is even, Remark 2 implies Gn1(saba,ξaba)0. Thus, we have
    (ba)2n3abS1(G,j(,s),g,a,b)abGn1(saba,ξaba)f(2n)(ξ)dξds0. 28
    Using this fact in Theorem 2 we get the desired inequality.
  2. The proof is similar to the part (a) except the fact that f is 2n-convex, therefore, f(2n)(x)0, n1 odd implies Gn1(saba,ξaba)0. Therefore, the reverse of (28) holds, which proves part (b).

  3. It follows from the facts that, under the assumptions, f(2n)(x)0 and Gn1(saba,ξaba)0, which give the reverse of (28) and prove (c).

  4. It follows from the facts that, under the assumptions, f(2n)(x)0 and Gn1(saba,ξaba)0, which yield (28) and complete the proof.

 □

In particular, the above theorem gives S1(f,g,a,b)0 and S1(f,g,a,b)0, which give (4) and its reverse. Consequently, Theorem 3 produces a generalization of Steffensen’s inequality and its reverse. Now, we prove the following theorem, which enables us to prove the generalization of (5).

Theorem 4

Let nN with n2 and let f:[0,b]R be 2n times differentiable function with f(0)=0. If h:[0,b][0,+) be an integrable function then:

  1. S2(f,h,b)=i=0n2b2i[f(2i+2)(0)0bS2(G,j(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,j(,s),h,b)Λi(sb)ds]+b2n30bS2(G,j(,s),h,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds
    for j=1,2.
  2. If f(0)=0 then
    S2(f,h,b)+f(b)=i=0n2b2i[f(2i+2)(0)0bS2(G,3(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,3(,s),h,b)Λi(sb)ds]+b2n30bS2(G,3(,s),h,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.
  3. S2(f,h,b)+f(b)bf(b)=i=0n2b2i[f(2i+2)(0)0bS2(G,4(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,4(,s),h,b)Λi(sb)ds]+b2n30bS2(G,4(,s),h,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.
  4. If f(0)=0 then
    S2(f,h,b)bf(b)=i=0n2b2i[f(2i+2)(0)0bS2(G,5(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,5(,s),h,b)Λi(sb)ds]+b2n30bS2(G,5(,s),h,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.

Proof

First, we prove for j=1, the proof of other cases are similar. By using (7) and (21) for f and f, respectively, and using the assumption that f(0)=0, we have

S2(f,h,b)=0bf(t)h(t)dtf(0bh(t)dt)=0b1bf(b)h(t)dt+0b[0bG,1t(t,s)f(s)ds]h(t)dt0bh(t)dtbf(b)0bG,1(0bh(t)dt,s)f(s)ds=0bS2(G,1(,s),h,b)f(s)ds.

Further, by substituting n with n1 in (27) for f and simplifying we get the required identities. □

In the next theorem, we prove a generalization of (5) and its reverse.

Theorem 5

Let nN with n2 and let f:[0,b]R be 2n times differentiable function with f(0)=0 and h be as in Corollary 2(a).

  1. If f is 2n-convex and n is odd, then:
    • (i)
      For j=1,2, we have
      S2(f,h,b)i=0n2b2i[f(2i+2)(0)0bS2(G,j(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,j(,s),h,b)Λi(sb)ds].
    • (ii)
      If f(0)=0 then
      S2(f,h,b)+f(b)i=0n2b2i[f(2i+2)(0)0bS2(G,3(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,3(,s),h,b)Λi(sb)ds].
    • (iii)
      S2(f,h,b)+f(b)bf(b)i=0n2b2i[f(2i+2)(0)0bS2(G,4(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,4(,s),h,b)Λi(sb)ds].
    • (iv)
      If f(0)=0 then
      S2(f,h,b)bf(b)i=0n2b2i[f(2i+2)(0)0bS2(G,5(,s),h,b)Λi(bsb)ds+f(2i+2)(b)0bS2(G,5(,s),h,b)Λi(sb)ds].
  2. If f is 2n-convex and n is even, then for each j the reverse of the inequality in part (a) holds.

  3. Iff is 2n-convex and n is odd, then for each j the reverse of the inequality in part (a) holds.

  4. If -f is 2n-convex and n is even, then for each j inequality in part (a) holds.

Proof

The proof can be obtained from Theorem 4 and Corollary 2(a) along the same lines as Theorem 3 has been proved by using Theorem 2 and Corollary 1(a). □

Now, we prove identities to obtain a generalization of (6).

Theorem 6

Let nN with n2 and let f:[0,b]R be 2n times differentiable function with f(0)=0 and k and K be as in Corollary 3. If h:[0,b][0,+) is integrable then:

  1. For j=1,2, we have
    S3(f,h,k,b)=i=0n2b2i[f(2i+2)(0)0bS3(G,j(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,j(,s),h,k,b)Λi(sb)ds]+b2n30bS3(G,j(,s),h,k,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.
  2. If f(0)=0 then
    S3(f,h,k,b)+f(b)0bk(x)dx=i=0n2b2i[f(2i+2)(0)0bS3(G,3(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,3(,s),h,k,b)Λi(sb)ds]+b2n30bS3(G,3(,s),h,k,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.
  3. S3(f,h,k,b)+(f(b)bf(b))0bk(x)dx=i=0n2b2i[f(2i+2)(0)0bS3(G,4(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,4(,s),h,k,b)Λi(sb)ds]+b2n30bS3(G,4(,s),h,k,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.
  4. If f(0)=0 then
    S3(f,h,k,b)bf(b)0bk(x)dx=i=0n2b2i[f(2i+2)(0)0bS3(G,5(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,5(,s),h,k,b)Λi(sb)ds]+b2n30bS3(G,5(,s),h,k,b)(0bGn1(sb,ξb)f(2n)(ξ)dξ)ds.

Proof

We prove the result for j=1. The proofs of the other parts are similar. By using (7) and (21) for f and f, respectively, we have

S3(f,h,k,b)=0bK(t)f(t)h(t)dt0bk(x)f(0xh(t)dt)dx=0bK(t)h(t)[1bf(b)+0bG,1t(t,s)f(s)ds]dt0bk(x)[1bf(b)0xh(t)dt+0bG,1(0xh(t)dt,s)f(s)ds]dx=1bf(b)[0bK(t)h(t)dt0bk(x)0xh(t)dtdx]+0bK(t)h(t)0bG,1t(t,s)f(s)dsdt0bk(x)0bG,1(0xh(t)dt,s)f(s)dsdx.

Since 0bk(x)0xh(t)dtdx=0bh(t)(tbk(x)dx)dt=0bK(t)h(t)dt,

S3(f,h,k,b)=0b[0bK(t)h(t)G,1t(t,s)dt0bk(x)G,1(0xh(t)dt,s)dx]f(s)ds=0bS3(G,1(,s),h,k,b)f(s)ds.

The rest follows from (27). □

The following theorem gives a generalization of (6) and its reverse.

Theorem 7

Let nN with n2 and let f:[0,b]R be 2n times differentiable function with f(0)=0 and k, K and h be as in Corollary 3(a).

  1. If f is 2n-convex and n is odd, then:
    • (i)
      For j=1,2, we have
      S3(f,h,k,b)i=0n2b2i[f(2i+2)(0)0bS3(G,j(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,j(,s),h,k,b)Λi(sb)ds].
    • (ii)
      If f(0)=0 then
      S3(f,h,k,b)+f(b)0bk(x)dxi=0n2b2i[f(2i+2)(0)0bS3(G,3(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,3(,s),h,k,b)Λi(sb)ds].
    • (iii)
      S3(f,h,k,b)+(f(b)bf(b))0bk(x)dxi=0n2b2i[f(2i+2)(0)0bS3(G,4(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,4(,s),h,k,b)Λi(sb)ds].
    • (iv)
      If f(0)=0 then
      S3(f,h,k,b)bf(b)0bk(x)dxi=0n2b2i[f(2i+2)(0)0bS3(G,5(,s),h,k,b)Λi(bsb)ds+f(2i+2)(b)0bS3(G,5(,s),h,k,b)Λi(sb)ds].
  2. If f is 2n-convex and n is even, then for each j the reverse of the inequality in part (a) holds.

  3. Iff is 2n-convex and n is odd, then for each j the reverse of the inequality in part (a) holds.

  4. If -f is 2n-convex and n is even, then for each j inequality in part (a) holds.

Proof

The proof follows from Theorem 6 and Corollary 3(a) in a similar way to the proof of Theorem 3 by using Theorem 2 and Corollary 1(a). □

Application to (2n+1)-convex function at a point

In the present section we prove results related to the following (n+1)-convex function at a point introduced in [9]. Let IR be an interval, cI0 and nN. A function f:IR is said to be (n+1)-convex at point c if there exists a constant Kc such that the function F(x)=f(x)Kcxnn! is n-concave on I(,c] and n-convex on I[c,). A function f is said to be (n+1)-concave at point c if the function −f is (n+1)-convex at point c. Pečarić, Praljak and Witkowski in [9] studied necessary and sufficient conditions on two linear functionals Ω1:C([δ1,c])R and Γ1:C([c,δ2]R so that the inequality Ω1(f)Γ1(f) holds for every function f that is (n+1)-convex at point c. In this section, we define linear functionals and obtain such inequalities for defined functionals. Let nN be odd with n>2, f:[a,b]R be 2n times differentiable function, a1,a2[a,b] and c(a,b), where a1<c<a2. Let g1:[a1,c]R and g2:[c,a2]R be non-decreasing with gi(x)x for i=1,2. For j=1,2,,5, we define

Ω1,j(f)=S1(f,g1,a1,c)i=0n2(ca1)2i[f(2i+2)(a1)a1cS1(G,j(,s),g1,a1,c)Λi(csca1)ds+f(2i+2)(c)a1cS1(G,j(,s),g1,a1,c)Λi(sa1ca1)ds] 29

and

Γ1,j(f)=S1(f,g2,c,a2)i=0n2(a2c)2i[f(2i+2)(c)ca2S1(G,j(,s),g2,c,a2)Λi(a2sa2c)ds+f(2i+2)(a2)ca2S1(G,j(,s),g2,c,a2)Λi(sca2c)ds]. 30

Similarly let c(0,b), b1(0,b] where c<b1 and let h1:[0,c][0,+) and h2:[c,b1][0,+) be as defined in Corollary 2(a) (w.l.o.g. we may assume h2 on [0,b1] by taking h2(t)=0 when t[0,c]). We define the following pair of functionals:

  1. Ω2,j(f)=S2(f,h1,c)i=0n2c2i[f(2i+2)(0)0cS2(G,j(,s),h1,c)Λi(csc)ds+f(2i+2)(c)0cS2(G,j(,s),h1,c)Λi(sc)ds]
    and
    Γ2,j(f)=S2(f,h2,b1)i=0n2b12i[f(2i+2)(0)cb1S2(G,j(,s),h2,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S2(G,j(,s),h2,b1)Λi(sb1)ds],
    where j=1,2.
  2. Ω2,3(f)=S2(f,h1,c)+f(c)i=0n2c2i[f(2i+2)(0)0cS2(G,3(,s),h1,c)Λi(csc)ds+f(2i+2)(c)0cS2(G,3(,s),h1,c)Λi(sc)ds]
    and
    Γ2,3(f)=S2(f,h2,b1)+f(b1)i=0n2b12i[f(2i+2)(0)cb1S2(G,3(,s),h2,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S2(G,3(,s),h2,b1)Λi(sb1)ds].
  3. Ω2,4(f)=S2(f,h1,c)+f(c)cf(c)i=0n2c2i[f(2i+2)(0)0cS2(G,4(,s),h1,c)Λi(csc)ds+f(2i+2)(c)0cS2(G,4(,s),h1,c)Λi(sc)ds]
    and
    Γ2,4(f)=S2(f,h2,b1)+f(b1)b1f(b1)i=0n2b12i[f(2i+2)(0)cb1S2(G,4(,s),h2,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S2(G,4(,s),h2,b1)Λi(sb1)ds].
  4. Ω2,5(f)=S2(f,h1,c)cf(c)i=0n2c2i[f(2i+2)(0)0cS2(G,5(,s),h1,c)Λi(csc)ds+f(2i+2)(c)0cS2(G,5(,s),h1,c)Λi(sc)ds]
    and
    Γ2,5(f)=S2(f,h2,b1)b1f(b1)i=0n2b12i[f(2i+2)(0)cb1S2(G,5(,s),h2,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S2(G,5(,s),h2,b1)Λi(sb1)ds].

Lastly, we define:

  1. Ω3,j(f)=S3(f,h1,k,c)i=0n2c2i[f(2i+2)(0)0cS3(G,j(,s),h1,k,c)Λi(csc)ds+f(2i+2)(c)0cS3(G,j(,s),h1,k,c)Λi(sc)ds]
    and
    Γ3,j(f)=S3(f,h2,k,b1)i=0n2b12i[f(2i+2)(0)cb1S3(G,j(,s),h2,k,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S3(G,j(,s),h2,k,b1)Λi(sb1)ds],
    where j=1,2.
  2. Ω3,3(f)=S3(f,h1,k,c)+f(c)0ck(x)dxi=0n2c2i[f(2i+2)(0)0cS3(G,3(,s),h1,k,c)Λi(csc)ds+f(2i+2)(c)0cS3(G,3(,s),h1,k,c)Λi(sc)ds]
    and
    Γ3,3(f)=S3(f,h2,k,b1)+f(b1)cb1k(x)dxi=0n2b12i[f(2i+2)(0)cb1S3(G,3(,s),h2,k,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S3(G,3(,s),h2,k,b1)Λi(sb1)ds].
  3. Ω3,4(f=S3(f,h1,k,c)+(f(c)cf(c))0ck(x)dxi=0n2c2i[f(2i+2)(0)0cS3(G,4(,s),h1,k,c)Λi(csc)ds+f(2i+2)(c)0cS3(G,4(,s),h1,k,c)Λi(sc)ds]
    and
    Γ3,4(f)=S3(f,h2,k,b1)+(f(b1)b1f(b1))cb1k(x)dxi=0n2b12i[f(2i+2)(0)cb1S3(G,4(,s),h2,k,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S3(G,4(,s),h2,k,b1)Λi(sb1)ds].
  4. Ω3,5(f)=S3(f,h1,k,c)cf(c)0ck(x)dxi=0n2c2i[f(2i+2)(0)0cS3(G,5(,s),h1,k,c)Λi(csc)ds+f(2i+2)(c)0cS3(G,5(,s),h1,k,c)Λi(sc)ds]
    and
    Γ3,5(f)=S3(f,h2,k,b1)b1f(b1)cb1k(x)dxi=0n2b12i[f(2i+2)(0)cb1S3(G,5(,s),h2,k,b1)Λi(b1sb1)ds+f(2i+2)(b1)cb1S3(G,5(,s),h2,k,b1)Λi(sb1)ds],

where k is as defined in Corollary 3. If f is 2n-convex then Theorem 3(a), Theorem 5(a) and Theorem 7(a) implies Γ1,j(f)0, Γ2,j(f)0 and Γ3,j(f)0 for j=1,2,,5 (and f(0)=0 for j=3), respectively. Moreover, if −f is 2n-convex then Theorem 3(c), Theorem 5(c) and Theorem 7(c) imply Ω1,j(f)0, Ω2,j(f)0 and Ω3,j(f)0 for j=1,2,,5 (and f(0)=0 for j=3), respectively.

Theorem 8

Let nN with n>2 be odd and let f:[a,b]R be (2n+1)-convex at a point c in (a,b). Let g1:[a1,c]R and g2:[c,a2]R, where a1<c<a2, be non-decreasing and differentiable functions. If Ω1,j(ϕ0)=Γ1,j(ϕ0), for all j=1,2,,5 and f(a)=0 for j=3, where ϕ0(x)=x2n then

Ω1,j(f)Γ1,j(f),

for j=1,2,,5.

Proof

Since f is (2n+1)-convex at c, there exists a Kc such that F(x)=f(x)Kcx2n(2n)! is 2n-concave (or −F is 2n-convex) on [a1,c] and 2n-convex on [c,a2]. Therefore, for each j=1,2,,5, we have 0Ω1,j(F)=Ω1,j(f)Kc(2n)!Ω1,j(ϕ0). Moreover, since F is 2n-convex on [c,a2], 0Γ1,j(F)=Γ1,j(f)Kc(2n)!Γ1,j(ϕ0). Since Ω1,j(ϕ0)=Γ1,j(ϕ0), Ω1,j(f)Γ1,j(f), which completes the proof. □

Theorem 9

Let nN with n>2 be odd, let h1:[0,c][0,+) and h2:[c,b1][0,+) be as defined in Corollary 2(a) and k:[0,b][0,+) be as in Corollary 3. If f:[0,b]R is (2n+1)-convex at a point c in (0,b) then:

    • (i)
      If
      S2(ϕ0,h1,c)i=0n2c2iϕ0(2i+2)(c)0cS2(G,j(,s),h1,c)Λi(sc)ds=S2(ϕ0,h2,b1)i=0n2b12iϕ0(2i+2)(b1)cb1S2(G,j(,s),h2,b1)Λi(sb1)ds
      then Ω2,j(f)Γ2,j(f) for j=1,2, where ϕ0(x)=x2n.
    • (ii)
      If f(0)=0 and
      S2(ϕ0,h1,c)+c2ni=0n2c2iϕ0(2i+2)(c)0cS2(G,3(,s),h1,c)Λi(sc)ds=S2(ϕ0,h2,b1)+b12ni=0n2b12iϕ0(2i+2)(b1)cb1S2(G,3(,s),h2,b1)Λi(sb1)ds
      then Ω2,3(f)Γ2,3(f).
    • (iii)
      If
      S2(ϕ0,h1,c)+(12n)c2ni=0n2c2iϕ0(2i+2)(c)0cS2(G,4(,s),h1,c)Λi(sc)ds=S2(ϕ0,h2,b1)+(12n)b12ni=0n2b12iϕ0(2i+2)(b1)cb1S2(G,4(,s),h2,b1)Λi(sb1)ds
      then Ω2,4(f)Γ2,4(f).
    • (iv)
      If
      S2(ϕ0,h1,c)2nc2ni=0n2c2iϕ0(2i+2)(c)0cS2(G,5(,s),h1,c)Λi(sc)ds=S2(ϕ0,h2,b1)2nb12ni=0n2b12iϕ0(2i+2)(b1)cb1S2(G,5(,s),h2,b1)Λi(sb1)ds
      then Ω2,5(f)Γ2,5(f).
    • (i)
      If
      S3(ϕ0,h1,k,c)i=0n2c2iϕ0(2i+2)(c)0cS3(G,j(,s),h1,k,c)Λi(sc)ds=S3(ϕ0,h2,k,b1)i=0n2b12iϕ0(2i+2)(b1)cb1S3(G,j(,s),h2,k,b1)Λi(sb1)ds
      then Ω3,j(f)Γ3,j(f) for j=1,2.
    • (ii)
      If f(0)=0 and
      S3(ϕ0,h1,k,c)+c2n0ck(x)dxi=0n2c2iϕ0(2i+2)(c)0cS3(G,3(,s),h1,k,c)Λi(sc)ds=S3(ϕ0,h2,k,b1)+b12ncb1k(x)dxi=0n2b12iϕ0(2i+2)(b1)cb1S3(G,3(,s),h2,k,b1)Λi(sb1)ds
      then Ω3,3(f)Γ3,3(f).
    • (iii)
      If
      S3(ϕ0,h1,k,c)+(12n)c2n0ck(x)dxi=0n2c2iϕ0(2i+2)(c)0cS3(G,4(,s),h1,k,c)Λi(sc)ds=S3(ϕ0,h2,k,b1)+(12n)b12ncb1k(x)dxi=0n2b12iϕ0(2i+2)(b1)cb1S3(G,4(,s),h2,k,b1)Λi(sb1)ds
      then Ω3,4(f)Γ3,4(f).
    • (iv)
      If
      S3(ϕ0,h1,k,c)2nc2n0ck(x)dxi=0n2c2iϕ0(2i+2)(c)0cS3(G,5(,s),h1,k,c)Λi(sc)ds=S3(ϕ0,h2,k,b1)2nb12ncb1k(x)dxi=0n2b12iϕ0(2i+2)(b1)cb1S3(G,5(,s),h2,k,b1)Λi(sb1)ds
      then Ω3,5(f)Γ3,5(f).

Proof

  1. Since f is (2n+1)-convex at c, there exists a Kc such that F(x)=f(x)Kcx2n(2n)! is 2n-concave (or −F is 2n-convex) on [0,c] and 2n-convex on [c,b1]. Therefore,
    0Ω2,j(F)=Ω2,j(f)Kc(2n)!(i=0n2c2iϕ0(2i+2)(c)0cS2(G,j(,s),h1,c)Λi(sc)dsS2(ϕ0,h1,c)).
    On the other hand, since F is 2n-convex on [c,b1],
    0Γ2,j(F)=Γ2,j(f)Kc(2n)!(i=0n2b12iϕ0(2i+2)(b1)cb1S2(G,j(,s),h2,b1)Λi(sb1)dsS(ϕ0,h2,b1)).
    So under the given assumption, we have Ω2,j(f)Γ2,j(f) for j=1,2, which completes the proof of part (i). The proofs of the other parts are similar.
  2. The proof is similar to the proof of part (a).

 □

Further refinements

Theorem 3 can be refined further for some classes of functions, using exponential convexity (for details see [2] and [3]). First, we use linear functional Ω1,j define in previous section. Under assumptions of Theorem 3(a), we conclude that, for any odd n and for any j{1,2,,5}, Ω1,j acts non-negatively on the class of 2n-convex functions.

Further, let us introduce a family of 2n-convex functions on [0,) with

φt(x)={xtt(t1)(t2n+1),t{0,1,,2n1};xjlnx(1)2n1jj!(2n1j)!,t=j{0,1,,2n1}. 31

This is indeed a family of 2n-convex functions since d2ndx2nφt(x)=xt2n0.

Since txt2n=e(t2n)lnx is an exponentially convex function, the quadratic form

i,k=1mξiξkd2ndx2nφpi+pk2(x) 32

is positively semi-definite. According to Theorem 3(a),

i,k=1mξiξkΩ1,jφpi+pk2 33

is also positively semi-definite, for any mN, ξiR and piR, showing the exponential convexity of the mapping pΩ1,jφp. Specially, if we take m=2 in (33) we see additionally that pΩ1,jφp is also a log-convex mapping, a property that we will need in the next theorem.

Theorem 10

Under the assumptions of Theorem 3(a) the following statements hold:

  • (i)

    The mapping pΩ1,jφp is exponentially convex on R.

  • (ii)
    For p,q,rR such that p<q<r, we have
    (Ω1,jφq)rp(Ω1,jφp)rq(Ω1,jφr)qp 34
    for j=1,2,,5.

Remark 3

We have outlined the proof of the theorem above. The second part of Theorem 10 is known as the Lyapunov inequality, it follows from log-convexity, and it refines the lower (upper) bound for the action of the functional on the class of functions given in (31). This conclusion is a simple consequence of the fact that exponentially convex mappings are non-negative and if an exponentially convex mapping attains zero value at some point it is zero everywhere (see [6]).

A similar estimation technique can be applied for classes of 2n-convex functions given in [6]. Lastly, a similar construction can be made for the linear functionals Ω2,j and Ω3,j to obtain the inequalities given in Theorem 10 for these functionals.

Results and discussion

Steffensen’s inequality first appeared in 1918 and has remained of interest for several mathematicians. This paper is devoted to proving a generalization of Steffensen’s inequality which is related to recent and older developments. We also provide applications of the obtained results. In the primary step we prove a simple lemma which approximates a continuously differentiable function in different forms. By using these approximations, we prove such identities as under the condition of 2n-convexity and 2n-concavity give a generalization of Steffensen’s inequality and its reverse. Subsequently, we provide applications of the results to the theory of (2n+1)-convex functions at a point and exponentially convex functions. We also prove the Lyapunov inequality.

Conclusion

Several identities related to recent generalization of Steffensen’s inequality have been proved. Under the assumption of 2n-convexity and 2n-concavity, a generalization of Steffensen’s inequality and its reverse has been obtained from the identities. Applications of the results have been presented of the theory of (2n+1)-convex functions at a point and exponentially convex functions.

Acknowledgements

The authors are thankful to the anonymous referees for their valuable suggestions, which led to the improvement of the paper.

Authors’ contributions

All authors jointly worked on the results and they read and approved the final manuscript.

Funding

The research of first and third author was supported by Higher Education Commission of Pakistan under SRGP with following reference number: 21-1428/SRGP/R-D/HEC/2016. The research of second author was supported by the Ministry of Education and Science of the Russian Federation (Agreement number No. 02.a03.21.0008).

Competing interests

The authors declare that they have no competing interests.

Footnotes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Asfand Fahad, Email: asfandfahad1@yahoo.com.

Josip Pečarić, Email: pecaric@element.hr.

Muhammad Imran Qureshi, Email: imranqureshi18@gmail.com.

References

  • 1.Agarwal P., Wong Y. Error Inequalities in Polynomial Interpolation and Their Applications. Norwell: Kluwer Academic; 1993. [Google Scholar]
  • 2.Akhiezer N.I. The Classical Moment Problem and Some Related Questions in Analysis. Edinburgh: Oliver and Boyd; 1965. [Google Scholar]
  • 3.Bernstein S.N. Sur les fonctions absolument monotones. Acta Math. 1929;52:1–66. doi: 10.1007/BF02592679. [DOI] [Google Scholar]
  • 4.Fahad A., Pečarić J., Praljak M. Generalized Steffensen’s inequaliy. J. Math. Inequal. 2015;9(2):481–487. doi: 10.7153/jmi-09-41. [DOI] [Google Scholar]
  • 5.Hewitt E., Stromberg K. Real and Abstract Analysis. 3. New York: Springer; 1975. [Google Scholar]
  • 6.Jakšetić J., Pečarić J. Exponential convexity method. J. Convex Anal. 2013;20(1):181–187. [Google Scholar]
  • 7.Mehmood N., Agrwal R.P., Butt S.I., Pečarić J. New generalizations of Popoviciu-type inequalities via new Green’s functions and Montgomery identity. J. Inequal. Appl. 2017;2017:108. doi: 10.1186/s13660-017-1379-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 8.Pečarić J. Connections among some inequalities of Gauss, Steffensen and Ostrowski. Southeast Asian Bull. Math. 1989;13(2):89–91. [Google Scholar]
  • 9.Pečarić J., Praljak M., Witkowski A. Linear operator inequality for n-convex functions at a point. Math. Inequal. Appl. 2015;18:1201–1217. [Google Scholar]
  • 10.Pečarić J., Proschan F., Tong Y.L. Convex Functions, Partial Orderings and Statistical Applications. New York: Academic Press; 1992. [Google Scholar]
  • 11.Rabier P. Steffensen’s inequality and L1L estimates of weighted integrals. Proc. Am. Math. Soc. 2012;140(2):665–675. doi: 10.1090/S0002-9939-2011-10939-0. [DOI] [Google Scholar]
  • 12.Steffensen J.F. On certain inequalities between mean values, and their application to actuarial problems. Skand. Aktuarietidskr. 1918;1:82–97. [Google Scholar]
  • 13.Widder D.V. Completely convex function and Lidstone series. Trans. Am. Math. Soc. 1942;51:387–398. doi: 10.1090/S0002-9947-1942-0006356-4. [DOI] [Google Scholar]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES