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.
Negative Laurent coefficients vanish on a Hartogs figure
Statement
In the notation of Laurent coefficients on Hartogs slices depend holomorphically on the remaining variables, one has
Facts & Assumptions
Given: A holomorphic function on , a radius with , and the Laurent coefficient functions defined in the preceding lemma.
Each is holomorphic on the unit disc, and for fixed the numbers are the Laurent coefficients of the slice on the annulus (Laurent coefficients on Hartogs slices depend holomorphically on the remaining variables).
A holomorphic function on a punctured disc has a removable singularity exactly when its Laurent expansion has no negative powers (Characterizations of removable singularities).
A holomorphic function on a connected open set that vanishes on a nonempty open subset vanishes identically (A holomorphic function vanishing on a nonempty open subset of a domain vanishes identically).
Proof
Fix with . Then for every , so the slice is holomorphic on the whole unit disc. By [L1], the coefficients are the Laurent coefficients of that slice on , and [L2] therefore forces for every .
For each fixed , step 1.1 shows that the holomorphic function is zero on the nonempty open disc . The domain is connected, so [L3] gives there.
As was arbitrary, every negative Laurent coefficient vanishes on the whole parameter disc .
Depends on
Used by
Dependency tree · two levels
17 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)