Pome

21.11.21 Legendre transform67B012704E18

Let $N$ be a real vector space of finite dimension and $M$ be the dual vector space. The pairing $M\times N\rightarrow \mathbb {R}$ will be denoted by $\langle \bullet , \bullet \rangle $.

Definition 21.11.22.2E5E29E9A58B Let $F\in \mathrm{Conv}(N)$ be a convex function. We define the Legendre transform of $F$ as the function $F^*\in \mathrm{Conv}(M)$:

E1AD8A1437E2 21.11.23
\begin{equation} F^*(m)\coloneqq \sup _{n\in N} \left( \langle m,n \rangle -F(n) \right)=\sup _{n\in \operatorname{RelInt}\operatorname{Dom}F} \left( \langle m,n \rangle -F(n) \right). \end{equation}
The latter equality follows from [Corollary 12.2.2, Roc70]. Recall the well-known Legendre–Fenchel duality [Theorem 12.2, Roc70].

Theorem 21.11.24.258227E5D497 Let $F\in \mathrm{Conv}(N)$. Then $F^*$ is a closed convex function. The function $F^*$ is proper if and only if $F$ is.

Moreover, we have $(\operatorname{cl}F)^*=F^*$ and

\[ F^{**}=\operatorname{cl}F. \]

Proof. For proper $F$, all assertions are the finite-dimensional Fenchel theorem, whose separation proof is given earlier: $F^*$ is closed and proper, $(\operatorname{cl}F)^*=F^*$, and $F^{**}=\operatorname{cl}F$.

For completeness consider improper convex functions. If $F\equiv+\infty$, then $F^*\equiv-\infty$ and $F^{**}\equiv+\infty$. Otherwise an improper $F$ takes $-\infty$ somewhere, so every $F^*(p)$ is $+\infty$, its biconjugate is identically $-\infty$, and this is exactly the closure prescribed in the definition. Its conjugate is again identically $+\infty$. Neither conjugate is proper in these improper cases. This proves the equivalence of properness and all the identities also at the extended-valued extremes.

Example 21.11.25.1A7C0B007516 Let $P\subseteq M$ be a closed convex subset. Then

\[ \operatorname{Supp}_ P^*=\chi _ P,\quad \chi _ P^*=\operatorname{Supp}_ P. \]

See [Theorem 13.2, Roc70].

The following special case will be useful to us in the sequel.

Corollary 21.11.26.8C4DFDD0ADE0 Let $F\colon (0,\infty )\rightarrow [-\infty ,\infty )$ be a convex function. If we define $G\colon \mathbb {R}\rightarrow (-\infty ,\infty ]$ by

\[ G(\tau )=\sup _{t>0} \Bigl ( t\tau -F(t) \Bigr ), \]

then $G$ is a convex function and

E918B6149A40 21.11.27
\begin{equation} F(t)=G^*(t),\quad \forall t>0. \end{equation}

Moreover,

3B0DC2BF53F0 21.11.28
\begin{equation} G(\tau )=\sup _{t\in \mathbb {R}_{>0}} \Bigl ( t\tau -F(t) \Bigr )=\sup _{t\in \mathbb {Q}_{>0}} \Bigl ( t\tau -F(t) \Bigr ). \end{equation}

Proof. We distinguish two cases.

First suppose that $F(t)=-\infty $ for some $t>0$. Then $F(t)=-\infty $ for all $t>0$ by the convexity of $F$. Our assertions are clear in this case.

Next assume that $F(t)\neq -\infty $ for all $t>0$. In this case, theorem 21.11.17 guarantees that $F$ admits a closed proper extension $\tilde{F}\in \mathrm{Conv}(\mathbb {R})$ with

\[ \tilde{F}(t)=\infty ,\quad \forall t<0. \]

It follows from (21.11.23) that

\[ G(\tau )=\tilde{F}^*(\tau ),\quad \forall \tau \in \mathbb {R}. \]

