Notes on Complex Analysis
Export PDFGitHub

§14.2.1 Classifying Growth of Meromorphic Functions

14.2.1 Classifying Growth of Meromorphic Functions

Theorem 14.2.1.1.

Let 𝑓 be holomorphic on 𝐷(0,𝑅)‾ for 𝑅>0 and define 𝑀(𝑟,𝑓) to be max|𝑧|≤𝑟|𝑓(𝑧)|=max|𝑧|=𝑟|𝑓(𝑧)| for 0<𝑟<𝑅; then

𝑇(𝑟,𝑓)≤log+𝑀(𝑟,𝑓)≤𝑅+𝑟𝑅−𝑟𝑇(𝑅,𝑓).
Proof.

Since 𝑓 is holomorphic in 𝐷(0,𝑟), 𝑁(𝑟,𝑓)≡0 and hence

𝑇(𝑟,𝑓)=𝑚(𝑟,𝑓)=12π∫02πlog+|𝑓(𝑟ei𝜃)|d𝜃≤12π∫02πlog+𝑀(𝑟,𝑓)d𝜃,

which proves the first inequality. Since 𝑇≥0 trivially, if 𝑀≤1 the second assertion holds trivially. Hence, assume 𝑀>1; by the Poisson–Jensen formula (Theorem 4.4.4.3Theorem 4.4.4.3Theorem 4.4.4.3), letting 𝑧∈𝜕𝐷(0,𝑟) be where |𝑓| attains 𝑀, we have

log+𝑀(𝑟,𝑓)=12π∫02πlog|𝑓(𝑅ei𝜃)|𝑅2−𝑟2|𝑅ei𝜃−𝑧|2d𝜃+∑𝑗=1𝑚log|𝑅(𝑧−𝑎𝑗)𝑅2−𝑎𝑗‾𝑧|−∑𝑘=1𝑛log|𝑅(𝑧−𝑏𝑘)𝑅2−𝑏𝑘‾𝑧|≤12π∫02πlog|𝑓(𝑅ei𝜃)|𝑅2−𝑟2|𝑅ei𝜃−𝑧|2d𝜃≤12π∫02πlog|𝑓(𝑅ei𝜃)|𝑅2−𝑟2(𝑅−𝑟)2d𝜃≤12π∫02πlog+|𝑓(𝑅ei𝜃)|𝑅+𝑟𝑅−𝑟d𝜃=𝑅+𝑟𝑅−𝑟𝑇(𝑅,𝑓).
(The Möbius transformation-like terms of the zeros ≤0 since they map to the unit disk, and the second summation vanishes since there are no 𝑏𝑘 by holomorphy). ⁠□

Definition 14.2.1.2.

The order of a meromorphic function 𝑓:ℂ→ℂ̂, denoted 𝜌=𝜌(𝑓), is given by

𝜌=lim sup𝑟→∞log+𝑇(𝑟,𝑓)log𝑟,
equivalent to the condition that 𝑇(𝑟,𝑓)=𝒪︀(𝑟𝜌+𝜀) for any 𝜀>0 but not for 𝜀<0.
Proof of equivalent definitions.

For any prescribed 𝜀>0 there exists 𝑟′>0 such that for any 𝑟>𝑟′,

log+𝑇(𝑟,𝑓)log𝑟≤𝜌+𝜀⟹𝑇(𝑟,𝑓)≤𝑟𝜌+𝜀.

Assume there exists some 𝜀>0 such that

𝑇(𝑟,𝑓)=ℴ︀(𝑟𝜌−𝜀).

Then there exist finite 𝑐,𝑟′ such that ∀𝑟>𝑟′,

𝑇(𝑟,𝑓)≤𝑐𝑟𝜌−𝜀⟹log+𝑇(𝑟,𝑓)≤𝒪︀(1)+(𝜌−𝜀)log𝑟⟹log+𝑇(𝑟,𝑓)log𝑟≤𝜌−𝜀,
which is a contradiction. The converse follows similarly to the case of entire functions in Section 4.4.4Section 4.4.4Section 4.4.4. ⁠□

Theorem 14.2.1.3.

Let 𝜌𝑀 be the order of a non-constant entire function 𝑓 as defined in Section 4.4.4Section 4.4.4Section 4.4.4 and let 𝜌𝑇 be the order as defined in Definition 14.2.1.2Definition 14.2.1.2Definition 14.2.1.2. Then 𝜌𝑀=𝜌𝑇.
Proof.

Since 𝑓 is non-constant, for sufficiently large 𝑟, log+𝑀(𝑟,𝑓)=log𝑀(𝑟,𝑓). For the remainder of this proof we will assume the two are equivalent. From Theorem 14.2.1.1Theorem 14.2.1.1Theorem 14.2.1.1 it is apparent that (under 𝑅=2𝑟 for sufficiently large 𝑟)

