Assume that $H_1$, $H_2$ : $ R^{n} \rightarrow R $ are convex, coercive and smooth. Prove that $min_{p \in R ^{n}}[H_1(p)+H_2(p)]=\max_{\nu \in R^{n}}[-L_1(\nu)-L_2(-\nu)]$ where $L_1=H_{1}^{*}$, $L_2=H_{2}^{*}$.
We define $H(p)$ and $L(q)$ as follows
$H(p)=\sup_{q \in R ^{n}}[pq-L(q)]$; $L(q)=\sup_{p \in R ^{n}}[qp-H(p)]$
I proved one side of the equality. That is $min_{p \in R ^{n}}[H_1(p)+H_2(p)] \ge \max_{\nu \in R^{n}}[-L_1(\nu)-L_2(-\nu)]$. This part is easy. I am trying to prove $min_{p \in R ^{n}}[H_1(p)+H_2(p)] \le \max_{\nu \in R^{n}}[-L_1(\nu)-L_2(-\nu)]$. This is my question actually. Thanks for any hint.