Now theorem 21.11.24 implies (21.11.27). Finally (21.11.28) follows from the continuity of $F$. $\square$

Proposition 21.11.29.C3CC440747D6 Let $F\colon N\rightarrow [-\infty ,\infty ]$. Define $F^*\colon M\rightarrow [-\infty ,\infty ]$ by

\[ F^*(m)\coloneqq \sup _{n\in N} \left( \langle m,n \rangle -F(n) \right). \]

Then

\[ F^*=(\operatorname{cl}\operatorname{CE}F)^*. \]

Proof. Put $H=\operatorname{cl}\operatorname{CE}F$. Since $H\leq F$, order reversal gives $H^*\geq F^*$. Fix $p$ with $F^*(p)$ finite. The affine function $\ell(x)=\langle p,x\rangle-F^*(p)$ lies below $F$, hence below its convex envelope and below its lower semicontinuous regularization, because $\ell$ itself is continuous. Thus $\langle p,x\rangle-H(x)\leq F^*(p)$ for all $x$, proving $H^*(p)\leq F^*(p)$.

If $F^*(p)=+\infty$, the reverse inequality already gives equality. If $F^*(p)=-\infty$, then $F$ is identically $+\infty$; its closed convex envelope is also identically $+\infty$, and the equality is immediate. This treats every possible value of the conjugate.

See [Corollary 12.1.1, Roc70].

Definition 21.11.30.D6A0CB1B8846 Let $F\in \mathrm{Conv}(N)$ and $n\in N$. An element $m\in M$ is a subgradient (in the sense of Alexandrov) of $F$ at $n$ if

