Skip to main content
Springer logoLink to Springer
. 2018 Oct 22;2018(1):288. doi: 10.1186/s13660-018-1882-9

Bellman–Steffensen type inequalities

Julije Jakšetić 1, Josip Pečarić 2, Ksenija Smoljak Kalamir 2,
PMCID: PMC6208619  PMID: 30839733

Abstract

In this paper some Bellman–Steffensen type inequalities are generalized for positive measures. Using sublinearity of a class of convex functions and Jensen’s inequality, nonnormalized versions of Steffensen’s inequality are obtained. Further, linear functionals, from obtained Bellman–Steffensen type inequalities, are produced and their action on families of exponentially convex functions is studied.

Keywords: Steffensen’s inequality, Bellman–Steffensen type inequality, Measure theory, Exponential convexity

Introduction

Since its appearance in 1918 Steffensen’s inequality [1] has been a subject of investigation by many mathematicians because it plays an important role not only in the theory of inequalities but also in statistics, functional equations, time scales, special functions, etc. A comprehensive survey on generalizations and applications of Steffensen’s inequality can be found in [2].

In 1959 Bellman gave an Lp generalization of Steffensen’s inequality (see [3]) for which Godunova, Levin and Čebaevskaya noted that it is incorrect as stated (see [4]). Further, in [5] Pečarić showed that the Bellman generalization of Steffensen’s inequality is true with very simple modifications of conditions. Using some substitutions in his result from [5], Pečarić also proved the following modification of Steffensen’s inequality in [6].

Theorem 1.1

Assume that two integrable functions f and G are defined on an interval [a,b], f is nonincreasing, and

0λG(t)abG(t)dt,for every t[a,b], 1.1

where λ is a positive number. Then

1λbλbf(t)dtabf(t)G(t)dtabG(t)dt1λaa+λf(t)dt. 1.2

In [7] Mitrinović and Pečarić gave necessary and sufficient conditions for inequality (1.2). The purpose of this paper is to generalize the aforementioned result for positive measures, using the approach from [8] and [9], and to give some applications related to exponential convexity.

Let B([a,b]) be the Borel σ-algebra generated on [a,b]. In [10] the authors proved the following measure theoretic generalization of Steffensen’s inequality.

Theorem 1.2

Let μ be a positive finite measure on B([a,b]), let g,h and k be μ-integrable functions on [a,b] such that k is positive and h is nonnegative. Let λ be a positive constant such that

[a,a+λ]h(t)k(t)dμ(t)=[a,b]g(t)k(t)dμ(t). 1.3

The inequality

[a,b]f(t)g(t)dμ(t)[a,a+λ]f(t)h(t)dμ(t) 1.4

holds for every nonincreasing, right-continuous function f/k:[a,b]R if and only if

[a,x)k(t)g(t)dμ(t)[a,x)k(t)h(t)dμ(t)and[x,b]k(t)g(t)dμ(t)0, 1.5

for every x[a,b].

Remark 1.1

In [10] the authors proved that if the function f is nonnegative, condition (1.3) can be replaced by the weaker condition

[a,a+λ]h(t)k(t)dμ(t)[a,b]g(t)k(t)dμ(t). 1.6

We note that if f/k is nondecreasing, f and h are nonnegative, k is positive, and (1.6) holds, then the inequality in (1.4) is reversed. Furthermore, if (f/k)(a)=0, f/k is increasing, h is nonnegative, k is positive, and (1.6) holds, then the inequality in (1.4) is reversed.

Main results

Motivated by Theorem 1.1 and necessary and sufficient conditions given in [7], we prove some generalizations of Bellman–Steffensen type inequalities for positive measures.

Theorem 2.1

Let μ be a finite, positive measure on B([a,b]), f, h be μ-integrable functions such that h is positive and f:[a,b]R nonincreasing, right-continuous. Then

[a,b]f(t)G(t)dμ(t)[a,b]G(t)dμ(t)[a,a+λ]f(t)h(t)dμ(t)[a,a+λ]h(t)dμ(t) 2.1

if and only if G:[a,b]R is μ-integrable and λ is a positive constant such that

[a,x)G(t)dμ(t)[a,b]G(t)dμ(t)[a,x)h(t)dμ(t)[a,a+λ]h(t)dμ(t)and[x,b]G(t)dμ(t)0, 2.2

