Math 2.0

Several complex variables and analytic spaces Holomorphic convexity and pseudoconvexity Concept

Pseudoconvexity

Summary

Pseudoconvexity is the notion of convexity adapted to several complex variables. An open set in ℂn\C^n is pseudoconvex if it admits a continuous plurisubharmonic exhaustion function. Such a function tends to +∞+\infty at the boundary and, for unbounded sets, at infinity. Unlike holomorphic convexity, it is a local condition at the boundary, and for smooth boundaries it can be checked with the Levi form. By the solution of the Levi problem, the pseudoconvex domains in ℂn\C^n are exactly the domains of holomorphy.

Where this leads

9 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Pseudoconvexity
About this page
TagAHYZMSBBNH
URIm2://AHYZMSBBNH
Kindconcept
WritingW0 stub
MSC32T05, 32U10
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Results about this

Special cases

Definitions