log+𝑇(𝑟,𝑓)log𝑟≤log+log𝑀(𝑟,𝑓)log𝑟≤log3log𝑟+log+𝑇(2𝑟,𝑓)log(2𝑟)⋅log(2𝑟)log𝑟.

Letting 𝑟→∞ in the limit superior gives that

𝜌𝑇≤𝜌𝑀≤𝜌𝑇⟹𝜌𝑇=𝜌𝑀.□

Proposition 14.2.1.4.

Let 𝑓:ℂ→ℂ̂ be a meromorphic function of finite order 𝜌. Then for every 𝜀>0 and every 𝑎∈ℂ̂,

  1. 𝑚(𝑟,𝑎,𝑓)=𝒪︀(𝑟𝜌+𝜀).
  2. 𝑁(𝑟,𝑎,𝑓)=𝒪︀(𝑟𝜌+𝜀).
  3. 𝑛(𝑟,𝑎,𝑓)=𝒪︀(𝑟𝜌+𝜀).
Proof.

By the First Fundamental Theorem of Nevanlinna theory (Theorem 14.2.4Theorem 14.2.4Theorem 14.2.4),

𝑚(𝑟,𝑎)=𝑇(𝑟,𝑓)+𝒪︀(1)−𝑁(𝑟,𝑎)

and since 𝑚(𝑟,𝑎)≥0 and 𝑁(𝑟,𝑎)≥0, we obtain

𝑚(𝑟,𝑎)≤𝑇(𝑟,𝑓)+𝒪︀(1)and𝑁(𝑟,𝑎)≤𝑇(𝑟,𝑓)+𝒪︀(1).

Because 𝑓 has order 𝜌, we have

𝑇(𝑟,𝑓)=𝒪︀(𝑟𝜌+𝜀),

which proves Part 1Part 1Part 1 and Part 2Part 2Part 2. Since

𝑁(2𝑟,𝑎,𝑓)−𝑁(𝑟,𝑎,𝑓)=∫𝑟2𝑟𝑛(𝑥,𝑎,𝑓)𝑥d𝑥≥𝑛(𝑟,𝑎,𝑓)∫𝑟2𝑟d𝑥𝑥=log2⋅𝑛(𝑟,𝑎,𝑓),

it follows from Part 2Part 2Part 2 that

𝑛(𝑟,𝑎,𝑓)≤𝑁(2𝑟,𝑎,𝑓)−𝑁(𝑟,𝑎,𝑓)log2≤𝑁(2𝑟,𝑎,𝑓)log2=𝒪︀((2𝑟)𝜌+𝜀)=𝒪︀(𝑟𝜌+𝜀)
and hence Part 3Part 3Part 3 follows. ⁠□

Theorem 14.2.1.5.

Let 𝑓:ℂ→ℂ̂ be a meromorphic function of finite order 𝜌. For 𝑎∈ℂ, let 𝑟𝑛(𝑎) denote the moduli of the zeros of 𝑓(𝑧)−𝑎 (counted with multiplicity) in non-decreasing order, and let 𝑟𝑛(∞) denote the moduli of the poles of 𝑓 in non-decreasing order. Then for every 𝜀>0 and every 𝑎∈ℂ̂,

∑𝑛1𝑟𝑛(𝑎)𝜌+𝜀<∞.
Proof.

Observe that

𝜌+𝜀>lim sup𝑟→∞log+𝑇(𝑟,𝑓)log𝑟≥lim sup𝑟→∞log𝑁(𝑟,𝑓)log𝑟.

Since

𝑁(e𝑟,𝑓)−𝑁(𝑟,𝑓)=∫𝑟e𝑟𝑛(𝑥,𝑓)d𝑥𝑥≥∫𝑟e𝑟𝑛(𝑟,𝑓)d𝑥𝑥=𝑛(𝑟,𝑓),

it follows that 𝑛≤𝑁, and

𝜌+𝜀>lim sup𝑟→∞log𝑛(𝑟,𝑓)log𝑟,

and hence the conclusion follows for 𝑎=∞ by Theorem 4.4.4.11Theorem 4.4.4.11Theorem 4.4.4.11. Assume 𝑎 is finite; observe that

𝑇(𝑟,𝑓)=𝑇(𝑟,𝑎,𝑓)+𝒪︀(1)=𝑇(𝑟,1𝑓−𝑎)+𝒪︀(1)
by the First Fundamental Theorem (Theorem 14.2.4Theorem 14.2.4Theorem 14.2.4). It follows that 𝜌 is the order of 1𝑓−𝑎. Applying the previous result to this function, whose poles are precisely at {𝑟𝑛(𝑎)}, the conclusion follows. ⁠□