Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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.

Hurwitz's zero-free limit theorem

Statement

Let ΩC be a complex domain, let each fn:ΩC be holomorphic and nowhere zero, and suppose fnf locally uniformly on Ω. Then either f0 on Ω, or f is nowhere zero on Ω.

Facts & Assumptions

Given: A complex domain Ω, holomorphic nowhere-zero functions fn on Ω, and locally uniform convergence fnf.

[L2]

Near an isolated zero of the limit, sufficiently late approximants have the same total zero multiplicity (Locally uniform convergence preserves the total multiplicity near an isolated zero).

Proof

technique · direct
1.1

By [L1], the limit function f is holomorphic on Ω. If f0, the first alternative of the statement holds.

givenL1
2.1

Assume f≢0 and suppose toward a contradiction that f(a)=0 at some point aΩ. Then a is an isolated zero of f, so [L2] gives a disc about a on which every sufficiently large fn has at least one zero. That contradicts the hypothesis that every fn is nowhere zero.

step 1.1L2assume-contradischarge-contradiction
3.1

Therefore, in the nonzero branch of step 1.1, the function f has no zeros on Ω. This is the second alternative.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

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