1 Introduction

In view of applications in different parts of mathematics, the classical Jensen’s inequality is especially noteworthy, as well as useful.

Theorem A (see [2])

Let fbe an integrable function on a probability space (X,A,P) taking values in an interval IR. Then X fdP lies in I. If q is a convex function on I such that qf is P-integrable, then

q ( X f d P ) X qfdP.
(1)

The discrete version of the Jensen’s inequality is also particularly important.

Theorem B (see [8])

Let C be a convex subset of a real vector space V, and let q:CR be a convex function. If p 1 ,, p n are nonnegative numbers with p 1 ++ p n =1, and v 1 ,, v n C, then

q ( i = 1 n p i v i ) i = 1 n p i q( v i ).
(2)

Various attempts have been made by many authors to refine the discrete Jensen’s inequality (2). Basic papers in this direction were [10] and [9]. [6] and [4] contain essential generalizations of some earlier results. Some other types of refinements have been studied in the recent papers [12] and [5]. The treatment of the problem is similar in all the mentioned and other papers: Create an expression A=A(q, v i , p i ) satisfying the inequality

q ( i = 1 n p i v i ) A i = 1 n p i q( v i ),
(3)

where A is a sum whose index set is a subset (mainly a proper subset) of either { 1 , , n } k or { 1 , , k } n for some k{1,2,}. For further details, see [5].

It is also a natural problem to give analogous results for the classical Jensen’s inequality (1). In spite of this, few papers have been published dealing with this problem (see [3] and [11]). One important reason is indicated: It is not possible to use the same machinery that is used in the discrete case. To the author’s best knowledge, it does not exist any refinements of (1) in the form

q ( X f d P ) B X qfdP,

where B=B(q,f,P) is an integral over a proper subset of X k for some k{1,2,}.

In this paper, such a refinement of (1) is obtained. The results not only extend and generalize earlier results, but give a new method to refine inequality (1). Moreover, the integral versions of classical discrete inequalities can be obtained. The inspiration for our result comes from the approach applied in [6]. We give such a version which shows the new feature clearly, but the method can be extended.

2 Main results

For the results from integration theory, see [2].

We consider the following conditions:

( C 1 ) Let (X,A,μ) be a σ-finite measure space such that μ(X)>0.

The integrable functions are considered to be measurable.

( C 2 ) Let φ be a positive function on X such that X φdμ=1.

In this case, the measure P defined on A by

P(A):= A φdμ

is a probability measure having density φ with respect to μ. An A-measurable function g:XR is P-integrable if and only if is μ-integrable, and the relationship between the P- and μ-integrals is

X gdP= X gφdμ.

( C 3 ) Let k2 be a fixed integer.

The σ-algebra in X k generated by the projection mappings p r m : X k X (m=1,,k)

p r m ( x 1 ,, x k ):= x m

is denoted by A k . μ k means the product measure on A k : This measure is uniquely (μ is σ-finite) specified by

μ k ( A 1 ×× A k ):=μ( A 1 )μ( A k ), A m A,m=1,,k.

We shall also use the following projection mappings: For m=1,,k define p r m : X k X k 1 by

p r m ( x 1 ,, x k ):=( x 1 ,, x m 1 , x m + 1 ,, x k ).

For every Q A k and for all m=1,,k, the sets

Q m , x : = { ( x 1 , , x m 1 , x m + 1 , , x k ) X k 1 ( x 1 , , x m 1 , x , x m + 1 , , x k ) Q }

and

Q x 1 , , x m 1 , x m + 1 , , x k := { x X ( x 1 , , x m 1 , x , x m + 1 , , x k ) Q }

are called x-sections of Q (xX) and ( x 1 ,, x m 1 , x m + 1 ,, x k )-sections of Q (( x 1 ,, x m 1 , x m + 1 ,, x k ) X k 1 ), respectively. We note that the sets Q m , x lie in A k 1 , while Q x 1 , , x m 1 , x m + 1 , , x k A.

( C 4 ) Let S A k such that

p r m (S)A,m=1,,kand m = 1 k p r m (S)=X,
(4)