for every x[a,b], assuming [a,b]G(t)dμ(t)>0.

For a nondecreasing, right-continuous function f:[a,b]R, inequality (2.1) is reversed.

Proof

(Sufficiency) Let us define the function

g(t)=G(t)[a,a+λ]h(t)dμ(t)[a,b]G(t)dμ(t).

Since [a,b]g(t)dμ(t)=[a,a+λ]h(t)dμ(t) and the conditions in (1.5) (for k1) are fulfilled, we can apply inequality (1.4) (for k1) and obtain inequality (2.1).

(Necessity) If we put the function

f(t)={1,t<x;0,tx,

for axa+λ into inequality (2.1), we obtain the conditions in (2.2). □

In the following lemma we recall the property of sublinearity of the class of convex functions.

Lemma 2.1

If ϕ:[0,)R is a convex function such that ϕ(0)=0 then for any 0a1

ϕ(ax)aϕ(x),for any x[0,).

Theorem 2.2

Let μ be a finite, positive measure on B([a,b]). Let f and h be nonnegative nonincreasing functions on [a,b], and let ϕ be an increasing convex function on [0,) with ϕ(0)=0. If G is a nonnegative nondecreasing function on [a,b] such that there exists a nonnegative function g1, defined by the equation

[a,b]g1(t)ϕ(G(t)g1(t))dμ(t)[a,b]h(t)dμ(t)

and [a,b]g1(t)dμ(t)1, then the following inequality is valid:

ϕ([a,b]f(t)G(t)dμ(t)[a,b]G(t)dμ(t))[a,a+λ]ϕ(f(t))h(t)dμ(t)[a,a+λ]h(t)dμ(t),

where

[a,a+λ]h(t)dμ(t)=ϕ([a,b]G(t)dμ(t)).

Proof

Using Jensen’s inequality, we have

ϕ([a,b]f(t)G(t)dμ(t)[a,b]G(t)dμ(t))[a,b]ϕ(f(t))G(t)dμ(t)[a,b]G(t)dμ(t),

and since ϕf is nonincreasing, we only have to check conditions in (2.2). Since G is nonnegative, obviously [x,b]G(t)dμ(t)0. So we only have to show

ϕ([a,b]G(t)dμ(t))[a,x)G(t)dμ(t)[a,x)h(t)dμ(t)[a,b]G(t)dμ(t). 2.3

Using sublinearity from Lemma 2.1 and Jensen’s inequality, we have

ϕ([a,b]G(t)dμ(t))=ϕ([a,b]g1(t)dμ(t)[a,b]G(t)dμ(t)[a,b]g1(t)dμ(t))[a,b]g1(t)dμ(t)ϕ([a,b]g1(t)G(t)g1(t)dμ(t)[a,b]g1(t)dμ(t))[a,b]g1(t)ϕ(G(t)g1(t))dμ(t)[a,b]h(t)dμ(t). 2.4

Since G is a nonnegative nondecreasing function and h is a nonnegative nonincreasing function, we see that for each x[a,b],

[a,x)G(t)dμ(t)[a,x)h(t)dμ(t)[a,b]G(t)dμ(t)[a,b]h(t)dμ(t),

i.e.,

[a,b]h(t)dμ(t)[a,x)G(t)dμ(t)[a,x)h(t)dμ(t)[a,b]G(t)dμ(t),

so along with (2.4) we proved (2.3). Hence, the proof is completed. □

Remark 2.1

In Theorems 2.1 and 2.2 we proved similar results to those obtained by Liu in [11] but we only need μ to be finite and positive instead of finite continuous and strictly increasing as in [11].

We continue with some more general Bellman–Steffensen type inequalities related to the function f/k.

Theorem 2.3

Let μ be a finite, positive measure on B([a,b]), f,h and k be μ-integrable functions such that h is nonnegative, k is positive and f/k:[a,b]R is nonincreasing, right-continuous. Then

[a,b]f(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,a+λ]f(t)h(t)dμ(t)[a,a+λ]k(t)h(t)dμ(t) 2.5

if and only if G:[a,b]R is a μ-integrable function and λ is a positive constant such that

[a,x)k(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,x)k(t)h(t)dμ(t)[a,a+λ]k(t)h(t)dμ(t)and[x,b]k(t)G(t)dμ(t)0, 2.6

for every x[a,b], assuming [a,b]k(t)G(t)dμ(t)>0.

For a nondecreasing, right-continuous function f/k:[a,b]R inequality (2.5) is reversed.

Proof

(Sufficiency) Let us define the function

g(t)=G(t)[a,a+λ]k(t)h(t)dμ(t)[a,b]k(t)G(t)dμ(t).

Since [a,b]k(t)g(t)dμ(t)=[a,a+λ]k(t)h(t)dμ(t) and (1.5) are fulfilled, we can apply (1.4), and so (2.5) is valid.

(Necessity) If we put the function

f(t)={k(t),t<x;0,tx,

for axa+λ in (2.5), we get (2.6). □

Theorem 2.4

Let μ be a finite, positive measure on B([a,b]). Let h and f/k be nonnegative, nonincreasing functions on [a,b] such that k is positive, and let ϕ be an increasing convex function on [0,) with ϕ(0)=0. If G is a nonnegative, nondecreasing function on [a,b] such that there exists a nonnegative function g1 defined by the equation

[a,b]g1(t)ϕ(k(t)G(t)g1(t))dμ(t)[a,b]k(t)h(t)dμ(t)

and [a,b]g1(t)dμ(t)1, then the following inequality is valid:

ϕ([a,b]f(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t))[a,a+λ]ϕ(f(t)k(t))k(t)h(t)dμ(t)[a,a+λ]k(t)h(t)dμ(t), 2.7

where

[a,a+λ]k(t)h(t)dμ(t)=ϕ([a,b]k(t)G(t)dμ(t)). 2.8

Proof

Using Jensen’s inequality, we have

ϕ([a,b]f(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t))=ϕ([a,b]f(t)k(t)k(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t))[a,b]ϕ(f(t)k(t))k(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t).

From (2.5) for f(ϕ(f/k))k, since ϕ(f/k) is nonincreasing, we have

[a,b]ϕ(f(t)k(t))k(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,a+λ]ϕ(f(t)k(t))k(t)h(t)dμ(t)[a,a+λ]k(t)h(t)dμ(t)

if conditions in (2.6) are satisfied. Obviously, [x,b]k(t)G(t)dμ(t)0 since k and μ are positive and G is nonnegative. Hence, we have to show

ϕ([a,b]k(t)G(t)dμ(t))[a,x)k(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,x)k(t)h(t)dμ(t). 2.9

Using sublinearity from Lemma 2.1 and Jensen’s inequality, we have

ϕ([a,b]k(t)G(t)dμ(t))=ϕ([a,b]g1(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,b]g1(t)dμ(t))[a,b]g1(t)dμ(t)ϕ([a,b]g1(t)k(t)G(t)g1(t)dμ(t)[a,b]g1(t)dμ(t))[a,b]g1(t)ϕ(k(t)G(t)g1(t))dμ(t)[a,b]k(t)h(t)dμ(t). 2.10

Since G and h are nonnegative nondecreasing and k is positive, we have

[a,x)k(t)G(t)dμ(t)[a,x)k(t)h(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,b]k(t)h(t)dμ(t),

i.e.,

[a,b]k(t)h(t)dμ(t)[a,x)k(t)G(t)dμ(t)[a,x)k(t)h(t)dμ(t)[a,b]k(t)G(t)dμ(t).

So, along with (2.10), we have proved (2.9). Hence the theorem is proved. □

Applications

In this section we use classes of log-convex, exponentially convex and n-exponentially convex functions. Definitions and properties of these classes of functions can be found, e.g., in Pečarić, Proschan and Tong [12], Bernstein [13], Pečarić and Perić [14], and Jakšetić, Pečarić [15].

The following example will be useful in our applications.

Example 3.1

  • (i)

    f(x)=eαx is exponentially convex on R, for any αR.

  • (ii)

    g(x)=xα is exponentially convex on (0,), for any α>0.

The following families of functions given in the next two lemmas will be useful in constructing exponentially convex functions.

Lemma 3.1

Let k be a positive function and pR. Let φp:(0,)R be defined by

φp(x)={xppk(x),p0;k(x)logx,p=0. 3.1

Then x(φp/k)(x) is increasing on (0,) for each pR and p(φp/k)(x) is exponentially convex on (0,) for each x(0,).

Proof

Since ddx(φp(x)k(x))=xp1>0 on (0,) for each pR we have that x(φp/k)(x) is increasing on (0,). From Example 3.1 the mappings peplogx and p1p are exponentially convex, and since pxpp=eplogx1p, the second conclusion follows. □

Similarly we obtain the following lemma.

Lemma 3.2

For pR let ϕp:[0,)R be defined by

ϕp(x)=xpp(p1),p>1. 3.2

Then xϕp(x) is convex on [0,) for each p>1 and pϕp(x) and pϕp(x) are exponentially convex on (1,) for each x[0,).

Using the Bellman–Steffensen type inequality given by (2.5), under the assumptions of Theorem 2.3, we can define a linear functional L by

L(f)=[a,b]f(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t)[a,a+λ]f(t)h(t)dμ(t)[a,a+λ]k(t)h(t)dμ(t). 3.3

We have that the functional L is nonnegative on the class of nondecreasing, right-continuous functions f/k:[a,b]R.

Theorem 3.1

Let fL(f) be the linear functional defined by (3.3) and let Φ:RR be defined by

Φ(p)=L(φp),

where φp is defined by (3.1). Then the following statements hold:

  • (i)

    The function Φ is continuous on R.

  • (ii)
    If nN and p1,,pnR are arbitrary, then the matrix
    [Φ(pj+pk2)]j,k=1n
    is positive semidefinite.
  • (iii)

    The function Φ is exponentially convex on R.

  • (iv)

    The function Φ is log-convex on R.

  • (v)
    If p,q,rR are such that p<q<r, then
    Φ(q)rpΦ(p)rqΦ(r)qp.

Proof

(i) Continuity of the function pΦ(p) is obvious for pR{0}. For p=0 it is directly checked using Heine characterization.

(ii) Let nN, piR, i=1,,n be arbitrary. Let us define an auxiliary function Ψ:(0,)R by

Ψ(x)=j,k=1nξjξkφpj+pk2(x).

Now

(Ψ(x)k(x))=j,k=1nξjξkxpj+pk21=(j=1nξjxpj12)20

implies that Ψ/k is nondecreasing on (0,), so L(Ψ)0. This means that

[Φ(pj+pk2)]j,k=1n

is a positive semidefinite matrix.

Claims (iii), (iv), (v) are simple consequences of (i) and (ii). □

Let k be a positive function and let {θp/k:p(0,)} be the family of functions defined on [0,) by

θp(x)=xppk(x). 3.4

Similarly as in Lemma 3.1 we conclude that x(θp/k)(x) is increasing on [0,) for each pR and p(θp/k)(x) is exponentially convex on (0,) for each x[0,).

Let us define a linear functional M by

M(f)=[a,b]f(t)g(t)dμ(t)[a,a+λ]f(t)h(t)dμ(t). 3.5

Under the assumptions of Remark 1.1, we have that the linear functional M is nonnegative acting on nondecreasing functions f/k:[a,b]R with the property (f/k)(a)=0.

Theorem 3.2

Let fM(f) be the linear functional defined by (3.5) and let F:(0,)R be defined by

F(p)=M(θp),

where θp is defined by (3.4). Then the following statements hold:

  • (i)

    The function F is continuous on (0,).

  • (ii)
    If nN and p1,,pn(0,) are arbitrary, then the matrix
    [F(pj+pk2)]j,k=1n
    is positive semidefinite.
  • (iii)

    The function F is exponentially convex on (0,).

  • (iv)

    The function F is log-convex on (0,).

  • (v)
    If p,q,r(0,) are such that p<q<r, then
    F(q)rpF(p)rqF(r)qp.

Proof

(i) Continuity of the function pF(p) is obvious.

(ii) Let nN, pi(0,), i=1,,n be arbitrary. Let us define an auxiliary function Ψ:[0,)R by

Ψ(x)=j,k=1nξjξkθpj+pk2(x).

Now

(Ψ(x)k(x))=(j=1nξjxpj12)20

implies that Ψ/k is nondecreasing on [0,) and nonnegative since (Ψ/k)(0)=0. Hence, M(Ψ)0 and we conclude that

[F(pj+pk2)]j,k=1n

is a positive semidefinite matrix.

Claims (iii), (iv), (v) are simple consequences of (i) and (ii). □

In the following theorem we give the Lagrange-type mean value theorem.

Theorem 3.3

Let fM(f) be the linear functional defined by (3.5), let k be a positive function on [a,b] and ψ/kC1[a,b] such that (ψ/k)(a)=0. Then there exists ξ[a,b] such that

M(ψ)=(ψ(ξ)k(ξ))M(e1),

where e1(x)=(xa)k(x).

Proof

Since ψ/kC1[a,b] there exist

m=minx[a,b]ψ(x)k(x)ψ(x)k(x)k2(x)andM=maxx[a,b]ψ(x)k(x)ψ(x)k(x)k2(x).

Denote

h1(x)=M(xa)k(x)ψ(x)andh2(x)=ψ(x)m(xa)k(x).

Then (h1/k)(a)=(h2/k)(a)=0 and

(h1(x)k(x))=Mψ(x)k(x)ψ(x)k(x)k2(x)0,(h2(x)k(x))=ψ(x)k(x)ψ(x)k(x)k2(x)m0,

so h1/k and h2/k are nondecreasing, nonnegative functions on [a,b], which means that M(h1),M(h2)0, i.e.,

mM(e1)M(ψ)MM(e1).

If M(e1)=0, the proof is complete. If M(e1)>0, then

mM(ψ)M(e1)M

and the existence of ξ[a,b] follows. □

Using the standard Cauchy type mean value theorem, we obtain the following corollary.

Corollary 3.1

Let fM(f) be the linear functional defined by (3.5), let k be a positive function on [a,b] and ψ1/k,ψ2/kC1[a,b] such that (ψ1/k)(a)=(ψ2/k)(a)=0, then there exists ξ[a,b] such that

(ψ1(ξ)k(ξ))(ψ2(ξ)k(ξ))=M(ψ1)M(ψ2), 3.6

provided that the denominator on the right-hand side is nonzero.

Remark 3.1

By (3.6) we can define various means (assuming that the inverse of (ψ1/k)/(ψ2/k) exists). Hence,

ξ=((ψ1k)(ψ2k))1(M(ψ1)M(ψ2)). 3.7

If we substitute ψ1(x)=θp(x),ψ2(x)=θq(x) (where θp is defined by (3.4)) in (3.7) and use the continuous extension, we obtain the following expressions:

M(p,q)={(M(θp)M(θq))1pq,pq;exp(M(θ0θp)M(θp)1p),p=q,

where θ0(x)=logx and p,q(0,).

Using the characterization of convexity by the monotonicity of the first order divided differences, it follows (see [12, p. 4]): if p,q,u,v(0,) are such that pu,qv then

M(p,q)M(u,v).

Using (2.7), under assumptions of Theorem 2.4, we can define a linear functional N by

N(ϕ)=[a,a+λ]ϕ(f(t)k(t))k(t)h(t)dμ(t)[a,a+λ]k(t)h(t)dμ(t)ϕ([a,b]f(t)G(t)dμ(t)[a,b]k(t)G(t)dμ(t)). 3.8

We have that the linear functional N is nonnegative on the class of increasing convex functions ϕ on [0,) with the property ϕ(0)=0.

Theorem 3.4

Let fN(f) be the linear functional defined by (3.8) and let H:(1,)R be defined by

H(p)=N(ϕp),

where ϕp is defined by (3.2). Then the following statements hold:

  • (i)

    The function H is continuous on (1,).

  • (ii)
    If nN and p1,,pn(1,) are arbitrary, then the matrix
    [H(pj+pk2)]j,k=1n
    is positive semidefinite.
  • (iii)

    The function H is exponentially convex on (1,).

  • (iv)

    The function H is log-convex on (1,).

  • (v)
    If p,q,r(1,) are such that p<q<r, then
    H(q)rpH(p)rqH(r)qp.

Proof

(i) Continuity of the function pH(p) is obvious.

(ii) Let nN,pi(1,)(i=1,,n) be arbitrary and define an auxiliary function ψ:[0,)R by

ψ(x)=j,k=1nξjξkϕpj+pk2(x). 3.9

Now

ψ(0)=j,k=1nξjξkϕpj+pk2(0)=0. 3.10

Further,

ψ(x)=(j=1nξjxpj22)20. 3.11

Relations (3.10) and (3.11), together with ψ(0)=0, imply that ψ is a convex increasing function, and then

L(ψ)0.

This means that the matrix

[H(pj+pk2)]j,k=1n

is positive semidefinite.

Claims (iii), (iv), (v) are simple consequences of (i) and (ii). □

Similar to Corollary 3.1 we also have the following corollary.

Corollary 3.2

Let fN(f) be the linear functional defined by (3.8) and ψ1,ψ2C2[0,a] such that ψ1(0)=ψ2(0)=ψ1(0)=ψ2(0)=0 and such that ψ2(x) does not vanish for any value of x[0,a], then there exists ξ[0,a] such that

ψ1(ξ)ψ2(ξ)=N(ψ1)N(ψ2), 3.12

provided that the denominator on the right-hand side is nonzero.

Remark 3.2

By (3.12) we can define various means (assuming that the inverse of ψ1/ψ2 exists). That is,

ξ=(ψ1ψ2)1(N(ψ1)N(ψ2)). 3.13

If we substitute ψ1(x)=ϕp(x),ψ2(x)=ϕq(x) in (3.13) and use the continuous extension, we obtain the following expressions:

N(p,q)={(N(ϕp)N(ϕq))1pq,pq;exp(N(ϕ0ϕp)N(ϕp)+32p(p1)(p2)),p=q,

where ϕ0(x)=logx and p,q(1,).

Again, by the monotonicity one has: if p,q,u,v(1,) are such that pu,qv then

N(p,q)N(u,v).

For a fixed n2, let us define

Cn={ψp:pJ},

a family of functions from C([0,a]) such that ψp(0)=ψp(0)=0, and pψp(x) is n-exponentially convex in the Jensen sense on J for every x[0,a].

Theorem 3.5

Let fN(f) be the linear functional defined by (3.8) and let S:JR be defined by

S(p)=N(ψp),

where ψpCn. Then the following statements hold:

  • (i)

    S is n-exponentially convex in the Jensen sense on J.

  • (ii)
    If S is continuous on J, then it is n-exponentially convex on J and for p,q,rJ such that p<q<r, we have
    S(q)rpS(p)rqS(r)qp.
  • (iii)
    If S is positive and differentiable on J, then for every p,q,u,vJ such that pu,qv, we have
    M˜(p,q)M˜(u,v),
    where M˜(p,q) is defined by
    M˜(p,q)={(S(p)S(q))1pq,pq;exp(ddp(S(p))S(p)),p=q.

Proof

(i) Choose any n points ξ1,,ξnR, any p1,,pnJ. Define an auxiliary function Ψ:[0,a]R by

Ψ(x)=k,m=1nξkξmψpk+pm2(x). 3.14

Then Ψ(0)=Ψ(0)=0 and

Ψ(x)=k,m=1nξkξmψpk+pm2(x)0

by definition of Cn. Hence, Ψ is an increasing convex function, and then L(Ψ)0, which is equivalent to

k,m=1nξkξmS(pk+pm2)0.

(ii) Since S is continuous on J, then it is n-exponentially convex.

(iii) This is a consequence of the characterization of convexity by the monotonicity of the first order divided differences (see [12, p. 4]). □

We also can further refine previous results using divided differences. Let

D={χp:pJ},

be a family of functions from C([0,a]) such that χp(0)=0,p[x,y;χp] is exponentially convex on J for every choice of two distinct points x,y[0,a], and p[x0,x1,x2;χp] is exponentially convex on J for every choice of three distinct points x0,x1,x2[0,a].

Theorem 3.6

Let fN(f) be the linear functional defined by (3.8) and let H:JR be defined by

H(p)=N(χp),

where χpD. Then the following statements hold:

  • (i)
    If nN and p1,,pnR are arbitrary, then the matrix
    [H(pk+pm2)]k,m=1n
    is positive semidefinite.
  • (ii)

    If the function H is continuous on J, then H is exponentially convex on J.

  • (iii)
    If H is positive and differentiable on J, then for every p,q,u,vJ such that pu,qv, we have
    Mˆ(p,q)Mˆ(u,v),
    where Mˆ(p,q) is defined by
    Mˆ(p,q)={(H(p)H(q))1pq,pq;exp(ddp(H(p))H(p)),p=q.

Proof

(i) Let nN,p1,,pnR be arbitrary and define an auxiliary function Ψ:[0,a]R by

Ψ(x)=k,m=1nξkξmχpk+pm2(x).

Then

[x,y;Ψ]=k,m=1nξkξm[x,y;χpk+pm2]0

by definition of D and exponential convexity. This implies that Ψ is a nondecreasing function on [0,a]. Similarly, [x0,x1,x2;Ψ]0, for every choice of three distinct points x0,x1,x2[0,a]. This implies that Ψ is a nondecreasing, convex function on [0,a] such that Ψ(0)=0. Hence L(Ψ)0, which is equivalent to

k,m=1nξkξmH(pk+pm2)0.

(ii) This follows from part (i).

(iii) This is a consequence of the characterization of convexity by the monotonicity of the first order divided differences (see [12, p. 4]). □

Acknowledgments

Acknowledgements

The authors would like to thank an anonymous referee for his valuable remarks and suggestions that improved an earlier version of the manuscript.

Availability of data and materials

Not applicable.

Authors’ contributions

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

Funding

No funding was received.

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

Julije Jakšetić, Email: julije@math.hr.

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

Ksenija Smoljak Kalamir, Email: ksenija.smoljak@ttf.hr.

References

  • 1.Steffensen J.F. On certain inequalities between mean values and their application to actuarial problems. Skand. Aktuarietidskr. 1918;1:82–97. [Google Scholar]
  • 2.Pečarić J., Smoljak Kalamir K., Varošanec S. Steffensen’s and Related Inequalities (a Comprehensive Survey and Recent Advances) Zagreb: Element; 2014. [Google Scholar]
  • 3.Bellman R. On inequalities with alternating signs. Proc. Am. Math. Soc. 1959;10:807–809. doi: 10.1090/S0002-9939-1959-0109864-9. [DOI] [Google Scholar]
  • 4. Godunova, E.K., Levin, V.I., Čebaevskaja, I.V.: Novye issledovanija po funkcional’nym neravenstvam, Materialy šestoi mež. fiz.-mat. nauč. konf. Dal’nego Vostoka. Diff. i Int. Uravenija. Tom 3. Habarovsk, 70–77 (1967) (russian) (eng. New results about functional inequalities)
  • 5.Pečarić J.E. On the Bellman generalization of Steffensen’s inequality. J. Math. Anal. Appl. 1982;88:505–507. doi: 10.1016/0022-247X(82)90208-6. [DOI] [Google Scholar]
  • 6.Pečarić J.E. On the Bellman generalization of Steffensen’s inequality II. J. Math. Anal. Appl. 1984;104:432–434. doi: 10.1016/0022-247X(84)90007-6. [DOI] [Google Scholar]
  • 7.Mitrinović D.S., Pečarić J.E. On the Bellman generalization of Steffensen’s inequality III. J. Math. Anal. Appl. 1988;135:342–345. doi: 10.1016/0022-247X(88)90158-8. [DOI] [Google Scholar]
  • 8.Jakšetić J., Pečarić J. Steffensen’s inequality for positive measures. Math. Inequal. Appl. 2015;18:1159–1170. [Google Scholar]
  • 9.Jakšetić J., Pečarić J., Smoljak Kalamir K. Some measure theoretic aspects of Steffensen’s and reversed Steffensen’s inequality. J. Math. Inequal. 2016;10:459–469. doi: 10.7153/jmi-10-36. [DOI] [Google Scholar]
  • 10.Jakšetić J., Pečarić J., Smoljak Kalamir K. Measure theoretic generalization of Pečarić, Mercer and Wu–Srivastava results. Sarajevo J. Math. 2016;12:33–49. doi: 10.5644/SJM.12.1.03. [DOI] [Google Scholar]
  • 11.Liu Z. More on Steffensen type inequalities. Soochow J. Math. 2005;31:429–439. [Google Scholar]
  • 12.Pečarić J.E., Proschan F., Tong Y.L. Convex Functions, Partial Orderings, and Statistical Applications. San Diego: Academic Press; 1992. [Google Scholar]
  • 13.Bernstein S.N. Sur les fonctions absolument monotones. Acta Math. 1929;52:1–66. doi: 10.1007/BF02592679. [DOI] [Google Scholar]
  • 14.Pečarić J., Perić J. Improvements of the Giaccardi and the Petrović inequality and related results. An. Univ. Craiova, Ser. Mat. Inform. 2012;39:65–75. [Google Scholar]
  • 15.Jakšetić J., Pečarić J. Exponential convexity method. J. Convex Anal. 2013;20:181–197. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

Not applicable.


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

RESOURCES