1. Introduction
The isoperimetric inequality is an important inequality in geometry which originated from the well-known isoperimetric problem. The isoperimetric inequality has a profound influence on each branches of mathematics. The breakthrough works of Federer and Fleming [
1] and Mazya [
2] discovered independently the connection between the isoperimetric problem and the Sobolev embedding problem. They established the sharp Sobolev inequality by using the isoperimetric inequality. This exciting connection has motivated a number of studies in recent years about interactions of geometric and analytic inequalities. In this paper, we further study the connection between geometry and analysis.
Let us recall some facts about convex bodies. Let
K be a convex body (i.e., compact, convex subset with non-empty interior) in the
n-dimensional Euclidean space
, the family
of its positions are studied by many mathematicians. Introducing the right position of the unit ball
of a finite dimensional normed space
X is one of the main problems in the asymptotic theory. There exist many celebrated positions for different purposes, for example isotropic position,
M-position, John’s position, the
ℓ-position and so on, see [
3,
4].
Our purpose is to study the isotropic position of log-concave functions. Hence, we first recall some geometric backgrounds and these are our motivations. Let
K be a convex body in
with centroid at the origin and volume equal to one. A convex body
K is in isotropic position if
where
is the usual inner product in
and
is the unit sphere in
. It’s worth noting that every convex body
K with volume one has an isotropic position, and this position is uniqueness (up to an orthogonal transformation), see, e.g., [
3]. Isotropic positions have been used to study the classical convexity problems, for example, the minimal surface area of a convex body and its extension [
5,
6], the minimal mean width of a convex body and its extension [
7,
8]. Other contributions include e.g., [
9,
10,
11] among others.
We recall two specific examples on isotropic positions. Let
K be a convex body and denote by
its surface area. If
for every
, then
K has minimal surface area (see, e.g., [
5]). Petty [
5] obtained the following characterization of the minimal surface area position: a convex body
K has minimal surface area if and only if its surface area measure
is isotropic, i.e.,
As a second example, the minimal mean width will be recalled which was defined by Giannopoulos and Milman [
7]. Let
K be a convex body in
, the mean width
of
K is define as
where
is the support function of
K and
is the rotationally invariant probability measure on
. For every
, if
then
K has minimal mean width (see, e.g., [
7]). Giannopoulos and Milman [
7] showed that if the support function of
K is twice continuously differentiable, then
K has minimal mean width if and only if the measure
is isotropic, i.e.,
Within the last few years, many geometric results have been generalized to their corresponding functional versions, including but not limited to the functional version Blaschke-Santaló inequality and its reverse [
12,
13,
14,
15,
16], the functional affine surface areas [
17,
18,
19], Minkowski problem for functions [
20,
21,
22], and analytic inequalities with geometric background [
23,
24,
25,
26,
27,
28].
In this paper, we consider the log-concave functions in
. A function
is log-concave if for any
and
, it holds
A typical example of log-concave functions is the characteristic function of convex bodies,
(which is defined as
when
and
when
). Let
denote the total mass functional of
, namely
For any
and log-concave functions
, Colesanti and Fragalà [
21] defined the first variation of
J at
f along
g as
where
for
and
, and
the Asplund sum of functions
f and
g, i.e.,
It was proved that if
f and
g are restricted to a subclass of log-concave functions, then the first variation
precisely turns out to be
mixed volume of convex bodies (see Proposition 3.13 in [
21]). In particular, the perimeter of
f is defined as (see [
21])
where
is the Gaussian function and
is the Euclidean norm of
.
Motivated by the work of Giannopoulos and Milman [
7], we consider the extremal problems of log-concave functions instead of convex bodies, and our purpose is to discuss the possibility of an isometric approach to these questions. We introduce the notion of minimal perimeters of log-concave functions. Assume that
f is a log-concave function, we call
f has minimal perimeter if
for every
. Furthermore, we derive the following characteristic theorem of the minimal perimeter.
Theorem 1. If is a log-concave function, then f has minimal perimeter if and only iffor every . Here denotes the trace of T, and is a Borel measure on (where is the n-dimensional Hausdorff measure and ). Theorem 1 implies that the log-concave function f has minimal perimeter if and only if is isotropic, and provides a further example of the connections between the theory of convex bodies and that of functions.
We remark that our works belong to the asymptotic theory of log-concave functions which parallel to that of convex bodies. From a geometric and analytic view of point to study convex bodies is the asymptotic theory of convex bodies which emphasize the dependence of various parameters on the dimension. Isotropic positions for convex bodies play important roles in the asymptotic theory of convex bodies. We are not aware of the related results for log-concave functions. Hence, our work in this paper presents a new connection between convex bodies and log-concave functions and it also leads to a new topic in the study of geometry of log-concave functions. We hope that our work provides some useful tools or ideas in the development of geometry of log-concave functions.
2. Preliminaries
In this section, we provide some preliminaries and notations required for functions. More details can be found in [
3,
4].
A function
is convex if
for any
and
. Let
Since the convexity of
u,
is a convex set. If
, then
u is said proper. The function
u is called of class
if it is twice differentiable on
, with a positive definite Hessian matrix. The Fenchel conjugate of
u is the convex function defined by
Clearly,
for all
. The equality holds if and only if
and
y is in the subdifferential of
u at
x. Hence, one can checked that
From the definition of log-concave functions (
1), we known that a log-concave function
has the form
where
is convex. Writing
For
, the inf-convolution of
is defined by
and the right scalar multiplication
is defined by
Note that these operations are convexity preserving, and
acts as the identity element in (
5). It is proved that
for
and
(see [
21]). Let
and
. Form (
5), the Asplund sum (defined in (
3)) can be rewritten as
and
. Let
. The support function,
, of
f is defined as (see, e.g., [
28])
We recall that a probability measure
is called isotropic if it satisfies
and
For a measure
with
, the following claims are equivalent (see, e.g., [
3]):
- (a)
is isotropic;
- (b)
For any
one has
- (c)
3. Minimal Perimeter of Log-Concave Functions
In this section, we consider the properties of the minimal perimeter of log-concave functions. Let
, the perimeter
has an integral expression (see [
21,
29]):
We define that
f has minimal perimeter if
for every
. This is, if
f has minimal perimeter, then
for any
.
The Borel measure
on
of a log-concave function
is defined by (see [
21])
Here
denotes the
n-dimensional Hausdorff measure. For any continuous function
, one has
The Borel measure plays the same role for f as the surface area measure for the convex body.
Proof. From Eqautions (
9), (
10) and (
7), we have
□
We recall that the gauge function of a convex body
K is defined by
It is clear that
where
is the boundary of
K.
We note that the minimal perimeter of a log-concave function
f is equivalent to considering the minimization problem:
For
, we write
for
. From (
9) and the fact that
for
and
, we have
Therefore, we can reformulate problem (
13) as follows:
Proposition 2. There exists a unique (un to an orthogonal matrix) such that it solves the minimization problem (14). Proof. We can limit our attention to
when
T is a positive definite symmetric matrix, since any
can be represented in the form
where
is a positive definite symmetric matrix and
Q is an orthogonal matrix. In this case, we can write the function
as
, where
is an origin-centered ellipsoid and
is the polar body of
E defined as
. There exists a
such that the diameter of
E satisfies
. Let
be a minimizing sequence for the problem (
14), namely,
From (
15) and the fact that
, we have
Since
, therefore the upper bound of the convex function
is depended only on
f. According to Theorem 10.9 in [
30], there exist a function
such that the Legendre conjugate of a minimizing sequence of functions for problem (
14) converge to
. Due to Theorem 11.34 in [
31], we known that a minimizing sequence of functions for problem (
14) converge to
. According to the dominated convergence theorem, there exists a solution to problem (
14).
Next, we prove the uniqueness of
. Assume there are two different solutions
to the considered problem which satisfy
for all
. If there exists a
such that
, then
This contradicts to
. The Minkowski inequality for symmetric positive definite matrices shows that
Then
and
, i.e.,
. This deduces that
By the convexity of the square of the Euclidean normal, we have
However, from the assumption on
and
, we have
which is a contradiction. □
Proposition 2 implies that the minimal perimeter of log-concave functions is well-defined. Namely,
Corollary 1. For a log-concave function , there exists a unique (up to an orthogonal matrix) such that has minimal perimeter.
Next we are in the position to consider the proof of Theorem 1.
Proof of Theorem 1. Let
, and
be a suitably small real number. Then
and this implies that
, i.e.,
By the fact that
, then
i.e.,
Because
and
when letting
, we obtain
Replacing
T by
in (
16), we conclude that there must be equality in (
4) for every
.
On the other hand, assume that (
4) is satisfied and let
. Since
for symmetric positive-definite metric, (
9) and
, we have
This shows that
f has minimal perimeter. Moreover, the equality in (
17) holds only if
T is the identity matrix. This prove that the uniqueness of the minimal perimeter position (up to
). □
Corollary 2. From Theorem 1 and the definition of isotropic measure, the log-concave function has minimal perimeter if and only if is an isotropic measure.
Next, we prove that Theorem 1 recovers the surface area measure of K, , is an isotropic measure on .
Corollary 3. Let K be a convex body in containing the origin in its interior. If for , thenand Theorem 1 includes the fact that surface area measure of K, , is an isotropic measure. Proof. For a convex body
K in
, let
denote the normalized cone volume measure of
K, which is given by
Here
is the outer unit normal of
K at the boundary point
z, and
is the
dimensional Hausdorff measure. For any
, we write
, with
and
. Since the map
is 0-homogeneous, and (
12), we have
where
is the Gamma function. We need the fact that
when
(see, e.g., [
4]). Therefore,
From the fact that the map
is 0-homogeneous, (
12) and (
10), we have
Hence, (
4) implies that
for every
. This means that the
surface area measure of
K,
, is an isotropic measure on
. □