Skip to main content
Springer logoLink to Springer
. 2017 Jan 3;2017(1):4. doi: 10.1186/s13660-016-1274-y

Levinson’s type generalization of the Jensen inequality and its converse for real Stieltjes measure

Rozarija Mikić 1, Josip Pečarić 1, Mirna Rodić 1,
PMCID: PMC5209453  PMID: 28111504

Abstract

We derive the Levinson type generalization of the Jensen and the converse Jensen inequality for real Stieltjes measure, not necessarily positive. As a consequence, also the Levinson type generalization of the Hermite-Hadamard inequality is obtained. Similarly, we derive the Levinson type generalization of Giaccardi’s inequality. The obtained results are then applied for establishing new mean-value theorems. The results from this paper represent a generalization of several recent results.

Keywords: Jensen’s inequality, converse Jensen’s inequality, Hermite-Hadamard’s inequality, Giaccardi’s inequality, Levinson’s inequality, Green function, mean-value theorems

Introduction and preliminary results

The well-known Jensen inequality asserts that for a convex function φ:IRR we have

φ(1Pni=1npixi)1Pni=1npiφ(xi), 1.1

where xiI for i=1,,n, and pi are nonnegative real numbers such that Pn=i=1npi>0.

Steffensen [1] showed that inequality (1.1) also holds in the case when (x1,,xn) is a monotonic n-tuple of numbers from the interval I and (p1,,pn) is an arbitrary real n-tuple such that 0PkPn (k=1,,n), Pn>0, where Pk=i=1kpi. His result is called the Jensen-Steffensen inequality.

Boas [2] gave the integral analog of the Jensen-Steffensen inequality.

Theorem 1.1

[2]

Let φ:IR be a continuous convex function, where I is the range of the continuous monotonic function (either increasing or decreasing) f:[a,b]R, and let λ:[a,b]R be either continuous or of bounded variation satisfying

λ(a)λ(x)λ(b)for all x[a,b],λ(a)<λ(b).

Then

φ(abf(x)dλ(x)abdλ(x))abφ(f(x))dλ(x)abdλ(x). 1.2

The generalization of this result is also given by Boas in [2]. It is the so-called Jensen-Boas inequality (see also [3]).

Theorem 1.2

[2]

If λ:[a,b]R is either continuous or of bounded variation satisfying

λ(a)λ(x1)λ(y1)λ(x2)λ(yn1)λ(xn)λ(b)

for all xkyk1,yk, y0=a, yn=b, and λ(a)<λ(b), and if f is continuous and monotonic (either increasing or decreasing) in each of the n intervals yk1,yk, then inequality (1.2) holds.

The following theorem states the well-known Levinson inequality.

Theorem 1.3

[4]

Let f:0,2cR satisfy f0 and let pi,xi,yi, i=1,,n be such that pi>0, i=1npi=1, 0xic and

x1+y1=x2+y2==xn+yn. 1.3

Then the following inequality is valid:

i=1npif(xi)f(x¯)i=1npif(yi)f(y¯), 1.4

where x¯=i=1npixi and y¯=i=1npiyi denote the weighted arithmetic means.

Numerous papers have been devoted to extensions and generalizations of this result, as well as to weakening the assumptions under which inequality (1.4) is valid (see for instance [58], and [9]).

A function f:IR is called k-convex if [x0,,xk]f0 for all choices of k+1 distinct points x0,x1,,xkI. If the kth derivative of a convex function exists, then f(k)0, but f(k) may not exist (for properties of divided differences and k-convex functions see [3]).

Remark 1.4

  • (i)
    Bullen [6] rescaled Levinson’s inequality to a general interval [a,b] and showed that if function f is 3-convex and pi,xi,yi, i=1,,n, are such that pi>0, i=1npi=1, axi, yib, (1.3) holds for some ca,b and
    max{x1,,xn}max{y1,,yn}, 1.5
    then (1.4) holds.
  • (ii)
    Pečarić [8] proved that inequality (1.4) is valid when one weakens the previous assumption (1.5) to
    xi+xni+12candpixi+pni+1xni+1pi+pni+1c,for i=1,2,,n.
  • (iii)
    Mercer [7] made a significant improvement by replacing condition (1.3) with a weaker one, i.e. he proved that inequality (1.4) holds under the following conditions:
    f0,pi>0,i=1npi=1,axi,yib,max{x1,,xn}max{y1,,yn},i=1npi(xix¯)2=i=1npi(yiy¯)2. 1.6
  • (iv)

    Witkowski [9] showed that it is enough to assume that f is 3-convex in Mercer’s assumptions. Furthermore, Witkowski weakened the assumption (1.6) and showed that equality can be replaced by inequality in a certain direction.

Furthermore, Baloch, Pečarić, and Praljak in their paper [5] introduced a new class of functions K1c(a,b) that extends 3-convex functions and can be interpreted as functions that are ‘3-convex at point ca,b’. They showed that K1c(a,b) is the largest class of functions for which Levinson’s inequality (1.4) holds under Mercer’s assumptions, i.e. that fK1c(a,b) if and only if inequality (1.4) holds for arbitrary weights pi>0, i=1npi=1 and sequences xi and yi that satisfy xicyi for i=1,2,,n.

We give the definition of the class K1c(a,b) extended to an arbitrary interval I.

Definition 1.5