and

l(x):= m = 1 k β m μ k 1 ( S m , x )]0,[,xX,

where β 1 ,, β k are fixed positive numbers.

We stress that the first condition in (4) is necessary. For example, there exists a Borel set in R 2 whose image under the first projection map is not a Borel set in R (see [7]). The function l is A-measurable.

Under the conditions ( C 1 )-( C 4 ), we introduce the functions ψ: X k ]0,[

ψ( x 1 ,, x k ):= j = 1 k β j φ ( x j ) l ( x j )

and ψ i : X k 1 ]0,[ (i=1,,k)

ψ i ( x 1 ,, x i 1 , x i + 1 ,, x k ):= j = 1 j i k β j φ ( x j ) l ( x j ) .

Since

ψ= j = 1 k β j ( φ p r j ) l p r j ,

ψ is A k -measurable. Similarly, ψ i (i=1,,k) is A k 1 -measurable.

( C 5 ) Suppose p r m (S) A k 1 (m=1,,k).

Now we formulate the main results.

Theorem 1 Assume ( C 1 )-( C 4 ). Let f:XR be a P-integrable function taking values in an interval IR, and let q be a convex function on I such that qf is P-integrable. Then

(a)

q ( X f d P ) = q ( X f φ d μ ) N k : = S q ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) ψ ( x 1 , , x k ) d μ k ( x 1 , , x k ) X ( q f ) φ d μ = X q f d P .

(b) If ( C 5 ) is also satisfied, then

q ( X f d P ) = q ( X f φ d μ ) N k N k 1 : = 1 k 1 i = 1 k p r i ( S ) μ ( S x 1 , , x i 1 , x i + 1 , , x k ) × q ( 1 ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) j = 1 j i k β j φ ( x j ) l ( x j ) f ( x j ) ) × ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) d μ k 1 ( x 1 , , x i 1 , x i + 1 , , x k ) X ( q f ) φ d μ = X q f d P .

By applying the method used in the proof of the preceding theorem, it is possible to obtain a chain of refinements of the form

q ( X f φ d μ ) N k N k 1 N 2 N 1 = X (qf)φdμ,

but some measurability problems crop up and it is not so easy to construct the expressions N i (i=k2,,2). These difficulties disappear entirely if S:=X. In this case, we have the following theorem.

Theorem 2 Assume ( C 1 )-( C 3 ), and let μ(X)<. If f:XR is a P-integrable function taking values in an interval IR, and q is a convex function on I such that qf is P-integrable, then

q ( X f d P ) = q ( X f φ d μ ) N k N 2 N 1 = X ( q f ) φ d μ = X q f d P , k 1 ,

where

N k := 1 k μ ( X ) k 1 X k q ( j = 1 k φ ( x j ) f ( x j ) j = 1 k φ ( x j ) ) j = 1 k φ( x j )d μ k ( x 1 ,, x k ),k1.

3 Discussion and applications

The following special situations show the force of our results: They extend and generalize some earlier results; new refinements of the discrete Jensen’s inequality can be constructed; the integral version of known discrete inequalities can be derived.

  1. 1.

    Suppose (X,A,μ) is a probability space, φ(x):=1 (xX), S:= X k , and m = 1 k β m =1. Then ( C 1 )-( C 5 ) are satisfied. Suppose also that f:XR is a μ-integrable function taking values in an interval IR, and q is a convex function on I such that qf is μ-integrable. In this case, Theorem 1(a) gives Theorem 1.3(a) in [3]:

    q ( X f d μ ) X k q ( j = 1 k β j f ( x j ) ) d μ k ( x 1 ,, x k ) X (qf)dμ.
    (5)

If β m = 1 k (m=1,,k) also holds, then Theorem 1.3(b) in [3] comes from Theorem 1(b):

(6)

We can see that Theorem 1 is much more general than (5) even if μ is a probability measure. Moreover, Theorem 1(b) makes it possible to obtain a chain of refinements in (5):

