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.
Levi pseudoconvex domains
Definition
Fix an integer . Use the one-based coordinate, vector-component and Wirtinger-operator aliases of The Levi form and strict plurisubharmonicity: for , and denote the canonical coordinate and vector component with index , and denotes the canonical Wirtinger operator with index . All coordinates, vector components and derivatives below use these aliases.
Let be a domain with boundary. We say that is Levi pseudoconvex when for every boundary point there are a neighbourhood of and a function such that
and
for every complex tangent vector satisfying
Depends on
Used by
- A Hartogs domain with a strictly plurisubharmonic exhaustion Example
- Levi form of the unit ball Example
- The unit ball is Levi pseudoconvex Example
- A strictly pseudoconvex boundary point has a local holomorphic separator Lemma
- Levi pseudoconvexity does not depend on the defining function Lemma
- Peak functions at strongly pseudoconvex boundary points, by a dbar correction Lemma
- Smooth global defining functions for strongly pseudoconvex boundaries Lemma
- Weighted ∂̄ solvability on a smoothly bounded pseudoconvex domain Lemma
- Weighted Morrey–Kohn estimate with a pseudoconvex boundary term Lemma
- Hartogs pseudoconvexity implies Levi pseudoconvexity for C² domains Theorem
- Hörmander's weighted L2 existence theorem for the dbar equation Theorem
Dependency tree · two levels
3 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
- Jiří Lebl, Tasty Bits of Several Complex Variables, §2.3 and §2.5 (standard reference, not scraped)
- Harold P. Boas, Lecture Notes on Several Complex Variables, §3.3.1 (standard reference, not scraped)