Notes on Complex Analysis
Export PDFGitHub

§4.4.4 Classifying Growth of Entire Functions

4.4.4 Classifying Growth of Entire Functions

Lemma 4.4.4.1.

Let 𝑓:𝐷(0,𝑟)‾→ℂ∗ (where 𝑟>0) be a nowhere-vanishing holomorphic function. It follows that

log|𝑓(0)|=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃.
Proof.

Without loss of generality, assume 𝑟=1. Since 𝑓 is non-vanishing and 𝔻‾ is simply connected, we may define the holomorphic logarithm as

log(𝑓(𝑧))=∫𝛾𝑓′(𝑧)𝑓(𝑧)d𝑧+log(𝑓(𝑧0))

for any fixed 𝑧0∈𝔻‾ and all 𝑧∈𝔻‾, where 𝛾⊂𝔻‾ is any piecewise smooth curve from 𝑧0 to 𝑧.

Hence, log|𝑓(𝑧)|=ℜ𝔢[log(𝑓(𝑧))] and is therefore harmonic. The assertion then follows from the mean-value property. ⁠□

Theorem 4.4.4.2 (Jensen’s Formula).

Let 𝑓:𝐷(0,𝑟)‾→ℂ be meromorphic such that 𝑓(0)≠0. If 𝑎1,…,𝑎𝑚, 𝑏1,…,𝑏𝑛 are the zeros and poles of 𝑓 in 𝐷(0,𝑟)‾, counted with multiplicities and orders, respectively, then

log|𝑓(0)|=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃+∑𝑘=1𝑚log|𝑎𝑘𝑟|−∑𝑘=1𝑛log|𝑏𝑘𝑟|.
Proof.

For simplicity, assume 𝑎1,…,𝑎𝑚0 are the zeros in 𝐷(0,𝑟) and 𝑎𝑚0+1,…,𝑎𝑚 are the zeros on 𝜕𝐷(0,𝑟). Similarly, let 𝑏1,…,𝑏𝑛0 be the poles in 𝐷(0,𝑟) and 𝑏𝑛0+1,…,𝑏𝑛 be the poles on 𝜕𝐷(0,𝑟). Let

𝑓(𝑧)=𝑔(𝑧)∏𝑗=1𝑚(𝑧−𝑎𝑗)∏𝑘=1𝑛(𝑧−𝑏𝑘),

where 𝑔 is holomorphic and non-vanishing on 𝐷(0,𝑟)‾. Since

log|𝑓(0)|=log|𝑔(0)|+∑𝑗=1𝑚log|𝑎𝑗|−∑𝑘=1𝑛log|𝑏𝑘|,

by Lemma 4.4.4.1Lemma 4.4.4.1Lemma 4.4.4.1 on 𝑔,

log|𝑓(0)|=12π∫02πlog|𝑓(𝑟ei𝜃)∏𝑘=1𝑛(𝑟ei𝜃−𝑏𝑘)∏𝑗=1𝑚(𝑟ei𝜃−𝑎𝑗)|d𝜃+∑𝑗=1𝑚log|𝑎𝑗|−∑𝑘=1𝑛log|𝑏𝑘|=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃+∑𝑗=1𝑚log|𝑎𝑗|−∑𝑘=1𝑛log|𝑏𝑘|+12π∫02π[∑𝑘=1𝑛(log𝑟+log|1−𝑏𝑘𝑟ei𝜃|)−∑𝑗=1𝑚(log𝑟+log|1−𝑎𝑗𝑟ei𝜃|)]d𝜃=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃+∑𝑗=1𝑚log|𝑎𝑗𝑟|−∑𝑘=1𝑛log|𝑏𝑘𝑟|+ℜ𝔢12πi[(∑𝑗=1𝑚∲𝜕𝐷(0,|𝑎𝑗/𝑟|)−∑𝑘=1𝑛∲𝜕𝐷(0,|𝑏𝑘/𝑟|))Log(1−𝑧)d𝑧𝑧]=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃+∑𝑗=1𝑚log|𝑎𝑗𝑟|−∑𝑘=1𝑛log|𝑏𝑘𝑟|+ℜ𝔢12πi(∑𝑘=𝑛0+1𝑛−∑𝑗=𝑚0+1𝑚)∳𝜕𝔻Log(1−𝑧)d𝑧𝑧

where 𝑧=𝑎𝑗/(𝑟ei𝜃),𝑏𝑘/(𝑟ei𝜃), d𝜃=id𝑧/𝑧, and the leftover integrals (up until 𝑘=𝑛0 and 𝑗=𝑚0) for interior points vanish by Cauchy–Goursat (Theorem 3.1.9Theorem 3.1.9Theorem 3.1.9), since Log(1−𝑧)𝑧 has a removable singularity at 𝑧=0.

We now are left to prove that the remaining integral 𝐼 vanishes as well, which is not as immediate since the integrand does not extend continuously to the boundary. Let 𝑧=ei𝜃, d𝑧=iei𝜃, then (by 𝜓=𝜃2)

𝐼=∳𝜕𝔻Log(1−𝑧)d𝑧𝑧=∫02πlog|1−ei𝜃|d𝜃=2∫0πlog|e−i𝜓−ei𝜓|d𝜓=2πlog2+2∫0πlog|sin𝜓|d𝜓=2πlog2+4∫0π/2log|sin𝜓|d𝜓=2πlog2+4𝐽.

Splitting at π/4 and using cos with a substitution for the second integral then yields

𝐽=∫0π/4log|sin𝜓|d𝜓+∫0π/4log|cos𝜓|d𝜓=∫0π/4log|12sin2𝜓|d𝜓.

