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 locally finite effective divisor on a plane domain is a holomorphic zero divisor
Statement
Let be a plane domain, let , and assign a nonnegative integer to each . Suppose the positive support is locally finite in : every compact subset of meets in finitely many points. Then there is a holomorphic function on with for each and with no zeros in . In particular, means .
This is the realization of the effective divisor . Its support has no accumulation point in ; isolation of the points of alone is insufficient. Empty and finite supports are included.
Facts & Assumptions
Given: A plane domain , a set , and finite nonnegative integer multiplicities whose positive support satisfies the stated local finiteness condition.
The elementary factors are , with (Weierstrass elementary factors). The exponential is entire and satisfies , so every has exactly one zero, simple, at (The complex exponential is entire and its complex derivative is itself, , and the complex exponential extends the real exponential). Finite products, quotients with nonzero denominator, and compositions of holomorphic functions are holomorphic (Linearity, product, reciprocal, and quotient rules for complex derivatives, The chain rule for complex derivatives).
A holomorphic product whose factors are not identically zero and whose deviations from are summable uniformly on each compact set after deleting finitely many zero-contributing factors has a holomorphic limit with exactly the factor zeros and their multiplicities (Normally convergent products define holomorphic functions with the expected zeros).
Closed bounded sets in are compact, and continuous real functions on nonempty compact sets attain their minima (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value). Distance to a fixed nonempty set is -Lipschitz (, so the distance to a fixed nonempty set is -Lipschitz).
The order at a point where a holomorphic function is nonzero is (The order of a zero of a holomorphic function).
The rationals are countable and dense in the reals, finite products of countable sets are countable, integer pairs have an explicit integer code, and an infinite subset of the nonnegative integers is enumerated by successively taking its least unused member; these statements use no Choice ( is countably infinite, The rationals embed densely in the reals, A product of two at most countable sets is at most countable, , Every subset of an at most countable set is at most countable).
Proof
Every point of has a closed disc neighbourhood contained in , so local finiteness makes each point of isolated and prevents any accumulation point of in . By [L6], enumerate all open discs with rational centre coordinates and positive rational radius in a fixed order. For each , let be the least index of such a disc containing and meeting only at ; isolation and density of the rationals ensure its existence. Distinct points have distinct indices. Thus injects into the nonnegative integers. By [L6], encode the pairs with by a fixed pairing of integers, and list the resulting codes in increasing order. This gives the points of repeated exactly times, without a choice principle. A compact subset contains only finitely many entries of this list. If the list is finite, works, with empty product . Henceforth assume it is infinite.
If is empty, put all entries into a list and leave the list empty. If is nonempty, set and split the repeated list, preserving its order, according to : contains the entries in , and those outside . Either sublist may be empty, finite, or infinite. The closedness of and openness of imply on , and [L4] makes continuous.
Suppose is infinite. For each , an entry with satisfies . Such entries lie in the closed bounded set , contained in and compact by [L4]. Step 1.1 makes their number finite. Thus . To specify a nearest boundary point without simultaneous choices, consider the compact nonempty set . The minimum of on it is : points outside it have distance greater than , and the definition of the infimum supplies points inside it with distance arbitrarily close to . The nearest-point set is therefore nonempty compact. First minimize on that set, then minimize on the minimizers. This specifies a unique with .
Suppose is infinite. If , every closed disc is compact in , so step 1.1 shows that only finitely many entries have modulus at most any fixed . If , entries with satisfy ; they lie in the compact subset of , which again contains only finitely many entries. In either case . Let be the finite number of zero entries and enumerate the nonzero entries as . Then .
For infinite define . Its denominator is nonzero on , so [L1] makes it holomorphic. Its only zero is , and that zero is simple because and the exponential factor never vanishes. For a nonempty compact , [L4] gives . Since , for all sufficiently large . These tail factors have no zeros on , and [L2] gives . Hence [L3] yields a holomorphic function with precisely the listed zeros and their multiplicities. If is finite, take its finite polynomial instead, and if it is empty take .
On each disc , eventually , so is zero-free there and [L2] gives . By [L1] and [L3], is entire with exactly the listed nonzero zeros and their multiplicities; since every partial product equals there. Thus contributes the listed zeros, with contributing no zero at . If is finite, take its finite polynomial instead, and if it is empty take .
Set . It is holomorphic by [L1], and steps 4.1 and 4.2 show that its zero set is exactly , with order at each : at a given point the orders of the finitely many contributing factors add and the remaining local product is nonzero. Every point of has a disc meeting in finitely many points, and that disc contains a point outside this finite set, so is not identically zero. It is nonzero at each point of , and [L5] gives order there, including each with . This proves the stated realization.
Depends on
- Weierstrass elementary factors
- The unit-disc estimate for Weierstrass elementary factors
- Normally convergent products define holomorphic functions with the expected zeros
- The order of a zero of a holomorphic function
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- $|d(x,A) - d(y,A)| \le d(x,y)$, so the distance to a fixed nonempty set is $1$-Lipschitz
- The complex exponential is entire and its complex derivative is itself
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- Linearity, product, reciprocal, and quotient rules for complex derivatives
- The chain rule for complex derivatives
- $\mathbb{Q}$ is countably infinite
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- A product of two at most countable sets is at most countable
- Every subset of an at most countable set is at most countable
- The rationals embed densely in the reals
Used by
Dependency tree · two levels
126 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, §8.2.3, Theorem 8.2.7, pp. 205–206; Lemma 8.2.3 and Theorem 8.2.4, pp. 200–201 (standard reference, not scraped)
- M. Weber, Complex Analysis, §3.3, Theorem 3.3.3, pp. 38–39 (entire-function case) (standard reference, not scraped)