×

On the product property of the pluricomplex Green function. (English) Zbl 0884.31005

Summary: Let \(E\) denote the unit disc in \(\mathbb{C}\). For any domain \(G\subset\mathbb{C}^n\) define \[ g_D(a,z):= \inf_{\substack{ \varphi\in{\mathcal O}(E,D)\\ \varphi(0)=z\\ a\in\varphi(E)}} \Biggl\{ \prod_{\lambda\in \varphi^{-1}(a)} |\lambda |^{\text{ord}_\lambda (\varphi-a)}\Biggr\}, \qquad a,z\in D, \] where \({\mathcal O}(E,D)\) denotes the set of all holomorphic mappings \(E\to D\) and \(\text{ord}_\lambda (\varphi-a)\) denotes multiplicity of \(\varphi-a\) at \(\lambda\). The function \(g_D\) is called the pluricomplex Green function for \(D\).
The author proves that the pluricomplex Green function has the product property \(g_{D_1\times D_2}= \max\{g_{D_1}, g_{D_2}\}\) for any domains \(D_1\subset \mathbb{C}^n\) and \(D_2\subset \mathbb{C}^m\).

MSC:

31C10 Pluriharmonic and plurisubharmonic functions
32U05 Plurisubharmonic functions and generalizations

References:

[1] Marek Jarnicki and Peter Pflug, Invariant distances and metrics in complex analysis, De Gruyter Expositions in Mathematics, vol. 9, Walter de Gruyter & Co., Berlin, 1993. · Zbl 0789.32001
[2] Marek Jarnicki and Peter Pflug, Remarks on the pluricomplex Green function, Indiana Univ. Math. J. 44 (1995), no. 2, 535 – 543. · Zbl 0848.31007 · doi:10.1512/iumj.1995.44.2000
[3] Kiyoshi Noshiro, Cluster sets, Ergebnisse der Mathematik und ihrer Grenzgebiete. N. F., Heft 28, Springer-Verlag, Berlin-Göttingen-Heidelberg, 1960. · Zbl 0090.28801
[4] Evgeny A. Poletsky, Holomorphic currents, Indiana Univ. Math. J. 42 (1993), no. 1, 85 – 144. · Zbl 0811.32010 · doi:10.1512/iumj.1993.42.42006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.