Changing back to 𝜃=2𝜓, we have

𝐽=𝐽2−π4log2⟹4𝐽=−2πlog2⟹𝐼=0.□

As an immediate consequence, we have:

Corollary 4.4.4.2.1 (Jensen’s Inequality).

Let 𝑓 be holomorphic on 𝐷(0,𝑟)‾ such that 𝑓≢0 and 𝑓(0)≠0. It follows that

log|𝑓(0)|≤12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃.

Theorem 4.4.4.3 (Poisson–Jensen Formula).

Suppose 𝑓 is a meromorphic function on 𝐷(0,𝑟)‾ such that 𝑓≢0 on 𝐷(0,𝑟) and is non-vanishing and non-infinity on 𝜕𝐷(0,𝑟). Let 𝑎1,…,𝑎𝑚 and 𝑏1,…,𝑏𝑛 be the zeros and poles of 𝑓 in 𝐷(0,𝑟), counted with multiplicity and order, respectively (multiplicities and orders count as multiple zeros or poles). Then it follows that

log|𝑓(𝑧)|=∫02πlog|𝑓(𝜁)|𝑃(𝜁,𝑧)d𝜃+∑𝑗=1𝑚log|𝑟(𝑧−𝑎𝑗)𝑟2−𝑎𝑗‾𝑧|−∑𝑘=1𝑛log|𝑟(𝑧−𝑏𝑘)𝑟2−𝑏𝑘‾𝑧|,(4.4.4.1)
where 𝜁=𝑟ei𝜃, 𝑧∈𝐷(0,𝑟)∖({𝑎𝑗}𝑗=1𝑚∪{𝑏𝑘}𝑗=1𝑛), and 𝑃(𝜁,𝑧) is the Poisson kernel in (3.6.6)(3.6.6)(3.6.6).
Proof.

For fixed 𝑧∈𝐷(0,𝑟) not at zeros or poles, let

𝑔𝑧(𝜁)=𝑓(𝑟𝜑−𝑧𝑟(𝜁𝑟))

where 𝜑−𝑎=(𝜑𝑎)−1 is the unit disk automorphism sending 0 to 𝑎. Then 𝑔𝑧 maps 0 to 𝑓(𝑧), and has zeros at 𝑟𝜑−𝑧𝑟(𝜁𝑟)=𝑎𝑘 or 𝜁=𝑟𝜑𝑧𝑟(𝑎𝑘𝑟) and poles at 𝑟𝜑−𝑧𝑟(𝜁𝑟)=𝑏𝑘 or 𝜁=𝑟𝜑𝑧𝑟(𝑏𝑘𝑟). By Jensen’s formula (Theorem 4.4.4.2Theorem 4.4.4.2Theorem 4.4.4.2),

log|𝑔𝑧(0)|=log|𝑓(𝑧)|=12π∫02πlog|𝑔𝑧(𝑟ei𝜃)|d𝜃+∑𝑘=1𝑚|𝜑𝑧𝑟(𝑎𝑘𝑟)|−∑𝑘=1𝑛|𝜑𝑧𝑟(𝑏𝑘𝑟)|.□

Lemma 4.4.4.4.

Let 𝑓:𝔻→ℂ be a non-constant bounded holomorphic function whose zeros are 𝑎1,𝑎2,…, counted according to their multiplicities, ordered such that |𝑎𝑛|≤|𝑎𝑛+1| for all 𝑛∈ℕ. Then,

∑𝑛=1∞(1−|𝑎𝑛|)
is convergent.
Proof.

First assume 𝑓(0)≠0 and choose 𝑀 such that |𝑓|≤𝑀 on 𝔻. Let 𝑛(𝑟,0,𝑓) count the number of zeros of 𝑓, according to multiplicities, inside 𝐷(0,𝑟)‾. By Jensen’s Formula (Theorem 4.4.4.2Theorem 4.4.4.2Theorem 4.4.4.2), we have

log|𝑓(0)|=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃+∑𝑘=1𝑛(𝑟,0,𝑓)log|𝑎𝑘𝑟|≤log(𝑀)+∑𝑘=1𝑛(𝑟,0,𝑓)log|𝑎𝑘𝑟|.

For any fixed positive integer 𝑘, choose 𝑟 such that |𝑎𝑘|<𝑟<1. Then 𝑛(𝑟,0,𝑓)≥𝑘 and

∑𝑗=1𝑛(𝑟,0,𝑓)log|𝑎𝑗𝑟|≤∑𝑗=1𝑘log|𝑎𝑗𝑟|,

since each log|𝑎𝑗𝑟|<0 for 𝑗≤𝑛(𝑟,0,𝑓). Therefore,

log|𝑓(0)|≤log𝑀+∑𝑗=1𝑘log|𝑎𝑗𝑟|=log𝑀+∑𝑗=1𝑘log|𝑎𝑗|−𝑘log𝑟.

Rearranging,

∑𝑗=1𝑘log|𝑎𝑗|≥log|𝑓(0)|−log𝑀+𝑘log𝑟.

Now let 𝑟→1− with 𝑟>|𝑎𝑘|. Since 𝑘log𝑟→0, it follows that

∑𝑗=1𝑘log|𝑎𝑗|≥log|𝑓(0)|−log𝑀.

This holds for every 𝑘. Since log|𝑎𝑗|<0 for all 𝑗, the partial sums ∑𝑗=1𝑘log|𝑎𝑗| are decreasing and bounded below by log|𝑓(0)|−log𝑀, hence converge to some finite limit, and

∑𝑗=1∞log|𝑎𝑗|≥log|𝑓(0)|−log𝑀,

or equivalently,

