Lesson plan

Pseudoconvexity

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 C n . Pseudoconvex sets are important, as they allow for classification of domains of holomorphy. Let G\subset {\mathbb{C}}^n be a domain. One says that G is pseudoconvex (or Hartogs pseudoconvex) if there exists a continuous plurisubharmonic function \varphi on G such that the set \{ z \in G \mid \varphi(z) 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 C^2 (twice continuously differentiable) boundary, this notion is the same as Levi pseudoconvexity, which is easier to work with. More specifically, with a C^2 boundary, it can be shown that G has a defining function, i.e., that there exists \rho: \mathbb{C}^n \to \mathbb{R} which is C^2 so that G=\{\rho , and \partial G =\{\rho =0\} .…

Back to article

Article summary

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 C n . Pseudoconvex sets are important, as they allow for classification of domains of holomorphy. Let G\subset {\mathbb{C}}^n be a domain. One says that G is pseudoconvex (or Hartogs pseudoconvex) if there exists a continuous plurisubharmonic function \varphi on G such that the set \{ z \in G \mid \varphi(z) 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 C^2 (twice continuously differentiable) boundary, this notion is the same as Levi pseudoconvexity, which is easier to work with. More specifically, with a C^2 boundary, it can be shown that G has a defining function, i.e., that there exists \rho: \mathbb{C}^n \to \mathbb{R} which is C^2 so that G=\{\rho , and \partial G =\{\rho =0\} .…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.