q ( X f d μ ) X k q ( j = 1 k β j f ( x j ) ) d μ k ( x 1 , , x k ) 1 ( k 1 ) i = 1 k ( 1 β i ) × X k 1 q ( 1 1 β i j = 1 j i k β j f ( x j ) ) d μ k 1 ( x 1 , , x i 1 , x i + 1 , , x k ) X ( q f ) d μ .
  1. 2.

    Let X:=[a,b]R (a<b). The set of the Borel subsets of R ( R k ) is denoted by B ( B k ). λ means the Lebesgue measure on B. Let q:[a,b]R be a convex function.

The classical Hermite-Hadamard inequality (see [1]) says

q ( a + b 2 ) 1 b a a b q(x)dx q ( a ) + q ( b ) 2 .

We can obtain the following refinement of the left-hand side of the Hermite-Hadamard inequality.

Corollary 3 Let S [ a , b ] k be a Borel set such that

p r m (S)B,m=1,,kand m = 1 k p r m (S)=[a,b],

and

l(x)= m = 1 k β m λ k 1 ( S m , x )>0,x[a,b],

where β m >0 (m=1,,k).

Then

q ( a + b 2 ) S q ( 1 ( b a ) ψ ( x 1 , , x k ) j = 1 k β j x j l ( x j ) ) ψ ( x 1 , , x k ) d μ k ( x 1 , , x k ) 1 b a a b q ( x ) d x .
(7)

Proof We can apply Theorem 1(a) to the pair of functions φ,f:[a,b]R, φ(x)= 1 b a , and f(x)=x. □

If S= [ a , b ] k and m = 1 k β m =1, then we have from (7) and Theorem 1(b) one of the main results in [13] as a special case:

q ( a + b 2 ) 1 ( b a ) k [ a , b ] k q ( j = 1 k β j x j ) d λ k ( x 1 , , x k ) i = 1 k 1 β i ( k 1 ) ( b a ) k 1 × [ a , b ] k 1 q ( 1 1 β i j = 1 j i k β j x j ) d λ k 1 ( x 1 , , x i 1 , x i + 1 , , x k ) 1 b a a b q ( x ) d x .

Another concrete example can be constructed for (7) by using Corollary 5.

  1. 3.

    In the following results, we consider noteworthy proper subsets of R k .

  2. (a)

    Let z,wR, z<w, and m1 be an integer. The simplex S z , w m is defined by

    S z , w m := { ( x 1 , , x m ) R m z x 1 x m w } .

Let X:=[a,b]R (a<b), and μ be a finite measure on the trace σ-algebra [a,b]B such that μ([a,b])>0. Suppose φ:[a,b]R is a positive function such that [ a , b ] φdμ=1. Fix an integer k2, and let β m >0 (m=1,,k).

Choose S:= S a , b k . Then

S 1 , x = S x , b k 1 , S k , x = S a , x k 1 , S m , x = S a , x m 1 × S x , b k m ,2mk1,

once the appropriate identification of R k 1 with R j 1 × R k j (2jk1) has been made. Therefore,

l(x)= m = 1 k β m μ m 1 ( S a , x m 1 ) μ k m ( S x , b k m ) >0,x[a,b],

where μ 0 ( S a , x 0 )= μ 0 ( S x , b 0 ):=1. Thus,

ψ( x 1 ,, x k )= j = 1 k β j φ ( x j ) m = 1 k β m μ m 1 ( S a , x j m 1 ) μ k m ( S x j , b k m ) ,( x 1 ,, x k ) [ a , b ] k .

We can see that under the above assumptions ( C 1 )-( C 4 ) are satisfied, so Theorem 1 can be applied.

Corollary 4 If f:[a,b]R is a P-integrable function taking values in an interval IR, and q is a convex function on I such that qf is P-integrable, then

(8)

Specifically, if μ=λ, we have

l(x)= 1 ( k 1 ) ! m = 1 k β m ( k 1 m 1 ) ( x j a ) m 1 ( b x j ) k m ,x[a,b].

When β 1 == β k =β, this says

l(x)= β ( k 1 ) ! ( b a ) k 1 ,x[a,b],

and in this case we have the inequality for the cube [ a , b ] k

