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.
Continuity principle for domains of holomorphy
Statement
Let be a domain of holomorphy, and let be a continuous family of analytic discs. Assume that there is a compact set with for every , and that . Then
Facts & Assumptions
Given: A domain of holomorphy and a continuous family of analytic discs satisfying the boundary and initial-disc hypotheses.
The family and its boundary hypotheses are those of Continuous families of analytic discs.
A domain of holomorphy is holomorphically convex, so the holomorphic hull of a compact subset is compactly contained in the domain (Cartan-Thullen theorem).
A function holomorphic on a disc and continuous on its closure is bounded there by its boundary maximum (Boundary maximum modulus principle on a bounded domain).
Proof
Put . By [L2], . Let The initial-disc hypothesis gives . If , then the compact set lies in the open set ; uniform continuity of on the compact parameter product shows that the same containment holds for all parameters sufficiently close to . Thus is open in .
If and , then is holomorphic on and continuous on its closure. By [L3] and the boundary hypothesis, Since this holds for every , one has .
Let and . For every , step 2.1 gives . The compact set is closed in , so continuity of yields . Hence , and is closed. Since is connected and is nonempty, open, and closed, .
Depends on
Used by
Dependency tree · two levels
15 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.5 (standard reference, not scraped)
- Harold P. Boas, Lecture Notes on Several Complex Variables, Theorem 8, continuity-principle implication (standard reference, not scraped)