How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Levi problem: pseudoconvexity, domains of holomorphy, and holomorphic convexity
Statement
Assume the Axiom of Choice (AC). Let be a domain, . Then the following three conditions are equivalent:
- is Hartogs pseudoconvex (Plurisubharmonic exhaustions and Hartogs pseudoconvexity);
- is a domain of holomorphy (Holomorphic extension and domains of holomorphy in several variables);
- is holomorphically convex, that is, for every compact (Holomorphic hulls and holomorphic convexity).
Facts & Assumptions
Given: The Axiom of Choice and a domain , .
Hartogs pseudoconvexity gives a continuous plurisubharmonic exhaustion on (Hartogs pseudoconvexity yields a continuous plurisubharmonic exhaustion).
In Demailly, Complex Analytic and Differential Geometry, Ch. I §7.A, Theorem 7.2(c) implies (e): a plurisubharmonic exhaustion on a proper open subset of makes plurisubharmonic, which is his pseudoconvexity criterion. Ch. VIII §9, Theorem 9.11(a), printed pp. 392–393, says that an open subset of is a domain of holomorphy if and only if it is pseudoconvex. Its proof of the forward implication used here applies Skoda's Theorem 9.10 to the coordinate functions at a boundary point with a plurisubharmonic distance weight; the resulting identity prevents common holomorphic continuation across .
For a domain in , being a domain of holomorphy is equivalent to holomorphic convexity (Cartan-Thullen theorem).
Every domain of holomorphy in is Hartogs pseudoconvex (Domains of holomorphy are Hartogs pseudoconvex).
The holomorphic hull of a compact set is closed in its ambient domain and bounded in each coordinate (Basic properties of the holomorphic hull). A closed bounded subset of is compact (Complex -space and its real coordinate dictionary, Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
AC supplies the ambient choice assumptions of the source theorem and the cited library interfaces (The Axiom of Choice).
Choice use. AC is the stated ambient hypothesis. The proof itself makes no new arbitrary selection; the nontrivial existence theorem imported in [F2] is used under its classical choice setting.
Proof
Suppose is Hartogs pseudoconvex and proper in . By [F1] it has a continuous plurisubharmonic exhaustion. Demailly's pseudoconvexity equivalence in [F2] makes it pseudoconvex in his sense; his Levi theorem in [F2] then gives that is a domain of holomorphy.
If , then for every compact its holomorphic hull is closed in and coordinate-bounded by [F5], hence compact. Thus is holomorphically convex and therefore a domain of holomorphy by [F3]. This covers the whole-space convention separately.
By [F3], the domain-of-holomorphy conclusion of steps 1.1–1.2 is equivalent to holomorphic convexity. Conversely, either of those conditions gives Hartogs pseudoconvexity by [F4]. Hence all three conditions in the Statement are equivalent.
Depends on
- The Axiom of Choice
- Plurisubharmonic exhaustions and Hartogs pseudoconvexity
- Hartogs pseudoconvexity yields a continuous plurisubharmonic exhaustion
- Cartan-Thullen theorem
- Domains of holomorphy are Hartogs pseudoconvex
- Basic properties of the holomorphic hull
- Complex $m$-space and its real coordinate dictionary
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Used by
Dependency tree · two levels
60 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jean-Pierre Demailly, Complex Analytic and Differential Geometry (standard reference, not scraped)