q ( a b f φ d λ ) ( k 1 ) ! ( b a ) k 1 S q ( 1 j = 1 k φ ( x j ) j = 1 k φ ( x j ) f ( x j ) ) j = 1 k φ ( x j ) d λ k ( x 1 , , x k ) = 1 k ( b a ) k 1 [ a , b ] k q ( 1 j = 1 k φ ( x j ) j = 1 k φ ( x j ) f ( x j ) ) j = 1 k φ ( x j ) d λ k ( x 1 , , x k ) a b ( q f ) φ d λ .

Next, we show that inequality (8) extends the following well-known discrete inequality to an integral form. Similar results are quite rare in the literature (see [3]).

Theorem C (see [9])

Let I be an interval in R, and let q:IR be a convex function. If v 1 ,, v n I, then for each k1

q ( 1 n i = 1 n v i ) 1 ( n + k 1 k ) 1 i 1 i k n q ( v i 1 + + v i k k ) 1 n i = 1 n q( v i ).
(9)

Let X:=[1,n]R (n1 is an integer), and let μ be the measure on the trace σ-algebra [1,n]B defined by μ:= m = 1 n 1 n ε m , where ε m is the unit mass at m (m=1,,n). Suppose φ(x):=1 (x[1,n]), k2 is a fixed integer, and β m =1 (m=1,,k).

Some easy combinatorial considerations yield that for every x[1,n] and m=1,,k

μ k 1 ( S m , x )= 1 n k 1 ( [ x ] + m 2 m 1 ) ( n [ x ] + k m k m ) ,

where [x] is the largest natural number that does not exceed x. Therefore,

l(x)= 1 n k 1 ( n + k 1 k 1 ) ,x[1,n].

Now, if I is an interval in R, q:IR is a convex function, and f:[1,n]R defined by

