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.
A domain containing a Hartogs figure but not its hull is not a domain of holomorphy
Statement
Let be a domain. If there exist such that
then is not a domain of holomorphy.
Facts & Assumptions
Given: A domain with and .
A domain of holomorphy is defined by the nonexistence of one fixed overlap from which every holomorphic function extends farther (Holomorphic extension and domains of holomorphy in several variables).
Every holomorphic function on extends uniquely to the full bidisc (A holomorphic function on a Hartogs figure extends to the full bidisc).
Proof
Let . Its restriction to the open subset is holomorphic, so [L2] gives a holomorphic function with on .
The domain is not contained in by hypothesis, and is a nonempty open subset of . Thus the same open overlap works for every holomorphic function on , namely the fixed set and the larger domain .
By the definition in [L1], the existence of that common pair shows that is not a domain of holomorphy.
Depends on
Used by
- FALSE: every domain in C² is a domain of holomorphy False statement
Dependency tree · two levels
10 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
- J. Lebl, Tasty Bits of Several Complex Variables, §2.1 (standard reference, not scraped)