Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-29
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.

Normally convergent products define holomorphic functions with the expected zeros

Statement

Let Ω⊆C be open, and let (fn)n≥0 be holomorphic functions on Ω whose product is normally convergent in the sense of Normal convergence of holomorphic products. Then the partial products

Pm(z):=∏n=0mfn(z)

converge locally uniformly on Ω to a holomorphic function F.

Moreover, on every compact set K⊆Ω, all but finitely many factors fn are zero-free and the tail limit is zero-free. If no factor vanishes identically on any connected component of Ω, the zeros of F on K, counted with multiplicity, are exactly those contributed by the finitely many exceptional factors.

Facts & Assumptions

Given: An open set Ω and a normally convergent holomorphic product ∏fn on Ω. The multiplicity conclusion additionally assumes that no factor vanishes identically on any connected component of Ω.

[F1]

Normal convergence means that on each compact K⊆Ω there is an index N such that fn has no zero on K for n≥N and ∑n≥Nsup⁡K∣fn−1∣<∞ (Normal convergence of holomorphic products).

[F2]

If ∑∣an∣ converges, then ∏(1+an) converges; its value is nonzero when every factor is nonzero (Absolute convergence criterion for complex infinite products).

[F4]

Multiplication by a holomorphic factor that is nonzero at a point does not change the order of a zero there (The order of a zero is the exponent in its local holomorphic factorization).

Proof

technique · direct
1.1F1givenchoose

Fix a compact set K⊆Ω. By [F1], choose N so that fn has no zero on K for n≥N and Mn:=sup⁡K∣fn−1∣ satisfies ∑n≥NMn<∞; enlarging N if needed, assume also Mn<1/2 for n≥N.

2.1F2step 1.1algebra

For m≥ℓ≥N and z∈K, one has ∣∏n=ℓmfn(z)−1∣≤∏n=ℓm(1+Mn)−1, while ∣fn(z)∣≥1−Mn>1/2 for n≥N. By [F2], the real products ∏n≥N(1+Mn) and ∏n≥N(1−Mn) converge, and the latter has positive value because all its factors are positive. Thus the tail partial products of ∏fn are uniformly bounded above and uniformly bounded away from 0 on K.

3.1F2F3step 2.1algebra

The estimate of step 2.1 implies that the tail partial products are uniformly Cauchy on K, hence converge uniformly there to a continuous zero-free limit QK; multiplying by the finite holomorphic prefix ∏n<Nfn gives uniform convergence of the full partial products on K. Because K was arbitrary, the convergence is locally uniform on Ω, and [F3] makes the limit function F holomorphic.

4.1F4step 1.1step 3.1givenalgebra∎

On the fixed compact set K, write F=(∏n<Nfn)QK with QK holomorphic and zero-free by step 3.1. If no factor vanishes identically on any connected component of Ω, the finitely many prefix factors have only isolated zeros on their respective components, and [F4] shows that every zero of F on K, with its multiplicity, comes from that finite prefix and no tail factor contributes a new zero.

Depends on

Used by

Dependency tree · two levels

21 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