f(i):={ v i , i = 1 , , n , 0 , elsewhere ,

then (9) follows immediately from (8).

  1. (b)

    Let m1 be an integer, z R m , and r>0. The open ball of radius r centered at the point z is denoted by B m (z,r).

Consider the measure space (]a,b[,B,λ) (a<b). Suppose φ:]a,b[R is a positive function such that a b φdλ=1. Fix an integer k2, and let β m >0 (m=1,,k). Choose

S:= B k ( ( a + b 2 , , a + b 2 ) , b a 2 ) .

Then for all x]a,b[ and m=1,,k

S m , x = B k 1 ( ( a + b 2 , , a + b 2 ) , ( b x ) ( x a ) ) .

Consequently,

l(x)=k 2 k 1 ( k 1 ) ! ! ( π 2 ) [ k 1 2 ] ( ( b x ) ( x a ) ) k 1 2 ,x]a,b[.

According to this, for all ( x 1 ,, x k )]a,b [ k ,

ψ( x 1 ,, x k )= 1 k 2 k 1 ( k 1 ) ! ! ( π 2 ) [ k 1 2 ] j = 1 k β j φ ( x j ) m = 1 k β m ( ( b x j ) ( x j a ) ) k 1 2 .

It is not hard to check that ( C 1 )-( C 4 ) are satisfied in this situation, and thus Theorem 1 says:

Corollary 5 If f:]a,b[R is a P-integrable function taking values in an interval IR, and q is a convex function on I such that qf is P-integrable, then

q ( ] a , b [ f d P ) = q ( a b f φ d λ ) 1 k 2 k 1 ( k 1 ) ! ! ( π 2 ) [ k 1 2 ] × S q ( 1 j = 1 k β j φ ( x j ) m = 1 k β m ( ( b x j ) ( x j a ) ) k 1 2 j = 1 k β j φ ( x j ) f ( x j ) m = 1 k β m ( ( b x j ) ( x j a ) ) k 1 2 ) × j = 1 k β j φ ( x j ) m = 1 k β m ( ( b x j ) ( x j a ) ) k 1 2 d λ k ( x 1 , , x k ) a b ( q f ) φ d λ = ] a , b [ q f d P .

By applying this result (φ,f:[a,b]R, φ(x)= 1 b a and f(x)=x), we can have a special case of the refinement of the left-hand side of the Hermite-Hadamard inequality in (7).

  1. 4.

    We turn now to the case where X is a countable set.

( C 1 1 ) Consider the measure space (X, 2 X ,μ), where either X:={1,,n} for some positive integer n or X:={0,1,}, 2 X denotes the power set of X, and μ({u}):= μ u is a positive number for all uX.

( C 2 1 ) Let ( p u ) u X be a sequence of positive numbers for which u X p u μ u =1.

( C 3 1 ) Let k2 be a fixed integer.

We define the functions α v j (vX, j=1,,k) on X k by

α v j ( u 1 ,, u k ):={ 1 , if  u j = v , 0 , if  u j v .

Then j = 1 k α v j ( u 1 ,, u k ) means the number of occurrences of v in ( u 1 ,, u k ) X k . If S X k , we introduce the following sums:

α S , v j := ( u 1 , , u k ) S α v j ( u 1 ,, u k ),vX,j=1,,k

and

α S , v := j = 1 k α S , v j ,vX.

Every sum is either a nonnegative integer or ∞.

( C 4 1 ) Let S X k such that α S , v 1 for all vX, and

l(u):= m = 1 k β m μ k 1 ( S m , u )<,uX,

where β m >0 (m=1,,k).

Since μ u >0 for all uX, l(u)>0 for all uX. By the definition of the measure μ,

l(u)= m = 1 k β m ( u 1 , , u j 1 , u , u j + 1 , , u k ) S μ u 1 μ u j 1 μ u j + 1 μ u k ,uX.

In this case, the function ψ has the form

ψ: X k ]0,[,ψ( u 1 ,, u k ):= j = 1 k β j p u j l ( u j ) .

Now Theorem 1(a) can be formulated in the following way.

Corollary 6 Assume ( C 1 1 )-( C 4 1 ), and let ( f u ) u X be a sequence taking values in an interval IR such that u X | f u | p u μ u <. If q is a convex function on I such that u X |q( f u )| p u μ u <, then

q ( u X f u p u μ u ) ( u 1 , , u k ) S q ( 1 ψ ( u 1 , , u k ) j = 1 k β j p u j l ( u j ) f u j ) ψ ( u 1 , , u k ) μ u 1 μ u k u X q ( f u ) p u μ u .

Assume ( C 1 1 )-( C 4 1 ), and suppose μ is the counting measure on P(X), that is, μ u :=1 for all uX. For a set A 2 X , let |A| denote the number of elements of A. Then u X p u =1,

l(u)= m = 1 k β m α S , u m ,uX,

and

ψ: X k ]0,[,ψ( u 1 ,, u k ):= j = 1 k β j p u j m = 1 k β m α S , u j m .

We note explicitly this particular case of Corollary 6.

Corollary 7 Assume ( C 1 1 )-( C 4 1 ), where μ is the counting measure on 2 X , and let ( f u ) u X be a sequence taking values in an interval IR such that u X | f u | p u <. If q is a convex function on I such that u X |q( f u )| p u <, then

q ( u X f u p u ) ( u 1 , , u k ) S ( j = 1 k β j p u j m = 1 k β m α S , u j m ) q ( 1 j = 1 k β j p u j m = 1 k β m α S , u j m j = 1 k β j p u j m = 1 k β m α S , u j m f u j ) u X q ( f u ) p u .

Corollary 6 corresponds to Theorem 2 in [4], but in [4] only finite sets are considered. If X={1,,n} and β m =1 (m=1,,k), then Theorem 1(a) in [6] contains Corollary 7, but Corollary 6 makes sense in a lot of other cases (for example, for countably infinite sets).

Next, some examples are given.

The first example deals with a relatively flexile case.

Example 8 (a) Assume ( C 1 )-( C 3 ), and let A m A (m=1,,k) such that 0<μ( A m )< (m=1,,k) and m = 1 k A m =X. Define S:= A 1 ×× A k . Then (4) holds and

l(x)= ( m = 1 k μ ( A m ) ) m = 1 k ( β m χ m ( x ) μ ( A m ) ) ,xX,

where β m >0 (m=1,,k), and χ m :XR means the characteristic function of A m (m=1,,k). We can see that ( C 4 ) is satisfied and

ψ( x 1 ,, x k )= 1 ( m = 1 k μ ( A m ) ) j = 1 k β j φ ( x j ) m = 1 k ( β m χ m ( x j ) μ ( A m ) ) ,( x 1 ,, x k ) X k .

The condition ( C 5 ) is also true, since

p r m (S)= A 1 ×× A m 1 × A m + 1 ×× A k ,m=1,,k.

Moreover, for m=1,,k,

S x 1 , , x m 1 , x m + 1 , , x k = { A m , if  ( x 1 , , x m 1 , x m + 1 , , x k ) A 1 × × A m 1 × A m + 1 × × A k , , otherwise .

It follows that Theorem 1 can be applied.

  1. (b)

    We consider the special case of (a), when the sets A m (m=1,,k) are pairwise disjoint (a special partition of X). Let the function τ be defined on X by

    τ(x):=m,if x A m .

Then

l(x)= ( m = 1 k μ ( A m ) ) β τ ( x ) μ ( A τ ( x ) ) ,xX,

and

ψ( x 1 ,, x k )= 1 ( m = 1 k μ ( A m ) ) j = 1 k β j φ ( x j ) μ ( A τ ( x j ) ) β τ ( x j ) ,( x 1 ,, x k ) X k .

The second example corresponds to Corollary 6.

Example 9 Let X:={0,1,}, let ( p u ) u = 0 be a sequence of positive numbers for which u = 0 p u =1, and let ( f u ) u = 0 be a sequence taking values in an interval IR such that u = 0 | f u | p u <. Define

S:= { ( u 1 , u 2 ) X 2 u 1 u 2 2 u 1 } .

An easy calculation shows that l(u)= α S , u =u+[ u 2 ]+2 (≥2) for all uX, where [ u 2 ] denotes the greatest integer that does not exceed u 2 . If q is a convex function on I such that u = 0 |q( f u )| p u <, then by Corollary 7

q ( u = 0 f u p u ) u = 0 ( v = u 2 u ( p u u + [ u 2 ] + 2 + p v v + [ v 2 ] + 2 ) × q ( p u u + [ u 2 ] + 2 f u + p v v + [ v 2 ] + 2 f v p u u + [ u 2 ] + 2 + p v v + [ v 2 ] + 2 ) ) u = 0 q ( f u ) p u .

The final example illustrates the case X:=R.

Example 10 Consider the measure space (R,B,λ). The function φ:RR, φ(x)= 1 2 π e x 2 / 2 is the density of the standard normal distribution on R, and thus φ=1. Let

S:= { ( x , y ) R 2 x 1 y x + 1 } .

Then ( C 1 )-( C 3 ) are satisfied. Let f:RR be a Borel measurable function taking values in an interval IR such that is integrable, and let q be a convex function on I such that (qf)φ is integrable. By Theorem 1(a),

q ( f φ ) 1 4 2 π ( x 1 x + 1 q ( e x 2 / 2 f ( x ) + e y 2 / 2 f ( y ) e x 2 / 2 + e y 2 / 2 ) ( e x 2 / 2 + e y 2 / 2 ) d y ) d x ( q f ) φ .

4 Preliminary results and the proof of the main result

We first establish a result which will be fundamental to our treatment.

Lemma 11 Assume ( C 1 )-( C 4 ), and let f:XR be a P-integrable function. Then

X fdP= X fφdμ= S ( j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) d μ k ( x 1 ,, x k ).

Proof The functions

β j ( φ p r j ) l p r j fp r j ,j=1,,k

are obviously A k -measurable on S.

Suppose first that the function f is nonnegative. By ( C 3 ), p r j (S)A, and hence the theorem of Fubini implies that

(10)

It follows from (10) that

(11)

If ( i 1 ,, i k ) { 0 , 1 } k , then let

A i 1 , , i k := m = 1 k p r m ( S ) ( i m ) ,

where

p r m ( S ) ( i m ) :={ p r m ( S ) , if  i m = 1 , X p r m ( S ) , if  i m = 0 , m=1,,k.

The sets A i 1 , , i k (( i 1 ,, i k ) { 0 , 1 } k ) are pairwise disjoint and measurable. Moreover, by (4),

( i 1 , , i k ) { 0 , 1 } k A i 1 , , i k = m = 1 k p r m (S)=X.

These establishments with (11) imply that

(12)

Choose ( i 1 ,, i k ) { 0 , 1 } k . It is clear that S m , x = if x A i 1 , , i k and i m =0, and hence

m { 1 , , k } i m = 1 β m μ k 1 ( S m , x )=l(x),x A i 1 , , i k .

Therefore, (12) gives

S ( j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) d μ k ( x 1 , , x k ) = ( i 1 , , i k ) { 0 , 1 } k A i 1 , , i k φ f d μ = X f φ d μ .

Having disposed of the nonnegativity of the function f, we have from the first part of the proof that

X |f|dP= X |f|φdμ= S ( j = 1 k β j φ ( x j ) l ( x j ) | f ( x j ) | ) d μ k ( x 1 ,, x k ),

and, therefore, the functions

β j ( φ p r j ) l p r j fp r j ,j=1,,k

are μ k -integrable over S. By using this, the result follows by an argument entirely similar to that for the nonnegative case.

The proof is complete. □

Remark 12 Under the conditions of Lemma 11, we have

  1. (a)

    The functions

    β j ( φ p r j ) l p r j fp r j ,j=1,,k

are μ k -integrable over S.

  1. (b)

    The measure P k defined on S A k by

    P k (A):= A ψd μ k = A ( j = 1 k β j φ ( x j ) l ( x j ) ) d μ k ( x 1 ,, x k )

is a probability measure.

Lemma 13 Assume ( C 1 )-( C 4 ). Let f:XR be a P-integrable function taking values in an interval IR, and let q be a convex function on I such that qf is P-integrable.

(a) The function

g:= ( q ( 1 ψ j = 1 k β j ( φ p r j ) l p r j ( f p r j ) ) ) ψ

is μ k -integrable over S.

(b) The functions

h i := ( q ( 1 ψ i p r i j = 1 j i k β j ( φ p r j ) l p r j ( f p r j ) ) ) ( ψ i p r i ) ,i=1,,k

are μ k -integrable over S.

Proof (a) It is easy to check that for fixed ( x 1 ,, x k )S

1 ψ ( x 1 , , x k ) β j φ ( x j ) l ( x j ) ,j=1,,k

are positive numbers with

1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) =1.

This gives immediately that for every ( x 1 ,, x k )S

1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f( x j )I,

and, therefore, by Theorem B,

g( x 1 ,, x k ) j = 1 k β j φ ( x j ) l ( x j ) q ( f ( x j ) ) ,( x 1 ,, x k )S.
(13)

Since the function q is convex on I, it is lower semicontinuous on I and, therefore, the function g is A k -measurable.

Choose an interior point a of I. The convexity of q on I implies that

q(t)q(a)+ q + (a)(ta),tI,

where q + (a) means the right-hand derivative of q at a. It follows from this and from (13) that

q ( a ) ψ ( x 1 , , x k ) + q + ( a ) ( j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) a ψ ( x 1 , , x k ) ) g ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) q ( f ( x j ) ) , ( x 1 , , x k ) S .

Now we can apply Remark 12(a), by the P-integrability of the functions 1 X , f and qf.

  1. (b)

    Fix i from the set {1,,k}. We can prove as in (a) by using the A k -measurability of h i and the estimates

    q ( a ) ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) + q + ( a ) ( j = 1 j i k β j φ ( x j ) l ( x j ) f ( x j ) a ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) ) h i ( x 1 , , x k ) j = 1 j i k β j φ ( x j ) l ( x j ) q ( f ( x j ) ) , ( x 1 , , x k ) S .

