MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).
1

1

In several complex variables , to determine the pseudoconvexity of a domain in $C^n$ is very important . There are various criterion to decide whether a domain is pseudoconvex . In particular ,if the domain is defined by a $C^\infty$ defining function $\phi>0$ , then 'Levi pseudoconvex ' is equivalent to the following matrix (which is called 'Monge-Ampere matrix') $$ \begin{pmatrix} -\phi & -\partial_\bar{k}\phi \\ -\partial_j\phi & -\partial_{j\bar{k}}^2\phi \end{pmatrix} $$ have precise one negative eigenvalue and n positive eigenvalues .

So my question is how to prove this ? Anybody knows? Thanks very much!

flag
I fixed your math display. You probably should also include a definition of the notation $\partial_{\bar{k}}$ (I think I know what it is, but best to make sure), and perhaps (link to) a short description of Levi pseudoconvexity to refresh our memories. – Willie Wong Mar 9 2011 at 12:33

1 Answer

0

Since $\phi$ is always nonzero inside $\Omega$ , so this matrix has precise one negative eigenvalue and n positive eigenvalues is equivalent to $-\partial\bar{\partial}log\phi$ is non-negative , but which means that $-log\phi$ is a plurisubharmonic exhaustion function for the domain $\Omega$ , i.e. $\Omega$ is pseudoconvex.

link|flag

Your Answer

Get an OpenID
or

Not the answer you're looking for? Browse other questions tagged or ask your own question.