log|𝑓(0)|≤log|𝑀|+∑𝑘=1∞log|𝑎𝑘|.

For any 0<𝑎<1, we have −log(𝑎)=1−𝑎+∑𝑛=2∞(1−𝑎)𝑛𝑎𝑛>1−𝑎. Hence,

0≤∑𝑘=1∞(1−|𝑎𝑘|)<−∑𝑘=1∞log|𝑎𝑘|≤log|𝑀|−log|𝑓(0)|.
If 𝑓 has a zero of multiplicity 𝑚 at 0, then the argument applies to 𝑧↦𝑓(𝑧)𝑧𝑚. ⁠□

Theorem 4.4.4.5 (Blaschke Product).

Let {𝑎𝑘}𝑘∈ℕ⊂𝔻∗=𝔻∖{0} be a sequence such that the series ∑𝑘=1∞(1−|𝑎𝑘|) is convergent (known as the Blaschke condition). Then the Blaschke product, defined by

𝐵(𝑧)=∏𝑘=1∞[−|𝑎𝑘|𝑎𝑘𝜑𝑎𝑘(𝑧)],(4.4.4.2)
(where 𝜑𝑎(𝑧) is a Möbius transformation in the form of (3.5.1)(3.5.1)(3.5.1)), locally uniformly converges to an analytic function on 𝔻 such that |𝐵|≤1 on 𝔻, and its only zeros are precisely at each of {𝑎𝑘}𝑘∈ℕ, counted according to multiplicities.
Proof.

If it can be shown that

∑𝑘=1∞||𝑎𝑘|𝑎𝑘𝑎𝑘−𝑧1−𝑎𝑘‾𝑧−1|

locally uniformly converges, we can use Lemma 4.4.3.3Lemma 4.4.3.3Lemma 4.4.3.3 to show that the infinite product converges uniformly on compact subsets of 𝔻. Let 𝐷(0,𝑟)‾⊂𝔻 be a compact subset. The summand can be bounded with

||𝑎𝑘|𝑎𝑘𝑎𝑘−𝑧1−𝑎𝑘‾𝑧−1|=|𝑎𝑘‾|𝑎𝑘|𝑎𝑘−𝑧1−𝑎𝑘‾𝑧−1|=||𝑎𝑘|2−𝑎𝑘‾𝑧|𝑎𝑘|(1−𝑎𝑘‾𝑧)−1|=||𝑎𝑘|2−𝑎𝑘‾𝑧−|𝑎𝑘|+|𝑎𝑘|𝑎𝑘‾𝑧|𝑎𝑘|(1−𝑎𝑘‾𝑧)|=|𝑎𝑘‾𝑧(|𝑎𝑘|−1)+|𝑎𝑘|(|𝑎𝑘|−1)|𝑎𝑘|(1−𝑎𝑘‾𝑧)|=|(𝑎𝑘‾𝑧+|𝑎𝑘|)(1−|𝑎𝑘|)|𝑎𝑘|(1−𝑎𝑘‾𝑧)|≤(1−|𝑎𝑘|)|𝑎𝑘‾|(1+𝑟)|𝑎𝑘|(1−|𝑎𝑘|𝑟)<(1−|𝑎𝑘|)1+𝑟1−𝑟.

Since

∑𝑘=1∞||𝑎𝑘|𝑎𝑘𝑎𝑘−𝑧1−𝑎𝑘‾𝑧−1|<1+𝑟1−𝑟∑𝑘=1∞(1−|𝑎𝑘|)

is convergent (Blaschke condition), by the Weierstrass 𝑀-Test (Theorem 2.3.3Theorem 2.3.3Theorem 2.3.3), ∑𝑘=1∞||𝑎𝑘|𝑎𝑘𝑎𝑘−𝑧1−𝑎𝑘‾𝑧−1| converges uniformly on 𝐷(0,𝑟)‾. By Lemma 4.4.3.3Lemma 4.4.3.3Lemma 4.4.3.3, the infinite product in (4.4.4.2)(4.4.4.13)(4.4.4.2) converges uniformly on compact subsets of 𝔻. The properties of its zeros follow from the lemma.

Lastly, since |𝜑𝑎𝑘|≤1 and each partial product is bounded by 1, it follows that |𝐵(𝑧)|≤1 on 𝔻. ⁠□

Remark.

A more general Blaschke product has an additional factor of 𝑧𝑚 to account for a zero at the origin, similar to the case of the Weierstrass product.

Corollary 4.4.4.5.1.

Let 𝑓:𝔻→ℂ be bounded and holomorphic whose multiplicity of the zero at 0 is 𝑚 (if 𝑓 does not vanish at 0, then 𝑚=0). If {𝑎𝑛}𝑛∈ℕ are its zeros in 𝔻∗, counting multiplicities, then

𝑓(𝑧)=𝐹(𝑧)𝑧𝑚∏𝑛=1∞[−|𝑎𝑛|𝑎𝑛𝜑𝑎𝑛(𝑧)],

where 𝐹 is bounded, holomorphic, and non-vanishing on 𝔻. Moreover,

sup𝑧∈𝔻|𝑓(𝑧)|=sup𝑧∈𝔻|𝐹(𝑧)|.
Proof.

Let

𝐹(𝑧)=𝑓(𝑧)𝑧𝑚∏𝑛=1∞[−|𝑎𝑘|𝑎𝑘𝜑𝑎𝑛(𝑧)],

which is well-defined by Lemma 4.4.4.4Lemma 4.4.4.4Lemma 4.4.4.4 and Theorem 4.4.4.5Theorem 4.4.4.5Theorem 4.4.4.5. By construction, 𝐹 extends to its removable singularities to a holomorphic function that does not vanish. Because

