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.
FALSE: the union of two domains of holomorphy is always a domain of holomorphy
Statement
The union of two domains of holomorphy is always a domain of holomorphy.
Facts & Assumptions
Given: The domains
A domain of holomorphy is characterized by the impossibility of extending every holomorphic function across one common larger neighborhood (Holomorphic extension and domains of holomorphy in several variables).
A holomorphic identity on a nonempty open subset propagates across a connected domain (A holomorphic function vanishing on a nonempty open subset of a domain vanishes identically).
In complex dimension at least two, a holomorphic function on a punctured domain extends across the missing point (An isolated puncture is removable in complex dimension at least two).
Refutation
The function is holomorphic on . If it extended across a point of the missing hyperplane , then would be holomorphic there and equal to on a nonempty open subset of the extension domain, so [L2] would force , impossible where . The same argument with shows that is also a domain of holomorphy.
The union is exactly . By [L3], every holomorphic function on this punctured space extends across the origin, so [L1] shows that is not a domain of holomorphy. Thus the statement is false.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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, §1.6 and §2.1 (standard reference, not scraped)
- Harold P. Boas, Lecture Notes on Several Complex Variables, §3.2.3 (standard reference, not scraped)