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.
The exponent of convergence of the zeros of an entire function does not exceed its order
Statement
Let be a nonzero entire function of finite order . For a finite multiset of nonzero zeros, use the convention that its exponent of convergence is . If the nonzero zero multiset is infinite, let list it with multiplicity and without finite accumulation point. In either case the exponent of convergence satisfies
Equivalently, for every real the reciprocal power sum over all nonzero zeros, counted with multiplicity, is finite; in the infinite case this is
Facts & Assumptions
Given: A nonzero entire function of order and its nonzero zero multiset, enumerated as when it is infinite.
The order is the limsup growth rate of (The order of an entire function).
Jensen's counting corollary bounds the number of zeros in in terms of the boundary growth on a larger circle (Jensen's formula bounds the number of zeros in a smaller disc).
The exponent of convergence is the infimum threshold for convergence of the reciprocal power sums (The exponent of convergence of a zero sequence).
A zero of finite order can be factored off locally as a power of times a holomorphic function nonvanishing at (The order of a zero is the exponent in its local holomorphic factorization).
Proof
Let be the order of the zero of at , with if . By [F4], there is an entire function with and so has exactly the same nonzero zeros as , with the same multiplicities.
If that nonzero zero multiset is finite, every reciprocal power sum over it is finite and its exponent is , so the conclusion holds. Hence assume from now on that it is infinite and enumerate it as .
For and , step 1.1 gives , hence . Therefore has order at most by [F1].
Fix real numbers with . By [F1] and step 2.1, for all sufficiently large one has . Applying [F2] to , whose value at is nonzero by step 1.1, yields where counts the nonzero zeros of in . Thus for all large .
Split the nonzero zeros into dyadic shells . The number of zeros in the th shell is at most , so for large one has Since , the dyadic majorant is summable.
Therefore for every . By [F3], this means the exponent of convergence of the nonzero zero sequence satisfies .
Depends on
Used by
Dependency tree · two levels
10 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
- Elias M. Stein and Rami Shakarchi, Complex Analysis, Ch. 5 §2 (standard reference, not scraped)