sup𝑧∈𝔻|𝑧𝑚∏𝑛=1∞[−|𝑎𝑛|𝑎𝑛𝜑𝑎𝑛(𝑧)]|≤1,

it follows that

sup𝑧∈𝔻|𝐹(𝑧)|≥sup𝑧∈𝔻|𝑓(𝑧)|.(4.4.4.3)

The partial products

𝐵𝑛(𝑧)=∏𝑘=1𝑛[−|𝑎𝑘|𝑎𝑘𝜑𝑎𝑘(𝑧)]

give for fixed 𝜃∈ℝ, 𝜀>0, the existence of 0<𝑟′<1 such that 𝑟′<𝑟<1 implies

|𝐵𝑛(𝑟ei𝜃)|>1−𝜀.

Then by the Maximum Modulus Principle (Theorem 3.4.2Theorem 3.4.2Theorem 3.4.2),

sup𝑧∈𝔻|𝑓(𝑧)𝑧𝑚𝐵𝑛(𝑧)|=sup𝑧∈𝔻∖𝐷(0,𝑟)‾|𝑓(𝑧)𝑧𝑚𝐵𝑛(𝑧)|≤1𝑟𝑚(1−𝜀)sup𝑧∈𝔻|𝑓(𝑧)|→11−𝜀sup𝑧∈𝔻|𝑓(𝑧)|

as 𝑟→1−. Letting 𝜀→0+, 𝑛→∞ gives

sup𝑧∈𝔻|𝐹(𝑧)|≤sup𝑧∈𝔻|𝑓(𝑧)|,
which in conjunction with (4.4.4.3)(4.4.4.14)(4.4.4.3), completes the final assertion. ⁠□

From the results above, a recurring theme in complex analysis is hinted at; the rate of growth of functions provides insight towards the distribution of its zeros.

The subjects to be discussed here are relevant and preliminary to Nevanlinna theory, or the study of holomorphic value distribution.

For an entire function 𝑓, let 𝑀(𝑟,𝑓)=sup|𝑧|=𝑟|𝑓(𝑧)|=sup|𝑧|≤𝑟|𝑓(𝑧)| (by the Maximum Modulus Principle in Theorem 3.4.2Theorem 3.4.2Theorem 3.4.2).

Definition 4.4.4.6 (Growth Order of Entire Functions).

An entire function 𝑓 is said to be of finite order if there exists 𝛼,𝑟𝛼>0 such that

𝑀(𝑟,𝑓)≤exp(𝑟𝛼),∀𝑟>𝑟𝛼,
or in loose terms, 𝑓 is of finite order if it grows at most exponentially for large 𝑧. The order of 𝑓, or 𝜌(𝑓) is defined to be the infimum of all 𝛼 satisfying the previous condition.

Proposition 4.4.4.7.

Let 𝑓 be entire; then if there exist 𝑎,𝑏,𝛼,𝑟𝛼,𝑏>0 such that

𝑀(𝑟,𝑓)≤exp(𝑎𝑟𝛼+𝑏),∀𝑟>𝑟𝛼,𝑏,
then 𝜌(𝑓)≤𝛼.
Proof.

For 𝜀>0, since 𝑟𝜀→∞ as 𝑟→∞, for any 𝜀>0, there exists 𝑟𝜀 such that

𝑟𝜀≥2𝑎⟹12𝑟𝛼+𝜀≥𝑎𝑟𝛼

for 𝑟>𝑟𝜀. There exists 𝑟𝜀′>0 such that

𝑟>𝑟𝜀′⟹12𝑟𝛼+𝜀≥𝑏.

For simplicity, let the value max{𝑟𝜀,𝑟𝜀′} be denoted by 𝑟𝜀. Then

𝑟>𝑟𝜀⟹𝑎𝑟𝛼+𝑏≤12𝑟𝛼+𝜀+12𝑟𝛼+𝜀=𝑟𝛼+𝜀.

By assumption, we have

𝑀(𝑟,𝑓)≤exp(𝑎𝑟𝛼+𝑏)≤exp(𝑟𝛼+𝜀)⟹𝛼+𝜀≥𝜌(𝑓).
Letting 𝜀→0+, the assertion follows. ⁠□

Theorem 4.4.4.8.

The order of a non-constant entire function 𝑓 may be explicitly given by

𝜌(𝑓)=lim sup𝑟→∞log(log𝑀(𝑟,𝑓))log𝑟.
Proof.

By definition, 𝜌(𝑓) is the infimum of all 𝛼>0 for which there exists 𝑟𝛼>0 such that

𝑀(𝑟,𝑓)≤exp(𝑟𝛼),∀𝑟>𝑟𝛼.

Let

𝐿=lim sup𝑟→∞log(log𝑀(𝑟,𝑓))log𝑟.

First suppose 𝜌(𝑓)<∞. Fix 𝜀>0. Since 𝜌(𝑓) is the infimum, there is an 𝛼 satisfying this condition such that 𝜌(𝑓)≤𝛼<𝜌(𝑓)+𝜀.

Hence, for all sufficiently large 𝑟,

𝑀(𝑟,𝑓)≤exp(𝑟𝛼)≤exp(𝑟𝜌(𝑓)+𝜀),

and hence 𝐿≤𝜌(𝑓)+𝜀. Letting 𝜀→0+ gives 𝐿≤𝜌(𝑓).

Conversely, suppose 0<𝜀<𝜌(𝑓) and let 𝛽=𝜌(𝑓)−𝜀. Since 𝛽<𝜌(𝑓), this condition fails for 𝛽. Thus, for every 𝑅>0, there exists 𝑟>𝑅 such that

