Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck pass
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 Ω⊆C be a plane domain, let A⊆Ω, and assign a nonnegative integer m(a) to each a∈A. Suppose the positive support S:={a∈A:m(a)>0} is locally finite in Ω: every compact subset of Ω meets S in finitely many points. Then there is a holomorphic function F≢0 on Ω with ord⁡a(F)=m(a) for each a∈A and with no zeros in Ω∖S. In particular, m(a)=0 means F(a)≠0.

This is the realization of the effective divisor ∑a∈Sm(a)[a]. Its support has no accumulation point in Ω; isolation of the points of S alone is insufficient. Empty and finite supports are included.

Facts & Assumptions

Given: A plane domain Ω, a set A⊆Ω, and finite nonnegative integer multiplicities whose positive support S satisfies the stated local finiteness condition.

[L1]

The elementary factors are Ep(w)=(1−w)exp⁡(w+w2/2+⋯+wp/p), with E0(w)=1−w (Weierstrass elementary factors). The exponential is entire and satisfies exp⁡(u)exp⁡(−u)=exp⁡(0)=1, so every Ep has exactly one zero, simple, at w=1 (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). 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).

[L2]

For ∣w∣≤1, ∣1−Ep(w)∣≤∣w∣p+1 (The unit-disc estimate for Weierstrass elementary factors).

[L3]

A holomorphic product whose factors are not identically zero and whose deviations from 1 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).

[L5]

The order at a point where a holomorphic function is nonzero is 0 (The order of a zero of a holomorphic function).

[L6]

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 (Q is countably infinite, The rationals embed densely in the reals, A product of two at most countable sets is at most countable, N×N≈N, Every subset of an at most countable set is at most countable).

Proof

technique · constructive
1.1givenL4L6constructcases

Every point of Ω has a closed disc neighbourhood contained in Ω, so local finiteness makes each point of S isolated and prevents any accumulation point of S in Ω. By [L6], enumerate all open discs with rational centre coordinates and positive rational radius in a fixed order. For each a∈S, let k(a) be the least index of such a disc containing a and meeting S only at a; isolation and density of the rationals ensure its existence. Distinct points have distinct indices. Thus S injects into the nonnegative integers. By [L6], encode the pairs (k(a),r) with 1≤r≤m(a) by a fixed pairing of integers, and list the resulting codes in increasing order. This gives the points of S repeated exactly m(a) times, without a choice principle. A compact subset contains only finitely many entries of this list. If the list is finite, F(z)=∏a∈S(z−a)m(a) works, with empty product 1. Henceforth assume it is infinite.

2.1step 1.1L4constructcases

If C:=C∖Ω is empty, put all entries into a list (cj) and leave the list (bj) empty. If C is nonempty, set δ(z):=dist⁡(z,C) and split the repeated list, preserving its order, according to D:={z∈Ω:δ(z)<1/(∣z∣+1)}: (bj) contains the entries in D, and (cj) those outside D. Either sublist may be empty, finite, or infinite. The closedness of C and openness of Ω imply δ(z)>0 on Ω, and [L4] makes δ continuous.

3.1step 1.1step 2.1L4construct

Suppose (bj) is infinite. For each ε>0, an entry bj with δ(bj)≥ε satisfies ∣bj∣<1/ε. Such entries lie in the closed bounded set {z:∣z∣≤1/ε, δ(z)≥ε}, contained in Ω and compact by [L4]. Step 1.1 makes their number finite. Thus δ(bj)→0. To specify a nearest boundary point without simultaneous choices, consider the compact nonempty set C∩B‾(bj,δ(bj)+1). The minimum of ∣bj−p∣ on it is δ(bj): points outside it have distance greater than δ(bj)+1, and the definition of the infimum supplies points inside it with distance arbitrarily close to δ(bj). The nearest-point set is therefore nonempty compact. First minimize Re⁡p on that set, then minimize Im⁡p on the minimizers. This specifies a unique pj∈C with ∣bj−pj∣=δ(bj).

3.2step 1.1step 2.1L4constructcases

Suppose (cj) is infinite. If C=∅, every closed disc is compact in Ω=C, so step 1.1 shows that only finitely many entries have modulus at most any fixed R. If C≠∅, entries with ∣cj∣≤R satisfy δ(cj)≥1/(R+1); they lie in the compact subset {z:∣z∣≤R, δ(z)≥1/(R+1)} of Ω, which again contains only finitely many entries. In either case ∣cj∣→∞. Let m0 be the finite number of zero entries and enumerate the nonzero entries as (dj). Then ∣dj∣→∞.

4.1step 3.1L1L2L3L4constructcases

For infinite (bj) define Qj(z):=Ej((bj−pj)/(z−pj)). Its denominator is nonzero on Ω, so [L1] makes it holomorphic. Its only zero is bj, and that zero is simple because 1−(bj−pj)/(z−pj)=(z−bj)/(z−pj) and the exponential factor never vanishes. For a nonempty compact K⊆Ω, [L4] gives dK:=min⁡z∈Kδ(z)>0. Since pj∈C, sup⁡z∈K∣(bj−pj)/(z−pj)∣≤δ(bj)/dK≤1/2 for all sufficiently large j. These tail factors have no zeros on K, and [L2] gives sup⁡K∣1−Qj∣≤2−j−1. Hence [L3] yields a holomorphic function F1:=∏j≥1Qj with precisely the listed bj zeros and their multiplicities. If (bj) is finite, take its finite polynomial instead, and if it is empty take F1=1.

4.2step 3.2L1L2L3constructcases

On each disc ∣z∣≤R, eventually ∣dj∣>2R, so Ej(z/dj) is zero-free there and [L2] gives sup⁡∣z∣≤R∣1−Ej(z/dj)∣≤2−j−1. By [L1] and [L3], H(z):=∏j≥1Ej(z/dj) is entire with exactly the listed nonzero zeros and their multiplicities; H(0)=1 since every partial product equals 1 there. Thus F2(z):=zm0H(z) contributes the listed cj zeros, with z0=1 contributing no zero at 0. If (cj) is finite, take its finite polynomial instead, and if it is empty take F2=1.

5.1step 1.1step 4.1step 4.2L1L5discharge-construct∎

Set F:=F1F2. It is holomorphic by [L1], and steps 4.1 and 4.2 show that its zero set is exactly S, with order m(a) at each a∈S: 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 S in finitely many points, and that disc contains a point outside this finite set, so F is not identically zero. It is nonzero at each point of Ω∖S, and [L5] gives order 0 there, including each a∈A with m(a)=0. This proves the stated realization.

Depends on

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