Let f:IR and cI, where I is the interior of I. We say that fK1c(I) (fK2c(I)) if there exists a constant D such that the function F(x)=f(x)D2x2 is concave (convex) on ,c]I and convex (concave) on [c,+I.

Remark 1.6

For the class K1c(a,b) the following useful results hold (see [5]):

(1)

If fKic(a,b), i=1,2, and f(c) exists, then f(c)=D.

(2)

The function f:(a,b)R is 3-convex (3-concave), if and only if fK1c(a,b) (fK2c(a,b)) for every c(a,b).

Jakšetić, Pečarić, and Praljak in [10] gave the following Levinson type generalization of the Jensen-Boas inequality.

Theorem 1.7

[10]

Let cI and let f:[a1,b1]R and g:[a2,b2]R be continuous monotonic functions (either increasing or decreasing) with ranges I,c] and I[c,+, respectively. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous or of bounded variation satisfying

λ(a1)λ(x1)λ(y1)λ(x2)λ(yn1)λ(xn)λ(b1)

for all xkyk1,yk, y0=a1, yn=b1, and λ(a1)<λ(b1), and

μ(a2)μ(u1)μ(v1)λ(u2)μ(vn1)μ(un)μ(b2)

for all ukvk1,vk, v0=a2, vn=b2, and μ(a2)<μ(b2). If φK1c(I) is continuous and if

a1b1f2(x)dλ(x)a1b1dλ(x)(a1b1f(x)dλ(x)a1b1dλ(x))2=a2b2g2(x)dμ(x)a2b2dμ(x)(a2b2g(x)dμ(x)a2b2dμ(x))2

holds, then

a1b1φ(f(x))dλ(x)a1b1dλ(x)φ(a1b1f(x)dλ(x)a1b1dλ(x))a2b2φ(g(x))dμ(x)a2b2dμ(x)φ(a2b2g(x)dμ(x)a2b2dμ(x)). 1.7

On the other hand, in [11] Pečarić, Perić, and Rodić Lipanović generalized the Jensen inequality (1.2) for a real Stieltjes measure. They considered the Green function G defined on [α,β]×[α,β] by

G(t,s)={(tβ)(sα)βαfor αst,(sβ)(tα)βαfor tsβ, 1.8

which is convex and continuous with respect to both s and t. The function G is continuous under s and continuous under t, and it can easily be shown by integrating by parts that any function φ:[α,β]R, φC2([α,β]), can be represented by

φ(x)=βxβαφ(α)+xαβαφ(β)+αβG(x,s)φ(s)ds. 1.9

Using that fact, the authors in [11] gave the conditions under which inequality (1.2) holds for a real Stieltjes measure, which is not necessarily positive nor increasing. This result is stated in the following theorem.

Theorem 1.8

[11]

Let g:[a,b]R be continuous function and [α,β] interval such that the image of g is a subset of [α,β]. Let λ:[a,b]R be continuous function or the function of bounded variation, such that λ(a)λ(b) and

abg(x)dλ(x)abdλ(x)[α,β].

Then the following two statements are equivalent:

(1)
For every continuous convex function φ:[α,β]R
φ(abg(x)dλ(x)abdλ(x))abφ(g(x))dλ(x)abdλ(x) 1.10
holds.
(2)
For all s[α,β]
G(abg(x)dλ(x)abdλ(x),s)abG(g(x),s)dλ(x)abdλ(x) 1.11
holds, where the function G:[α,β]×[α,β]R is defined in (1.8).

Furthermore, the statements (1) and (2) are also equivalent if we change the sign of inequality in both (1.10) and (1.11).

Note that for every continuous concave function φ:[α,β]R inequality (1.10) is reversed, i.e. the following corollary holds.

Corollary 1.9

[11]

Let the conditions from the previous theorem hold. Then the following two statements are equivalent:

(1′)

For every continuous concave function φ:[α,β]R the reverse inequality in (1.10) holds.

(2′)

For all s[α,β] inequality (1.11) holds, where the function G is defined in (1.8).

Moreover, the statements (1′) and (2′) are also equivalent if we change the sign of inequality in both statements (1′) and (2′).

The main aim of our paper is to give a Levinson type generalization of the result from Theorem 1.8. In that way, a generalization of Theorem 1.7 for real Stieltjes measure, not necessarily positive nor increasing, will also be obtained.

Main results

In order to simplify the notation, throughout this paper we use the following notation:

f¯=a1b1f(x)dλ(x)a1b1dλ(x)andg¯=a2b2g(x)dμ(x)a2b2dμ(x).

The following theorem states our main result.

Theorem 2.1

Let f:[a1,b1]R and g:[a2,b2]R be continuous functions, [α,β]R an interval and cα,β such that f([a1,b1])[α,c] and g([a2,b2])[c,β]. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous functions or functions of bounded variation such that λ(a1)λ(b1) and μ(a2)μ(b2) and such that

f¯[α,c]andg¯[c,β]

and

C:=a1b1f2(x)dλ(x)a1b1dλ(x)f¯2=a2b2g2(x)dμ(x)a2b2dμ(x)g¯2 2.1

holds.

If for all s1[α,c] and for all s2[c,β] we have

G(f¯,s1)a1b1G(f(x),s1)dλ(x)a1b1dλ(x)andG(g¯,s2)a2b2G(g(x),s2)dμ(x)a2b2dμ(x), 2.2

where the function G is defined in (1.8), then for every continuous function φK1c([α,β]) we have

a1b1φ(f(x))dλ(x)a1b1dλ(x)φ(f¯)D2Ca2b2φ(g(x))dμ(x)a2b2dμ(x)φ(g¯). 2.3

The statement also holds if we reverse all signs of inequalities in (2.2) and (2.3).

Proof

Let φK1c([α,β]) be continuous function on [α,β] and let ϕ(x)=φ(x)D2x2, where D is the constant from Definition 1.5.

Since the function ϕ is continuous and concave on [α,c] and for all s1[α,c] (2.2) holds, from Corollary 1.9 it follows that

ϕ(f¯)a1b1ϕ(f(x))dλ(x)a1b1dλ(x).

When we rearrange the previous inequality, we get

a1b1φ(f(x))dλ(x)a1b1dλ(x)φ(f¯)D2[a1b1f2(x)dλ(x)a1b1dλ(x)f¯2]. 2.4

Since the function ϕ is continuous and convex on [c,β] and for all s2[c,β] (2.2) holds, from Theorem 1.8 it follows that

ϕ(g¯)a2b2ϕ(g(x))dμ(x)a2b2dμ(x),

and after rearranging we get

D2[a2b2g2(x)dμ(x)a2b2dμ(x)g¯2]a2b2φ(g(x))dμ(x)a2b2dμ(x)φ(g¯). 2.5

Inequality (2.3) follows directly by combining inequalities (2.4) and (2.5), and taking into account the condition (2.1). □

Corollary 2.2

Let the conditions from the previous theorem hold.

  • (i)

    If for all s1[α,c] and s2[c,β] inequalities (2.2) hold, where the function G is defined in (1.8), then for every continuous function φK2c([α,β]) the reverse inequalities in (2.3) hold.

  • (ii)

    If for all s1[α,c] and s2[c,β] the reverse inequalities in (2.2) hold, then for every continuous function φK2c([α,β]) (2.3) holds.

Remark 2.3

It is obvious from the proof of the previous theorem that if we replace the equality (2.1) by a weaker condition

C1:=D2[a1b1f2(x)dλ(x)a1b1dλ(x)f¯2]C2:=D2[a2b2g2(x)dμ(x)a2b2dμ(x)g¯2], 2.6

then (2.3) becomes

a1b1φ(f(x))dλ(x)a1b1dλ(x)φ(f¯)C1C2a2b2φ(g(x))dμ(x)a2b2dμ(x)φ(g¯).

Since the function φ belongs to class K1c([α,β]), we have φ(c)Dφ+(c) (see [5]), so if additionally φ is convex (resp. concave), the condition (2.6) can be further weakened to

a1b1f2(x)dλ(x)a1b1dλ(x)f¯2a2b2g2(x)dμ(x)a2b2dμ(x)g¯2.

Remark 2.4

It is easy to see that Theorem 2.1 further generalizes the Levinson type generalization of the Jensen-Boas inequality given in Theorem 1.7. Namely, if in Theorem 2.1 we set the functions f and g to be monotonic, and the functions λ and μ to satisfy

λ(a1)λ(x1)λ(y1)λ(x2)λ(yn1)λ(xn)λ(b1)

for all xkyk1,yk, y0=a1, yn=b1, and λ(a1)<λ(b1), and

μ(a2)μ(u1)μ(v1)λ(u2)μ(vn1)μ(un)μ(b2)

for all ukvk1,vk, v0=a2, vn=b2, and μ(a2)<μ(b2), then since the function G is continuous and convex in both variables, we can apply the Jensen inequality and see that for all s1[α,c] and s2[c,β] inequalities (2.2) hold, so we get exactly Theorem 1.7.

Discrete case

In this section we give the results for the discrete case. The proofs are similar to those in the integral case given in the previous section, so we will state these results without the proofs.

In Levinson’s inequality (1.3) and its generalizations (see [5]) we see that pi (i=1,,n) are positive real numbers. Here, we will give a generalization of that result, allowing pi to also be negative, with the sum not equal to zero, but with a supplementary demand on pi and xi given by using the Green function G defined in (1.8).

Here we use the common notation: for real n-tuples (x1,,xn) and (p1,,pn) we set Pk=i=1kpi, Pk¯=PnPk1 (k=1,,n) and x¯=1Pni=1npixi. Analogously, for real m-tuples (y1,,ym) and (q1,,qm) we define Qk, Qk¯ (k=1,,m) and ȳ.

We already know from the first section that we can represent any function φ:[α,β]R, φC2([α,β]), in the form (1.9), where the function G is defined in (1.8), and by some calculation it is easy to show that the following holds:

φ(x¯)1Pni=1npiφ(xi)=αβ(G(x¯,s)1Pni=1npiG(xi,s))φ(s)ds.

Using that fact the authors in [11] derived the analogous results of Theorem 1.8 and Corollary 1.9 for discrete case, and here, similarly as in the previous section, we get the following results.

Theorem 3.1

Let [α,β]R be an interval and cα,β. Let xi[a1,b1][α,c], piR (i=1,,n) be such that Pn0 and x¯[α,c], and let yj[a2,b2][c,β], qjR (j=1,,m) be such that Qm0 and y¯[c,β] and let

C:=1Pni=1npixi2x¯2=1Qmj=1mqjyj2y¯2. 3.1

If for all s1[α,c] and for all s2[c,β] we have

G(x¯,s1)1Pni=1npiG(xi,s1)andG(y¯,s2)1Qmj=1mqjG(yj,s2), 3.2

where the function G is defined in (1.8), then for every continuous function φK1c([α,β]) we have

1Pni=1npiφ(xi)φ(x¯)D2C1Qmj=1mqjφ(yj)φ(y¯), 3.3

where D is the constant from Definition  1.5.

Inequality (3.3) is reversed if we change the signs of inequalities in (3.2).

Corollary 3.2

Let the conditions from the previous theorem hold.

  • (i)

    If for all s1[α,c] and s2[c,β] the inequalities in (3.2) hold, where the function G is defined in (1.8), then for every continuous function φK2c([α,β]) the reverse inequalities in (3.3) hold.

  • (ii)

    If for all s1[α,c] and s2[c,β] the reversed inequalities in (3.2) hold, then for every continuous function φK2c([α,β]) (3.3) holds.

Remark 3.3

Theorem 3.1 is the generalization of Levinson’s type inequality given in [5]. Namely, since the function G is convex in both variables, in the case when all pi>0 and qj>0 we can apply the Jensen inequality and we see that for all s1[α,c] and s2[c,β] inequalities (3.2) hold. Now from Theorem 3.1 and Corollary 3.2 we get the result from [5].

Remark 3.4

We can replace the equality from the condition (3.1) by a weaker condition in the analogous way as in Remark 2.3 from the previous section.

Converses of the Jensen inequality

The Jensen inequality for convex functions implies a whole series of other classical inequalities. One of the most famous ones amongst them is the so-called Edmundson-Lah-Ribarič inequality which states that, for a positive measure μ on [0,1] and a convex function ϕ on [m,M] (<m<M<+), if f is any μ-measurable function on [0,1] such that mf(x)M for x[0,1], one has

01ϕ(f)dμ01dμMf¯Mmϕ(m)+f¯mMmϕ(M), 4.1

where f¯=01fdμ/01dμ.

It was obtained in 1973. by Lah and Ribarič in their paper [12]. Since then, there have been many papers written on the subject of its generalizations and converses (for instance, see [13] and [3]).

In [14] the authors gave a Levinson type generalization of inequality (4.1) for positive measures. In this section we will obtain a similar result involving signed measures, with a supplementary demand by using the Green function G defined in (1.8). In order to do so, we first need to state a result from [11], which gives us a version of the Edmundson-Lah-Ribarič inequality for signed measures.

Theorem 4.1

[11]

Let g:[a,b]R be continuous function and [α,β] be an interval such that the image of g is a subset of [α,β]. Let m,M[α,β] (mM) be such that mg(t)M for all t[a,b]. Let λ:[a,b]R be continuous function or the function of bounded variation, and λ(a)λ(b). Then the following two statements are equivalent:

(1)
For every continuous convex function φ:[α,β]R
abφ(g(x))dλ(x)abdλ(x)Mg¯Mmφ(m)+g¯mMmφ(M) 4.2
holds, where g¯=abg(x)dλ(x)abdλ(x).
(2)
For all s[α,β]
abG(g(x),s)dλ(x)abdλ(x)Mg¯MmG(m,s)+g¯mMmG(M,s) 4.3
holds, where the function G:[α,β]×[α,β]R is defined in (1.8).

Furthermore, the statements (1) and (2) are also equivalent if we change the sign of inequality in both (4.2) and (4.3).

Note that for every continuous concave function φ:[α,β]R inequality (4.2) is reversed, i.e. the following corollary holds.

Corollary 4.2

[11]

Let the conditions from the previous theorem hold. Then the following two statements are equivalent:

(1′)

For every continuous concave function φ:[α,β]R the reverse inequality in (4.2) holds.

(2′)

For all s[α,β] inequality (4.3) holds, where the function G is defined in (1.8).

Moreover, the statements (1′) and (2′) are also equivalent if we change the sign of inequality in both statements (1′) and (2′).

In the following theorem we give the Levinson type generalization of the upper result, and we use a similar method to Section 2 of this paper.

Theorem 4.3

Let f:[a1,b1]R and g:[a2,b2]R be continuous functions, [α,β]R an interval and cα,β such that f([a1,b1])=[m1,M1][α,c] and g([a2,b2])=[m2,M2][c,β], where m1M1 and m2M2. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous functions or functions of bounded variation such that λ(a1)λ(b1) and μ(a2)μ(b2) and

C:=M1f¯M1m1m12+f¯m1M1m1M12a1b1f2(x)dλ(x)a1b1dλ(x)=M2g¯M2m2m22+gm2M2m2M22a2b2g2(x)dμ(x)a2b2dμ(x). 4.4

If for all s[α,c] we have

a1b1G(f(x),s)dλ(x)a1b1dλ(x)M1f¯M1m1G(m1,s)+f¯m1M1m1G(M1,s) 4.5

and for all s[c,β] we have

a2b2G(g(x),s)dμ(x)a2b2dμ(x)M2g¯M2m2G(m2,s)+g¯m2M2m2G(M2,s), 4.6

where the function G is defined in (1.8), then for every continuous function φK1c([α,β]) we have

M1f¯M1m1φ(m1)+f¯m1M1m1φ(M1)a1b1φ(f(x))dλ(x)a1b1dλ(x)D2CM2g¯M2m2φ(m2)+gm2M2m2φ(M2)a2b2φ(g(x))dμ(x)a2b2dμ(x). 4.7

The statement also holds if we reverse all signs of inequalities in (4.5), (4.6) and (4.7).

Proof

Let φK1c([α,β]) be continuous function on [α,β] and let ϕ(x)=φ(x)D2x2, where D is the constant from Definition 1.5.

Since the function ϕ is continuous and concave on [α,c] and for all s[α,c] (4.5) holds, from Corollary 4.2 it follows that

a1b1ϕ(f(x))dλ(x)a1b1dλ(x)M1f¯M1m1ϕ(m1)+f¯m1M1m1ϕ(M1).

When we rearrange the previous inequality, we get

M1f¯M1m1φ(m1)+f¯m1M1m1φ(M1)a1b1φ(f(x))dλ(x)a1b1dλ(x)D2[M1f¯M1m1m12+f¯m1M1m1M12a1b1f2(x)dλ(x)a1b1dλ(x)]. 4.8

Since the function ϕ is continuous and convex on [c,β] and for all s[c,β] (4.6) holds, from Theorem 4.1 it follows that

a2b2ϕ(g(x))dμ(x)a2b2dμ(x)M2g¯M2m2ϕ(m2)+g¯m2M2m2ϕ(M2),

and after rearranging we get

D2[M2g¯M2m2m22+g¯m2M2m2M22a2b2g2(x)dμ(x)a2b2dμ(x)]M2g¯M2m2φ(m2)+g¯m2M2m2φ(M2)a2b2φ(g(x))dμ(x)a2b2dμ(x). 4.9

Inequality (4.7) follows directly by combining inequalities (4.8) and (4.9), and taking into account the condition (4.4). □

Corollary 4.4

Let the conditions from the previous theorem hold.

  • (i)

    If for all s[α,c] the inequality in (4.5) holds, and for all s[c,β] the inequality in (4.6) holds, then for every continuous function φK2c([α,β]) the reverse inequalities in (4.7) hold.

  • (ii)

    If for all s[α,c] the reversed inequality in (4.5) holds, and for all s[c,β] the reversed inequality in (4.6) holds, then for every continuous function φK2c([α,β]) the inequalities in (4.7) hold.

Remark 4.5

It is obvious from the proof of the previous theorem that if we replace the equality (4.4) by a weaker condition

C1:=D2[M1f¯M1m1m12+f¯m1M1m1M12a1b1f2(x)dλ(x)a1b1dλ(x)]C2:=D2[M2g¯M2m2m22+gm2M2m2M22a2b2g2(x)dμ(x)a2b2dμ(x)], 4.10

then (4.7) becomes

M1f¯M1m1φ(m1)+f¯m1M1m1φ(M1)a1b1φ(f(x))dλ(x)a1b1dλ(x)C1C2M2g¯M2m2φ(m2)+gm2M2m2φ(M2)a2b2φ(g(x))dμ(x)a2b2dμ(x).

Since φ(c)Dφ+(c) (see [5]), if additionally φ is convex (resp. concave), the condition (4.10) can be further weakened to

M1f¯M1m1m12+f¯m1M1m1M12a1b1f2(x)dλ(x)a1b1dλ(x)M2g¯M2m2m22+gm2M2m2M22a2b2g2(x)dμ(x)a2b2dμ(x).

Discrete form of the converses of the Jensen inequality

In this section we give the Levinson type generalization for converses of Jensen’s inequality in discrete case. The proofs are similar to those in the integral case given in the previous section, so we give these results with the proofs omitted.

As we can represent any function φ:[α,β]R, φC2([α,β]), in the form (1.9), where the function G is defined in (1.8), by some calculation it is easy to show that the following holds:

1Pni=1npiφ(xi)bx¯baφ(a)x¯abaφ(b)=αβ(1Pni=1npiG(xi,s)bx¯baG(a,s)x¯abaG(b,s))φ(s)ds.

Using that fact the authors in [11] derived analogous results of Theorem 4.1 and Corollary 4.2 for discrete case.

In [14] the authors obtained the following Levinson type generalization of the discrete Edmundson-Lah-Ribarič inequality.

Theorem 5.1

[14]

Let <aAcbB<+. If xi[a,A], yj[b,B], pi>0, qj>0 for i=1,,n and j=1,,m are such that i=1npi=j=1mqj=1 and

Ax¯Aaa2+x¯aAaA2i=1npixi2=By¯Bbb2+y¯bBbB2j=1mqjyj2,

where x¯=i=1npixi and y¯=j=1mqjyj, then for every fK1c(a,B) we have

Ax¯Aaf(a)+x¯aAaf(A)i=1npif(xi)By¯Bbf(b)+y¯bBbf(B)j=1mqjf(yj).

Our first result is a generalization of the result from [14] stated above, in which it is allowed for pi,qj to also be negative, with the sum not equal to zero, but with supplementary demands on pi,qj and xi,yj given by using the Green function G defined in (1.8).

Theorem 5.2

Let [α,β]R be an interval and cα,β. Let xi[a1,b1][α,c], a1b1, piR (i=1,,n), and yj[a2,b2][c,β], a2b2, qjR (j=1,,m) be such that Pn0 and Qm0 and

C:=b1x¯b1a1a12+x¯a1b1a1b121Pni=1npixi2=b2y¯b2a2a22+y¯a2b2a2b221Qmj=1mqjyj2. 5.1

If for all s[α,c] we have

1Pni=1npiG(xi,s)b1x¯b1a1G(a1,s)+x¯a1b1a1G(b1,s), 5.2

and for all s[c,β] we have

1Qmj=1mqjG(yj,s)b2y¯b2a2G(a2,s)+y¯a2b2a2G(b2,s), 5.3

where x¯=1Pni=1npixi, y¯=1Qmj=1mqjyj and the function G is defined in (1.8), then for every continuous function φK1c([α,β]) we have

b1x¯b1a1φ(a1)+x¯a1b1a1φ(b1)1Pni=1npiφ(xi)D2Cb2y¯b2a2φ(a2)+y¯a2b2a2φ(b2)1Qmj=1mqjφ(yj). 5.4

The statement also holds if we reverse all signs of the inequalities in (5.2), (5.3), and (5.4).

Remark 5.3

If we set all pi,qj to be positive, then Theorem 5.2 becomes the result from [14] which is stated above in Theorem 5.1.

Corollary 5.4

Let the conditions from the previous theorem hold.

  • (i)

    If for all s[α,c] inequality (5.2) holds and for all s[c,β] inequality (5.3) holds, then for every continuous function φK2c([α,β]) the reverse inequalities in (5.4) hold.

  • (ii)

    If for all s[α,c] the reversed inequality in (5.2) holds and for all s[c,β] the reversed inequality in (5.3) holds, then for every continuous function φK2c([α,β]) (5.4) holds.

Remark 5.5

We can replace the equality from the condition (5.1) by a weaker condition in the analogous way as in Remark 4.5 from the previous chapter.

The Hermite-Hadamard inequality

The classical Hermite-Hadamard inequality states that for a convex function φ:[a,b]R the following estimation holds:

φ(a+b2)1baabφ(x)dxφ(a)+φ(b)2. 6.1

Its weighted form is proved by Fejér in [15]: If φ:[a,b]R is a convex function and p:[a,b]R nonnegative integrable function, symmetric with respect to the middle point (a+b)/2, then the following estimation holds:

φ(a+b2)abp(x)dxabφ(x)p(x)dxφ(a)+φ(b)2abp(x)dx. 6.2

Fink in [16] discussed the generalization of (6.1) by separately looking the left and right side of the inequality and considering certain signed measures. In their paper [17], the authors gave a complete characterization of the right side of the Hermite-Hadamard inequality.

Rodić Lipanović, Pečarić, and Perić in [11] obtained the complete characterization for the left and the right side of the generalized Hermite-Hadamard inequality for the real Stieltjes measure.

In this section a Levinson type generalization of the Hermite-Hadamard inequality for signed measures will be given as a consequence of the results given in Sections 2 and 4.

Here we use the following notation:

x˜=a1b1xdλ(x)a1b1dλ(x)andy˜=a2b2ydμ(y)a2b2dμ(y).

Corollary 6.1

Let [α,β]R be an interval and cα,β and let [a1,b1][α,c] and [a2,b2][c,β]. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous functions or functions of bounded variation such that λ(a1)λ(b1), μ(a2)μ(b2) and x˜[α,c], y˜[c,β], and such that

C:=a1b1x2dλ(x)a1b1dλ(x)x˜2=a2b2y2dμ(y)a2b2dμ(y)y˜2. 6.3

If for all s1[α,c] and for all s2[c,β] the inequalities

G(x˜,s1)a1b1G(x,s1)dλ(x)a1b1dλ(x)andG(y˜,s2)a2b2G(y,s2)dμ(y)a2b2dμ(y) 6.4

hold, where the function G is defined in (1.8), then for every continuous function φK1c([α,β]) we have

a1b1φ(x)dλ(x)a1b1dλ(x)φ(x˜)D2Ca2b2φ(y)dμ(y)a2b2dμ(y)φ(y˜). 6.5

The statement also holds if we reverse all signs of the inequalities in (6.4) and (6.5).

Remark 6.2

Let the conditions from the previous corollary hold.

  • (i)

    If for all s1[α,c] and s2[c,β] inequalities (6.4) hold, then for every continuous function φK2c([α,β]) the reverse inequalities in (6.5) hold.

  • (ii)

    If for all s1[α,c] and s2[c,β] the reversed inequalities in (6.4) hold, then for every continuous function φK2c([α,β]) (6.5) holds.

Note that for the Levinson type generalization of the left-side inequality of the generalized Hermite-Hadamard inequality it is necessary to demand that x˜[α,c] and y˜[c,β].

Remark 6.3

If in Remark 2.3 we put f(x)=x and g(x)=x, we can obtain weaker conditions instead of equality (6.3) under which inequality (6.5) holds.

Similarly, from the results given in the fourth section we get the Levinson type generalization of the right-side inequality of the generalized Hermite-Hadamard inequality. Here we allow that the mean value goes outside of the interval [α,c] and outside of the interval [c,β].

Corollary 6.4

Let [α,β]R be an interval and cα,β, and let [a1,b1][α,c] and [a2,b2][c,β]. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous functions or functions of bounded variation such that λ(a1)λ(b1) and μ(a2)μ(b2) and such that

C:=b1x˜b1a1a12+x˜a1b1a1b12a1b1x2dλ(x)a1b1dλ(x)=b2y˜b2a2a22+y˜a2b2a2b22a2b2y2dμ(y)a2b2dμ(y). 6.6

If for all s[α,c] we have

a1b1G(x,s)dλ(x)a1b1dλ(x)b1x˜b1a1G(a1,s)+x˜a1b1a1G(b1,s), 6.7

and for all s[c,β] we have

a2b2G(y,s)dμ(y)a2b2dμ(y)b2y˜b2a2G(a2,s)+y˜a2b2a2G(b2,s), 6.8

where the function G is defined in (1.8), then for every continuous function φK1c([α,β]) we have

b1x˜b1a1φ(a1)+x˜a1b1a1φ(b1)a1b1φ(x)dλ(x)a1b1dλ(x)D2Cb2y˜b2a2φ(a2)+y˜a2b2a2φ(b2)a2b2φ(y)dμ(y)a2b2dμ(y). 6.9

The statement also holds if we reverse all signs of the inequalities in (6.7), (6.8) and (6.9).

Remark 6.5

Let the conditions from the previous theorem hold.

  • (i)

    If for all s[α,c] inequality (6.7) holds and for all s[c,β] inequality (6.8) holds, then for every continuous function φK2c([α,β]) the reverse inequalities in (6.9) hold.

  • (ii)

    If for all s[α,c] the reversed inequality in (6.7) holds and for all s[c,β] the reversed inequality in (6.8) holds, then for every continuous function φK2c([α,β]) (6.9) holds.

Remark 6.6

If in Remark 4.5 we put f(x)=x and g(x)=x, we can obtain analogous weaker conditions instead of equality (6.6) under which inequality (6.9) holds.

It is easy to see that for λ(x)=x and μ(x)=x the conditions (6.4), (6.7) and (6.8) are always fulfilled. In that way we can obtain a Levinson type generalization of both sides in the classical weighted Hermite-Hadamard inequality.

Corollary 6.7

Let [α,β]R be an interval and cα,β, and let [a1,b1][α,c] and [a2,b2][c,β].

  • (i)
    If C:=112(b2a2)2=112(b1a1)2 holds, then for every continuous function φK1c([α,β])
    1b1a1a1b1φ(x)dxφ(a1+b12)D2C1b2a2a2b2φ(x)dxφ(a2+b22).
  • (ii)
    If C:=16(b2a2)2=16(b1a1)2 holds, then for every continuous function φK1c([α,β])
    φ(a1)+φ(b1)21b1a1a1b1φ(x)dxD2Cφ(a2)+φ(b2)21b2a2a2b2φ(x)dx.

If φK2c([α,β]), then the inequalities in (i) and (ii) are reversed.

The inequalities of Giaccardi and Petrović

The well-known Petrović inequality [18] for convex function f:[0,a]R is given by

i=1nf(xi)f(i=1nxi)+(n1)f(0), 7.1

where xi (i=1,,n) are nonnegative numbers such that x1,,xn, i=1nxi[0,a].

The following generalization of (7.1) is given by Giaccardi (see [3] and [19]).

Theorem 7.1

Giaccardi, [19]

Let p=(p1,,pn) be a nonnegative n-tuple and x=(x1,,xn) be a real n-tuple such that

(xix0)(j=1npjxjxi)0,i=1,,n,x0,i=1npixi[a,b]andi=1npixix0.

If f:[a,b]R is a convex function, then

i=1npif(xi)Af(i=1npixi)+B(i=1npi1)f(x0), 7.2

where

A=i=1npi(xix0)i=1npixix0,B=i=1npixii=1npixix0.

In this section we will use an analogous technique as in the previous sections to obtain a Levinson type generalization of the Giaccardi inequality for n-tuples p of real numbers which are not necessarily nonnegative. As a simple consequence, we will obtain a Levinson type generalization of the original Giaccardi inequality (7.2). In order to do so, we first need to state two results from [11].

Theorem 7.2

[11]

Let xi[a,b][α,β], ab, piR (i=1,,n) be such that Pn0. Then the following two statements are equivalent:

(1)
For every continuous convex function f:[α,β]R
1Pni=1npif(xi)bx¯baf(a)+x¯abaf(b) 7.3
holds.
(2)
For all s[α,β]
1Pni=1npiG(xi,s)bx¯baG(a,s)+x¯abaG(b,s) 7.4
holds, where the function G:[α,β]×[α,β]R is defined in (1.8).

Moreover, the statements (1) and (2) are also equivalent if we change the sign of the inequality in both inequalities, in (7.3) and in (7.4).

Corollary 7.3

[11]

Under the conditions from the previous theorem, the following two statements are also equivalent:

(1′)

For every continuous concave function φ:[α,β]R the reverse inequality in (7.3) holds.

(2′)

For all s[α,β] inequality (7.4) holds.

Moreover, the statements (1′) and (2′) are also equivalent if we change the sign of inequality in both statements (1′) and (2′).

Our first result is a Levinson type generalization of the Giaccardi inequality for n-tuples p and m-tuples q of arbitrary real numbers instead of nonnegative real numbers.

Theorem 7.4

Let [α,β]R be an interval and cα,β such that [a1,b1][α,c] and [a2,b2][c,β]. Let p and x be n-tuples of real numbers, and let q and y be m-tuples of real numbers such that Pn=i=1npi0, Qm=i=1mqi0, and

(xjx0)(i=1npixixj)0(j=1,,n);x0,i=1npixi[a1,b1];i=1npixix0;(yjy0)(i=1mqiyiyj)0(j=1,,m);y0,i=1mqiyi[a2,b2];i=1mqiyiy0. 7.5

Let

C:=A1(i=1npixi)2+B1(i=1npi1)x02i=1npixi2=A2(j=1mqjyj)2+B2(j=1mqj1)y02j=1mqjyj2, 7.6

where

A1=i=1npi(xix0)i=1npixix0,B1=i=1npixii=1npixix0,A2=j=1mqj(yjy0)j=1mqjyjy0,B2=j=1mqjyjj=1mqjyjy0. 7.7

If PnQm>0 and for all s[α,β] and the function G defined in (1.8) the inequalities

i=1npiG(xi,s)A1G(i=1npixi,s)+B1(i=1npi1)G(x0,s), 7.8
j=1mqjG(yj,s)A2G(j=1mqjyj,s)+B2(j=1mqj1)G(y0,s), 7.9

hold, then for every continuous function φK1c([α,β]) we have

A1φ(i=1npixi)+B1(i=1npi1)φ(x0)i=1npiφ(xi)D2CA2φ(j=1mqjyj)+B2(j=1mqj1)φ(y0)j=1mqjφ(yj). 7.10

The statement also holds if we reverse all signs of the inequalities in (7.8), (7.9), and (7.10).

Proof

We follow the same idea as in the proof of Theorem 4.3 from Section 4. We apply Theorem 7.2 and Corollary 7.3 to the function ϕ(x)=φ(x)D2x2, which is concave on [α,c] and convex on [c,β]. We set a=min{x0,i=1npixi}, b=max{x0,i=1npixi} on [α,c], and then we set a=min{y0,j=1mqjyj} and b=max{y0,j=1mqjyj} on [c,β], as well as consider the signs of Pn and Qm. We omit the details. □

Corollary 7.5

Let the assumptions from the previous theorem hold.

  • (i)

    If Pn>0 and Qm<0 and if for all s[α,β] inequality (7.8) holds and inequality (7.9) is reversed, then (7.10) holds.

  • (ii)

    If Pn<0 and Qm>0 and if for all s[α,β] inequality (7.8) is reversed and inequality (7.9) holds, then (7.10) holds.

Statements (i) and (ii) also hold if we reverse the signs in all of the inequalities.

Corollary 7.6

Let the assumptions from the previous theorem hold.

  • (i)

    If PnQm>0 and if for all s[α,β] inequalities (7.8) and (7.9) hold, then for every continuous function φK2c([α,β]) the reversed inequality in (7.10) holds.

  • (ii)

    If PnQm>0 and if for all s[α,β] inequalities (7.8) and (7.9) are reversed, then for every continuous function φK2c([α,β]) (7.10) holds.

  • (iii)

    If Pn>0 and Qm<0 and if for all s[α,β] inequality (7.8) holds and inequality (7.9) is reversed, then for every continuous function φK2c([α,β]) the reversed inequality in (7.10) holds.

  • (iv)

    If Pn<0 and Qm>0 and if for all s[α,β] inequality (7.8) is reversed and inequality (7.9) holds, then for every continuous function φK2c([α,β]) the reversed inequality in (7.10) holds.

Statements (iii) and (iv) also hold if we reverse the signs in all of the mentioned inequalities.

Remark 7.7

One needs to notice that if we set pi (i=1,,n) and qj (j=1,,m) to be positive, Theorem 7.4 becomes the Levinson type generalization of the original Giaccardi inequality (7.2).

Remark 7.8

As in the previous sections, we can replace the equality (7.6) by a weaker condition

C1:=D2[A1(i=1npixi)2+B1(i=1npi1)x02i=1npixi2]C2:=D2[A2(j=1mqjyj)2+B2(j=1mqj1)y02j=1mqjyj2], 7.11

and then (7.10) becomes

A1φ(i=1npixi)+B1(i=1npi1)φ(x0)i=1npiφ(xi)C1C2A2φ(j=1mqjyj)+B2(j=1mqj1)φ(y0)j=1mqjφ(yj).

Since φ(c)Dφ+(c) (see [5]), if additionally φ is convex (resp. concave), the condition (7.11) can be further weakened to

A1(i=1npixi)2+B1(i=1npi1)x02i=1npixi2A2(j=1mqjyj)2+B2(j=1mqj1)y02j=1mqjyj2.

Mean-value theorems

Let f:[a1,b1]R and g:[a2,b2]R be continuous functions, [α,β]R an interval and cα,β such that f([a1,b1])=[m1,M1][α,c] and g([a2,b2])=[m2,M2][c,β]. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous functions or functions of bounded variation such that λ(a1)λ(b1) and μ(a2)μ(b2), and let φK1c([α,β]) be a continuous function.

Motivated by the results obtained in previous sections, we define the following linear functionals which, respectively, represent the difference between the right and the left side of inequalities (2.3) and (4.7):

ΓJ(φ)=a2b2φ(g(x))dμ(x)a2b2dμ(x)φ(g¯)a1b1φ(f(x))dλ(x)a1b1dλ(x)+φ(f¯), 8.1

where f¯[α,c], g¯[c,β];

ΓELR(φ)=M2g¯M2m2φ(m2)+gm2M2m2φ(M2)a2b2φ(g(x))dμ(x)a2b2dμ(x)M1f¯M1m1φ(m1)f¯m1M1m1φ(M1)+a1b1φ(f(x))dλ(x)a1b1dλ(x), 8.2

where m1M1 and m2M2.

We have:

  • (i)

    ΓJ(φ)0, when (2.1) holds and for all s1[α,c], s2[c,β] (2.2) holds;

  • (ii)

    ΓELR(φ)0, when (4.4) holds, and for all s[α,c] (4.5) holds and for all s[c,β] (4.6) holds.

In the following two theorems we give the mean-value theorems of the Lagrange and Cauchy type, respectively.

Theorem 8.1

Let f:[a1,b1]R and g:[a2,b2]R be continuous functions, [α,β]R an interval and cα,β such that f([a1,b1])=[m1,M1][α,c] and g([a2,b2])=[m2,M2][c,β]. Let λ:[a1,b1]R and μ:[a2,b2]R be continuous functions or functions of bounded variation such that λ(a1)λ(b1), μ(a2)μ(b2). Let ΓJ and ΓELR be linear functionals defined above, and let φC3([α,β]).

  • (i)
    If (2.1) holds and for all s1[α,c], s2[c,β] (2.2) holds, then there exists ξ1[α,β] such that
    ΓJ(φ)=φ(ξ1)6[a2b2g3(x)dμ(x)a2b2dμ(x)a1b1f3(x)dλ(x)a1b1dλ(x)+f¯3g¯3]. 8.3
  • (ii)
    If (4.4) holds, and for all s[α,c] (4.5) holds and for all s[c,β] (4.6) holds, then there exists ξ2[α,β] such that
    ΓELR(φ)=φ(ξ2)6[M2g¯M2m2m23+gm2M2m2M23a2b2g3(x)dμ(x)a2b2dμ(x)M1f¯M1m1m13f¯m1M1m1M13+a1b1f3(x)dλ(x)a1b1dλ(x)]. 8.4

Proof

Since φ(x) is continuous on [α,β], it attains its minimum and maximum value on [α,β], i.e. there exist m=minx[α,β]φ(x) and M=maxx[α,β]φ(x). The functions φ1,φ2:[α,β]R defined by

φ1(x)=φ(x)m6x3andφ2(x)=M6x3φ(x)

are 3-convex because φ1(x)0 and φ2(x)0, so from Remark 1.6 it follows that they belong to the class K1c([α,β]). From Theorem 2.1 it follows that ΓJ(φ1)0 and ΓJ(φ2)0, and from Theorem 4.3 it follows that ΓELR(φ1)0 and ΓELR(φ2)0 and so we get

m6ΓJ(φ˜)ΓJ(φ)M6ΓJ(φ˜), 8.5
m6ΓELR(φ˜)ΓELR(φ)M6ΓELR(φ˜), 8.6

where φ˜(x)=x3. Since the function φ̃ is 3-convex, we have φ˜K1c([α,β]), so by applying Theorem 2.1 (resp. Theorem 4.3) we get ΓJ(φ˜)0 (resp. ΓELR(φ˜)0). If ΓJ(φ˜)=0 (resp. ΓELR(φ˜)=0), then (8.5) implies ΓJ(φ)=0 (resp. (8.6) implies ΓELR(φ)=0), so (8.3) (resp. (8.4)) holds for every ξ[α,β]. Otherwise, dividing (8.5) by ΓJ(φ˜)>0 (resp. (8.6) by ΓELR(φ˜)>0) we get

m6ΓJ(φ)ΓJ(φ˜)M6(resp. m6ΓELR(φ)ΓELR(φ˜)M6),

and continuity of φ ensures the existence of ξ1[α,β] satisfying (8.3) (resp. ξ2[α,β] satisfying (8.4)). □

Theorem 8.2

Let the conditions from Theorem  8.1 hold. Let φ,ψC3([α,β]). If ΓJ(ψ)0 and ΓELR(ψ)0, then there exist ξ1,ξ2[α,β] such that

ΓJ(φ)ΓJ(ψ)=φ(ξ1)ψ(ξ1)orφ(ξ1)=ψ(ξ1)=0

and

ΓELR(φ)ΓELR(ψ)=φ(ξ2)ψ(ξ2)orφ(ξ2)=ψ(ξ2)=0.

Proof

Let us define a function χC3([α,β]) by χ(x)=ΓJ(ψ)φ(x)ΓJ(φ)ψ(x). Due to the linearity of ΓJ we have ΓJ(χ)=0. Theorem 8.1 implies that there exist ξ1,ξ[α,β] such that

ΓJ(χ)=χ(ξ1)6ΓJ(φ˜),ΓJ(ψ)=ψ(ξ)6ΓJ(φ˜),

where φ˜(x)=x3. Now we have ΓJ(φ˜)0, because otherwise we would have ΓJ(ψ)=0, which is a contradiction with the assumption ΓJ(ψ)0. So we have

χ(ξ1)=ΓJ(ψ)φ(ξ1)ΓJ(φ)ψ(ξ1)=0,

and this gives us the first claim of the theorem. The second claim is proved in an analogous manner, by observing the linear functional ΓELR instead of ΓJ. □

Remark 8.3

Note that if in Theorem 8.2 we set the function ψ to be ψ(x)=x3, we get exactly Theorem 8.1.

Remark 8.4

Note that if we set the functions f, g, λ, and μ from our theorems to fulfill the conditions from Jensen’s integral inequality or Jensen-Steffensen’s, or Jensen-Brunk’s, or Jensen-Boas’ inequality, then - applying that inequality on the function G which is continuous and convex in both variables - we see that in these cases for all s1[α,c], s2[c,β] inequalities in (2.2) hold, and so from our results we directly get the results from the paper [10].

Remark 8.5

If in the definition of the functional ΓJ (resp. ΓELR) we set f(x)=x and g(x)=x, then we get a functional that represents the difference between the right and the left side of the left-hand part (resp. right-hand part) of the generalized Hermite-Hadamard inequality. In the same manner, adequate results of Lagrange and Cauchy type for those functionals can be derived directly from Theorem 8.1 and Theorem 8.2.

Discrete case

Let [α,β]R and cα,β. Let xi[a1,b1][α,c], piR (i=1,,n) be such that Pn0, and let yj[a2,b2][c,β], qjR (j=1,,m) be such that Qm0. Let φK1c([α,β]) be a continuous function.

As before, motivated by the discrete results obtained in previous sections, we define the following linear functionals which, respectively, represent the difference between the right and the left side of inequalities (3.3), (5.4), and (7.10):

ΓJD(φ)=1Qmj=1mqjφ(yj)1Pni=1npiφ(xi)+φ(x¯)φ(y¯), 8.7

where x¯[α,c], y¯[c,β];

ΓELRD(φ)=b2y¯b2a2φ(a2)+y¯a2b2a2φ(b2)1Qmj=1mqjφ(yj)b1x¯b1a1φ(a1)x¯a1b1a1φ(b1)+1Pni=1npiφ(xi), 8.8

where a1b1 and a2b2;

ΓG(φ)=A2φ(j=1mqjyj)+B2(j=1mqj1)φ(y0)j=1mqjφ(yj)A1φ(i=1npixi)B1(i=1npi1)φ(x0)+i=1npiφ(xi), 8.9

where the conditions (7.5) hold and A1,B1,A2,B2 are defined in (7.7).

We have:

  • (i)

    ΓJD(φ)0, when (3.1) holds and for all s1[α,c], s2[c,β] (3.2) holds;

  • (ii)

    ΓELRD(φ)0, when (5.1) holds, and for all s[α,c] (5.2) holds and for all s[c,β] (5.3) holds;

  • (iii)

    ΓG(φ)0, when PnQm>0 and (7.6) holds, and for all s[α,β] (7.8) and (7.9) hold.

The following two results are mean-value theorems of the Lagrange and Cauchy type, respectively, and they are obtained in an analogous way to the theorems of the same type in the previous sections, so we omit the proof.

Theorem 8.6

Let [α,β]R be an interval and cα,β. Let xi[a1,b1][α,c], piR (i=1,,n) be such that Pn0 and let yj[a2,b2][c,β], qjR (j=1,,m) be such that Qm0. Let ΓJD, ΓELRD, and ΓG be the linear functionals defined above, and let φC3([α,β]).

  • (i)
    If (3.1) holds and for all s1[α,c], s2[c,β] (3.2) holds, then there exists ξ1[α,β] such that
    ΓD(φ)=φ(ξ1)6[1Qmj=1mqjyj31Pni=1npixi3+x¯3y¯3]. 8.10
  • (ii)
    If (5.1) holds, and for all s[α,c] (5.2) holds and for all s[c,β] (5.3) holds, then there exists ξ2[α,β] such that
    ΓELRD(φ)=φ(ξ2)6[b2y¯b2a2a23+y¯a2b2a2b231Qmj=1mqjyj3b1f¯b1a1a13f¯a1b1a1b13+1Pni=1npixi3]. 8.11
  • (iii)
    If PnQm>0 and (7.6) holds, and for all s[α,β] (7.8) and (7.9) hold, then there exists ξ3[α,β] such that
    ΓG(φ)=φ(ξ3)6[A2(j=1mqjyj)3+B2(j=1mqj1)y03j=1mqjyj3A1(i=1npixi)3B1(i=1npi1)x03+i=1npixi3]. 8.12

Theorem 8.7

Let the conditions of Theorem  8.6 hold and let φ,ψC3([α,β]). If ΓJD(ψ)0, ΓELRD(ψ)0, and ΓG(ψ)0, then there exist ξ1,ξ2,ξ3[α,β] such that all of the following statements hold:

ΓJD(φ)ΓJD(ψ)=φ(ξ1)ψ(ξ1)orφ(ξ1)=ψ(ξ1)=0, 8.13
ΓELRD(φ)ΓELRD(ψ)=φ(ξ2)ψ(ξ2)orφ(ξ2)=ψ(ξ2)=0, 8.14
ΓG(φ)ΓG(ψ)=φ(ξ3)ψ(ξ3)orφ(ξ3)=ψ(ξ3)=0. 8.15

Remark 8.8

Note that if in Theorem 8.7 we set the function ψ to be ψ(x)=x3, we get exactly Theorem 8.6.

As a consequence of the previous two theorems, we now give some further results in which we give explicit conditions on pi,xi (i=1,,n) and qj,yj (j=1,,m) for (8.10) and (8.13) to hold, where using the properties of the function G we can skip the supplementary conditions on that function.

Corollary 8.9

Let xi[α,c], piR+ (i=1,,n) and yj[c,β], qjR+ (j=1,,m), and let φ,ψ:[α,β]R.

  • (i)

    If (3.1) holds and φC3([α,β]), then there exists ξ[α,β] such that (8.10) holds.

  • (ii)

    If (3.1) holds and φ,ψC3([α,β]), then there exists ξ[α,β] such that (8.13) holds.

Proof

Note that pi,qj>0 implies that x¯[α,c] and y¯[c,β], so we can set the interval [a1,b1] to be [α,c] and [a2,b2] to be [c,β]. The function G is convex, so by Jensen’s inequality we see that the inequalities in (3.2) hold for all s1[α,c], s2[c,β]. Now we can apply Theorem 8.6 and Theorem 8.7 to get the statements of this corollary. □

Corollary 8.10

Let (x1,,xn) be monotonic n-tuple, xi[α,c] (i=1,,n) and (y1,,ym) be monotonic m-tuple, yj[c,β] (j=1,,m). Let (p1,,pn) be a real n-tuple such that

0PkPn(k=1,,n),Pn>0,

and (q1,,qm) be a real m-tuple such that

0QkQm(k=1,,m),Qm>0.

Let φ,ψ:[α,β]R.

  • (i)

    If (3.1) holds and φC3([α,β]), then there exists ξ[α,β] such that (8.10) holds.

  • (ii)

    If (3.1) holds and φ,ψC3([α,β]), then there exists ξ[α,β] such that (8.13) holds.

Proof

Suppose that x1x2xn. We have

Pn(x1x¯)=i=2npi(x1xi)=j=2n(xj1xj)(PnPj1)0

so it follows that x1x¯. Furthermore,

Pn(x¯xn)=i=1n1pi(xixn)=j=1n1(xjxj+1)Pj0,

so x¯xn. We see that we have obtained xnx¯x1, that is, x¯[α,c]. In an analogous way we can get y¯[c,β]. Therefore, as well as in the proof of the previous corollary, we can set the interval [a1,b1] to be [α,c] and [a2,b2] to be [c,β]. By the Jensen-Steffensen inequality we see that for the convex function G the inequalities in (3.2) hold for all s1[α,c], s2[c,β]. Now the statements of this corollary follow directly from Theorem 8.6 and Theorem 8.7. □

Acknowledgements

This research is supported by Croatian Science Foundation under the project 5435.

Footnotes

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.

Contributor Information

Rozarija Mikić, Email: rjaksic@ttf.hr.

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

Mirna Rodić, Email: mrodic@ttf.hr.

References

  • 1.Steffensen JF. On certain inequalities and methods of approximation. J. Inst. Actuar. 1919;51:274–297. [Google Scholar]
  • 2.Boas RP. The Jensen-Steffensen inequality. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1970;302-319:1–8. [Google Scholar]
  • 3.Pečarić JE, Proschan F, Tong YL. Convex Functions, Partial Orderings, and Statistical Applications. San Diego: Academic Press; 1992. [Google Scholar]
  • 4.Levinson N. Generalisation of an inequality of Ky Fan. J. Math. Anal. Appl. 1964;8:133–134. doi: 10.1016/0022-247X(64)90089-7. [DOI] [Google Scholar]
  • 5.Baloch IA, Pečarić J, Praljak M. Generalization of Levinson’s inequality. J. Math. Inequal. 2015;9(2):571–586. doi: 10.7153/jmi-09-49. [DOI] [Google Scholar]
  • 6.Bullen PS. An inequality of N. Levinson. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1985;421-460:109–112. [Google Scholar]
  • 7.Mercer AMcD. Short proof of Jensen’s and Levinson’s inequality. Math. Gaz. 2010;94:492–495. doi: 10.1017/S0025557200001820. [DOI] [Google Scholar]
  • 8.Pečarić J. On an inequality of N. Levinson. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1980;678-715:71–74. [Google Scholar]
  • 9. Witkowski, A: On Levinson’s inequality. RGMIA Research Report Collection 15, Art. 68 (2012)
  • 10.Jakšetić J, Pečarić J, Praljak M. Generalized Jensen-Steffensen inequality and exponential convexity. J. Math. Inequal. 2015;9(4):1287–1302. [Google Scholar]
  • 11.Pečarić J, Perić I, Rodić Lipanović M. Uniform treatment of Jensen type inequalities. Math. Rep. 2014;16(66)(2):183–205. [Google Scholar]
  • 12.Lah P, Ribarič M. Converse of Jensen’s inequality for convex functions. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1973;412-460:201–205. [Google Scholar]
  • 13. Edmundson, HP: Bounds on the expectation of a convex function of a random variable. The Rand Corporation, Paper No. 982 (1956)
  • 14.Jakšić R, Pečarić J. Levinson’s type generalization of the Edmundson-Lah-Ribarič inequality. Mediterr. J. Math. 2016;13(1):483–496. doi: 10.1007/s00009-014-0478-y. [DOI] [Google Scholar]
  • 15.Fejér L. Über die Fourierreihen, II. Math. Naturwiss. Anz. Ungar. Akad. Wiss. 1906;24:369–390. [Google Scholar]
  • 16.Fink AM. A best possible Hadamard inequality. Math. Inequal. Appl. 1998;1:223–230. [Google Scholar]
  • 17.Florea A, Niculescu CP. A Hermite-Hadamard inequality for convex-concave symmetric functions. Bull. Math. Soc. Sci. Math. Roum. 2007;50(98)(2):149–156. [Google Scholar]
  • 18.Petrović M. Sur une fonctionnelle. Publ. Math. Univ. Belgrade. 1932;1:149–156. [Google Scholar]
  • 19.Vasić PM, Pečarić JE. On the Jensen inequality for monotone functions I. An. Univ. Vest. Timiş., Ser. Mat.-Inform. 1979;1:95–104. [Google Scholar]

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

RESOURCES