ScalingStacks

Proof. [0284]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

We use a similar argument to the one in the proof of Proposition 2 in [Co]. Consider the subvariety A=(X×ℂ)∪(ℂn×{0})⊂ℂn+1A=(X\times{\mathbb{C}})\cup({\mathbb{C}}^{n}\times\{0\})\subset{\mathbb{C}}^{n+1}, and let

D={(z,w)∈X×ℂ:log⁡|w|+χ⁡(z)<0}∪(ℂn×{0})⊂A.D=\{(z,w)\in X\times{\mathbb{C}}:\,\log|w|+\chi(z)<0\}\cup({\mathbb{C}}^{n}\times\{0\})\subset A.

Since D∩(X×ℂ)D\cap(X\times{\mathbb{C}}) is Runge in X×ℂX\times{\mathbb{C}}, it follows that DD is Runge in AA. Let

K={(z,w)∈ℂn+1:ρ⁡(z,w)=max⁡{log+⁡(‖z‖/R),log⁡|w|+v⁡(z)}≤0}.K=\{(z,w)\in{\mathbb{C}}^{n+1}:\,\rho(z,w)=\max\{\log^{+}(\|z\|/R),\log|w|+v(z)\}\leq 0\}.

Since vv is continuous, ρ\rho is a continuous psh exhaustion function on ℂn+1{\mathbb{C}}^{n+1}, so KK is a polynomially convex compact set. As χ<v\chi<v on XX, we have K∩A⊂DK\cap A\subset D. By [Co, Theorem 3] there exists a Runge domain D~⊂ℂn+1\widetilde{D}\subset{\mathbb{C}}^{n+1}, with D~∩A=D\widetilde{D}\cap A=D and K⊂D~K\subset\widetilde{D}. Let δ⁡(z,w)\delta(z,w) denote the distance from (z,w)∈D~(z,w)\in\widetilde{D} to ∂D~\partial\widetilde{D} in the ww-direction. Since D~\widetilde{D} is pseudoconvex, −log⁡δ-\log\delta is psh on D~\widetilde{D} (see e.g. [FS, Proposition 9.2]). Hence χ~​(z)=−log⁡δ⁡(z,0)\widetilde{\chi}(z)=-\log\delta(z,0) is psh on ℂn{\mathbb{C}}^{n}, as ℂn×{0}⊂D~{\mathbb{C}}^{n}\times\{0\}\subset\widetilde{D}. Since D~∩A=D\widetilde{D}\cap A=D, it follows that χ~|X=χ\widetilde{\chi}\,|_{{}_{X}}=\chi. Moreover, K⊂D~K\subset\widetilde{D} implies that χ~​(z)<v​(z)\widetilde{\chi}(z)<v(z) for all z∈ℂnz\in{\mathbb{C}}^{n} with ‖z‖≤R\|z\|\leq R. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.