Several complex variables and analytic spaces Holomorphic convexity and pseudoconvexity Problem
Levi problem
Builds on PseudoconvexityDomain of holomorphy
Problem
Let and let be a domain. Every domain of holomorphy is pseudoconvex. Is every pseudoconvex domain a domain of holomorphy?
Remarks
The answer is yes. Kiyoshi Oka proved it for in 1942. For all 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 with Hörmander's estimates for weights built from a plurisubharmonic exhaustion function. The problem has no content for , 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
- no evidence level
- Domain of holomorphy concept
- Pseudoconvexity concept
- Levi problem problem
Further reading
About this page
| Tag | 47CVS9RJ9D |
|---|---|
| URI | m2://47CVS9RJ9D |
| Kind | problem |
| Writing | W0 stub |
| MSC | 32E40, 32T05 |
| Status | This copy of the site has no build data. Run m2 status 47CVS9RJ9D. |
| About | Pseudoconvexity, Domain of holomorphy |
| Uses | Pseudoconvexity, 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.