𝑀(𝑟,𝑓)>exp(𝑟𝛽)=exp(𝑟𝜌(𝑓)−𝜀).

Thus this inequality holds along a sequence 𝑟𝑗→∞, so 𝐿≥𝜌(𝑓)−𝜀. Letting 𝜀→0+ gives 𝐿≥𝜌(𝑓).

If 𝜌(𝑓)=0, then 𝐿≥0 because 𝑀(𝑟,𝑓)→∞ for a non-constant entire function, while the first half gives 𝐿≤0. Therefore 𝐿=𝜌(𝑓).

Finally, if 𝜌(𝑓)=∞, then this condition fails for every 𝛽>0. The same argument gives 𝐿≥𝛽 for every 𝛽>0, and hence 𝐿=∞=𝜌(𝑓). ⁠□

Example 4.4.4.9.

The function sin is of order 1, while exp⚬exp is not of finite order.
Solution to Example 4.4.4.9Example 4.4.4.9Example 4.4.4.9.

We consider the two examples separately:

  1. Observe that

    sup|𝑧|=𝑟|sin(𝑧)|≤sup|𝑧|=𝑟|ei𝑧|+|e−i𝑧|2=sup|𝑧|=𝑟e|𝑦|+e−|𝑦|2≤sup|𝑧|=𝑟e|𝑦|=e𝑟.

    For 𝑟>1, we have e−𝑟<1<12e𝑟, and hence for 𝑧=i𝑟, we have

    |sin(𝑧)|=e𝑟−e−𝑟2>14e𝑟.

    Therefore,

    14e𝑟<sup|𝑧|=𝑟|sin(𝑧)|≤e𝑟⟹𝜌(𝑓)=lim sup𝑟→∞log(𝑟+𝒪︀(1))log𝑟=1.
  2. Let 𝑧=𝑟, then

    sup|𝑧|=𝑟|exp⚬exp|≥exp(exp(𝑟))⟹log⚬logsup|𝑧|=𝑟|𝑓(𝑧)|≥𝑟⟹𝜌(𝑓)≥lim sup𝑟→∞𝑟log𝑟=∞.□

The utility of 𝜌 is that it gives implications on the rate of which the zeros of an entire function tend to ∞. The order for meromorphic functions is more general and is pertinent in Nevanlinna Theory (Section 14Section 14Section 14). This is quantified technically by the convergence range of the sum given by

∑𝑛=1∞1|𝑎𝑛|𝑘+1,

where each 𝑎𝑛 is a zero. Specifically, the infimum of all such 𝑘 under which the prescribed sum converges correlates to this right. For example, let 𝑎𝑛=𝑛 for each 𝑛. Then for any 𝑘>0, the integral test gives the convergence of the series, while if 𝑎𝑛=𝑛 (corresponding to a slower approach to ∞), the series converges for 𝑘>1.

For the following discussions, let 𝑛(𝑟,0,𝑓) count the zeros of 𝑓 in 𝐷(0,𝑟) according to multiplicity.

Lemma 4.4.4.10.

If 𝑓 is entire with 𝑓(0)=1, then

log2⋅𝑛(𝑟,0,𝑓)≤log𝑀(2𝑟,𝑓).
Proof.

By Jensen’s formula (Theorem 4.4.4.2Theorem 4.4.4.2Theorem 4.4.4.2), for 𝑟>0, we have

∑𝑘=1𝑛(2𝑟,0,𝑓)log|2𝑟𝑎𝑘|=12π∫02πlog|𝑓(2𝑟ei𝜃)|d𝜃,

where 𝑎1,…,𝑎𝑛(2𝑟,0,𝑓) are the zeros of 𝑓 in 𝐷(0,2𝑟), ordered such that each |𝑎𝑘|≤|𝑎𝑘+1|. Then

∑𝑘=1𝑛(𝑟,0,𝑓)log2≤∑𝑘=1𝑛(𝑟,0,𝑓)log|2𝑟𝑎𝑘|≤∑𝑘=1𝑛(2𝑟,0,𝑓)log|2𝑟𝑎𝑘|=12π∫02πlog|𝑓(2𝑟ei𝜃)|d𝜃≤log𝑀(2𝑟,𝑓).□

Theorem 4.4.4.11.

For a nonzero complex sequence {𝑎𝑘}𝑘∈ℕ counting multiplicities (such that |𝑎1|≤|𝑎2|, etc.), the sum

∑𝑘=1∞1|𝑎𝑘|𝜎

converges for any

𝜎>lim sup𝑟→∞log𝑛(𝑟)log𝑟
where 𝑛(𝑟) counts 𝑎𝑘 in the closed disk of radius 𝑟.
Proof.

Choose 𝜎′ such that

𝜎>𝜎′>lim sup𝑟→∞log𝑛(𝑟)log𝑟.

For sufficiently large 𝑟,

log𝑛(𝑟)log𝑟<𝜎′⟹𝑛(𝑟)≤𝑟𝜎′.

For sufficiently large 𝑘∈ℕ, by the ordering of zeros, it follows that

𝑘≤𝑛(|𝑎𝑘|+𝛿)≤(|𝑎𝑘|+𝛿)𝜎′

for sufficiently small 𝛿. As 𝛿→0+, we have

𝑘≤|𝑎𝑘|𝜎′⟹1𝑘≥1|𝑎𝑘|𝜎′⟹1𝑘𝜎/𝜎′≥1|𝑎𝑘|𝜎.

By the comparison test, we then have the convergence of

∑𝑘=1∞1|𝑎𝑘|𝜎.□

Theorem 4.4.4.12.

