3.2. The Legendre-Fenchel dual of a concave function
Let and be as in the previous section.
Set
with the natural order and
arithmetic operations. Unless otherwise stated, we will use the
conventions and .
A function
is concave
if
|
|
|
for all
, and is not identically
. Observe that a function is concave in our sense if and only if is a
proper convex function in the sense of [Roc70].
The effective domain
of such a function is the
subset of points of where takes finite values.
It is a convex set. A concave function defines a concave function with finite values
. Conversely, if
is a
concave function defined on some convex set , we can extend it to
the whole of by declaring
that its value at any point of is .
We will move freely from the point of view of
concave functions on the whole of with possibly infinite values
to the point of view of real-valued concave functions on
arbitrary convex sets.
A concave function is
closed
if it is upper semicontinuous.
This includes the case of
continuous concave functions defined on closed convex sets. Given an arbitrary
concave function, there exists a unique minimal closed concave
function above . This function is called the closure
of and is denoted by .
Let be a concave function on .
The Legendre-Fenchel dual of
is the function
|
|
|
It is a closed concave function. The Legendre-Fenchel duality is an
involution between such functions: if is closed,
then [Roc70, Cor. 12.2.1].
In fact, for any concave function we have .
The effective domain of is called the stability set
of .
It can be described as
|
|
|
Example 3.16.
The indicator function of a convex set
is the
concave function
defined as for and for . Observe that is the logarithm of the
characteristic function of .
This function is closed if and only if is a closed set.
The support function of a convex set
is the function
|
|
|
It is a closed concave function.
A function is called
conical
if for
all . The support function is conical. The
converse is also true: all conical closed concave functions are
of the form for a closed convex set .
We have and .
Thus, the Legendre-Fenchel duality defines a bijective correspondence between
indicator functions of closed convex subsets of and
closed concave conical functions on .
Next result shows that the Legendre-Fenchel duality is monotonous.
Proposition 3.17.
Let and be concave functions
such that for all . Then ,
and for
all .
Proof.
It follows directly from the definitions.
∎
The Legendre-Fenchel duality is continuous with
respect to uniform
convergence.
Proposition 3.18.
Let be a sequence of concave functions which
converges uniformly to a function . Then is a concave
function and the sequence converges
uniformly to . In particular, there is some such that
and for all .
Proof.
It is a direct consequence of Proposition 3.17.
∎
The classical Legendre duality of strictly concave differentiable
functions can be described in terms of the gradient map ,
called in this setting the ‘‘Legendre transform’’.
We will next show that the Legendre transform can be extended to the general concave case as
a correspondence between convex decompositions.
Let be a concave function on . The
sup-differential of at a point
is defined as the set
|
|
|
For an arbitrary concave function,
the sup-differential is a generalization of the gradient.
In general, may contain more than one point, so the
sup-differential has to be
regarded as a multi-valued function.
We say that is sup-differentiable at a point
if .
The effective domain of ,
denoted ,
is the set of points where is sup-differentiable.
For a subset we define
|
|
|
In particular, the image of
is defined as .
The sup-differential is a closed
convex set for all .
It is bounded if and only if . Hence, in the particular case when , we have
that is a bounded closed convex subset of for
all .
The effective domain of the sup-differential is not necessarily convex but it
differs very little from being convex, in the sense that it satisfies
| (3.19) |
|
|
|
Let be a closed concave function and consider the pairing
| (3.20) |
|
|
|
This pairing satisfies for all .
Proposition 3.21.
Let be a closed concave function on .
For
and , the following conditions are equivalent:
- (1)
;
- (2)
;
- (3)
Proof.
This is proved in [Roc70, Theorem 23.5].
∎
If is closed, then and so the
image of the sup-differential is close to be a convex set, in the
sense that
| (3.22) |
|
|
|
Definition 3.23.
We denote by the collection of all sets of the form
|
|
|
for some .
Lemma 3.24.
Let . Then
In other words, the set is characterized by the condition
| (3.25) |
|
|
|
Thus the restriction of to is an affine
function with linear part given by , and is the
maximal subset where this property holds.
Proof.
The first statement follows from the equivalence of (2)
and (3) in Proposition 3.21. The second
statement follows from the definition of and its non-positivity.
∎
The hypograph
of a concave function is defined as the set
|
|
|
A face of the hypograph is called non-vertical
if it projects injectively in .
Proposition 3.26.
Let be a closed concave function on . For a subset , the following conditions are equivalent:
- (1)
- (2)
for a ;
- (3)
there exist and such that
the set is
an exposed face
of the hypograph of .
In particular, the
correspondence
|
|
|
is a bijection between and the set of
non-vertical exposed faces of .
Proof.
The equivalence between the conditions (1) and
(2) comes directly from
Proposition 3.21. The equivalence with the
condition (3)
follows from (3.25).
∎
Proposition 3.27.
Let be a closed concave function. Then is a convex decomposition
of .
Proof.
The collection of non-vertical exposed faces of forms a
convex decomposition in . Using Proposition
3.26 we obtain that is a convex decomposition of .
∎
We need the following result in order to properly define the
Legendre-Fenchel correspondence for an arbitrary concave function as a
bijective correspondence between convex decompositions.
Lemma 3.28.
Let be a closed concave function and . Then for any ,
|
|
|
Proof.
Fix such that and .
Let . Then
| (3.29) |
|
|
|
Let . By (3.25), we have and so the above inequality implies
The fact implies
for some small . Applying the same argument to this
element we obtain the reverse inequality and so
| (3.30) |
|
|
|
In particular,
and from (3.29) we obtain
|
|
|
Hence and so
, which
implies the stated equality.
∎
Definition 3.31.
Let be a closed concave function.
The Legendre-Fenchel correspondence of
is defined as
|
|
|
By Lemma 3.28, for
any . Hence,
|
|
|
Definition 3.32.
Let be subsets of and
respectively, and
convex decompositions of and , respectively.
We say that and are dual convex
decompositions
if there
exists a bijective map
such that
- (1)
for all we have if and
only if ;
- (2)
for all the sets and
are contained in orthogonal affine spaces of and ,
respectively.
Theorem 3.33.
Let be a closed concave function, then is a duality between
and with inverse .
Proof.
We will prove first that .
Fix and set .
Let such that
and let .
Hence and so
by
Proposition 3.21 and
Lemma 3.28. Hence
|
|
|
On the other hand, let .
In particular, and so for all . It implies
|
|
|
Thus and applying the same argument to
we conclude that and that is bijective.
Now we have to prove that is a duality between
and .
Let such that . Clearly,
.
The reciprocal follows by applying the same argument to .
The fact that and lie in orthogonal affine spaces
has already been shown during the proof of Lemma 3.28 above,
see (3.30).
∎
Definition 3.34.
Let be a closed concave function. The pair of convex decompositions
will be called the dual pair of convex decompositions induced by .
In particular, for put .
For any and , we have
|
|
|
Following (3.25), the restrictions and are
affine functions. Observe that we can recover the Legendre-Fenchel dual
from the Legendre-Fenchel correspondence by writing, for
and any ,
| (3.35) |
|
|
|
Example 3.36.
Let denote the Euclidean norm on and
the unit ball. Consider the
concave function defined as .
Then and the Legendre-Fenchel dual is the function defined by
if and otherwise.
The decompositions and consist of a collection
of pieces of three different types and the Legendre-Fenchel
correspondence
is given, for , by
|
|
|
In the above example both decompositions are in fact subdivisions. But
this is not always the case, as shown by the next example.
Example 3.37.
Let the function defined by
|
|
|
Then and
the Legendre-Fenchel dual is the function for and for . Then and . Moreover,
|
|
|
The Legendre-Fenchel correspondence sends bijectively
to and to , and sends the
element to the point . In this example,
is not a subdivision while is.