This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
A(a). If either A(X):s: A(a) for every x
E
(a, b)
(3.10)
A(X) ~ A(b) for every x
E
(a, b)
(3.11)
or holds, then (3.5) is valid.
A reversal of Theorem 2.30 is given in the same paper by Pecaric (1984g): 3.12. Theorem. Let f: I ~ ~ (I an interval in ~ k ) be a continuous function with increasing increments, and let p be a real n-tuple such that (3.1) is valid. If x;EI (i=I, ... ,n), An(x,p)EI where An(x,p) is defined as in (2.32), and if
Xl :s: Aix, p) :s: ... :s: An(x, p)
(3.12)
holds (or if the reverse inequalities in (3.12) hold), then (3.2) is valid.
3.2. Refinements of Inequalities
87
3.13. Remark. In Theorem 3.12 instead of considering a function with 0 increasing increments we can let f be a P-convex function.
3.2.
Some Refinements of Jensen's and Jensen-Stetfensen's Inequalities
Let f: U ~IR be a real-valued function and U be a convex set in an arbitrary linear real space M. Let I be a finite nonempty set of positive integers. If we define the index set function F by
where 1 A/(x; p) = P ~ P i X i ' liEf
then the following theorem-is valid: 3.14. Theorem. Let f be a convex function on U. Let I and J be finite nonempty sets of positive integers such that In J = 0, P = {pJiElUJ' and x = {Xi}iElU; are real sequences such that Xi E U (i E I U J), PlUJ > 0, and As(x, p) E U (5 = I, J, I UJ). If p/ > 0 and PJ > 0, then F(I U J)
:5
F(I)
+ F(J).
(3.13)
If PIP; < 0, then the inequality in (3.13) is reversed. Iffis strictly convex, then the equality in (3.13) holds iffA/(x, p) = A;(x, p).
Proof. For n = 2, this is a simple consequence of Jensen's inequality and of its reversal. Thus the proof follows by letting Xz= A;(x, p),
3.15. Corollary.
(a) If Pi;::::O (i = 1,
F(In):5 F(In-l) and
:5
and
pz
= P;,
o
, n) and Ik = {1, ... , k}, then :5
F(Iz) :5 0
(3.14)
88
3. Reversals, Refinements, and Converses
(b) If An(x, p)
E
Pl>O,
U and Pi :$ 0 for
i = 2, ... , n,
(3.16)
then the reverse of the inequalities in (3.14) is valid, and
3.16. Remark. Theorem 3.14 and Corollary 3.15 give generalizations of results in Vasic and Mijalkovic (1976), Vasic and Pecaric (1979b), and Pecaric (1986a) (see also Bullen, Mitrinovic, and Vasic (1987, pp. 24-25). D The following result is proved in Pecaric (1984g):
3.17. Theorem. Let I and J be defined as in Theorem 3.14. Let f : U ~IR be a continuous function with increasing increments (U is an interval in IRk), and let p and xbe defined as in Theorem 3.14. (a) Let PI > 0 and PJ > O. If (3.18)
i.e., if (3.19)
then (3.13) is valid, i.e., the function F is subadditive. (b) If PI>O and PJ < 0, and if (3.18) (i.e., (3.19» holds, then the inequality in (3.13) is reversed. 3.18. Corollary. Let the conditions of Theorem 2.30 be satisfied. Then (3.14) is valid. If the conditions of Theorem 3.12 are satisfied, then the reverse of the inequalities in (3.14) holds.
3.19. Remarks. (a) Theorem 3.17 can also be formulated for P-convex functions. (b) For k 2: 2, an interesting function with increasing increments is f(xl' ... ,Xk) = Xl' .. Xk (Xi 2: 0, i = 1, ... ,k). This function is also continuous, thus Theorem 3.17 and Theorems 2.28, 2.30 and 3.11, 3.12 give generalizations of several well-known results concerning Cebysev's inequality for monotonic functions and sequences; see, for example,
89
3.2. Refinements of Inequalities
Popoviciu (1959b), Pecaric (1980b, 1980d), Fink and Jodeit (1984), Vasic and Pecaric (1981b), Biernacki (1950, 1951), and Burkhill and Mirsky (1975). 0 A related refinement of the Jensen-Steffensen Inequality is given in Vasic and Pecaric (1984):
3.20. Theorem. Let x and p be two real n-tuples such that a s: Xl ::s ... ::s X n ::s band O::s Pk ::s P;
for
k
=
1, ... , n - 1,
Then for every convex function f : [a, b] Hn(XI' ..•
,xn )
(3.20)
~ ~
~ Hn-I(XI, •.. ,Xn-I) ~ ..•
~Hz(XI' X2)
~HI(XI) = 0
(3.21)
holds, where Hk(XI, .•• ,
Proof.
xd =
C?k(Xl' •.. , Xk, PI, ..• ,Pk-l,
Pk ) ,
The inequality Hk(XI, . . . , Xk) ~ Hk-I(XI, . . . , Xk-l)
(3.22)
is equivalent to (3.23) where
Note that Xk::S Xk and Xk-I::S Xk-l. Without loss of generality we may assume Xl < ... <x n and 0 < Pk < P; (k = 1, ... , n - 1). By the substitu> e have (3.22) from tions Y I ~ X k - I ' Y 2 ~ X k >X l ~ X k - I ' X 2 ~ X k w (1.7). 0 Another type of refinement of Jensen's inequality is given by Pecaric and Dragomir (1989a):
90
3. Reversals, Refinements, and Converses
3.21. Theorem. in M, and f : U
Let M be a real linear space, U a nonempty convex set a convex function. Then
~ ~
f (P ~ ~~ p xo ) : 5 (P-1 )kII
nl-l
n
0
1)2 :5 (P
0
n
1 :5 P n
'" LJ
'1.··.,'kE1
L
po11 ",pof(!(Xo Ik k II +",+xo)):5'" lk
PiIPiJ(2! (XiI + Xi2))
11,12E1
n
~ 1P;/(Xi)'
(3.24)
where 1= {1, ... , n}, Xi E U (i = 1, ... , n), and Pi> 0 (i = 1, ... , n).
The following theorem (Mitrinovic and Pecaric, 1987a) gives a result on Jensen's inequality via the monotonicity property of certain functions: 3.22. Theorem. Let f be a convex function defined on a convex set U c M (M is an arbitrary linear real space). Let the function g be defined by n 1 ( n ) g(x) = ~ l ~ f qixAi + (r -x) ~ 1A k ,
where qi>O (i=1, x) EZ=lAk E U (i = 1, (xy > 0, Y E I), then
,n) with ~ Z = 1 ( 1 / q k ) = 1 r, E ~ , qixAi+(r, n) for all x in an interval I (I ~ ~ ) . If Ixl :5lyl
(3.25)
g(x) :5 g(y).
Proof. Let s1 E [0, 1] (i, j = 1, ... , n) with E?=l s1 = 1 (j = 1, ... , n). By (3.13) we have (3.26) Using the substitutions n
ai=qiyAi+(r-y)
LA k=l
s{ = -1 ( 1 - X) - (i =1= j), o
b
qi
Y
and we obtain (3.25) from (3.26).
o
s:. = -qi1 ( 1 - Y-X) + Yx- ,
3.2. Refinements of Ineqnalities
91
3.23. Remarks. (a) The function g in Theorem 3.22 is also convex. Indeed, we have Ag(X) + Xg(y)
= ~ ~(Af(qiXAi+ (r-x) kt1 A k) + Xf(q.yA, + (r- y) ~ 1A k)) 2: g(h
+ Xy).
(b) Using the substitutions: lIqi-Wi, q;Ai-Xi, r=l, conclude that (3.25) is also valid if g(x) =
we may
~WJ(XXi + (1- x) ~ 1WkXk),
where Wi >0 (i = 1, ... ,n) are such that I:Z=1 Wk = 1 and XXi + (Ix) I : k ~ W 1 kXkE U (i = 1, ... , n) for all x in an interval I (I ~ ~ ) . D Note that for one-variable convex functions the result in Remark 3.23(b) can be obtained by using Fuchs' generalization of a theorem on majorization. Moreover, in this case we can obtain similar results for Jensen-Steffensen's inequality. The above results give refinements of related discrete inequalities. Next we give some similar results for linear isotonic functionals. Let E be a nonempty set, d be an algebra of subsets of E, and L be a linear class of real-valued functions g : E - ~ having the properties
+ bg) E L for all a, b E ~ ; that is if f(t) = 1 for tEE, then f E L;
L1: f, g E L=;,(af
(3.27)
L2: 1 E L,
(3.28) (3.29)
L3: f E L, E 1 Ed=;' fCEl E L,
where CEI is the indicator function of E 1 (i.e., CEl(t) = 1 for t E E 1 , and 0 for t E E\E 1 ) . It follows from L2, L3 that CEI E L for E 1 E d. We also consider isotonic linear functionals A: L - ~ by assuming:
AI: A(af + bg) A2: f
= aA(f) + bA(g) for f, gEL, a, b E E L, f(t) 2: 0 on E =;, A(f) 2: 0 (A is isotonic).
~ ;
(3.30) (3.31)
Furthermore, we make use of the fact that if L also satisfies L3, then for every £1 E d such that A( C E ) > 0, the functional Al defined for all gEL by A 1(g) = A(gCE)/A(CE) is an isotonic linear functional with A 1 (1) = 1. We observe that A(g) = A(gCEJ + A(gCE\E).
(3.32)
92
3. Reversals, Refinements, and Convenes
3.24. Theorem. Let L satisfy properties L1, L2, and L3 on a nonempty set E, and assume that
0 (or p
Proof. First assume that A(wgq ) > 0, and p> 1. Then (4.22) follows from (4.18) by substitutions k
=
wg q ;
(4.23)
this is so because k E L, kg, = wfg E L, and k
0, we may apply (4.22) with p, q, f, g replaced by q, p, g, f to again obtain (4.22). Finally, suppose that A(wgq ) = 0 and A(wjP) = O. Since 1 1 O:5wfg:5-wjP +-wg q p q
on E,
it follows that A(wfg) = O. This completes the proof for the case p > 1.
114
4. Applications of Jensen's Inequality
°
For the case
1, and may apply (4.22) with p, q, f, g replaced by P, Q=(l-p)-l, fl=(fg'f and gl=g-P; in this q, case wff= wfg, wgf = wg and Wflgl = wJP are all in L. Thus we obtain A(wfP) :5 AP(wfg)A1-P(wgq),
which is (4.22) with the inequality reversed provided A(wg q ) > 0. Finally, if p < 0, then 0< q < 1 and we may apply a similar argument with p, q, f, g replaced by q, p, g, f provided A(wfP) > 0. 0 4.13. Theorem (Minkowski's inequality for isotonic functionals), Let L and A be as in Theorem 4.12. If P > 1 and w, f, g ~ on E with wi", wgP, w(f + g'f
°
E
L, then AlIp(w(f + g'f):5AlIP(wJP)
°
°
+ Al/P(wgP).
(4.24)
If < p < 1 or if p < and A(wfP) > 0, A(wgP) > 0, then the reverse inequality in (4.24) holds.
Proof.
This is an immediate consequence of Theorem 4.12.
4.14. Theorem.
0
Let L and A satisfy conditions Ll, L2 and AI, A2 on a q, base set E. Let p > 1, q = pl(p -1), and w, f, g ~ on E with wf", wg wfg E L. If < m :5 f(x)g-q/P(x) :5 M for x E E, then (M - m)A(wJP) + (mMP - MmP)A(wgq):5 (MP - mP)A(wfg). (4.25)
°
°
q) If P < 0, then (4.25) also holds provided either A (wfP) > Oar A(wg > 0; if o
Oar A(wg > 0.
Proof.
First we note that if p > 0, then we have 0:5 mrwg"
:5
wfP :5 M'wg"
on E,
and the inequalities are reversed if p < 0. In particular, this shows that q) A(wfP), A(wg are either both zero or both positive for all p. If q A( wg ) > 0, then, since (x ) = x'' is convex for either p > 1 or p < 0, (4.25) follows from (4.19) by the substitutions in (4.23). If P > 1 and A(wgq) = 0, then (4.25) also holds because it reduces to the case 0:5 (MP - mP)A(wgf). q) q) If p < and either A(wfP) > or A(wg > 0, then A(wg > 0; thus (4.25) holds. (Note that (4.25) does not hold if A(wJP) = A(wgq) = 0
°
°
4.2. Holder's and Minkowski's Inequalities
115
unless A (wfg) =0, which need not be the case.) If 0
(x ) = x" is concave on [m, M] and the reverse inequality in (4.19) holds. The substitutions in (4.22) then yield the reverse inequality in (4.25) provided A(wgq ) > 0, and the proof is complete. (Again we note that the reverse inequality in (4.25) does not hold if A(wfP) = A(wgq ) = 0 D unless A(wfg) = 0.)
4.15. Remark. Theorem 4.14 is a generalization of the Diaz-Metcalf Inequality, which is the special case p = q = 2 with w == 1 and A(t) = 'l.7A or AU) = f ~ f d x . See, for example, Bullen, Mitrinovic, and Vasic (1987, p. 109), and Mitrinovic (1970, pp. 61-63). D 4.16. Theorem. then
Let L, A, p, q, w, f, g be as in Theorem 4.14. IfP > 1,
A(wfg) ~ Ip!lIp \qlllq
( M - m)lIP ImMP - M IMP -mPI
m
PllIq
A lip (wfP)AlI q( wg q).
(4.26) If p < 0 or 0 < p < 1, then the reverse inequality in (4.26) holds provided either A(wfP) > 0 or A(wgq ) > O.
In the case p > 1 or p < 0, (x) = x'' is convex on 1= [m, M]; thus when applying (4.20) with the substitutions in (4.23) we have
Proof.
or (4.27) In the case p > 1, (4.26) dearly holds when A(wgq ) = O. As noted in the proof of Theorem 4.14, we may assume that A(wfP) > 0 and A(wgq ) > 0 for the rest of the proof. If p > 1 and A(wgq ) > 0, then from (4.27) we obtain A(wfg)
p(wfP )A lI q( wg q),
~A-lip A II
where A is determined as in Theorem 3.39(a) with (x) =x P on 1= [m, M]. Using the same notation in Theorem 3.39(a), we find Ii
= (MP
x
- mP)/(M - m), = q(mMP - MmP)/(MP - mr], p(mMP A = p-lql- MmP)I-p(M - m)-l(MP - mP)p;
116
4. Applications of Jensen's Inequality
thus (4.26) follows for p > 1. Now suppose that 0 < P < 1 and P = P -1 > 1. We apply the result in (4.27) with p, q, t. g replaced by P, Q = (1- P )-1, it = (fgr, and gl = g-P, for which wfi = wfg, wgF = wgq, Wf1g1 = wI;,. Moreover, f1g1Q1P = holds, and since m 5,fg-q1p 5, M on E, it follows that
re :
m1 = m" 5, f1glQIP 5, MP
= M1
on E.
Thus the modified (4.27) yields
A(wfg)5, AlA1Ip(wr)A1Iq(wgq), where
A1 = p-1Q1-P(m1Mf- M1mD 1-P(M1 - m1)-1(Mf- mDP. This reduces to the constant term on the right-hand side of (4.26). Finally, if p < 0, then 0 < q < 1 and we may use a similar argument and, with P1 = q, q = p, f1 = g and gl = f We then have f1g1q,lp, = si since plq <0,
?"
The reverse inequality in (4.26) is still valid since A(wgi1 ) = A(wfP) > 0, consequently we obtain
A(wfg) 5, s'" Ipillp
M 1- m1)lIq I:;1- Mq ~m
(M
1
M1
m1qillp
AlIq(wgq)AlIP(wfP).
1
By writing -plq = 1- p, the factor on the right-hand side of this inequality reduces to that in (4.26) after an elementary calculation. This completes the proof of the theorem. 0
4.17. Remark. It is also possible to obtain (4.26) (or the reverse inequality in (4.26)) from (4.25) by using the arithmetic-geometric means inequality. Thus, for example, if p > 1 and p-1 + q-1 = 1, then the left-hand side of (4.25) is bounded below by {p(M - m)A(wr)} IIp{q(mMP - MmP)A(wgq)}lIq, and this reduces to the right-hand side of (4.26), with a factor of (MP - m'']. This shows that the inequality in (4.25) is sharper than that in 0 (4.26). 4.18. Theorem. Let L, A, p, w, f, g be as in Theorem 4.14, and let 0< m < F(x) 5, M and 05, G(x) 5, M for x E E, where F = f(f + g)-qlp,
4.2. Holder's and Minkowski's Inequalities
G
= g(f + g)-qIP.
117
If p > 1, then
A IIP(w(f + gY) 2:: K(p, q, m, M){AIIP(wfP ) + A IIP(wg P)}
(4.28)
holds where K(p, q, m, M) is the constant on the right-hand side of (4.26). If 0 < p < 1 or p < 0, then the reverse inequality in (4.28) holds provided that A(w(f+ gY) > 0 for p < o.
Proof.
This follows immediately from Theorem 4.16.
0
4.19. Remarks. (a) By writing s = ar + bt, where a + b = 1, Holder's inequality yields the following Liapunov inequality for isotonic functionals: (4.29) If we define the means of order r by
M[r](g, A) = A(gr)lIr for
r
=1=
0
and A(1) = 1, then (4.29) can be written in the form M[sl(g, A) :0:; M[r](g, A)(rls)«t-s)/(t-r))M[t](g, A )(tls)«s-r)/(t-r))
for
0 < r <s
< t. (4.30)
Hence by the arithmetic-geometric means inequality we have
r(t - s) -[
t(s - r) -[
-[I I I MS(g,A):O:;Mr(g,A)+Mt(g,A), s t-r s t-r
or equivalently, M[t](g, A) - M[rl(g, A) <: s(t - r) M[t](g, A) - M[s](g, A) - r(t - s)
for
0 < r < s < t.
This inequality was proposed by Hsu (1955) (as a problem for the classical means); see Beesack (1983), and Pecaric and Wang (1988). (b) In Beesack (1983), the last inequality in (a) for the classical means M(r) (Hsu's inequality) was proved by showing that the function M(r- 1 ) is convex for r > O. Here we give a shorter and simpler proof for a more powerful result: The function f(s) = M[lIs](g, A) is log-convex (hence convex) for s > O. Indeed, this follows from the Liapunov Inequality (4.30) by the substitutions t=x- 1, r=y-l, and t(s-r)/[s(t-r)]=A,
118
4. Applications of Jensen's Inequality
r'.
which yields 1- A = r(t - s)/[s(t - r)], s = [Ax + (1- A)y inequality f(AX+(1-A)y):;f(x)y(y)1-A for
O<x
and the
0<1.<1.
Consequently, the log-convexity property of f(s) holds. (c) Holder's inequality for isotonic functionals can be stated in the following form: Let L satisfy conditions L1, L2, and A satisfy conditions A1, A2 on a base set E. If O
E
=f~/A,
IR then (4.31) yields (4.32)
~ Hence the function G(r) = by using the substitutions f ~ ! ' and g f". A(!') is log-convex (thus it is convex) on IR. (e) Let us consider the function
g(x) =
DA(fr Dl f I ~ - x )
l Iqj
(4.33)
where A is a positive linear functional (we assume that all expressions exist, i.e., if we write A(s) we assume that s E L), fk'S are positive functions, qi > 0 (i = 1, ... , n) with 1:1 (l!qk) = 1. By using Remarks 4.19 and Theorem 2.26, we have that g is a log-convex function (thus it is convex), and for IxI:; Iy I (xy > 0) we have g(x):; g(y). This result is proved in Mitrinovic and Pecaric (1987), and it is a generalization of results in Callebaut (1965), Daykin and Eliezer (1968), Godunova and Cebaevskaja (1971), McLaughlin and Metcalf (1967), and Pecaric and Beesack (1986). As a special case we have the following generalization of the well-known Callebaut's inequalities (1965): If 1:; a:; f3 :; 2 or f3 :; a:; 1, then A(fg)Z:;A(fcxgz-a')A(fz-cxg CX) :; A(ff3g Z- (3)A(f z- f3 g f3 ) :; A(fz)A(gZ). (4.34)
(f) Some further generalizations of the previous results are given in 0 Pecaric (1989f).
4.3. Dresher's Inequality
4.3.
119
Dresher's Inequality
First, we consider a two-parameter family of means, Bp,q(f, A), defined by
Bp,if, A) = {A(fp)/A(rnl/(p-q) for
p"* q,
(4.35)
Bp,p(f, A) = exp{A(fP10gf)/A(fP)},
for p, q E IR. We assume that f(x) > 0 for x E E, JP E L, JP logf E L for all p E IR, that L satisfies Ll, L2, and that A: L ~IR satisfies AI, A2. When applying the known result for convex functions
(xz -Xl)-I{cp(XZ) - cp(Xln:s; (yz - Yl)-I{cp(yZ) - CP(Yl)} Xz:s; Yz,
Yl "*Yz
to the convex function cp(x) = 10gA(r), we can obtain
Bxz,x,(f,A):s; B)Iz,y,(f, A) for
Xl:S; Yh Xz:S; Yz and XI "* Xz,
Yl "*Yz.
(4.36)
We now show that (4.36) holds even if Xl = Xz or Yl = Yz. To prove this we use the fact that M[r1(g, A) is an increasing function of r on IR and, in particular, that
A(fx,-xZ)lI(x,-xz) :5 exp(A(logf):s; A(fx2-X,)1!(xz-x,) for
Xl < Xz. (4.37)
We then apply (4.37) to the isotonic linear functional AI: E ~IR defined for certain gEL (see Lemma 4.11) by Ai(g) = A(rig)/A(r') for i = 1, 2. By taking i = 1, the right-hand inequality (4.37) reduces to
Bx"x,(f, A):s; Bxz,x,(f,A) for
Xl < Xz.
Similarly, by taking i = 2, the left-hand inequality of (4.37) reduces to
Bx2,x,(f, A) :5 Bx2,xz(f, A) for
Xl < Xz.
These two inequalities show that (4.36) is valid even when Xl = Xz or Yl = Yz· Note that (4.36) implies that Bp,if, A) is an increasing function of both p and q for all p, q E IR.
4.20. Remarks. (a) As in Stolarsky (1975), let us take E = [x, y] for fixed x, Y with 0 < X < Y < 00, P = s - 1, q = r - 1, f(t) = t, and
f y
A(g) =
x
get) dtl(y - x),
120
4. Applications of Jensen's Inequality
where L is the set of all bounded measurable functions on E. Then the means in (4.35) become, when writing E(r, s) = Bs-I,r-I(t, A),
r (yS _ XS)}II(s-r) E(r,s)= {;(yr_xr) for E(r, 0) = E(O, r) E(r, r)
yr
xr
= { r(lny -lnx)
rs =1= 0,
r=l=s, }llr for
r =1= 0,
= e- lIr(x 'l yY') II(x' - Y') for r =1= 0, X
and E(O, 0) = yXy. By (4.36), the function E(r, s) is increasing in both r and s. These means were introduced by Stolarsky (1975), and have been considered by Leach and Sholander (1978,1983). The proof of the monotonicity property of E(r, s) given in Leach and Sholander (1978) appears to be more difficult than that given above. (b) In (4.35), take E={1,2, ... ,n}, f(k)=ak>O(kEE), and A(f) = I : Z ~ lakin. Then
B p . q ( f , A ) = D ( P , q ) = { * a ~ / ~ a kforr ( pp=l=q, -q) D(p, p)
= exp{
~ a ~log s, / ~af },
becomes the Gini-Dresherrnean (for sums), introduced by Gini (1926) and Dresher (1953). Again we can conclude that D(p, q) is increasing in both p and q; see Brenner (1978, Section 3), Bullen, Mitrinovic, and Vasic (1987, pp. 189-190) and the references given there. 0 For a second result related to the Gini-Dresher means we prove the following generalization of Dresher's inequality (1953).
4.21. Theorem. Let A, B: L- ~ be isotonic linear functionals. If fi, u;:E-[O, oo) with f'[, (1:lfiY, u ~ , (1:7u;yEL, wherep2=l>r>O and A(uD > 0 for 1:5 i :5 n, then n
{
)p}lI(p_r)
~fi B( ~ u;)' A(
:5
{A(ff)}II(p-r).
n
~
B(uD
4.3. Dresher's Inequality
Proof.
121
By Minkowski's inequality for isotonic functionals, we have
Hence
={ x
n
~ [(A(ff))lIp-r)](p-r)!p
}p!(p-r)
n {
~ [(B(uD}-lI(p-r)](p-r)!(-r)
}-r!(p-r)
n
:S
2: A(ff)lI(p-r)B(uD-lI(p-r) 1
follows from the basic Holder's inequality for sums with the conjugate indices P = (p - r)/p and Q = (p - r)/( -r). D Dresher (1953, Section 7) dealt with the special case n = 2, B = A, E = [0, 1], and A(t) = fbi du. A simpler proof, also for this case (essentially the proof given above), can be found in Danskin (1952). A special case for 1 :S P :S 2 and r = p - 1 was treated earlier by Beckenbach (1950). See also Beckenbach and Bellman (1961, 1965, pp. 27-28) for other proofs of the results of Beckenbach and Dresher. The following is a simple consequence of the above result: Let a, b, p, q be positive n-tuples, a E A, b e B, A x B be a convex set. If 0 < r < 1 < S, then
is a convex function on A x B. The proof of this result can be found in Godunova (1967a).
122
4. Applications of Jensen's Inequality
4.4.
Beckenbach's Inequality
Let E be a nonempty set, .sI1 be an algebra of subsets of E, and let L be a linear class of real-valued functions satisfying conditions L1-L3 defined in (3.27)-(3.29). The following two results are given in Pecaric and Beesack (1987b): 4.22. Theorem. Let L satisfy L1, L2, L3 on a nonempty set E and let A be an isotonic functional on L. Suppose E 1 E.sI1 has A(C E,) > 0 where E 2 = E\E l' Then for every nonnegative gEL such that gP E L (p > 1) and A(gCEJ >0, we have A(gP)1/P/A(g) 2 : : A ( g ~ Y / P / A ( g E t ) '
(4.38)
where
First observe that A(g) 2:: A (gC Et) > 0 and A(gE1) > A (gCEJ > 0; thus both sides of (4.38) are well-defined. Applying Theorem 3.26 with A replaced by A 1(g)=A(g)/A(1), F(x, y) =X llP/y1/P, ep(x)=xP, and with 1= J = [0, (0), we have
Proof.
A(gP)1/p / A(g) 2:: inf A ( g ~ ' . X ) l /A(gE IP t' x),
(4.39)
XE[
where gE,.x(t)
= g(t)CE,(t) + xCE,(t).
Hence we have By elementary calculus we find that the minimum value of k(x) = {A(gPCE,) + x PA (C Ez)}lIP/ {A(gC E,) + XA(CE2)},
x> 0
is attained at x = {A(gPCEJ/A(gCEJ}lI(p-l). Thus (4.38) follows from (4.39). 0 4.23. Theorem. Let L satisfy Ll, L2, L3 on a nonempty set E, and let A be an isotonic linear functional on L. Suppose the nonnegative functions t. g: E ~'U? are such that [P, gq,fg E L, where p > 1, p-1 + «:' = 1. If E 1 E .sI1 has A(fgCEJ > 0 and A(gqCE2) > 0 where E 2 = E\£1, then A (fP)lIPjA(fg) 2 : : A ( j ~ , ) l I P j A ( j g ) ,
(4.40)
4.4. Beckenbach's Inequality
123
where
Proof. We apply Theorem 4.22 to the functional A1(gl) defined for certain g l : E ~ ~by A1(gl)=A(kg1)/A(k), with k=gqEL. Since A ( k ) ~ A ( g q C E 2 by » 0 Lemma , 4.11 and the fact that <jJ(u)=u P is convex on 1= [0,00), we have
for all functions gl: E ~ ~ for which gqgl ELand gqgf E L. But this is precisely the inequality corresponding to (2.6) for the functional A1(gl) and <jJ(u) = u", and this in turn implies the validity of Theorem 3.31, and hence that of Theorem 4.22 with A = AI. Consequently, we may apply Theorem 4.22 with the function g replaced by gl = fg- q /p because both A1(gl C E) > 0 and A1(CE,} > 0 hold. Now gqgl = fg and gqgf = JP; thus
It is easy to verify that (4.38), with A and g replaced by Al and gl, respectively, reduces to
(4.41) where
gdt)
= gl(t)CE,(t) + {A(JPCE)/A(fgCE)}1I(p-IlCE2(t).
Hence by 1/(p -1) = q -1 = q/p, we have
gqgE , = g{fCEI + [gA(JPCE,/A(fgCE)]q/PC E,} = fgE " g q g ~ =, JPC E, + [gA(JPC E,/A(fgCE,WCE2 = It, and so (4.40) follows from (4.41).
0
4.24. Remark. (a) Beckenbach's inequality (1966) is the special case of Theorem 4.23 corresponding to E = {1, 2, ... , n}, £1 = {1, 2, ... ,m} (where 1:s: m < n), L = ~ n , the vector space of all real n-vectors a=(al, ... ,a n ) , and A(a)=I:7a;. Let a=(al, ... ,a n ) , b= (b 1 , . . . , b n ) be two n-tuples of positive real numbers, and p, q be real numbers such that p-l + q-l = 1 (p > 1). If 0 < m < n, then P ( n~af )l/P( n~a.b, )-1 ~ (n~ iif)lI ( n~ii;b; )-1 ,
(4.42)
124
4. Applications of Jensen's Inequality
where
a, ii, = I
{ (b i
m
m
1=1
1=1
2: a)/2:
for
1 ~ i ~ m,
for
m
qlp
ajbj)
+ 1 ~ i ~n,
and the equality in (4.42) holds iff iii = a, for all i. The inequality in (4.42) is reversed if p < 1 and p *0. Furthermore, for m = 1 (4.42) reduces to HOlder's inequality. (b) Some related results are also given in Pecaric and Beesack (1987b). (c) In the same fashion we can give generalizations of Theorem 4.23 and Corollaries 3, 4 in Bullen, Mitronovic, and Vasic (1987, pp. 258-260). 0
4.5. Aczel's and Related Inequalities We noted that from Jensen's inequality we can easily obtain Holder's inequality. Similarly, from Theorem 3.1 (the reverse Jensen's inequality) we can obtain Aczel's (1956) (Mitrinovic, 1970, pp. 57-58) and Popoviciu's (1959b) inequalities, and their proofs can be found in Vasic and Pecaric (1982b). The ideas can be used to prove more general results. First, we note that the following generalization of Theorem 4.22 is valid:
4.25. Lemma.
Let E, L, A, t/J be defined as in Lemma 4.11 and assume that pEL with p ~ Oon E and O < A ( p ) < U (ua-A(pg))/(uE ~ , A(p)) E I (a E I), pg ELand pt/J(g) E L. Then t/J (
Proof.
ua - A(pg)) > ut/J(a) - A(pt/J(g)) . u -A(p) u -A(p)
(4.43)
By letting p=u,
in Theorem 3.1 for n
q = -A(p),
= 2,
b = A(pq)/A(p),
i.e., from
A..(pa+qb»_pt/J(a)+qt/J(b) ." p+q p+q
for
q < 0, P
+ 1 > 0, pa+qb p+q
E
I,
4.5. Aczel's and Related Inequalities
125
we have 4J(ua - A(pg)) ~ u4J(a) - A(p)4J(A(pg))/A(p)). u-A(p) u-A(p)
By applying Lemma 4.11 we have (4.43).
0
4.26. Theorem (Aczel's inequality for isotonic functionals). Let L satisfy Ll, L2, and A satisfy A1, A2 on a base set E. IfF, s'. fg ELand g ~- A(g2) > 0 (or f ~ - A(F) > 0), where go, fo are real numbers, then (fogo - A (fg))2 ~ ( f ~- A ( f 2 ) ) ( g- ~ A (g2)).
(4.44)
4.27. Theorem (Popoviciu's inequality for isotonic functionals). Let A and L be as in Theorem 4.26. If P > 1, q > 1, p-l + «: = 1, f, g ~ 0 on E, I", s". fg E L, and fo, go are positive real numbers such that (4.45) then
(f£ - A (jP))lI P(gg - A(gq))lIq 75, fogo - A(fg).
(4.46)
In the case 0 < P < 1 and A(g!l) > 0 (or p < 0 and A(fP) > 0), the reverse inequality in (4.46) holds.
Proof.
By applying the substitutions
4J(x) =xP (p > 1),
in (4.43), we obtain (fogo - A(fg)Y ~ (f£ - A (fP))(gg - A(gq)Y-l
(4.47)
if the first condition in (4.45) is satisfied. If the second condition is also satisfied, then from Holder's inequality we have A(fg) < A (fP)lIp A(gq)lIq < fogo, i.e., fogo - A(fg) > O. Thus from (4.47) we obtain (4.46). 0
4.28. Remark. Note that for p = 2, we obtain Aczel's inequality from (4.47). Thus (4.47) is a generalization of A C Z ( ~ I ' sand Popoviciu's inequalities. 0 4.29. Theorem (Bellman's inequality for isotonic functionals). Let A and L be as in Lemma 4.25. Let f, g ~ 0 on E with I", gq, (f + g) E L, and fa, go be positive real numbers satisfying (4.48)
126
4. Applications of Jensen's Inequality
If p > 1, then «(fg - A(fP»lIP(gg - A(gP»lIPY:S (fo + goY - A«(f + gY). (4.49)
If 0 < p < 1 or p < 0 and A(fp) > 0, then the inequality in (4.49) is reversed.
Proof. We give proof for p > 1 only; the proof for the other case is similar. Using (4.48) and the Minkowski Inequality we have (fo + goY> (A(fP)lIp
+ A(gP)lIPY
From the discrete Minkowski Inequality for n «a1
+ b 1Y + (az + b zy)lIp :s (af +
~ A « ( +f gY)·
= 2, i.e.,
a ~ ) l I P+ (M + bf)lIP ,
the substitutions
and the Minkowski Inequality, we have
«(fg - A(fp»llp + (gg - A(gP»lIPY :s (fO + goY - (A(fp)llp + A(gP)lI PY :s (10 + goY - A«(f + gY).
0
4.30. Remark. The last inequality in the above proof is an interpolation of (4.49), and it is a generalization of a result in Mitrinovic and Pecaric (1988a). Similarly we can prove Theorem 4.27 by using only Holder's inequality, i.e., we can obtain a similar interpolation of Popoviciu's inequality. Of course, we can also obtain other results similar to those that can be obtained from HOlder's inequality. 0
4.6.
Further Generalizations of Holder's and Minkowski's Inequalities
Let us further consider the generalized means defined in Section 4.1, and assume that I = (a, b), -00:S a < b < 00, 1J11"'" 1J1n: I ~ ~ are continuous and strictly monotonic, X: I ~ ~ is continuous and increasing; L and A satisfy the conditions Ll, L2 and AI, A2 defined in (3.27)-(3.31), with A(l) = 1 on a base set E; gl" .. , gn : E ~ ~ and f:I1 x··· x I n ~ ~ are real-valued functions such that gl(E) c 11, ... , gn(E) c In, 1J11(gl), ... , 1J1n(gn), x(f(gl, ... , gn» E L.
4.6. Further Generalizations
127
We consider the inequality of the form
MX(f(gl, ... ,gn), A) =Sf(M"'l(gl' A), ... ,M"'n(gn, A)), (4.50) and observe
4.31. Theorem. A necessary and sufficient condition for (4.50) to hold is that the function H(Sl' ... , sn) = x(f(1J11 1(Sl)' ... , 1J1;;\sn))
is concave. If H is convex, then the inequality in (4.50) is reversed. Proof. McShane's inequality (see Theorem 2.6 and Remark 2.11(b)) for the function H becomes x(f(1J111(A(fr)), ... , 1J1;;l(A(fn)))) 2':A(X(f(1J111(fl), ... , 1J1;; 1 (fn))))' (4.51) Thus if we let t.
= 1J1i(gi) (i = 1, ... , n), then (4.51) becomes
X(f(M"'l(gl, A), ... ,M"'n(gn, A))) 2':A(X(f(gl' ... ,gn))), (4.52) which is equivalent to (4.50).
0
4.32. Remark. For the special case of discrete functionals with n = 2, this result is given in Beck (1970) (see also Bullen, Mitrinovic, and Vasic (1987, pp. 246-255). 0 The following two corollaries can be proved as in Beck (1970):
4.33. Corollary. Assume that f(x,y)=x+y, and let H(s,t)= X(1J11\s) + 1J12 1(t)), E = 1J1U 1 J 1 ~ , F = 1 J 1 ~ / 1 J 1 ~ , G = X'/ X", and all of 1J1;, 1 J 1 ~ , X', x", 1 J 1 ~ , 1 J 1 ~ be positive. Then Mx(gl + gz, A) =s M"'l(gl, A) + M"'2(gZ, A) holds iff G(x + y) 2': E(x) + F(y). 4.34. Corollary. Assume that f(x, y) =xy, and let H(s, t) = X(1J11 1(S)1J12 1(t)), A(x) = 1J1;(x)/(1J1;(x) + x 1 J 1 ~ ( x ) ) B(x) , = 1 J 1 ~ ( x ) / ( 1 J 1 ~ (+x ) X1J1~(x))C , (x) = X'(x)/(X'(x) + xx"(x)), and 1J1;, 1 J 1 ~ , X', X", 1 J 1 ~ , 1 J 1 ~ be positive. Then
MX(glgZ,A) =s M"'l(gl, A)M"'2(gZ'A) holds iff C(xy) 2':A(x) + B(y).
128
4. Applications of Jensen's Inequality
Several other results related to Holder's and Minkowski's inequalities will be given in other parts of this book. We complete this section by observing the following general result in Bourbaki (1952, pp. 9-14) (see Mitrinovic, 1970, pp. 355-56, and Kuczma, 1985, pp. 203-4): Let P be the set of all mappings of a set S into the nonnegative reals. Let M be a mapping of P into the nonnegative real numbers satisfying (i) M(O) = 0, M(At) = AM(t), where A> 0 and f E P; (ii) f(x)::5 g(x) for all XES and f, g E P implies M(t)::5 M(g); and (iii) M(f + g)::5 M(t) + M(g) for all f, g E P. Let h(t l , . . . , tn) be a real-valued function of n real variables t l , . . . , t n which is defined and continuous for t, 2= 0 (i = 1, , n). Let h have the following properties: (iv) inequalities ti > 0 (i = 1, , n) imply , Atn) = that h(tl>.'" tn) > 0; (v) if A> 0, then h(Atl, Ah(tl, ... , tn); and (vi) the set of all points (t l, ... , tn) in En satisfying t, 2= 0 (i = 1, ... , n) and h(tl>' .. ' tn) ~ 1, is convex. Then (a) fl , ... .t; E P implies
M(h(fl' ... ,fn))::5 h(M(fI), ... , M(fn))'
(4.53)
(b) O
2= 1
(4.54)
and f, g E Pimply
M«f + g)P)lIP::5 M(fP) lip + M(gP)lIP.
(4.55)
4.35. Remark. Some related results were obtained by You (1989).
o 4.7.
Some Inequalities
fOl"
Complex Functionals and Norms
As in Sections 2.1 and 3.2, we assume that L satisfies cOnditions L1, L2 (defined in (3.27) and (3.28)) on a base set E, and that A is an isotonic linear functional on L. We consider the class
L= and the functional
A:L
{ f : E ~ C Ref , E
L, Imf E L},
~C defined by
A(t) = A(Ret) + iA(lmt) = Re(A(t)) + i Im(A(t)). Clearly
A is a complex linear functional on L; that is, A(af + {3g) = aA(t) + {3A(g) for f, gEL.
In the following we give some simple properties of A.
a, {3
E
(4.56)
C. (4.57)
4.7. Some Inequalities for Complex Functionals and Norms
Theorem 4.36.
(a) Iff ELand If I E L, then (4.58)
IA(f) I :5A(lfl)·
(b) Iff E L, If I E L, and a - 8:5 argf(t):5 a 8 are real numbers such that 0 < 8 < rr/2, then
+ 8 for all
tEE, where a,
IA(f)I2= (cos 8)A(lfl).
(c) If in (b) we have a < argf(t):5a then
+8
(4.59)
for all tEE (0< 8 < rr12),
Vi IA(f)I2= 2: A(lfl)·
Proof.
129
(4.60)
(a) For arbitrary but fixed 8 E IR we have Re(eiOA(f» = Re(A(ei0f) = A (Re(ei0f) :5A(lfl).
Suppose that A(f) = Reit • Take 8 = -t to obtain IA(f)1 = r = Re(e-itA(f) :5A(lfl).
(b)
IA(f) I = le- iaA(f)I2= Re e-iaA(f) = A[lfl Re
ei(arg/-a)]
= A(Re(e-iaf)
= A(lfl cos(argf - a»
2= A(cos 8 If I) = (cos 8)A(lfl).
(c) For an arbitrary but fixed complex number z = x + iy, we have Izl2= (Vi12)(lxl + Iyl). Hence IA(f) I = le-iaA(f)I 2= Vi
V;
{IRe(e-iaA(f)1 + IIm(e- iaA(f»1}
= 2: {A(lfl cos(argf -
a»
.
+ A(lfl sm(argf -
a»},
or Vi IA(f)I 2= 2: A(lfl [cos(argf - a)
+ sin(argf -
am·
Since the function cosx+sinx=h(x)2=h(0)=h(rr/2)=1 rr/2, (4.60) follows. 0
for O:5x:5
Note that it follows from (4.59) and (4.60) that if f E L, If I E L, and + 8 for all tEE, where 0 < 8 < rr/2, then
a :5 argf(t) :5 a
V IA(f)1 2= max { 2' cosi8} A(lfl)·
(4.61)
130
4. Applications of Jensen's Inequality
4.37. Remark. (a) The inequality in (4.59) is a generalization of an inequality of Petrovic (1933), and (4.61) is a generalization of a result in Vasic, Janie, and Keckic (1971), namely, the inequality n
I
~ Zk
I
2:
max
{Vi T' cos ()}
n
~ IZkl
for
a s: arg Zk
:5
a
n + () < a +"2'
o
4.38. Theorem. If g: E -- ~ and f: E -- C are such that g2 E L, Ifl 2 E L, Ifgl E L, fg E L, and FE L, then
IA(fg)12:5 ~ A(g2){A(lfI2) + IA(f2)1}. Proof.
II = eiaf,
First we show that there exists a real number a then
A(gRelI)2:0 and
(4.62)
E
~
such that if
A(g Imh) =0.
It then suffices to prove the second of the two identities because, if necessary, we may replace f1 with (-f1) (that is, a by a + n), to yield the first. Let
k(a)
= A(g Im(eiaf) = A(g If I sin(a + argf).
Then k(O) = -k(n). Thus it suffices to prove that k is continuous on [0, n]. But this follows from
Ik(a) - k(ao)1
= IA(g If I [sin(a + argf) - sin(ao + argf)]) I :5IA(lgl . If I . la - aol)! = la - aol A(lgfl)·
With this choice of a, we have
Thus we have
by the special case p = q = 2 of the generalized Holder's inequality. Since 2(Re 1I)2 = Ifd2 + Re(fi) we have
= If/ 2 + Re(fi),
4.7. Some Inequalities for Complex Functionals and Norms
131
But A(Re(fi» = ReA(fi) ~ IA(fDI = IA(F)I;
hence (4.62) follows.
D
Note that the inequality in (4.62) is a generalization of an inequality involving sums due to De Bruijn (see, for example, Mitrinovic, 1970, pp. 313-314). It is an improvement of the generalized Cauchy Inequality IA(fgW ~ A ( l f I 2. A(g2), )
since we have IA(F)I ~ A ( l f I 2by ) (4.58). Our next result concerns a generalization of the well-known inequality of Bohr (see Mitrinovic, 1970, p. 312), or an extension of the inequality 2 n
~ Zk
1
n
n
~ ~ ak IZkl2 for
Zk E
and
1[,
2: aJ;l = 1. 1
I
4.39. Theorem. Let f: E ~I[ and p: E pll(l-r), IfI, plfl', and f E L, then IA(f)lr
~[0,
00). If for r > 1 we have
~ A ( p l l ( l - r ) y - I Ifn. A ( p
(4.63)
Proof. We use (4.56) and HOlder's inequality (Theorem 4.12) with conjugate exponents r, r/(r - 1) to obtain IA(f)lr ~ A ( l f I=YA(p-lIrplir IflY ~ A ( p l l ( r - l ) y - I Ifn. A ( p Similarly, using (4.62) we obtain a refinement of this result for r
D
= 2: (4.64)
provided that f E L, pF E L, and r:'. If I, plfl 2 E L. This follows as above with r = 2, except that (4.62) is used in place of Holder's inequality (with the substitutions g ~p-112 and f ~p1l2f). The inequalities (4.63) and (4.64) are generalizations of results given in Vasic and Keekic (1971b) which deal with the case E = {1, 2, ... ,n} and A(f) = 'L.Uk' 4.40. Theorem. Let
(4.65)
132
4. Applications of Jensen's Inequality
If tjJ is concave and decreasing, then the reverse of the inequality in (4.65) holds.
Proof. By (4.58) we have IA(!)I =sA(lf!). Thus (4.65) follows from the properties of tjJ and Jessen's inequality (2.6). For the reverse inequality, just apply (4.65) to - tjJ. 0 Now for given f : E -- C with f cos e
E
L, let us define the constant
if a -
e =s argf(t) =s a + e for e E (0, ~ ) ,
some a
c, = m a x { ~cos , e}
E
IR, and all tEE,
if a =s argf(t) =s a + e for some a
o
C, by
E
e E (0, ~ ) ,
IR, and all tEE,
otherwise.
Then we have 4.41. Theorem.
(a) A and
A satisfy
1 A(lf!) =s -IA(!)I for f
c,
E
L,
If I E L.
(4.66)
(b) If cjJ: [0, oo]__ 1R is concave and increasing and if A(l) = 1, then A(cjJOfl» =s
c j J ( ~ IAU)I)
(4.67)
f
provided that f E L, IfI E L, and cjJ(lf!) E L. If cjJ is convex and decreasing, then the reverse of the inequality in (4.67) holds.
Proof. Inequality (4.66) follows from (4.59) and (4.61), while (4.67) follows from Jessen's inequality (2.6) and (4.66). 0 4.42. Theorem. Let L, A satisfy conditions Ll, L2 and Ai, A2 defined in (3.27)-(3.31), respectively, and let gEL. If O=sg(t) =sA(g) for all tEE, tjJ: [0, oo) __ 1R is convex with tjJ(O) = 0, and tjJ(g) E L, then A(tjJ(g» =s tjJ(A(g».
(4.68)
4.7. Some Inequalities for Complex Functionals and Norms
133
Proof. This follows from Theorem 12 of Beesack and Pecaric (1985a) with Xo = O. 0 Note that in the case A(1) = 1, equality in (4.68) holds by (2.6). 4.43. Theorem. and iff E
L, IfI E
If ep is concave and increasing on [0,00) with ep(O) L, ep(lfl) E L, and If(t)1 :o:;A(lfl) for all tEE, then
ep(I.4(f)I) :o:;A(ep(lfl))· Proof.
=0
(4.69)
Since -ep is convex, it follows from (4.68) and (4.58) that A(-ep(lfl):o:;
-ep(A(lfl»:o:; -ep(I.4(f)I).
0
4.44. Remark. By applying (4.61) and (4.62) we can obtain additional generalizations of Bohr's inequality similar to those given in Vasic, Janie, and Keckic (1971), and Kocic and Maksimovic (1973). 0 Using (4.65) together with Lemma 4.11, we can prove, as in Theorem 2 of Kocic and Maksimovic (1?73), the following result: Let p(t) > 0 for tEE and ep: [0, o o ) ~IR be strictly convex, with ep(uv):o:; ep(u)ep(v) for u, v> O. Let 1jJ(t) = ep(t)/t for t > 0 and 1jJ(0+) = 0, 1jJ(00) = 00. If X(t) = 1/1jJ-\t), then
4.45. Theorem.
ep(I.4(f)I) :0:; 1jJ(A(X(p)))A(pep(lfl)) holds provided that f E L, IfI E L, x(p) E L, x(p )ep(x(p) IfI) E L, and A(X(p))> O.
pep(lfl) E L,
Note that the inequality in (4.63) is a special case of this result. In the same fashion we can prove converse inequalities similar to those in Vasic, Janie, and Keckic (1971), Kocic and Maksimovic (1973), and Pecaric and Janie (1988) by using the other parts of Lemma 4.11. Similar results for norms can be obtained by using the same arguments. First, we observe the following theorem (Pecaric and Dragomir, 1989a): 4.46. Theorem.
Iffis an increasing convex function for x
2:
0, then (4.70)
where Pi 2: 0, P; = ~ 7 ~ Pi' 1 Xi E V (i = 1, ... , n), and V is an arbitrary normed vector space with norm 11·11.
134
4. Applications of Jensen's Inequality
As a special case of this inequality we have
I I ~xl :s ( ~ 1p}I(1_,»)'-1 ~Pi Ilxill'
for
r> 1.
(4.71)
Similarly, by the reverse of Jensen's inequality, the reverse of the inequality in (4.70) holds under the same conditions on f for the following values of the p/s:
Pi :s 0 (i
Pl>O,
= 2, ... , n) and P; > O.
(4.72)
Also note that if
qi:S 0 for i = 2, ... ,n, and q1:s
( ~ z l q i l l l ( l - ' »1-', ) (4.73)
then (4.74) As a consequence of (4.71) and (4.74) we then have
Ilxl + x211' II xllI' II xzll' - , , - - - ~ - = . : . c . . . . ~_ _ + __ u+v
u
v
for
uv(u+v»O,
II x1 + xzll':s /./X111' + Ilxzll' for uv(u + v) <0, u+v
u
(4.75)
v
where 1 :s r ~ 2. Another generalization of (4.71) is given in Kocic and Maksimovic (1973). A similar result is also given in Pecaric and Janie (1988). A special case of those results is the following result of Delbosco (1980): (4.76) where Xi EX (i = 1, ... , n), and the constant cp,n = nP - 1 for P ~ 1 and cp,n = 1 for O:s P < 1 is the best possible. If z and ware complex numbers and A ~ 2, then van der Corput and Beth (see Mitrinovic, 1970, p. 322) showed that [z + wl A+ [z -
W I A ~ 2 ( l z I IwI A +A).
(4.77)
Klamkin (1975) extended this inequality by showing that z,
2: IDIVI + DzVz + ... + O n V n I A ~ 2 IVilzt n(~
(4.78)
4.7. Some Inequalities for Complex Functionals and Norms
135
where A> 2 or <0, D; = -lor 1 (i = 1, ... , n), the V;'s are vectors in Em and the summation on the left-hand side of (4.78) is taken over all 2n points of (D1 , • . . , Dn ) . The inequality is reversed for 0 < A < 2, while for A= 0,2 it becomes an identity. A geometric interpretation of this result corresponding to the case A = 1 is that: For all parallelotopes of given lengths, the rectangular one has the largest sum of the lengths of the body diagonals. Its proof follows from an identity for A= 2 and some known inequalities (see also Shore, 1980). In Pecaric and Janie (1982) further generalizations are given by using Jensen's inequality and Petrovic's inequality for convex functions. Also, Shore (1980) and Pecaric and Janie (1982) gave some inequalities for norms. However, the well-known Clarkson inequalities (see, for example, Mitrinovic and Vasic, 1977) are closely related to the above results. 4.47. Theorem. If x, yare elements of the space t p (or Lp ) , where p and «: + «:' = 1, then the inequalities 2(llxll P + lIyIlP)q- 1:s IIx + yllq 2(jjxjjP
+ lIyllP):s
jlx
+ Ilx -
yllq,
~2
(4.79)
+y
jjP + Ilx - yjjP:S 2P- 1(jjxjjP + Ijy liP),
(4.80) IIx + yliP
+ IIx -
Y II p :s 2(lIxll
q
+ lIyllqy-l
(4.81)
hold. If 1 < P :s 2, then the reverse inequalities are valid. For some similar results, see Dragomir and Sandor (1987) and Koskela (1979).
This page intentionally left blank
Chapter 5
5.1.
Hermite-Hadamard’s and JensenPetrovik’s Inequalities
Hermite-Hadamard’s Inequality
On November 22, 1881, Hermite (1822-1901) sent a letter to the journal Mathesis. An extract from that letter was published in Mathesis 3 (1883, p . 82). I t reads as follows (see Mitrinovii. and Lackovii., 1985): “Sur deux Iimites d’une inte‘grale de‘finie. Soit f ( x ) une fonction qui varie toujours dans le m h e sens de x = a, ri x = b. On aura les relations
ou bien
a
suivant que la courbe y =f ( x ) tourne sa convexite‘ ou sa concavite‘ vers l’axe des abcisses. En faisant dans ces formules f ( x ) = 1 / ( 1 +x ) , a = 0 , b = x il vient XZ x - -< 2+x
log(1 + x ) < x -~ x 2 2(1+x)‘
3,
It is interesting to note that this short note of Hermite is nowhere mentioned in mathematical literature, and that these important inequalities (of Hermite) are not widely known as Hermite’s result. His note is recorded neither in the authoritative journal Jahrbuch iiber die Fortschritte der Mathematik nor in Hermite’s collected papers, which 137
138
5. Hermite-Hadamard's and Jensen-Petrovic's Inequalities
were published "so US les auspices de l'Academie des sciences de Paris par Emile Picard (1905-1917), membre de l'Institut." In the booklet on Hermite by Jordan and Mansion (1901), Mansion published a bibliography of Hermite's writings, but this note in Mathesis was not included. Beckenbach (1948, p. 441), a leading expert on the history and theory of complex functions, wrote that the first inequality in (5.1) was proved by Hadamard (1893, see, in particular, pp. 174-76, 186) and apparently was not aware of Hermite's result. It should be mentioned that Fejer (1880-1959), while studying trigonometric polynomials (1906), obtained inequalities which generalize that of Hermite, but again Hermite's work was not acknowledged. In its original form, Fejer's result reads: "Consider the integral f ~ f ( x ) g ( xdx, ) where f is a convex function in the interval (a, b) and g is a positive function in the same interval such that g(a
+ t) = g(b - t),
1 2
O ~ t ~ - ( a + b ) ,
i.e., y = g(x) is a symmetric curve with respect to the straight line which contains the point (Ha + b), 0) and is normal to the x-axis. Under those conditions the following inequalities are valid: ~
f(a;b)
J a
~
~
g ( x ) d x J~ f ( x ) g ( X ) d X ~ f ( a ) ; f J( g(x)dx." b) a
(5.2)
a
Clearly, for g(x) == 1 and x E (a, b) we obtain Hermite's inequalities. Therefore, Hermite's important result in (5.1), which provides a necessary and sufficient condition for a function f to be convex in (a, b), has not been credited to him in mathematical literature. In fact, the term "convex" also stems from a result obtained by Hermite in 1881 and published in 1883 as a short note in Mathesis, a journal of elementary mathematics. There are results of lesser importance which have received more attention in the area of inequalities, but unfortunately this fundamental work of Hermite has been frequently cited without the correct identification of its original author. It is obvious that (5.1) is an interpolating inequality for (5.3)
5.1. Hermite-Hadamard's Inequality
139
More than twenty years after Hermite's work was published, J. L. W. V. Jensen (1905, 1906) defined convex functions (i.e., J-convex functions) using inequality (5.3). His remark, which we cite here, was shown to be justified: "Il me semble que la notion de fonction convexe est a peu pres aussi fondamentale que celles-ci: fonction positive, fonction croissante. Si je ne tromp pas en ceci, la notion devra trouver sa place dans les expositions elementaires de la theorie des fonctions reelles" (see Jensen, 1906, p. 191). Indeed, it is not easy to give a complete treatment of the literature when studying convex functions, but the importance of Hermite's result is obvious. Since the inequalities in (5.1) have been known as Hadamard's inequalities, in this volume we shall call them the Hermite-Hadamard's inequalities. In the classic book of Hardy, Littlewood, and P6lya (1934, 1952, p. 98) the following result is given:
5.1. Theorem. A necessary and sufficient condition that a continuous functionf(x) be convex in (a, b) is that x+h
f ( x ) ~ 2J ~ f(t)dt
for
a ss x r-h-c x-r h ss b.
(5.4)
x-h
It can be shown that this result is equivalent to the first inequality in
(5.1) whenfis continuous on [a, b]. However, it remains unclear by who and when the transition from the inequality (5.1) to the convexity criterion in (5.4) was made. Note that a generalization of Theorem 5.1 is already given in Theorem 2.14. In the following we shall give some other generalizations. For f E C(I), h >0, and x E 11 (h ) = {t:t - h, t + h e I}, the operator Sh defined by x+h
ShU, x) =
2~
J f(t) dt
(5.5)
x-h
is often called a Steklov function, although it is an operator mapping e(I) into C(I1 ) . For a finite interval I = [a, b], the maximum value of h can be (b - a)/2. In this case 11 contains a single point and Sh becomes a functional. The Hermite-Hadamard inequality (5.4) now has the form f ( X ) ~ S h U , for X ) xEI1(h) and is equivalent to the convexity of the function. The iterated Steklov operators (with the step h > 0) S ~ (n E .N)
140
5. Hermite-Hadamard's and Jensen-Petrovlc's Inequalities
are defined by x+h
Sh(f, h) =
s2(f, x) =f(x),
2~
f
Sh-1(f, x) dt,
(5.6)
x-h
where n E X, x E In(h) = {t:t - nh, t + nh E I}. For convenience we write S; instead of sL and (5.4) becomes s2(f, x)::5 Sh
E
C(I) is convex iff for every h > 0 and
(5.7)
f(x) ::5 Sh(f, x) holds for every fixed n.
5.3. Theorem. A function f x E In(h) the inequality
E
C(I) is convex iff for every h > 0 and (5.8)
holds for every fixed n.
5.4. Remarks. (a) Theorem 5.2 can be found in Horova (1968). (b) It is known (see, for example, Timan, 1963) that f(x) can be uniformly approximated by Sh(f, x) as h ~o. (c) The operator Sh can be used for the following characterization of convex functions (see Kocic, 1984): Let I = [a, b]. Then the function f E C(I) is convex iff for every HE [0, (b - a)/2) and x such that [x - h, x + h] E I and for every h E (0, H) the inequality SH(f,X)2=Sh(f,X)
holds.
(5.9)
0
It is easy to see that Theorem 5.3 generalizes the convexity criterion based on the inequality (5.4) (we obtain (5.4) by letting h ~0). Theorems 5.1-5.3 are all related to the first inequality in (5.1). Note that the first inequality is stronger than the second inequality in (5.1); i.e., the following inequality is valid for a convex function f: b
b
_1_ ff(x) dx _f(a +2 b) ::5 f(a) +2 f(b) __ 1_ ff(x) dx. b-a b-a a
a
(5.10)
5.1. Hermite-Hadamard's Inequality
141
Indeed, (5.10) can be written as b
b: a
f
d X : 5 (f(a) ~ + f(b) + 2f(a: b)),
f(x)
a
which is 2 b-a
f
(a+b)/2
f a
b
f(x)dx+_2b -a
f(x)dx
(a+b)/2
This immediately follows by applying the second inequality in (5.1) twice (on the interval [a, (a + b )/2] and [(a + b )/2, b D. By letting a = -1, b = 1, we obtain the result due to Bullen (1978). However, the second inequality in (5.1) can also be used as a convexity criterion. In Roberts and Varberg (1973, p. 15), the following result is given:
f
5.5. Theorem. A function [a, b] we have
-l-f f
E
qa, b] is convex iff for every s < t in
I
(x ) dx :5 f(s)
t-s
+ f(t).
(5.11)
2
More general results are given by Rado (1935). In the following we state some characterization results given in his paper. Let f (x) be a positive and continuous function on (a, b) and let u, v E ~ . We define 1 ( 2h
I(f,x,h,u)=
fh -h
{
f(x + tt dt
)1IU
h
f
eXP(2~
logf(x + t) dt)
for
u=O;
-h
1 )1IV ( If(x - h)V + f(x + h)V
A(f, x, h, v) = {
(f(x + h )f(x - h
»112
for
v
=
O.
Further, let E denote the set of all pairs (u, v) such that I(f, x, h, u) :5A(f, x, h, v)
(5.12)
142
5. Hennite-Hadamard's and Jensen-PetroviC's Inequalities
holds for all x and h satisfying a < x - h < x + h < b and all positive, continuous, and convex functions f on (a, b). Similarly let E be the set of points of (u, v) such that (5.12) holds for all such x, h and all positive and continuous functions f on (a, b). The main result in Rado's paper concerns the explicit determination of the sets E and E, and the following theorems is proved:
5.6. Theorem. (a) (u, v) belongs to E iffone of the following conditions is satisfied: (i) u $ -2 and v 2': 0; (ii) -2 $ u $ -! and v 2': (u + 2)/3; (iii) -! $ u $1 and v 2': (u log2)/(log(1 + u»; and (iv) 1 $ u and v 2': (u + 2)/3. (b) (u, v) belongs to E iff3v - u - 2 $ O. In Theorem 5.5 if we replace the word "convexity" by "concavity," the inequality "/$A" in (5.12) by "/2':A" and E, E by E* and E*, respectively, then the following theorems is true (Rado, 1935):
5.7. Theorem. (a) (u, v) belongs to E* iff one of the following conditions is satisfied: (i) u $ -2 and v $ (u + 2)/3; (ii) -2 $ u $ -1 and V$O; (iii) -15U5-! and V2':(ulog2)/(log(l+u»; (iv) -!5u51 and v 5 (u + 2)/3 and (v) 15 u and v $ (u log 2)/(log(1 + u ». (b) (u, v) belongs to E* iff 3v - u - 22':0. As a simple consequence of Theorems 5.6-5.7, Rado (1935) proved the following result:
5.8. Theorem. Let f be a positive and continuous function on (a, b). Then (a) the inequality in (5.12) is equivalent to the convexity of f iff (u, v) satisfies the conditions: (i) 3v - u - 2 = 0 and (ii) either -2 $ u $ -! or 1 $ u < 00; (b) the reverse inequality in (5.12) is equivalent to the convexity of f iff (u, v) satisfies the conditions (i) 3v - u - 2 = 0 and (ii) either u 5 -2 or -! $ u $1. The following result of Pitenger (1980) is a consequence of Rado's results (see Lupas 1983):
143
5.1. Hermite-Hadamard's Inequality
5.9. Corollary. Let 0 < a
< b,
-m
< r < ~0 and define
]
log2 log(r 1)
+
for r>-l,r+O, for r =0,
r+2
for r s - 1 .
Let r, be defined similarly with min replaced by max. Then M['"(a, b ) 5 L,(a, b) 5 M[rzl(a,b)
(5.13)
holds, where L,(a, b ) is the generalized logarithmic mean given by L,(a, b ) =
{
- l(bbl a a ) l l ( b -0) for r=O ( b - a)/(log b - log a ) f o r r = -1, [(br+'- ar")/((r l)(b - a))]", f o r r # 0, -1,
+
and L,(a, a ) = a. The equality in (5.13) holds iff a = b or r = 1, -2. Moreover, the values of r, and r . are sharp.
-4,
or
5.10. Remarks. (a) LupaS (1983) also proved (5.12) by using (5.13). (b) Rado's (1935) results are further generalized in Hartman (1972).
Namely, Hartman considered the monotonicity of the difference A - Z as a function of x and h when f is positive, increasing, and convex. He also showed that Rado's inequalities are valid under some weaker conditions. This, of course, is natural because the classes of functions he considered are narrower than those in Rado's paper; i.e., positive convex functions are also monotonic. Another generalization of Hermite-Hadamard's inequalities is given in Vasi6 and LackoviC (1974, 1976) and LupaS (1976):
5.11. Theorem. Let p , q be given positive numbers and a , 5 a < b 5 b,. Then the inequalities
144
5. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
hold for A = (pa + qb )/(p tions f: [aI' b d IR ~ iff
y
+ q), Y > 0, and all continuous convex funcb-a p+q
~ - - m i n { pq}. ,
(5.15)
5.12. Remarks. (a) Observe that (5.14) may be regarded as a refinement of the definition inequality for convex functions. (b) For p = q = 1 and y = (b - a)/2, (5.15) is the HermiteHadamard's inequality. We now show that under the same conditions Hermite-Hadamard's inequality yields the following refinement of (5.15):
f
A+y
f(pa p
+ qb) ~ ~ f(t) dt ~ ~{f(A- y) + f(A + y)} ~ p f ( a +) qf(b) +q 2y A-y 2 p +q (5.16)
First, observe that if O < y ~ [ ( b - a ) / ( p + q ) ] m i n { p then , q } by , considering two cases (0 < P ::5 q and 0 < q < p ), we can easily verify that a ~ A - y < A + y so ~ bthat , f is defined on [A-y,A+y]. By Hermite-Hadamard's inequality in (5.1) with a, b replaced by Ay, A + y, we obtain
f
A+y
f(A) ~ 12 y
f(t) dt ~ 12[f(A - y) + f(A + y)].
(5.17)
A-y
By the definition of convexity, we have for a
Hence, taking
Xl
= a and X3 = b,
~Xl < X 2 < X 3 ::5 b
we obtain (5.18)
f(A+y)::5
b - (A + y) A +Y- a b-a f(a)+ b-a f(b).
(5.19)
5.1. Hermite-Hadamard's
Inequality
145
From (5.17)-(5.19) we then have A+y
f(A) ~1
2y
-
J
f(t) dt
A-y
~ 1-{f(A-
y) + f(A + y)}
2
~ !{b -Af(a) + A - a f(b)} =pf(a) + qf(b) , 2
b-a
b-a
p+1
proving (5.16). (c) Note also that (5.14) can be proved from the integral analogues of Jensen's and Lah-Ribaric's inequalities, i.e., from the inequalities b
f(
b
b
b
(J p(x)g(x) dx)/ (J p(x) dX)) ~((J p(x)f(g(x» dX) / (J p(x) dX)) a
a
a
a
~ M - g f(m) + g - m f(M), M-m
M-m
where m ~ g ( x ) ~forM all !E[a, b], g = ( f ~ p ( x ) g ( x ) d x ) / ( f ~ p ( x ) d x ) . Indeed, if we make the substitutions p(x)=l, g(x)=x, a=A-y, b = A + y, m = a, and M = b, we obtain the result that (5.14) is valid if the following condition holds:
a
~ A-
y
~b
and
a
+y
~ A
~ b.
(5.20)
We can then easily show that conditions (5.15) and (5.20) are equivalent. Therefore, condition (5.15) is sufficient. Now we show that it is also necessary. Let p >q and assume that (5.15) is not valid, i.e., y> (q(b - a»/(p + q). Since the function f(x) = a - x for x < a and f(x) = 0 for x2:a is convex, (5.14) becomes: 0 ~ ( a - A - y ) / 2 y ~a 0 con, tradiction. Therefore we must have y ~ q(b - a)/(p + q). Similarly, for the case p
146
5. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
(e) Inequalities (5.14) can also be used as convexity criteria. Of course, the first inequality is the same as (5.4), and the related result for the second inequality (i.e., the generalization of Theorem 5.4) is given in Kocic (1984). (f) Using a proof similar to that given in (b), we can prove the following generalization of (5.10): Under the same conditions as stated in Theorem 5.11,
f
A
~ 2y
A
~
f
A
f(t) dt - f(pa p ~
+ qb) :spf(a) + qf(b) - ~ +q p +q 2y
A
~
f(t) dt. (5.22) ~
o
Generalizations of Theorem 5.11 for positive linear functionals are given in Pecaric and Beesack (1986):
5.13. Theorem.
Let f be a continuous convex function on an interval I ~ [m, M], where -00 < m < M < 00. Suppose that g: E - [R satisfies m:sg(t):SM for all tEE, gEL; and f(g)EL. Let A:L-[R be an isotonic linear functional with A(l) = 1, and let p = Ps» q = qg be nonnegative real numbers (with p + q > 0) for which A(g) = (pm
+ qM)/(p + q).
(5.23)
Then f(pm + qM) :SA(f(g» :spf(m) + qf(M). p+q p+q
(5.24)
Proof. Observe first that since m :s A(g) -s M, there always exist p ;::: 0, q ;::: 0, (p + q) > satisfying (5.23). The first inequality in (5.24) is just (2.6), while the second of (5.24) is (3.43). 0
°
5.14. Theorem.
Suppose that L satisfies conditions Ll-L3 defined in (3.27)-(3.29) on a nonempty set E and that f is a continuous convex function on an interval I, while g, h E L with f(g),f(h) E L. Let A, B be isotonic linear functionals on L for which A(l) = B(l) = 1. If A(h) = B(g), E[ E.s4 satisfies A(CE) > 0 and A (C Ez) > 0 where E 2 = E\E 1 , and if A(hCE)/A(CE) :sg(t) :sA(hCEz)/A(CE,) for all tEE,
(5.25)
f(A(h»:S B(f)(g) :sA(f(h».
(5.26)
then
5.1. Hermite-Hadamard's Inequality
Proof.
147
By Jessen's inequality we have i
= 1, 2.
(5.27)
Applying Theorem 5.13 «5.24» to the isotonic linear functional Band the function g with m=A(hCE,)/A(CE,), M=A(hCE,)/A(CE,), for p= A(CE,), q = A(CE,), we have P + q = A(CE) = A(1) = 1 and B(g)=A(h)=A(hCE,)+A(hCEz) =
pm+qM . p+q
Hence, by (5.24) we obtain f(A(h» = f(B(g» :s B(f(g» :s A(CE,)f(
~ ~ h ~ ~ +/ )A(CE,)f( ~ ~ ~ : ) )
:sA(f(h)CE,) +A(f(h)CEz) (by (5.27»
= A(f(h», proving (5.26).
0
Note that again the inequality (5.26) is a refinement of Jessen's inequality and is also a generalization of an inequality given in Vasic, Lackovic, and Maksimovic (1980). Wang and Wang (1982) proved the following generalization of Theorem 5.11:
5.15. Theorem. Let f: [a, b ] ~IR be a convex function, Xi E [a, b], and = 0, 1, ... , n). Then the following inequalities are valid:
Pi> 0 (i
n-l
+
2: xi1 -
n
tj + 1)t1 ••• tj
j=1
IT dt,
+ X n t 1 t 2 ••• tn )
i=1
(5.28) where
(£1'i
n
+ f3;)/2 = ~ 1Pk
/
n
k ~ - Pk 1 for i = 1, ... , n
(5.29)
148
5. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
and
O:s a i < f3i :s 1 for
i
= 1, ... , n.
(5.30)
Proof. (Pecaric, 1989a). By the integral and discrete versions of Jensen's inequality, we have
f(~PiXi/itPi)
f{n (f3j - aj)-l f
fJ,
n
=
)=1
f ... f fJ,
n
:s)] (f3j - a'j}-l
a1
fJ,
n
-s
I ~(f3) -
aJ-1
n
/
n
~Pi-
f(xo(1- (1)
an
fJn
f ---f eXt
= ~pJ(Xi)
fJn
(f(xo)(l - (1)
(1'"
o
5.16. Remarks. (a) In Pecaric (1989a) the condition in (5.30) is weakened and a generalization to Theorem 5.15 for convex functions of several variables is given. Another extension of Theorem 5.15 is given in Hu (1986). (b) Generalizations of Hermite-Hadamard's inequalities are also given in Lackovic and Stankovic (1973) and Lackovic (1969). Note that the results in Lackovic and Stankovic (1973) are simple consequences of the well-known results for support line of convex functions. For example, by integration and Theorem 1.6 we can obtain the following generalization
5.1. Hennite-Hadamard's Inequality
149
of the first inequality in (5.1): b
f(c)
b
+ f ~ ( c ) ( xf p(x) dX) /
(f p(x) dX) -
a
cf~(C)
a b
b
~ ( fp (x)f(X)dx)/(JP(X)dx) a
where
for
a
(5.31)
a
f is convex and p is a positive integrable function.
D
Another generalization of the first inequality in (5.1) can be found in ~ u ~ v and a, E IR) be an Neuman (1986). Let x(t) = I : ~ ~ ua .t' (for algebraic polynomial of degree not exceeding v and let a = min{x(t): c ~
°
t ~ d } , b = m a x { x ( t ) : c ~ t ~ d } .
5.17. Theorem.
Let f be a convex function on (a, b). Then d
f ( ~ uarm r) ~ J M n ( t ) f ( ~artu r) dt,
(5.32)
c
where M; is a B-spline and m, the rth generalized symmetric mean of to, ... , tn (see Section 1.3).
The following generalization of the first inequality in (5.1) for convex functions of several variables is given in Neuman and Pecaric (1989). 5.18. Theorem. Let f be a convex function vol([Xo, ... ,xd) > 0, Xi E IRk, i = 0, 1, ... ,n. Then f(me, , ... , mek)
on
IRk
and
let
f(xf', ... , Xfk)M(xI Xo, ... , xn ) dx, (5.33)
~J IRk
where f i
= 1, 2, ... , ; i = 1, 2, ... , k.
Proof. Consider Jensen's inequality for multivariate continuous convex functions on IRk, ( ~ 1 " ' " ~ k ) E C(lRk), and let du be a probability measure on IRk. Then
f(
f ~ 1 du, ... , IRk
J ~ kdp:) ~ J f( IRk
IRk
1>1' ... ,
~ k )d u,
(5.34)
150
S. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
and the equality in (5.34) holds iff f E III (IRk) (the space of all k-variate polynomials of total degree :51). Let df.-l(x) = M(x I Xo, ... ,xn ) dx. Then du is a probability measure on IRk. To establish (5.33) we let t(x) = Xi; i = 1, 2, ... ,k in (5.34). Hence the inequality follows from Theorem 1.6(e). 0 5.19. Theorem.
Under the assumptions of Theorem 5.18, we have
[ ( -n +1 1 2:n) xi:S i=O
f
IRk
[(x)M(x I Xo, ... , Xn ) dx:s - 1 n [(Xi), n + 1 ;=0
2:
and the equality in (5.35) holds iff[
E
(5.35)
III (IRk).
Proof. The first inequality in (5.35) follows immediately from (5.33) and (1.58) by letting t l = ... = t k = 1. To obtain the right-hand side inequality in (5.35) we apply (1.56) and
f
Ago ... APn dA = r(po + 1) ... f(Pn + 1) n
S"
r(Po+"'+Pn+n+1)'
where Po, ... , P« > -1 and f(-) is the gamma function. We then obtain
As a special case we obtain: 5.20. Theorem. Let a = [x,, ... ,xd where k::::: 1 and volk( a) > O. If [ : a ~IR is a convex [unction, then (5.36) and equalities hold iff[
Proof.
E
III (IRk).
Immediate from (5.35) and (1.57).
0
5.21. Remark. Using a proof similar to the proof of Theorem 5.18 we can give a generalization of Theorem 5.17 which includes Theorem 5.18 as a special case (see Neuman and Pecaric, 1989). 0
5.2. Jensen-PetroviC's Inequalities
151
Let X = {Xo, ... , X n } (n > k 2= 1), and assume that any subset that consists of k + 1 points spans a proper simplex. let Xj = X \ {x, : ::5 j ::5 n}. Then a multivariate B-spline can be written as M(·I X) (with knot set X). Similarly let M(·\ X) denote the multivariate B-spline with knot set Xj . For real numbers Ao, ... , An with ~ 7 = Ao j = 1, let y = ~ 7 ~ A o jXj and let z= ( ~ 7 = o x j ) / +( n1). The following generalization of Theorem 5.11 is a special case of a more general result of Neuman (1990):
°
5.22. Theorem.
f
Let f be a convex function on ~ k . Then f(x)M(x I X) dX::5
IRk
t
f
Aj
]-0
f(x)M(x I X) dx
(5.37)
IRk
holds iff y = z, and equality in (5.37) holds ifff
E
TIl
(~k).
Note that Neuman's general inequality is also a generalization of Fejer's inequality given in (5.2).
5.23. Remark. Other generalizations of Hermite-Hadamard's inequalities were obtained by Zhang (1987), Neuman (1988), Sandor 0 (1988), and Alzer (1989c).
5.2.
Jensen-PetroviC's Inequalities
5.2. 1.
Inequalities for Starshaped Functions
The following theorem is proved in Vasic and Pecaric (1979a): 5.24. Theorem.
Let x, p and q, be nonnegative n-tuples. Then (5.38)
holds for every n, x, p, and q such that
X; E
[0, a] (i
n
2. p.x, 2=Xj
i=1
= 1, ... , n) and
n
for
j = 1, ... ,n
and
2. PiX; E [0, a]
i=1
(5.39)
iff ep : [0, a] ~ ~ is a decreasing function. Similarly, the reverse inequality holds iff ep is increasing. (i) If ep is decreasing, then e p (5.38). (ii) For n = 2, XI = X, Xz = h,
Proof.
( ~ 7 =PiXi) 1 ::5
PI
ep(x). Thus we obtain
= pz = 1, ql =
1,
and
qz
= p,
152
S. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
(5.38) becomes (1 + P )¢(x + h) ::; ¢(x) + p¢(h). As p ~0, we have ¢(x + h) $¢(x). The proof for the reverse inequality is similar. 0
5.25. Remark. For Pi = 1 (i = 1, ... , n) the first condition in (5.39) is satisfied; thus we can obtain a result of J. L. W. V. Jensen (1906) from Theorem 5.24 (see also Hardy, Littlewood, and P6lya, 1934, 1952, p. 83): We say that f(x)/(x - x o) is a decreasing (increasing) function if ...J...J--'>.,. f(xt) :> Xt-rXO -r- X2 ....,... Xt-XO
Letting ¢(x) = f(x)/x and qi = p.x, (i have:
= 1, ...
«) -
f(x2) • X2- XO
o
, n) in Theorem 5.24, we
5.26. Theorem. Let x and p be two nonnegative n-tuples such that (5.39) is satisfied. If f(x )/x is a decreasing function, then (5.40)
If f(x)/x is an increasing function, then the reverse of the inequality in (5.40) holds. 5.27. Corollary. If the conditions of Theorem 5.26 are satisfied and X2 - ... - Xn > 0 (2:0 iff is defined at 0), then
Xt -
(5.41) The following generalization of Theorem 5.26 is given in Vasic and Pecaric (1979a): 5.28. Theorem. such that
Let p be a nonnegative n-tuple and x be a real n-tuple
(5.42)
5.2. Jensen-PetroviC's Inequalities
153
If (f(x) - f(xo»/(x - xo) is an increasing function, then
%1 pd(Xk):5 Af(%1PkXk) + B(%1 Pk -
1)f(xo)
(5.43)
holds, where A
=
(%1 Pk(Xk- xo»)/ (%1 pix; -xo), (5.44)
B=
(%1 PkXk)/(%/kXk-xo).
Proof. This is a simple consequence of a result given in Remark 3.45(b) by letting either m = Xo and M = ~ ? = P1 iXi or m = ~ ? = P1 iXi and M = Xo. 0 5.29. Theorem.
Let f(x)/x be an increasing function.
(a) IfO<xl:5'" :5xn and if there exists an m (:5n) such that
Pm + 1 = ... = Pn = 0, where P k = ~ 7 = I P i P' k = Pn - Pk - 1 (k=2, ... ,n), and (5.40) holds. If there exists an m (:5n) such that
P1 = Pn ,
then
Pm + 1 = ... = Pn = 0, then the reverse of the inequality in (5.40) holds, i.e.,
(5.45)
(b) Let Xl:5"':5x m:50:5Xm+l:5"':5X n and f(O) =0. Then the inequality (5.40) is valid if either (i) there exists a i. 1:5 j :5 m + 1, such that PI = ... =
Pm + 1 = ... = Pn = 0,
~ + 1 '
or (ii) there exists a k, m s; k :5 n, such that PI = .. ·=Pm=O, The inequality in (5.45) holds if there
Pk + 1 = ... = Pn = O. exist integers j and k, 1:5 j:5 m + 1,
m :5 k :5 n, such that PI = ...
=
= 0,
~ - 1
0:5 Pm + 1:::s;· .. :::s; Pk:::s; 1,
1
~ ~ ~
Fk+ 1 =
~ Pm
~ 0,
= Fn = O.
154
S. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
5.30. Remarks. (a) A new proof of Theorem 5.29 is given in Vasic and Pecaric (1979a). In fact, they proved Theorem 5.29 under weaker conditions. (b) Vasic and Pecaric (1979a) also proved that inequality (5.40) holds for every n and every f such that f(x)/x is a decreasing function iff Pi ~ 1 (i = 1, ... , n). (c) If inequality in (5.40) holds for all positive n-tuples x and p, then f(x) = cx where c is a real number (Hardy, Littlewood, and P6lya, 1934, 1952, p. 84). 0
5.2.2.
Inequalities for Convex Functions
First we give the following result:
5.31. Theorem. Let f be a convex function on [0, a). If the conditions of Theorem 5.26 are satisfied, then (5.46)
Proof. 5.26.
The function f(x) - f(O) satisfies the conditions of Theorem 0
5.32. Remarks. (a) For Pi = 1 (i = 1, ... , n). (5.46) becomes (5.47) This is the well-known Petrovic's inequality for convex functions (see Petrovic, 1932, or Mitrinovic, 1970, p. 28). (b) Inequality (5.45) was first given by Pipoviciu (1944) under the incorrect assumptions that Pi > 0 and Xi >0 (i = 1, ... ,n). Vasic (1968b) noted that this result is true for Pi ~ 1 and Xi ~0 (i = 1, ... , n). In fact, Vasic's conditions are necessary and sufficient for the inequality in (5.46) to hold for every n and every convex function f (see Vasic and Pecaric, 1989).
5.2. Jensen-PetroviC's Inequalities
155
(c) Vasic (1968b) considered the following generalization of (5.46):
~ 1Pk!(Xk) :5 r f ( ~ ~ 1PkXk) -
,n and where Xk E [0, a) for k = 1, , n) and conditions are Pk;:==: 1 (k = 1, nt- 1
nz-l
2: PkXk = k=l
2:
~ 1Pk)[(0),
(r -
1/r I : k ~ l P k EX [0, k a).
(5.48) His
n
PkXk = ...
=
2:
PkXk'
k=nr-l
k=nt
For Pk = 1 (k = 1, ... , n), we obtain an inequality of Marshall, Olkin, and Proschan (1967) which includes, as a spcial case, the inequality
-1 2:n
n k=l
s
(n)S-l( 2:
lak - al :5 -
2
n
k=l
lak -
)S
al ,
where a = (lin) I: k=l ai; ak;:==: 0 and s;:==: 1. Moreover, Vasic's conditions can be replaced by 1 n O:5Xi:5-2:PkXk for r k=l
i=l, ... ,n.
(5.49)
o
We note that the special case Pi = 1 (i = 1, ... , n) and r = 2 was considered by Petrovic (1938) with an aspect of applications in geometric inequalities (Pavlovic, 1961). Also note that inequalities (5.46) and (5.48) are equivalent. To see this, by the substitution P i ~ p J (5.48) r follows from (5.46). Similarly, for r = 1 (5.48) yields (5.46). A similar consequence of Theorem 5.28 is: 5.33. Theorem. Let f: I ~IR be a convex function where Xo and I:k=lPkXk are in 1. Let the n-tuples x and p satisfy the conditions of Theorem 5.28. Then (5.43) holds.
Proof.
The function
f satisfies the conditions of Theorem 5.24.
0
5.34. Remarks. (a) Inequality (5.43) for convex functions is proved by Giaccardi (1955) under stronger conditions. Theorem 5.33 is proved in Vasic and Stankovic (1973). In fact, they proved a generalization of Theorem 5.33 for g-convex functions. Vasic and Pecaric (1979a) showed that this result for g-convex functions can be obtained from a similar generalization of the discrete case in Theorem 3.37 (see Remark 3.45(b».
156
5. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
(b) A generalization of Theorem 5.33 for positive linear functionals is given in Beesack and Pecaric (1985a): Let L, A satisfy the conditions Ll, L2 and AI, A2 defined in (3.27)-(3.31) and let gEL. If xo*A(g) and either xo:S g(t) :s A(g) for all tEE or A(g) :s g(t) :s Xo for all tEE, and if (jJ is convex on [xo, A(g)] (or on [A(g), xoD and (jJ(g) E L, then A((jJ(g»:s ([A(g) - A(I)xo](jJ(A(g» + [A(I) - 1]A(g)(jJ(xo)}/[A(g) - xo].
o The following generalization of the well-known Brunk-Olkin Inequality (see, e.g., Mitrinovic, 1970, pp. 47-48, or Beckenbach and Bellman, 1961, 1965, pp. 47-49) is given in Barlow, Marshall, and Proschan (1969): 5.35. Theorem. Let xl:s·· ·:Sxs:sO:SXs+I:S··· :sxn (SE{O, 1, ... , n}), X; E 1(1 :s i :s n; 0 E I), and p be a real n-tuple. (a) The inequality in (5.46), i.e.,
~ lp J(x;) ~ f ( PiX;) ~ + ( ~ 1p; -1 )f(O) holds for every convex function f : I
o:s Pk :s 1
~[ffi
1:s k -s sand
for
(5.50)
iff
0 :s Pk :s 1 for s + 1 :s k :s n. (5.51)
(b) Let r..?=IP;X;
E
I. Then the inequality
(5.52) holds for every convex function f : I f}:SO
for
i<m,
f } ~ 1 for
~[ffi
iffthere exists an m :s s such that
m:Si:ss,
and
P;:s0
for
i ~ s + l ;
(5.53) or there exists an m f}:SO
for
i :ss,
~s
such that
P; ~ 1 for
s
+ 1 :s i :s m, and P;:s 0 for
i
< m.
(5.54)
5.2. Jensen-PetroviC's Inequalities
157
Proof. Let Theorems 2.19 and 3.3 (i.e., Remarks 2.20(a) and 3.4) hold for n + 1 with Xi = Xi and Pi = Pi (1 ~ i ~ n + 1). By the substitutions Xi=X;
and
P;=P;
for
and P;=P;-I
X;=X;_I
Xm + 1 = 0,
1 ~ i ~ m ;
we obtain Theorem 5.35.
for
m + 2 ~ i ~ n + 1 ;
0
5.36. Remark. We have shown that Theorem 5.35(a) is a special case of Theorem 2.19, and that Theorem 5.35(b) is a special case of Theorem 3.3. Now we show that the reverse implications are also valid (Pecaric, 1984h). Without loss of generality we may assume that P; = 1. Then (2.19) and (5.50) are equivalent and (3.2) and (5.52) are equivalent. In this case (5.51) becomes O ~ P k ~ P for n
1 ~ k ~ s and
Fk-I;:::O
for
O ~ F k ~ P for n
Pk;:::O
for
Fk;:::O,
1 ~ k ~ s and
Pk -
I ;:::
0 for
Fk;:::O
1 ~ k ~ n - 1a nd
which is equivalent to (2.20). Similarly, for m ~ ~ Ofor
i<m,
~ ; : : : P n
for
s + 1 ~ k ~ n ; i . e . ,
s
+1
for
P;-I ~0 for
i<m,
~0
for
i<m
and
becomes
i e:s
+ 1; i.e.,
i e.s
+ 1; i.e.,
m ~ i ~ sand
P ; ~ O for
P,
i.e.,
and
P ; ~ O for ~ ~ Ofor
~ n,
2 ~ k ~ n ,
~ s (5.53)
m zi i zs s
~k
P; ~ 0 for i > m,
which is the condition in (3.3). By a similar argument for m ;::: s (5.54) becomes ~ ~ Ofor
i
P;;::: t; for
~ s ,
s + 1 ~ i ~ m and
P ; ~ O for ~ ~ Ofor
F.-I
i zs s,
~0
for
s + 1 ~ i ~ m and
P ; ~ O for
P, ~0
for
i
<m
and
i<m;i.e.,
P;
~0
for
i > m.
i>m; i.e.,
158
5. Hermite-Hadamard's and Jensen-PetroviC's Inequalities
Thus we again obtain the condition in (3.3). Consequently, we have proved Theorems 2.19 and 3.3 with the assumption that 0 E 1. Suppose that 0 $ I, and let I = [a, b]. If f is a convex function on [a, b], then F(t) = f(t + (a + b )/2)) is a convex function on [- (b - a)/2, (b - a)/2]. Thus in the case P; = 1, from (5.50) (and (5.52)) we have
i.e., f
n (
a
(
+
b)) ::s;("?:.)t:/ J
-
(a
n
~ P ; t;+-2-
a
(
+
b)
t;+-2- ,
which is
where we have used t, = X; 0 completes the proof.
+ b )/2 for
[a, b] and 1::s; i ::s; n. This
X; E
Note that similar assertions also hold for some of the results given later. To obtain an analogue of Theorem 5.35 from Theorems 2.21 and 3.6, we let I\.(x) = g(x) = g(x) + sex), where sex) = 0 for X E [a, to] and sex) = 1- G(b) for X E (t a , b], and
f
G(t)
=
f b
t
dg(x),
G(t)
a
=
dg(x).
t
5.37. Theorem. Let to E [a, b] be fixed and f be continuous and monotonic with f(to) = O. Let g be a function of bounded variation. (a) If O::s; G(t) ::s; 1 for
a s: t ::s; to,
4J: I
then for every convex function we have b
O::s; G(t) ::s; 1 for ~IR
such that f(x) E I for all x
b
a
(5.55) E
[a, b]
b
J4J(f(t» dg(t)"?:. 4J(J f(t) dg(t») + (J dg(t) a
to < t s; b,
a
1)4J(0).
(5.56)
5.2. Jensen-Petrovic's Inequalities
(b) If J ~ f ( t dg(t) )
E
159
I and either
there exists an s ::s to such that G(t)::s 0 for t < s, G(t)
~1
for
s ::s t s: to, and G(t)::s 0 for t > to,
(5.57)
or there exists an s ~ to such that G(t) ::s 0 for t < to, G(t) ~ 1 for to
b
b
J¢(f(t» dg(t) ::s ¢ (J f(t) dg(t») + (J dg(t) - 1) ¢(O). a
a
(5.59)
a
5.38. Remarks. (a) For Pk = (-1)k- 1hk> 1 ~ h, ~ ... .2: 0, we obtain the Brunk-Olkin Inequality from Theorem 5.35. It is known that this inequality is a generalization of results given by Szego (1950), Weinberger (1952), and Bellman (1953) (see also Mitrinovic, 1970, p. 1; Beckenbach and Bellman, 1961, 1965, pp. 47-48, or Karlin and Studden, 1966, p. 431). (b) A generalization for functions with increasing increments was given in Pecaric (1984b) with conditions (5.57) and (5.58) replaced by, respectively, ~1
for
a s; t < to,
G(t) ::::; 0
for
to::::; t s: b;
(5.57')
G(t) ::::; 0
for
a::::; t < to,
G(t) ~0
for
to::::; t s: b.
(5.58')
G(t)
(c) In the case to = a, inequality (5.56) and a similar result for functions with increasing increments was proved by Brunk (1956, 1964). (d) Some additional generalizations can be obtained from Theorems 2.21 and 3.6 if we let A(X)=g(x)+S(x), where S(x)=O for a::sx
= Xo·
(c) Pecaric (1983a) used Fuchs' generalization of a theorem on majorization to obtain some similar results. He also obtained some refinements of Petrovic's inequality. These results are extensions of the results in Vasic and Stankovic (1973). 0
160
5. Hermite-Hadamard's and Jensen-Petrovic's Inequalities
5.39. Corollary. Let to E [a, b] be fixed and f be continuous and monotonic with f(to) = O. Let 1J be continuous and convex on I such that f(x) E I for all x E [a, b] and 1J(0) ~O. Let A and 1t be functions of bounded variation such that: 1t(b»1t(a), 1 t ( b ) - 1 t ( a ) ~ A ( b ) - Aand ( a ) t
b
O ~J d A ( X ) J~ d1t(x) a
for
a~t~to,
for
to~t~b.
a b
b
o ~J d A ( x ) J ~ d1t(x) a
t
Then b
b
b
b
(J f(x) dA(X»)/ (J d1t(X»)} ~ (J 1J(f(x» dA(X»)/ (J d1t(X»).
1J{
a
a
a
a
(5.60)
Proof. Immediate by letting g(x) = A(X)/ f ~ d1t(y) in the BarlowMarshall-Proschan Inequality (5.56). 0 5.40. Remark. Inequality (1970a). 0
(5.60)
was
also
considered
by
Boas
5.41. Corollary. Let to, f, and 1J satisfy the conditions of Corollary 5.39. Let A and 1t be functions of bounded variation such that A ( a ) ~ A ( t ) ~ A ( b ) for + d
a ~ t ~ t o ,
A ( a ) - d ~ A ( t ) ~ A for ( b ) t o ~ t ~ b , b
A(b) > A(a),
b
Jd1t(x) ~ J dA(X) + d a
for
d > O.
a
Then (5.60) is valid.
Proof.
This is an immediate consequence of Corollary 5.39.
5.42. Remark. For to = band f decreasing, the condition f(b) 0 be replaced by f(b) ~0 (see Boas, 1970).
0
=0
can
,
5.2. Jensen-Petrovic's Inequalities
161
In a similar fashion we can obtain: 5.43. Corollary. Let to, f, and 4> satisfy the conditions of Corollary 5.39. Let A be a function of bounded variation such that b
t
f dA(t)"'?' 0 for
a s: t :s, to,
a
f dA(t)"'?' 0 for
to < t s: b,
t
b
f IdA(t)1 > O.
and
a
Then the following inequality holds: b
b
b
b
4>{(f f(x)dA(x»)/(fIdA(X)I)}:s,(f4>(f(x»dA(x»)/(f IdA(X)I). a
a
a
a
5.44. Remarks. (a) Corollary 5.43 is a generalization of the Ciesielski Inequality (1958); see also Boas (1970a) and Brunk (1956). (b) Corollaries 5.39, 5.41,_ and 5.43, are proved in Pecaric (1983b). Related generalizations for functions with increasing increments are also 0 valid (see Pecaric, 1984b). Let us consider once again the inequalities with alternative signs (see Remark 5.38(a». First we show that the well-known inequality of Szego (see Mitrinovic, 1970, p. 112; Beckenbach and Bellman, 1961, 1965, p. 47; and Karlin and Studden, 1966, p. 431) is valid under weaker conditions: 5.45. Theorem. Let Xl"'?' X2"'?' ... ",? X2m+l, Xi E I for i = 1, ... , 2m + 1, and let f be a Wright-convex function on 1. Then the following inequality is valid: (5.61)
Proof.
For m = 1, the inequality f(xI) - f(x2) + f(x3) ",? f(x I
-
X2 + X3)
(5.62)
holds if XI ",? X2 ",? x 3. This inequality is a simple consequence of the definition inequality for Wright-convex functions D"'?'O,
162
5. Hermite-Hadamard's and Jensen-Petrovie's Inequalities
by letting al = X3, az = Xz, () = Xl - Xz. Suppose that the theorem is valid for m - 1, and that the conditions of the theorem are satisfied for m. Then we have
by first using the inductive hypothesis for m - 1, then applying (5.62), because Zm+l
2:
(-l)i-l xi;:o:xZ m;:O:XZm+I'
0
i=l
Similarly, we can prove the following: 5.46. Theorem. and let
Let XkE I, k
= 1, ... ,2m + 1 (I is
Zk+l
2:
(-l)i-l Xi E I for
k
= 1, ...
an interval in IR),
, m.
i ~ l
(a) If Zk
2: (-l)i-l Xi
;:0:
0 for
k = 1, ... , m,
(5.63)
i=l
then the reverse of the inequality in (5.61) holds for every Wright-convex functions f : I ~IR. Further, if the reverse ofthe inequalities in (5.63) hold, then the reverse of the inequality in (5.61) is also valid.
(b) If instead of (5.63) the following conditions hold Zk
2: (-ly- lxi
~ o for
k
=
1, ... , m,
(5.64)
i=l
then (5.61) is valid. If the reverse inequalities in (5.64) hold, then (5.61) is also valid. 5.47. Remarks. (a) Theorem 5.46 is a generalization of an inequality of Opial (1960) (see also Mitrinovic, 1970, p. 351). For some related results see Vasic and Janie (1970a) and Pecaric (1980f).
5.2. Jensen-Petrovie's Inequalities
163
(b) Theorems 5.45 and 5.46 can be generalized for functions with increasing increments. The same is true for results given in Vasic and Janie (1970a) and Pecaric (1980f); i.e., these results can be generalized for continuous functions with increasing increments. (c) Let the conditions of Theorem 5.35 be fulfilled with Xl> 1. Then for the convex function -log(1 +x), (5.50) becomes a generalization of the well-known Bernoulli inequality n
n
II (1 + Xi)"'::; 1 + L p.x, , i=l
i ~ l
and (5.52) gives the reverse inequality.
5.2.3.
0
Combination Convexity Inequalities
Hwang and Yang (1985) gave some generalizations of results of Beckenbach (1969). First they proved: 5.48. Theorem. If f E K(b) (K(b) is the class of real-valued functions that are continuous and nonnegative on [0, b] with f(O) = 0) is convex on [0, a] and starshaped on [0, b], where a ::; b, then for all real numbers Xi in [0, b] (i = 1, ... , n) and weights Ai> such that r . 7 ~ 1Ai::; alb, we have
°
(5.65)
Furthermore, the constant alb is the best possible. By letting Ai
= aw.lb
we obtain Beckenbach's (1969) inequality.
5.49. Theorem. Iff E K(c) is starshaped on [0, b] and superadditive on [0, c] where b ::; c, then for every X in [0, c] and every A E [0, blc] we have f(Ax)::; (clb )Af(x). 5.50. Theorem. If f E K(c) is convex on [0, a], starshaped on [0, b], and superadditive on [0, c], where a z: b -s c, then for all real numbers Xi E [0, b] (i = 1, ... , n) satisfying r . 7 ~ 1Xi = co::; c, we have f«A/n)co»::; (A/n)f(co), where O::;A::;alb. This theorem is also equivalent to Beckenbach's inequality.
164
5. Hermite-Hadamard's and Jensen-Petrovie's Inequalities
5.51. Theorem. Iff E K(c) is convex on [0. a]. starshaped on [0, b] and superadditive on [0, c], where a s; b :s: c. then for all real numbers Xi E [0, c] (i = 1, ...• n) satisfying ~ 7 = X1 i E [0. c] and all weights Ai> such that ~ 7 = A 1 :S: a]c, we have
°
(5.66)
Proof. Denoting A= ~ 7 = A1 i we have Axi:S: (alc)x i E [0, a] for i = 1•...• n; and from Jensen's inequality we have n )... (C b ) -; f(Axi) = 2: -; f -b A- Xi . 1=1 1=1 C
f ( 2: AiXi :s: 2: n
1=1
)
n)... I\.
I\.
Since (blc)Xi E [0, b], (clb)A < 1, and f starshaped on [0. b], we obtain the first inequality in (5.66) from the fact that f c I b)A(b I c )x;) :s: (clb)Af«blc)x;). To prove the second inequality in (5.66). note thatfis increasing on [0, c] which implies
«
and
-bc
i
1=1
i
c AJ(!!-Xi) :S:-b f(i Xi) c 1=1 1=1
A i : S : ~ 1=1 b f (Xi)' i
Also. from f«blc)Xi):S:f(b) for i=l, ...• n, we have (clb) ~ 7 = AJ«blc)x;):s: 1 (alb )f(b); and from ~ 7 = 1AiXi:S: ~ 7 = 1AiC:S: a. we 1 :s: f(a). Since f is starshaped on [0, b]. we have obtain f ( ~ 7 = AiX;) f(a) =f«alb)b):S: (alb)f(b). 0 Note that when b = c. Theorem 5.48 is a special case of Theorem 5.51.
5.2.4.
Inequalities for Sums of Order p
Let us denote and
5.2. Jensen-Petrovic's Inequalities
165
where a and p are positive n-tuples such that Pi 2= 1 (i = 1, ... , n). The well-known inequality for sums of order p states that (5.67) for s>r>O (see Hardy, Littlewood, and Polya, 1935, 1952, pp. 28-30). But this inequality is also valid for r < s < 0 and s < 0 < r (see Vasic and Pecaric, 1979a). Furthermore, Vasic and Pecaric also proved that (5.68) for s > r > 0 and a ~> 0;