Pome

Theorem 21.12.138B5B73657BF7

Theorem 21.12.13.8B5B73657BF7 There are canonical bijections between the following three sets:

  1. 7680C9B63EAE

    The set of $\varphi \in \mathrm{PSH}_{\mathrm{tor}}(X,\omega )$,

  2. 2C49CA751C18

    the set $\mathcal{P}(N_{\mathbb {R}},P)$ in definition 21.11.41, namely, the set of convex functions $F\colon N_{\mathbb {R}}\rightarrow \mathbb {R}$ satisfying $F\preceq \operatorname{Supp}_ P$, and

  3. B8FE90D4F13F

    the set of closed proper convex functions $G\in \mathrm{Conv}(M_{\mathbb {R}})$ satisfying

    \[ G|_{M_{\mathbb {R}}\setminus P}\equiv \infty . \]

Proof. The bijection between 2 and 3 is the classical Legendre duality. Given $F$ as in 2, we construct $G=F^*$ and vice versa, see proposition 21.11.38.

The map from 1 to 2 is given as follows: Given $\varphi \in \mathrm{PSH}_{\mathrm{tor}}(X,\omega )$, since $\varphi $ is $T_ c$-invariant, we can find $f\colon N_{\mathbb {R}}\rightarrow [-\infty ,\infty )$ such that

0CA6FBB8B2BF 21.12.14
\begin{equation} \varphi |_{T(\mathbb {C})}=\operatorname{Trop}^*f. \end{equation}

We then define $F=f+F_0$. Then $\operatorname{Trop}^* F\in \mathrm{PSH}(T(\mathbb {C}))$. By 21.12.7, $F(n)$ is finite for any $n\in N_{\mathbb {R}}$ and $F$ is convex. Moreover, $F\preceq \operatorname{Supp}_ P$ since $\varphi $ is bounded from above on the compact space $X$ and $F_0\preceq \operatorname{Supp}_ P$.

Conversely, given a map $F\in \mathcal{P}(N_{\mathbb {R}},P)$, then

\[ \operatorname{Trop}^*(F-F_0)\in \mathrm{PSH}\left(T(\mathbb {C}),\omega |_{T(\mathbb {C})}\right). \]

Since $F\preceq \operatorname{Supp}_ P$ and $F_0\sim \operatorname{Supp}_ P$, the difference $F-F_0$ is bounded from above. Hence the corresponding local psh potentials are locally bounded from above near $X\setminus T(\mathbb {C})$. It follows from theorem 5.14.10 that this function can be extended uniquely to an $\omega $-psh function on $X$. The uniqueness of the extension guarantees its $T_ c$-invariance.

The two maps are inverse to each other by construction. $\square$

Cite this page

Comments

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