Pseudoconvexity

From testwiki
Revision as of 08:42, 23 June 2023 by imported>Silvermatsu (References: | Add: s2cid, arxiv, pages, volume, journal, year, title, authors 1-2. | Use this tool. Report bugs. | #UCB_Gadget)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Gn

be a domain, that is, an open connected subset. One says that G is pseudoconvex (or Hartogs pseudoconvex) if there exists a continuous plurisubharmonic function φ on G such that the set

{zGφ(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 iff for every pG and w in the complex tangent space at p, that is,

ρ(p)w=i=1nρ(p)zjwj=0, we have
i,j=1n2ρ(p)zizj¯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 GkG with C (smooth) boundary which are relatively compact in G, such that

G=k=1Gk.

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. The concept of pseudoconvexity is thus more useful in dimensions higher than 1.

See also

References

Template:PlanetMath attribution

Template:Convex analysis and variational analysis