For an entire function 𝑓 (𝑓(0)=1) of finite order 𝜌(𝑓) whose zeros are at {𝑎𝑘}𝑘∈ℕ counting multiplicities (such that |𝑎1|≤|𝑎2|, etc.), the sum

∑𝑘=1∞1|𝑎𝑘|𝜌(𝑓)+𝜂
converges for any 𝜂>0.
Proof.

For every 𝜀>0 and all sufficiently large 𝑟, the definition of order gives

𝑀(2𝑟,𝑓)≤exp((2𝑟)𝜌(𝑓)+𝜀).

Also, Lemma 4.4.4.10Lemma 4.4.4.10Lemma 4.4.4.10 gives

log2⋅𝑛(𝑟,0,𝑓)≤log𝑀(2𝑟,𝑓).

Hence,

log2⋅𝑛(𝑟,0,𝑓)≤(2𝑟)𝜌(𝑓)+𝜀⟺𝑛(𝑟,0,𝑓)𝑟𝜌(𝑓)+2𝜀≤1log22𝜌(𝑓)+𝜀𝑟−𝜀→0+

as 𝑟→∞. Hence, for sufficiently large 𝑟,

𝑛(𝑟,0,𝑓)≤𝑟𝜌(𝑓)+2𝜀.

For sufficiently large 𝑘∈ℕ, by the ordering of zeros, it follows that

𝑘≤𝑛(|𝑎𝑘|+𝛿,0,𝑓)≤(|𝑎𝑘|+𝛿)𝜌(𝑓)+2𝜀

for sufficiently small 𝛿. As 𝛿→0+, we have

𝑘≤|𝑎𝑘|𝜌(𝑓)+2𝜀⟹1𝑘≥1|𝑎𝑘|𝜌(𝑓)+2𝜀⟹1𝑘(𝜌(𝑓)+𝜂)/(𝜌(𝑓)+2𝜀)≥1|𝑎𝑘|𝜌(𝑓)+𝜂.

The left-hand side as a summation is convergent for 2𝜀<𝜂 or lower, and hence we have the convergence of

∑𝑘=1∞1|𝑎𝑘|𝜌(𝑓)+𝜂.□

Therefore, for any 𝑟>0, the series

∑𝑘=1∞|𝑟𝑎𝑘|⌊𝜌(𝑓)⌋+1

converges, because ⌊𝜌(𝑓)⌋+1>𝜌(𝑓) and Theorem 4.4.4.12Theorem 4.4.4.12Theorem 4.4.4.12 applies with 𝜂=⌊𝜌(𝑓)⌋+1−𝜌(𝑓). Then by the Weierstrass Factorization Theorem (Theorem 4.4.3.5Theorem 4.4.3.5Theorem 4.4.3.5),

𝑓(𝑧)=𝑧𝑚e𝜑(𝑧)∏𝑘=1∞𝐸⌊𝜌(𝑓)⌋(𝑧𝑎𝑘)

locally uniformly converges on ℂ, where 𝜑 is entire.

Definition 4.4.4.13.

The rank of an entire function is the smallest 𝑝∈ℤ≥0 for which the associated sum

∑𝑘=1∞1|𝑎𝑘|𝑝+1
converges, where {𝑎𝑘}𝑘 are its zeros in ℂ∗.

The conclusion of Theorem 4.4.4.12Theorem 4.4.4.12Theorem 4.4.4.12 is that the rank of an entire function with finite order is finite. Moreover, the rank ≤⌊𝜌⌋.

Definition 4.4.4.14 (Weierstrass Canonical Factorization).

Let 𝑓 be entire of finite rank 𝑝. Using this rank in the Weierstrass Factorization theorem (Theorem 4.4.3.5Theorem 4.4.3.5Theorem 4.4.3.5),

𝑓(𝑧)=𝑧𝑚e𝜑(𝑧)∏𝑘=1∞𝐸𝑝(𝑧𝑎𝑘).
If 𝜑 is a polynomial of degree 𝑞, then 𝑓 is said to be of finite genus 𝜇=max{𝑝,𝑞}.

This particular Weierstrass factorization (using the rank 𝑝) is the Weierstrass canonical factorization of 𝑓 (the portion corresponding to the product of elementary factors itself is the Weierstrass canonical product). Now that we have indulged in the implications of 𝜌(𝑓) to its zero distribution, we now turn to the function 𝜑 in the exponential.

Lemma 4.4.4.15.

Let 𝑓 be entire with finite order such that 𝑓(0)=1. Let {𝑎𝑘}𝑘∈ℕ be the zeros of 𝑓, listed with multiplicities, such that |𝑎1|≤|𝑎2|≤|𝑎3|≤…. Suppose 𝑝>𝜌(𝑓)−1; then for any 𝑧∈ℂ,

lim𝑟→∞∑𝑘=1𝑛(𝑟,0,𝑓)𝑎𝑘‾𝑝+1(𝑟2−𝑎𝑘‾𝑧)−𝑝−1=0.
Proof.

For fixed 𝑧, let 𝑟>2|𝑧| such that 𝑎1,…,𝑎𝑛(𝑟,0,𝑓) lie in 𝐷(0,𝑟). For each 𝑘 we obtain

|𝑟2−𝑎𝑘‾𝑧|≥𝑟2−|𝑎𝑘||𝑧|>𝑟2−𝑟⋅𝑟2=𝑟22⟹|𝑎𝑘|𝑝+1|𝑟2−𝑎𝑘‾𝑧|−𝑝−1<(2𝑟)𝑝+1

since 𝜌(𝑓)≥0 by the logarithm formula. Now by definition of 𝜌(𝑓), Lemma 4.4.4.10Lemma 4.4.4.10Lemma 4.4.4.10 gives the estimate for sufficiently large 𝑟 and arbitrarily small 𝜀>0:

