Escolar Documentos
Profissional Documentos
Cultura Documentos
Abstract. The aim of this paper is to extend to the context of several variables a number of results related to the Favard-Berwald inequalities.
1. Introduction
The aim of this paper is to prove extensions and refinements of some integral
inequalities for concave functions of several variables, that is, for those real-valued
functions f defined on convex subsets K of Rn such that
f ((1 )x + y) (1 )f (x) + f (y)
for all x, y K and all [0, 1]. The following examples show that the class of
concave functions covers a large spectrum of important functions:
1/n
...
en = x1 x2 xn .
(2) (x1 , ..., xn ) (xp1 xp2 ... xpn )1/p , on the subset of Rn+ where xp1
xp2 + + xpn . Here p > 1.
1/n
n
(3) A (det A)
, on the cone S++
of all nn dimensional positively defined
1/(nk)
matrices. The same is true for the functions (det A/ det Ak )
, where
Ak denotes the principal submatrix of A formed by taking the first k rows
and k columns of A. Because every concave function is also log-concave, we
n
infer that log (det A) is also concave on S++
.
(4) A minkxk=1 hAx, xi, on the the subset of all n n dimensional Hermitian
matrices in Mn (R). Letting
1 (A) 2 (A) ... n (A)
2000 Mathematics Subject Classification. Primary 26D15.
Key words and phrases. Concave function, superharmonic function, Favard-Berwald type
inequality.
The first author was partially supported by GrantKAW2000.0048.
The second author was partially supported by Wenner-Gren Foundations (Grant 25 12 2002).
1
be the sequence of eigenvalues of A in decreasing order, this function associates to each matrix A its smallest eigenvalue n (A). More generally, all
functions A k (A) + + n (A) are also concave.
For details, see the classical book of E. F. Beckenbach and R. Bellman [4]. While
the one variable case has received a great deal of attention, the literature concerning
the peculiar properties of concave functions of several variables is quite scarce. In
fact, leaving out those results which can be obtained by a change of sign from
similar ones, for convex functions, what remains counts few significant facts. The
most prominent is the following theorem due to L. Berwald [5]:
Theorem 1. Let K be a compact convex subset of Rn of positive volume, and let
f, f1 , ..., fm : K R+ be continuous concave functions. Then:
i) The function
1/t
Z
t+n 1
t
t
f (x) dV
n
|K| K
is decreasing on (0, );
ii) For every positive constants 1 , ..., m the following inequality holds
1 +n
Z
Z
mn+n Y
1
1
k
1
m
n
f (x) fm (x) dV 1 ++m +n
f (x) dV .
|K| K 1
|K| K k
n
k=1
Here dV denotes the volume measure in R (that is, the Lebesgue measure) and
|K| denotes the volume of K.
Theorem 1 extends an earlier result due to J. Favard [7], which asserts that
!1/p
!
Z b
Z b
1
1
2
p
f (x)dx
f (x)dx
ba a
(p + 1)1/p b a a
for all continuous concave functions f : [a, b] R+ and all parameters p > 1. This
complements a well known consequence of the Rogers-Holder inequality,
!1/p
Z b
Z b
1
1
p
f (x)dx
f (x)dx
.
ba a
ba a
The limiting case (for p ) of Favards inequality gives us
Z b
1
1
sup f (x)
f (x)dx.
2 x[a,b]
ba a
Theorem 1 extends this conclusion to all continuous concave functions f : K R+
defined on an arbitrary compact convex subset K Rn of positive volume:
Z
1
1
sup f (x)
f (x) dV.
(FB)
n + 1 xK
|K| K
The inequality (FB) (called in what follows the Favard-Berwald inequality) has a
very simple geometrical meaning: the volume of every conoid of base K and height
f (x) (for every x K) does not exceed the volume of the cylindroid of base K,
bounded above by the hypersurface v = f (u). From this geometrical interpretation
one can infer immediately the equality case in (FB).
x
x+1/2
1
1
1
1+
1+
<e< 1+
,
1 + 2x
x
x
which works for every x > 0.
In this paper the inequality (FB) will be the object of several generalizations and
refinements. In Section 2 we shall describe the connection of (FB) and (J) with
the topics of Choquets theory. In Section 3 we shall prove an extension of (FB),
while in Section 4 we shall show that a reverse counterpart of Berwalds inequality
(mentioned in Theorem 1) yields a multiple (FB) inequality:
Z
m
m
Y
Y
1
(MFB)
fj (x) dV C(n, m)
sup fj (x) .
|K| K j=1
j=1 xK
Here C(n, m) is a positive constant that depends only on m and n. In the case of
functions of one real variable, the inequality (MFB) was previously noticed by J.
L. Brenner and H. Alzer [6], who in turn extended the limiting case (for p, q )
of a result due to D. C. Barnes [2]: If p, q 1 and the functions f and g are
non-negative, concave and continuous on [a, b], then
Z b
1/p
1/q
1
(p + 1) (q + 1)
f (x)g(x)dx
kf kp kgkq .
ba a
6
Of course, an inequality like (MFB) is not possible without certain restrictions.
However, a remarkable result due to C. Visser [23] offers the alternative of passing
to subsequences. More precisely, if (X, , ) is a probability
space and (fn )n is a
R
sequence of random variables such that 0 fn 1 and X fn d > 0, then for
every > 0 there exists a subsequence, say (gn )n , such that
Z
gn1 gns d (1 )s
X
for every string of indices n1 < ... < ns . See G. G. Lorentz [13] for a nice combinatorial argument.
In the last section we discuss the generalization of our results to the context of
superharmonic functions.
2. The Favard-Berwald Inequality Within Choquets Theory
In what follows we shall prove a number of estimates from above and from below
of the integral mean value
Z
1
f (x)dV,
M (f ) =
|K| K
inf f (x) =
xK
inf
xExt K
f (x),
where Ext K denotes the set of all extreme points of K. Recall that a point x K
is said to be an extreme point of K if it admits no representation of the form
x = (1 )u + v with u, v K, u 6= v and (0, 1).
The equality (E) is a consequence of the celebrated Krein-Milman theorem, which
asserts that K is the closed convex hull of Ext K.
By (FB), applied to the non-negative concave function f inf xK f (x), we get
Z
n
1
1
f (x)dV
sup f (x) +
inf f (x),
|K| K
n + 1 xK
n + 1 xK
so that, taking into account the relations (E) and (J) we arrive at the following
result:
Proposition 1. For every continuous concave function f defined on a compact
convex subset K Rn of positive volume,
Z
1
n
1
sup f (x) +
inf f (x)
f (x)dV f (xK ).
n + 1 xK
n + 1 xExt K
|K| K
In the 1-dimensional case, when K = [a, b], the result above represents an improvement of the classical Hermite-Hadamard inequality,
Z b
f (a) + f (b)
1
a+b
(HH)
f (x)dx f
.
2
ba a
2
See [17], [20], [21].
It is worth to notice that the left hand inequality in (HH) can be strengthened
as
Z b
f (a) + f (b)
1
a+b
f (a) + f (b)
1
(LHH)
f
+
f (x)dx.
2
2
2
2
ba a
In fact, we may assume that f 0 (replacing f by f inf x[a,b] f (x) if necessary),
which allows us to interpret an equivalent form of (LHH),
Z b
ba
ba
(b a) f a+b
f (a)
f (b)
2
+ 2
+ 2
f (x)dx,
2
2
2
a
in terms of areas: the sum of the areas of the triangles P AB, P M A and P BN
(with basis of lengths b a, f (a) and respectively f (b)) does not exceeds the area
of the subgraph of f. See Fig. 1.
Using the same geometrical idea, one can prove the following refinement of
Proposition 1:
Theorem 2. Suppose that K Rn is a compact convex set of positive volume,
with piecewise smooth boundary. Then for every continuous concave function f :
K R+ ,
Z
Z
1
1
1
sup f (y) +
d(y, Tx K)f (x)dS
f (x)dV f (xK ).
n + 1 yK
|K| K
|K| K
Here Tx K is the tangent hyperplane at x to the boundary of K and dS is the
(n 1)-dimensional surface measure induced by the Lebesgue measure.
P
N
f(x)
y
dS
Z
Z
1
1
1
f (xK ) +
d(xK , Tx K)f (x)dS
f (x)dV f (xK ).
n+1
|K| K
|K| K
The next example gives us an idea how good is the estimate offered by Proposition 1.
1/n
(p1 ) (pn )
=
(p1 + + pn )
Z
0
, when re-
(that works for all p1 , ..., pn > 0), we easily deduce that the volume of Dn is 1/n!
and
Z
1
n (1 + 1/n)
f (x)dV =
.
|Dn | Dn
n+1
Notice that limn n (1 + 1/n) = e = 0.561 46...
Proposition 1 yields
Z
1
1
1
<
f (x)dV <
n(n + 1)
|Dn | Dn
n+1
which provides a rough estimate of the integral mean of f. Corollary 1 gives us a
much better bound from below. For example, for n = 2, it leads to
2 (3/2)
1
= 0.261 80 < .
3
3
While Theorem 1 has a finite dimensional character, the Hermite-Hadamard
inequality (HH) can be extended to the context of continuous concave functions
defined on compact convex sets, not necessarily finite dimensional. This touches
the core of Choquets theory, a theory that had at the origin the Krein-Milman
theorem. We recall here the following result due to G. Choquet:
0.234 52 < M (f ) =
Theorem 3. (G. Choquet; see [20] or [22] for details). Suppose that K is a metrizable compact convex set (in a locally convex Hausdorff space E). Then the set
Ext K of all extreme points of K is a G -subset of K and for every Borel probability measure on K there exists a Borel probability measure on K supported by
Ext K (that is, (K \ Ext K ) = 0) such that
Z
Z
(Ch)
f (x) d(x)
f (x) d(x) f (x )
Ext K
1/n
In the case of the function h(x1 , ..., xn ) = 1 + x1 )1/n (1 + xn
(defined on
Dn ), Proposition 1 gives us
Z
1
1
1
1+
h(x)dV 1 +
,
n(n + 1)
|Dn | Dn
n+1
which is weaker than the estimate offered by Theorem 3:
Z
1 + n 21/n
1
1
h(x)dV 1 +
.
n+1
|Dn | Dn
n+1
For n = 2, the mean value to be evaluated is
Z
1
M (h) =
h(x)dV
|Dn | Dn
Z
4 1
3/2
=
(2 x) 1
1 + xdx = 1. 318 2.
3 0
k=1
k=1
Here (w1 , ..., wm ) denotes the barycenter of m with respect to . Notice that
every point of m is the barycenter of a Borel probability measure.
The above inequalities should be reversed if f is concave on K.
Among the Borel probability measures on m we recall here the Dirichlet measure,
(p1 + + pm ) p1 1
pm1 1
x
xm1
(1 x1 xm1 )pm 1 dx1 dxm1 .
(p1 ) (pm ) 1
In principle, it allows us to refine (via Theorem 4) all Jensen inequalities associated
to the concave functions listed in the Introduction, but we do not know any practical
consequence of this fact.
3. An Extension of the Favard-Berwald Inequality
A basic ingredient in our extension of the Favard-Berwald inequality is Greens
first identity,
Z
Z
Z
v
hu, vi dV =
u
dS
uv dV,
Lemma 1. Suppose that is a bounded open subset of Rn with a Lipschitz boundary, y is a point of , and u C() C 1 (). Then
Z
Z
Z
hu, x yi dV = n
u dV +
u
dS,
n
where (x) =
1
2
kx yk .
(x) = hx y,
i
n
kx ak
kx ak hy a, x ai
R2 R ky ak
0.
R
R
This remark provides very useful in strengthening inequalities for concave functions
defined on balls.
A convex body in Rn is any compact convex subset of Rn with nonempty interior
and a Lipschitz boundary.
The Favard-Berwald inequality represents the case where = 0 and = 1 of
the following result, whose one-dimensional variant was previously noticed by J. L.
Brenner and H. Alzer [6]:
=
hf + (y), x yi.
+
By integrating over y and taking into account Lemma 1, we get
Z
Z
Z
f (x)
f (y) dV
f + (y)dV
hf + (y), y xidV
+ K
K
K
Z
Z
n
+
f + (y)dV
f
(y)dV +
+ K
K
= f + (y) +
!
Z
Z
ya
+
f (y) dV +
f
sup
f (x)
(y)hy x,
i dS
+ SR (a)
ky ak
R (a)
R (a)
B
xB
Z
+ (n + 1)
f + (y) dV.
+
R (a)
B
A problem which is left open is whether the constant ( + ) / ( + (n + 1)) in
Theorem 5 is the best possible for each triplet (, , n). The case of the following
function
f : {x1 , x2 0 | x1 + x2 1} R,
f (x1 , x2 ) = 1 x1 x2 ,
shows that the answer is positive for the triplet (, 1, 2). In fact, a simple computation yields
Z
Z
( + 1) ( + 2)
+
f
(x) dV / sup f (x)
f (x) dV =
(
+
+ 1) ( + + 2)
xK
K
K
and
( + 1) ( + 2)
+
(3 + + 4) (1 )
=
( + + 1) ( + + 2) + (2 + 1)
( + 3) ( + + 1) ( + + 2)
vanishes for = 1 and approaches 0 as (whenever 0 < 1).
4. A Reverse Berwald Inequality
In this section we show that a reverse Berwald inequality holds true. The main
result is as follows:
Theorem 6. Let K be a convex body in Rn and let f1 , ..., fm : K R+ be continuous concave functions and let p1 , ..., pm be non-negative numbers. Then
!
Z Y
m
m
X
p
n+
pk |K|
fj j (x) dV
K j=1
k=1
m
X
k=1
pk
p
fj j (x) fkpk 1 (x)dV
j6=k
Z
fk (y)dV.
K
Z
Z Y
m
m
Y
1
1
pk
pk
f dV
(RB)
C
fk
dV .
|K| K k
|K| K
k=1
k=1
10
Proof. As in the proof of Theorem 5 we may assume that all the functions fk are
differentiable and vanish at K. Then
fk (x) fk (y) hfk (x), x yi
for all x, y K and all k = 1, ..., m. By multiplying both sides by pk fkpk 1 (x) we
get
pk fkpk (x) pk fkpk 1 (x)fk (y) hfkpk (x), x yi
Q
p
and a further multiplication by j6=k fj j (x) leads us to
m
Y
Y
Y
p
p
p
pk
fj j (x) pk
fj j (x) fkpk 1 (x)fk (y)
fj j (x) hfkpk (x), x yi.
j=1
j6=k
j6=k
Summing side by side these inequalities (over k) and integrating over x we get
m
!Z m
Z
m
X
Y p
X
Y p
pk
pk
fj j (x) dV
fj j (x) fkpk 1 (x)dV fk (y)
k=1
K j=1
k=1
m
Y
fj j (x) , x yi dV
j=1
= n
K
j6=k
m
Y
p
fj j (x)
dV
j=1
and then integrating over y we arrive at the main inequality in the statement of
Theorem 6. The second assertion follows by mathematical induction.
Z
Z Y
m
m
Y
1
1
C(n, m)
fk dV
fk dV
|K| K
|K| K
k=1
k=1
m!
for m 2.
(n + 2) (n + m)
m
C(n, m 1) for m 2.
n+m
11
m
!
!
Z
Z
m
Y
Y
1
1
fk (x) dV C(n, m)
R (a) B (a)
R (a) B (a) fk (x) dV +
B
B
R
R
k=1
k=1
Z
!
Z
m
1
xa Y
+
hx y,
i
fk (x) dS dV.
R (a) B (a)
kx ak
(n + m) B
S (a)
R
k=1
Z 1
2
f1 (0)f2 (0) + f1 (1)f2 (1)
f1 f2 dx
f1 dx
f2 dx +
,
3
6
0
0
0
which represents a remark made by C. Borell to Barnes inequality. See [15].
Combining Corollary 3 with inequality (FB) we get:
Proposition 2. Under the assumptions of Corollary 3, for K a closed ball in Rn ,
the following inequalities hold:
!
Z Y
Z
m
m
1
C(n, m) Y
1
fk dV
d(y,
T
K)f
(x)dS
sup
f
(y)
+
x
k
k
|K| K
(n + 1)m
|K| K
yK
k=1
k=1
m
C(n, m) Y
sup fk (x) .
(n + 1)m
xK
k=1
12
We may wonder if the results in the preceding sections extend to the framework
of superharmonic functions. Simple examples such as
f (x, y) = 1 x2 + y 2 ,
for (x, y) in the unit ball of R2 and (0, 1), shows that the Favard-Berwald
inequality (FB) does not work. However the result of Theorem 1 has a partial
extension which will be detailed here. For convenience we shall restrict to the case
of smooth functions u C() C 2 () defined on convex bodies in Rn .
Consider the Green kernel G(x, y) associated with on . The solution u
C() C 2 () of the Dirichlet problem
(5.1)
u = f on
u| = 0,
u(x) =
1/s Z
1/r #
r
G(x, y) d(x)
/
G(x, y) d(x)
< ,
s
C = C(r, s; , ) = sup
y
1/s
Z
1/r
r
u (x)d(x)
C
u (x)d(x)
s
(5.3)
13
Proof. We use the representation formula (5.2). Then, by applying the RogersHolder inequality, the Fubini theorem and finally the Minkowski inequality, we get
Z
Z
Z
us (x)d(x) =
us1 (x)
G(x, y)f (y)dV d(x)
Z Z
=
G(x, y)us1 (x)d(x) f (y) dV
Z Z
1/s
G(x, y)s d(x)
(s1)s0
1/s0
(x)d(x)
f (y) dV
1/s0 Z Z
1/r
r
u (x)d(x)
f (y) dV
G(x, y) d(x)
s
Z
C
Z
C
1/s0 Z Z
r
1/r
us (x)d(x)
G(x, y)f (y)dV
d(x)
1/s0 Z
1/r
us (x)d(x)
ur (x)d(x)
and the proof of (5.3) is done. The fact that C = C(r, s; , ) is sharp follows by
considering the case of functions u (x) = G(x, y), for y arbitrarily fixed.
1/r
u (x)d(x)
r
C(1, s; , )
+
for every u SH+
0 () (and even for every SH (), if and are absolutely
continuous with respect to the Lebesgue measure on ), but the constant C(1, s; , )
may not be the best possible.
The problem with Theorem 1 is that the Green kernel is known in compact form
only in few cases, for examples, for balls (but even then it is difficult to be handled).
For = (a, b), the Green kernel is
(y a)(b x), if a y x b
G(x, y) =
(x a)(b y), if a x y b
and thus for d(x) = d(x) = dx/(b a) we have
C(r, s; dx/(b a), dx/(b a))
"Z
1/s Z
1/r #
s
r
= sup
G(x, y) d(x)
/
G(x, y) d(x)
a<y<b
= (r + 1)
1/r
/ (s + 1)
1/s
14
n
n
1 X
1 X 2
3 (n 1)
ak
ak
n+1
4 (n + 1)
n+1
k=0
k=0
15
[23] C. Visser, On certain infinite sequences, Nederl. Akad. Wetensch. Proc. 40 (1937), 358-367.
Department of Engineering Sciences, Physics and Mathematics, University of Karlstad, Karlstad, SE 851 88, Sweden
E-mail address: sorina.barza@kau.se
Department of Mathematics, University of Craiova, Street A. I. Cuza 13, Craiova,
RO-200585, Romania
E-mail address: cniculescu@central.ucv.ro