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.
Every discrete effective divisor on a plane domain is the zero divisor of a holomorphic function
Statement
Let be a plane domain, and let be discrete with multiplicities . Then there is a holomorphic function on whose zero at each has order exactly and which has no other zeros.
Facts & Assumptions
Given: A plane domain and a discrete effective divisor on .
The elementary factor has its only zero at (Weierstrass elementary factors).
A normally convergent product of holomorphic factors is holomorphic and has exactly the zeros contributed by its factors (Normally convergent products define holomorphic functions with the expected zeros).
If and is a discrete sequence of nonzero complex numbers, then a product is entire and has exactly the order- zero at and the listed nonzero zeros with multiplicity (Weierstrass product theorem on the complex plane).
Proof
List the points of with each repeated times. If the list is finite, the corresponding finite polynomial works (with for the empty list). If the list is infinite and , let be the multiplicity of and enumerate the remaining nonzero terms as . Fact [L4] applied to and gives the required entire function. Thus assume . Define Split the repeated list into , consisting of the terms in , and , consisting of the remaining terms.
For each , choose with . If is infinite, then : otherwise a subsequence stays a fixed positive distance from the boundary, while the defining inequality for keeps that subsequence bounded, producing a limit point in . Define Each is holomorphic on and, by [L1], has its only zero at .
If is infinite, then . Indeed, a bounded subsequence would have a limit point; discreteness excludes a limit in , while gives which excludes a boundary limit. Let be the multiplicity of in this list and enumerate its nonzero terms as . Then , so [L4] gives an entire function whose zeros, with repetition, are exactly the . If the list is finite, take the corresponding finite polynomial, and if it is empty, take .
Fix a compact set and put . For all sufficiently large , Hence [L2] gives after increasing the starting index if necessary. Thus is normally convergent on , and [L3] gives a holomorphic function whose zeros, with repetition, are exactly the .
The product is holomorphic on . Steps 3.1 and 2.2 show that its zeros are exactly the original points , and repetition in the list gives each zero order .
Depends on
Used by
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
- J. Lebl, Guide to Cultivating Complex Analysis, §9.4 (standard reference, not scraped)
- M. Weber, Complex Analysis, §3.3 and §4.4 (standard reference, not scraped)