𝑛(𝑟,0,𝑓)𝑟−𝑝−1≤log𝑀(2𝑟,𝑓)log2𝑟−𝑝−1≤(2𝑟)𝜌(𝑓)+𝜀𝑟−𝑝−1log2.

Thus,

|∑𝑘=1𝑛(𝑟,0,𝑓)𝑎𝑘‾𝑝+1(𝑟2−𝑎𝑘‾𝑧)−𝑝−1|≤𝑛(𝑟,0,𝑓)(2𝑟)𝑝+1≤𝑟𝜌(𝑓)+𝜀−𝑝−12𝜌(𝑓)+𝜀+𝑝+1log2.

Letting 𝜀=𝑝+1−𝜌(𝑓)2 (positive by theorem assumption), we obtain

|∑𝑘=1𝑛(𝑟,0,𝑓)𝑎𝑘‾𝑝+1(𝑟2−𝑎𝑘‾𝑧)−𝑝−1|≤2(3𝑝+3−𝜌(𝑓))/2𝑟−𝜀log2→0as𝑟→∞.□

Theorem 4.4.4.16.

Let 𝑓 be entire with 𝑓(0)=1. Then for 𝑝>𝜌(𝑓)−1 (𝑝 integer) and 𝑧∈ℂ,

lim𝑟→∞∫02π𝑟ei𝜃log|𝑓(𝑟ei𝜃)|(𝑟ei𝜃−𝑧)𝑝+2d𝜃=0.
Proof.

For fixed 𝑧, 𝑟>2|𝑧|, we have

∫02πi𝑟ei𝜃d𝜃(𝑟ei𝜃−𝑧)𝑝+2=∳𝜕𝐷(0,𝑟)d𝑤(𝑤−𝑧)𝑝+2=2πiRes𝑤=𝑧1(𝑤−𝑧)𝑝+2

by the Residue Theorem (Theorem 4.5.2Theorem 4.5.2Theorem 4.5.2). Since 𝑝+2>𝜌(𝑓)+1≥1 where 𝑝 is an integer, we must have 𝑝+2≥2 and thus

∫02π𝑟ei𝜃d𝜃(𝑟ei𝜃−𝑧)𝑝+2=0.

Therefore,

|∫02π𝑟ei𝜃log|𝑓(𝑟ei𝜃)|(𝑟ei𝜃−𝑧)𝑝+2d𝜃|=|∫02π𝑟ei𝜃(𝑟ei𝜃−𝑧)𝑝+2[log|𝑓(𝑟ei𝜃)|−log𝑀(𝑟,𝑓)]d𝜃|≤∫02π𝑟(𝑟/2)𝑝+2[log𝑀(𝑟,𝑓)−log|𝑓(𝑟ei𝜃)|]d𝜃=2𝑝+3𝑟−𝑝−1[2πlog𝑀(𝑟,𝑓)−∫02πlog|𝑓(𝑟ei𝜃)|d𝜃]≤2𝑝+4𝑟−𝑝−1πlog𝑀(𝑟,𝑓),

where the last expression uses the inequality derived from Jensen’s formula (Corollary 4.4.4.2.1Corollary 4.4.4.2.1Corollary 4.4.4.2.1) on the remaining integral.

Now by assumption, we have

log𝑀(𝑟,𝑓)≤𝑟𝜌(𝑓)+𝜀

for any 𝜀>0 and sufficiently large 𝑟. Hence,

|∫02π𝑟ei𝜃log|𝑓(𝑟ei𝜃)|(𝑟ei𝜃−𝑧)𝑝+2d𝜃|≤2𝑝+4𝑟𝜌(𝑓)+𝜀−𝑝−1π=2𝑝+4𝑟(𝜌(𝑓)−𝑝−1)/2π

at 𝜀=𝑝+1−𝜌(𝑓)2. Then since 𝜌(𝑓)−𝑝−12<0, the expression vanishes as 𝑟→∞. ⁠□

Proposition 4.4.4.17.

Let 𝑓 be entire, non-constant, and of finite order such that 𝑓(0)=1. Let {𝑎𝑘}𝑘∈ℕ be the zeros of 𝑓 counted according to multiplicities such that |𝑎1|≤|𝑎2|≤|𝑎3|≤…. If 𝑝>𝜌(𝑓)−1 is an integer, then

d𝑝d𝑧𝑝(𝑓′(𝑧)𝑓(𝑧))≡−∑𝑘=1∞𝑝!(𝑎𝑘−𝑧)𝑝+1
for all 𝑧∈ℂ∖{𝑎1,𝑎2,…}.
Proof.

Let 𝑟>2|𝑧|. By the Poisson–Jensen Formula (Theorem 4.4.4.3Theorem 4.4.4.3Theorem 4.4.4.3), at each non-singular point, we have (the kernel representation derived in (3.6.6)(3.6.6)(3.6.6))

ℜ𝔢log𝑓(𝑧)=12π∫02πlog|𝑓(𝑟ei𝜃)|ℜ𝔢(𝑟ei𝜃+𝑧𝑟ei𝜃−𝑧)d𝜃+∑𝑘=1𝑛(𝑟,0,𝑓)ℜ𝔢log(𝑟(𝑧−𝑎𝑘)𝑟2−𝑎𝑘‾𝑧).

For any holomorphic 𝑔=𝑢+i𝑣, we have

𝜕(ℜ𝔢𝑔(𝑧))𝜕𝑧=12(𝜕𝑢(𝑧)𝜕𝑥−i𝜕𝑢(𝑧)𝜕𝑦)=12(𝜕𝑢(𝑧)𝜕𝑥+i𝜕𝑣𝜕𝑥)=12𝜕𝑔(𝑧)𝜕𝑥=𝑔′(𝑧)2.(4.4.4.4)

