Pseudoconvexity

From testwiki
Jump to navigation Jump to search

Template:Short description Template:About In mathematics, more precisely in the theory of functions of several complex variables, a pseudoconvex set is a special type of open set in the n-dimensional complex space Cn. Pseudoconvex sets are important, as they allow for classification of domains of holomorphy.

Let G⊂ℂn be a domain. One says that G is pseudoconvex (or Hartogs pseudoconvex) if there exists a continuous plurisubharmonic function φ on G such that the set {z∈G∣φ(z)<x} is a relatively compact subset of G for all real numbers x. In other words, a domain is pseudoconvex if G has a continuous plurisubharmonic exhaustion function. Every (geometrically) convex set is pseudoconvex. However, there are pseudoconvex domains which are not geometrically convex.

When G has a C2 (twice continuously differentiable) boundary, this notion is the same as Levi pseudoconvexity, which is easier to work with. More specifically, with a C2 boundary, it can be shown that G has a defining function, i.e., that there exists ρ:ℂn→ℝ which is C2 so that G={ρ<0}, and ∂G={ρ=0}. Now, G is pseudoconvex if and only if for every p∈∂G and w in the complex tangent space at p, that is,

∇ρ(p)w=∑i=1n∂ρ(p)∂zjwj=0, we have
∑i,j=1n∂2ρ(p)∂zi∂zj¯wiwj¯≥0.

The definition above is analogous to definitions of convexity in Real Analysis.

If G does not have a C2 boundary, the following approximation result can be useful.

Proposition 1 If G is pseudoconvex, then there exist bounded, strongly Levi pseudoconvex domains Gk⊂G with C∞ (smooth) boundary which are relatively compact in G, such that

G=⋃k=1∞Gk.

This is because once we have a φ as in the definition we can actually find a C∞ exhaustion function.

The case n = 1

In one complex dimension, every open domain is pseudoconvex.

See also

References

Template:PlanetMath attribution

Template:Convex analysis and variational analysis