F6F028287E9D 21.11.31
\begin{equation} F(n')\geq F(n)+\langle n'-n,m \rangle ,\quad \forall n'\in N. \end{equation}

The set of subgradients of $F$ at $n$ is denoted by $\nabla F(n)$.

More generally, for any subset $E\subseteq N$, we write

\[ \nabla F(E)=\bigcup _{n\in E}\nabla F(n). \]

Definition 21.11.32.08E83421373C Given $F,F'\in \mathrm{Conv}(N)$, we write $F\preceq _ P F'$ if

\[ \overline{\nabla F(N)}\subseteq \overline{\nabla F'(N)}. \]

We write $F\sim _ P F'$ if $F\preceq _ P F'$ and $F'\preceq _ P F$.

Theorem 21.11.33.A57F525B7ABC Suppose that $F\in \mathrm{Conv}^{\mathrm{prop}}(N)$. Then the following hold:

  1. 8BEAD5D03F60

    For any $n\not\in \operatorname{Dom}F$, $\nabla F(n)=\varnothing $;

  2. C38BB55E74AA

    for any $n\in \operatorname{RelInt}\operatorname{Dom}F$, $\nabla F(n)\neq \varnothing $; moreover, for any $n'\in N$, we have

    \[ \partial _{n'} F(n)=\sup \left\{ \langle n', m \rangle : m\in \nabla F(n)\right\} ; \]
  3. 891D0FE828BD

    for $n\in N$, the set $\nabla F(n)$ is non-empty and bounded if and only if $n\in \operatorname{Int}\operatorname{Dom}F$.

Proof. Subgradients at points outside the effective domain are empty by definition. On the relative interior, existence and the directional formula follow from local convex regularity applied in the affine span $A$ of the domain. To view a subgradient as a functional on $N$, extend its restriction to the direction space of $A$ by a linear functional. Any functional vanishing on that direction space may be added without changing the subgradient inequality. Thus for a direction outside that space the supremum in the directional formula is $+\infty$, just as the one-sided directional derivative is; for tangent directions it is the relative formula.

At an interior point of the domain, local Lipschitz continuity bounds all subgradients: if $|F(x+v)-F(x)|\leq L|v|$ for small $v$, the subgradient inequality for $v$ and $-v$ gives $|\langle p,v\rangle|\leq L|v|$, hence $|p|\leq L$. Conversely, suppose the subgradient set is nonempty at a point $x$ of the domain which is not interior. A supporting hyperplane to the closure of the convex domain at $x$ supplies a nonzero $q$ with $\langle q,y-x\rangle\leq0$ for every $y$ in the domain. If $p$ is a subgradient, then so is $p+tq$ for every $t\geq0$, so the set is unbounded. Supporting hyperplanes also exist when the domain lies in a proper affine subspace, by taking an annihilating functional. This proves the final equivalence.

For the proof, we refer to [Theorem 23.4, Roc70].

Proposition 21.11.34.8B18F2B2DE3B Let $F\in \mathrm{Conv}^{\mathrm{prop}}(N)$. Then

\[ \nabla F(N)\subseteq \operatorname{Dom}F^*. \]

If moreover $F$ is closed, we have

C0D69D19C109 21.11.35
\begin{equation} \operatorname{RelInt}\operatorname{Dom}F^*\subseteq \nabla F(N). \end{equation}

In particular, if $F$ is a proper closed convex function on $N$, then

\[ \overline{\nabla F(N)}=\overline{\operatorname{Dom}F^*}. \]

Proof. If $p\in\partial F(x)$, the subgradient inequality gives $F^*(p)=\langle p,x\rangle-F(x)<+\infty$, proving the first inclusion. Now assume $F$ is closed and let $p$ lie in the relative interior of $\operatorname{Dom}F^*$. The conjugate is closed and proper by Fenchel duality, so it has a subgradient $x$ at $p$. The same duality theorem gives $p\in\partial F(x)$. Thus the relative interior is contained in the subgradient image. Taking closures in the two inclusions and using that a nonempty convex set has the same closure as its relative interior proves the equality of closures.

Proof. Suppose that $m\in \nabla F(n)$ for some $n\in N$. Then (21.11.31) holds. In particular,

\[ \langle m,n'\rangle -F(n')\leq \langle m,n\rangle -F(n). \]

It follows that

\[ F^*(m)\leq \langle m,n\rangle -F(n)<\infty . \]

(21.11.35) is proved in [Corollary 23.5.1, Roc70]. For the last assertion, it suffices to observe that $\overline{\operatorname{RelInt}\operatorname{Dom}F^*}=\overline{\operatorname{Dom}F^*}$. $\square$

Proposition 21.11.36.7A76E56311F5 Let $\{ F_ i\} _{i\in I}$ be a non-empty family in $\mathrm{Conv}^{\mathrm{prop}}(N)$. Then

\[ \left(\bigwedge _{i\in I} F_ i\right)^*=\bigvee _{i\in I} F_ i^*,\quad \left(\bigvee _{i\in I} \operatorname{cl}F_ i\right)^*=\operatorname{cl}\bigwedge _{i\in I} F_ i^*. \]

If $I$ is finite and $\overline{\operatorname{Dom}F_ i}$ is independent of the choice of $i\in I$, then

\[ \left(\bigvee _{i\in I} F_ i\right)^*=\bigwedge _{i\in I} F_ i^*. \]
Recall that $\wedge $ is defined in definition 21.11.10 and $\lor $ in definition 21.11.11. See [Theorem 16.5, Roc70] for the proof.

Proposition 21.11.37.36CA6A68994E Let $F_1,\ldots ,F_ r\in \mathrm{Conv}^{\mathrm{prop}}(N)$ ($r\in \mathbb {Z}_{>0}$). Assume that

\[ \bigcap _{i=1}^ r\operatorname{RelInt}\operatorname{Dom}(F_ i)\neq \varnothing , \]

then for any $m\in M$,

\[ \left( \sum _{i=1}^ r F_ i \right)^*(m)=\inf \left\{ \sum _{i=1}^ r F_ i^*(m_ i):m_1,\ldots ,m_ r\in M, \sum _{i=1}^ r m_ i=m \right\} . \]

Proof. For every decomposition $p=\sum_i p_i$, the defining inequalities for the conjugates give $(\sum_iF_i)^*(p)\leq\sum_iF_i^*(p_i)$. It remains to prove the reverse inequality when the left side is finite. The case $r=1$ is immediate.

For $r\geq2$, put \[V(z_1,\ldots,z_{r-1})=\inf_x\left\{\sum_{i<r}F_i(x+z_i)+F_r(x)-\langle p,x\rangle\right\}.\] This is convex, being an infimum over the fibers of a convex epigraph. Its value at zero is $-(\sum_iF_i)^*(p)$, which is finite. Choose $x_0$ in the common relative interior in the hypothesis. The product of the effective domains has $(x_0,\ldots,x_0)$ in its relative interior. The linear map $(x_1,\ldots,x_r)\mapsto(x_1-x_r,\ldots,x_{r-1}-x_r)$ maps a relative neighborhood of this point onto a relative neighborhood of zero in its image affine span: a surjective linear map between finite-dimensional spaces has a continuous linear right inverse. Consequently zero lies in the relative interior of $\operatorname{Dom}V$.

The function $V$ cannot take $-\infty$ anywhere. If it did, combining that point with a point of its effective domain on the opposite side of zero would force $V(0)=-\infty$. It is therefore proper, and existence of supporting slopes gives $p_1,\ldots,p_{r-1}$ with $V(z)\geq V(0)+\sum_{i<r}\langle p_i,z_i\rangle$. Set $p_r=p-\sum_{i<r}p_i$. Substituting arbitrary $x_i=x+z_i$ in this inequality yields \[\sum_i\bigl(F_i(x_i)-\langle p_i,x_i\rangle\bigr)\geq V(0).\] Taking independent infima proves $\sum_iF_i^*(p_i)\leq-V(0)=(\sum_iF_i)^*(p)$. Together with the first inequality this is equality. If the conjugate on the left is $+\infty$, the first inequality forces every decomposition cost to be $+\infty$, so the formula still holds.

See [Theorem 16.4, Roc70] for the proof.

Proposition 21.11.38.6FCC352452C3 Let $P\subseteq M$ be a convex body1 and $F\in \mathrm{Conv}^{\mathrm{prop}}(N)$. The following are equivalent:

  1. 2A7BEBC1BA5F

    $F\preceq \operatorname{Supp}_ P$;

  2. 4DF22CEDD6E4

    $\operatorname{Dom}F=N$ and $F^*|_{M\setminus P}\equiv \infty $;

  3. 97FA12796841

    $\operatorname{Dom}F=N$ and $\nabla F(N)\subseteq P$.

Moreover, under these conditions,

D5ABA398BA7B 21.11.39
\begin{equation} F(n)-\operatorname{Supp}_ P(n)\leq F(0),\quad \forall n\in N. \end{equation}

Proof. 1 $\implies $ 2. It is clear that $\operatorname{Dom}F=N$ since $\operatorname{Dom}\operatorname{Supp}_ P=N$. From $F\preceq \operatorname{Supp}_ P$ and example 21.11.25, we know that

\[ \chi _ P=\operatorname{Supp}_ P^*\preceq F^*. \]

So 2 follows.

2 $\implies $ 3. This follows from proposition 21.11.34.

3 $\implies $ 1. The function $t\mapsto F(tn)$ is convex on $[0,1]$, hence absolutely continuous and differentiable almost everywhere. For almost every $t\in (0,1)$,

\[ \frac{\mathrm d}{\mathrm dt}F(tn)=\partial _ n F(tn) \leq \operatorname{Supp}_ P(n) \]

by theorem 21.11.33 and the assumption $\nabla F(N)\subseteq P$. Integrating in $t$ gives

\[ F(n)-F(0)\leq \operatorname{Supp}_ P(n). \]

In particular, (21.11.39) also follows. $\square$

Cite this page

Comments

Corrections, questions, and mathematical discussion are welcome. Sign in with GitHub to comment. Comments are public.