The proof is complete. □

Now we are able to prove the main results.

Proof of Theorem 1 (a) By Lemma 11,

q ( X f d P ) = q ( X f φ d μ ) = q ( S ( j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) d μ k ( x 1 , , x k ) ) = q ( S ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ψ ( x 1 , , x k ) ) d μ k ( x 1 , , x k ) ) = q ( S ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) d P k ( x 1 , , x k ) ) .

Since P k is a probability measure on S A k , it follows from the previous part, Theorem A, Lemma 11, and Lemma 13(a) that

q ( X f d P ) = q ( X f φ d μ ) S q ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) d P k ( x 1 , , x k ) = S q ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) ψ ( x 1 , , x k ) d μ k ( x 1 , , x k ) S ( j = 1 k β j φ ( x j ) l ( x j ) q ( f ( x j ) ) ) d μ k = X ( q f ) φ d μ = X q f d P .

Now (a) has been proven.

  1. (b)

    By using the convexity of q, an easy manipulation leads to

    q ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) = q ( i = 1 k j = 1 j i k β j φ ( x j ) l ( x j ) f ( x j ) ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) ( k 1 ) ψ ( x 1 , , x k ) ) 1 ( k 1 ) ψ ( x 1 , , x k ) i = 1 k ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) × q ( 1 ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) j = 1 j i k β j φ ( x j ) l ( x j ) f ( x j ) ) 1 ( k 1 ) ψ ( x 1 , , x k ) i = 1 k ( j = 1 j i k β j φ ( x j ) l ( x j ) q ( f ( x j ) ) ) = 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) q ( f ( x j ) ) , ( x 1 , , x k ) S .