Therefore, by differentiation under the integral sign,

𝑓′(𝑧)𝑓(𝑧)=1π∫02πlog|𝑓(𝑟ei𝜃)|𝑟ei𝜃d𝜃(𝑟ei𝜃−𝑧)2+∑𝑘=1𝑛(𝑟,0,𝑓)𝑟2−|𝑎𝑘|2(𝑟2−𝑎𝑘‾𝑧)(𝑧−𝑎𝑘)=1π∫02πlog|𝑓(𝑟ei𝜃)|𝑟ei𝜃d𝜃(𝑟ei𝜃−𝑧)2+∑𝑘=1𝑛(𝑟,0,𝑓)𝑎𝑘‾𝑟2−𝑎𝑘‾𝑧+∑𝑘=1𝑛(𝑟,0,𝑓)1𝑧−𝑎𝑘.

Differentiating 𝑝 times from here gives

d𝑝d𝑧𝑝(𝑓′(𝑧)𝑓(𝑧))=1π∫02πlog|𝑓(𝑟ei𝜃)|𝑟ei𝜃(𝑝+1)!d𝜃(𝑟ei𝜃−𝑧)𝑝+2+∑𝑘=1𝑛(𝑟,0,𝑓)𝑎𝑘‾𝑝+1𝑝!(𝑟2−𝑎𝑘‾𝑧)𝑝+1−∑𝑘=1𝑛(𝑟,0,𝑓)𝑝!(𝑎𝑘−𝑧)𝑝+1.
The first two terms vanish as 𝑟→∞ by Theorem 4.4.4.16Theorem 4.4.4.16Theorem 4.4.4.16 and Lemma 4.4.4.15Lemma 4.4.4.15Lemma 4.4.4.15. ⁠□

Lemma 4.4.4.18 (Logarithmic Factorization).

Let 𝑓 be entire, non-constant, and of finite order 𝜌 such that 𝑓(0)=1. Let

𝑃(𝑧)=∏𝑘=1∞𝐸rank𝑓(𝑧𝑎𝑘)

be the associated product. If 𝑝>𝜌(𝑓)−1 is an integer, then

d𝑝d𝑧𝑝(𝑃′(𝑧)𝑃(𝑧))≡−∑𝑘=1∞𝑝!(𝑎𝑘−𝑧)𝑝+1
for all 𝑧∈ℂ∖{𝑎1,𝑎2,…}.
Proof.

Let 𝑃𝑛 be the 𝑛-th partial product of 𝑃. Then

𝑃𝑛′(𝑧)𝑃𝑛(𝑧)=∑𝑘=1𝑛dd𝑧𝐸rank𝑓(𝑧𝑎𝑘)𝐸rank𝑓(𝑧𝑎𝑘)=∑𝑘=1𝑛[1𝑧−𝑎𝑘+∑𝑗=1rank𝑓𝑧𝑗−1𝑎𝑘𝑗],

implying that

d𝑝d𝑧𝑝(𝑃𝑛′(𝑧)𝑃𝑛(𝑧))=−∑𝑘=1𝑛𝑝!(𝑎𝑘−𝑧)𝑝+1+d𝑝d𝑧𝑝∑𝑗=1rank𝑓∑𝑘=1𝑛𝑧𝑗−1𝑎𝑘𝑗.

Since the polynomial in the rightmost term has degree at most max𝑗−1=rank𝑓−1, and because 𝑝>⌊𝜌⌋−1≥rank𝑓−1, after 𝑝 derivatives each term of the expression vanishes. For an arbitrarily chosen compact 𝐾⊂ℂ avoiding the zeros, choose 𝑁∈ℕ so that |𝑎𝑘|≥2max𝑧∈𝐾|𝑧| for all 𝑘>𝑁. Then, for 𝑧∈𝐾 and 𝑘>𝑁,

|𝑎𝑘−𝑧|≥|𝑎𝑘|−|𝑧|≥|𝑎𝑘|2.

The convergence of

∑𝑘=1∞2𝑝+1|𝑎𝑘|𝑝+1

from Theorem 4.4.4.12Theorem 4.4.4.12Theorem 4.4.4.12 implies the absolute convergence of

∑𝑘=1∞1(𝑎𝑘−𝑧)𝑝+1

uniformly in 𝐾. Moreover, the locally uniform convergence 𝑃𝑛→𝑃 implies 𝑃𝑛′→𝑃′ by the Weierstrass Convergence Theorem (Theorem 4.1.1Theorem 4.1.1Theorem 4.1.1). Since 𝑃 is bounded away from zero on 𝐾, it follows that 𝑃𝑛′𝑃𝑛→𝑃′𝑃 locally uniformly away from the zeros. Applying the Weierstrass Convergence Theorem 𝑝 more times gives

lim𝑛→∞d𝑝d𝑧𝑝(𝑃𝑛′(𝑧)𝑃𝑛(𝑧))=d𝑝d𝑧𝑝(𝑃′(𝑧)𝑃(𝑧))=−lim𝑛→∞∑𝑘=1𝑛𝑝!(𝑎𝑘−𝑧)𝑝+1=−∑𝑘=1∞𝑝!(𝑎𝑘−𝑧)𝑝+1.□

The two preceding results are similar in conclusion, but Lemma 4.4.4.18Lemma 4.4.4.18Lemma 4.4.4.18 is not a special case of Proposition 4.4.4.17Proposition 4.4.4.17Proposition 4.4.4.17 since we have not asserted that the canonical product is of finite order.