Math 2.0

Several complex variables and analytic spaces Holomorphic convexity and pseudoconvexity Problem

Levi problem

Builds on PseudoconvexityDomain of holomorphy

Problem

Let n≥2n \ge 2 and let Ω⊆ℂn\Omega \subseteq \C^n be a domain. Every domain of holomorphy is pseudoconvex. Is every pseudoconvex domain Ω⊆ℂn\Omega \subseteq \C^n a domain of holomorphy?

Remarks

The answer is yes. Kiyoshi Oka proved it for n=2n = 2 in 1942. For all nn it was proved in the early 1950s, independently by Oka, by Hans-Joachim Bremermann and by François Norguet. Hans Grauert solved the analogue for complex manifolds in 1958: a complex manifold with a smooth strictly plurisubharmonic exhaustion function is a Stein manifold. A modern proof solves the equation ∂ˉu=f\bar\partial u = f with Hörmander's L2L^2 estimates for weights built from a plurisubharmonic exhaustion function. The problem has no content for n=1n = 1, where every domain is both pseudoconvex and a domain of holomorphy.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Domain of holomorphy concept
  2. Pseudoconvexity concept
  3. Levi problem problem

Further reading

  1. Web https://en.wikipedia.org/wiki/Stein_manifold
About this page
Tag47CVS9RJ9D
URIm2://47CVS9RJ9D
Kindproblem
WritingW0 stub
MSC32E40, 32T05
StatusThis copy of the site has no build data. Run m2 status 47CVS9RJ9D.
AboutPseudoconvexity, Domain of holomorphy
UsesPseudoconvexity, Domain of holomorphy

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

Results about this