Consequently, by applying ( C 5 ), Lemma 13(b), and the theorem of Fubini, we have

N k = S q ( 1 ψ ( x 1 , , x k ) j = 1 k β j φ ( x j ) l ( x j ) f ( x j ) ) ψ ( x 1 , , x k ) d μ k ( x 1 , , x k ) 1 k 1 i = 1 k S q ( 1 ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) j = 1 j i k β j φ ( x j ) l ( x j ) f ( x j ) ) × ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) d μ k ( x 1 , , x k ) = 1 k 1 i = 1 k p r i ( S ) ( S x 1 , , x i 1 , x i + 1 , , x k q ( 1 ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) × j = 1 j i k β j φ ( x j ) l ( x j ) f ( x j ) ) d μ ( x i ) ) × ψ i ( x 1 , , x i 1 , x i + 1 , , x k ) d μ k 1 ( x 1 , , x i 1 , x i + 1 , , x k ) = N k 1 X ( q f ) φ d μ .

The proof is complete. □

Proof of Theorem 2 Apply Theorem 1 with S:= X k and β m =1 (m=1,,k). Then the conditions ( C 4 ) (by using μ(X)<) and ( C 5 ) are satisfied,

ψ( x 1 ,, x k ):= 1 k μ ( X ) k 1 j = 1 k φ( x j ),( x 1 ,, x k )S,

and ψ i : X k 1 ]0,[ (i=1,,k) has the form

ψ i ( x 1 ,, x i 1 , x i + 1 ,, x k ):= 1 k μ ( X ) k 1 j = 1 j i k φ( x j ).

Therefore,

N k = 1 k μ ( X ) k 1 X k q ( j = 1 k φ ( x j ) f ( x j ) j = 1 k φ ( x j ) ) j = 1 k φ( x j )d μ k ( x 1 ,, x k )

and

N k 1 = 1 k 1 i = 1 k X k 1 ( μ ( X ) q ( j = 1 j i k φ ( x j ) l ( x j ) f ( x j ) j = 1 j i k φ ( x j ) ) ) × 1 k μ ( X ) k 1 j = 1 j i k φ ( x j ) d μ k 1 ( x 1 , , x i 1 , x i + 1 , , x k ) = 1 ( k 1 ) μ ( X ) k 2 X k 1 q ( j = 1 k 1 φ ( x j ) f ( x j ) j = 1 k 1 φ ( x j ) ) j = 1 k 1 φ ( x j ) d μ k 1 ( x 1 , , x k 1 ) .

The proof is complete. □