Notes on Complex Analysis
Export PDFGitHub

§14.4.1 The Estimation of 𝑆(𝑟,𝑓)

14.4.1 The Estimation of 𝑆(𝑟,𝑓)

The second part of the Second Fundamental Theorem is typically a suitable estimate on 𝑆(𝑟,𝑓).

Theorem 14.4.1.5 (Second Fundamental Theorem of Nevanlinna Theory, Part 2).

  1. If 𝑅0=∞ and 𝑓 has finite order, then Let 𝑓:𝐷(0,𝑅0)→ℂ̂ (0<𝑅0≤∞) be meromorphic and non-constant. Define 𝑆(𝑟,𝑓) as in (14.4.1)(14.4.1)(14.4.1). Then

    𝑆(𝑟,𝑓)=𝒪︀(log𝑇(𝑟,𝑓))+𝒪︀(log𝑟)(†)
    as 𝑟→∞ through all values.
  2. If 𝑅0=∞ and 𝑓 has infinite order, then (†) holds as 𝑟→∞ through all values of 𝑟 outside a set 𝐸 of finite linear measure.
  3. If 𝑅0<∞, then

    𝑆(𝑟,𝑓)=𝒪︀(log+𝑇(𝑟,𝑓)+log1𝑅0−𝑟)(‡)

    as 𝑟→𝑅0− outside a set 𝐸 satisfying

    ∫𝐸d𝑟𝑅0−𝑟<∞.
    Moreover, for any 𝜌,𝜌′∈(0,𝑅0) such that 𝑅0−𝜌′<e−2(𝑅0−𝜌) (implying that 𝜌<𝜌′), ∃𝑟∈(𝜌,𝜌′) such that 𝑟∉𝐸.

Modern results vastly improve said estimations, and the search for a sharp estimation is one of the most challenging questions in Nevanlinna Theory.

Lemma 14.4.1.1.

Let 𝑧∈ℂ be arbitrary and fixed and suppose 0<𝑟<∞. Let

𝐸𝑘={𝜃:−π<𝜃<π∧|𝑧−𝑟ei𝜃|<𝑘𝑟}

for each 0<𝑘≤1. It follows that

𝐼=∫𝐸𝑘log|𝑟𝑧−𝑟ei𝜃|d𝜃<π𝑘(1−log𝑘).
Proof.

Let 𝑧=𝜌ei𝜓. Performing a substitution of 𝜗=𝜃−𝜓, we have 𝐼=∫𝐸𝑘′log|𝑟𝜌−𝑟ei𝜗|d𝜗, where 𝐸𝑘′={𝜗:−π−𝜓<𝜗<π−𝜓∧|𝜌−𝑟ei𝜗|<𝑘𝑟}.

Because the exponential is periodic every 2πi, we may assume that 𝐸𝑘′ is restricted to −π<𝜗<π instead of −π−𝜓<𝜗<π−𝜓. The expression |𝜌−𝑟ei𝜗|=𝑘𝑟 gives at most two symmetric solutions ±𝜃0 (let 𝜃0≥0).

Evidently, for 𝜗>π2 or −𝜗<−π2,

|𝜌−𝑟ei𝜗|=𝜌2+𝑟2−2𝑟𝜌cos(𝜗)≥𝑟≥𝑘𝑟,(Law of Cosines)

so it follows that 𝜃0≤π2, and furthermore, all −𝜃0<𝜗<𝜃0 lie in 𝐸𝑘′ by the geometry of a circle. Since |𝜌−𝑟ei𝜗|≥|ℑ𝔪(𝜌−𝑟ei𝜗)|=𝑟|sin(𝜗)|, assuming that 𝐸𝑘′≠⌀, it follows that

𝐼=2∫0𝜃0log|𝑟𝜌−𝑟ei𝜗|d𝜗≤2∫0𝜃0logcsc(𝜗)d𝜗<2∫0𝜃0log(π2𝜗)d𝜗=2𝜃0log(π2)−2∫0𝜃0log(𝜗)d𝜗=2𝜃0log(π2)−2(𝜃0log(𝜃0)−𝜃0)=2𝜃0(log(π2𝜃0)+1).

Since π2sin𝑥≥𝑥 for 𝑥∈[0,π2], it follows that 𝜃0≤π2sin𝜃0≤π𝑘2. Moreover, 𝜃↦2𝜃(log(π2𝜃)+1) is an increasing function of 0≤𝜃≤π2; thus we may replace all instances of 𝜃0 with π𝑘2, proving the lemma. ⁠□

Lemma 14.4.1.2.

Let {𝑧𝜈}𝜈=1𝑛 be 𝑛≥1 (possibly indistinct) complex numbers. Define 𝛿(𝑧)=min{|𝑧−𝑧𝜈|:𝜈∈ℕ≤𝑛}. It follows that for any 𝑟>0,

12π∫02πlog+𝑟𝛿(𝑟ei𝜃)d𝜃≤2log𝑛+12
Proof.

Define the set

𝐸𝜈={𝜃∈(−π,π):|𝑧𝜈−𝑟ei𝜃|<𝑟𝑛}

and let 𝐸=⋃𝜈=1𝑛𝐸𝜈. For 𝜃∈𝐸, 𝛿(𝑟ei𝜃)<𝑟𝑛, implying that 𝑟𝛿(𝑟ei𝜃)>𝑛. Define

log0𝑥={log𝑥if𝑥≥𝑛0otherwise(≥0),

so that for 𝜃 in the prescribed range, we have

log+𝑟𝛿(𝑟ei𝜃)=log0(𝑟𝛿(𝑟ei𝜃))=log0(𝑟min𝜈∈ℕ≤𝑛|𝑟ei𝜃−𝑧𝜈|)≤∑𝜈=1𝑛log0(𝑟|𝑟ei𝜃−𝑧𝜈|).

Since 0<1𝑛≤1, by virtue of Lemma 14.4.1.1Lemma 14.4.1.1Lemma 14.4.1.1 for 𝑘=1𝑛,

12π∫𝐸log+𝑟𝛿(𝑟ei𝜃)d𝜃≤12π∑𝜈=1𝑛∫02πlog0(𝑟|𝑟ei𝜃−𝑧𝜈|)d𝜃=12π∑𝜈=1𝑛∫02πlog(𝑟|𝑟ei𝜃−𝑧𝜈|)d𝜃<12π∑𝜈=1𝑛π𝑛(1+log𝑛)=12+log𝑛2.(14.4.1.1)

For 𝜃∉𝐸, for each 𝜈 we have |𝑧𝜈−𝑟ei𝜃|≥𝑟𝑛 and thus 𝛿(𝑟ei𝜃)≥𝑟𝑛. It follows that

12π∫𝜃∉𝐸log+𝑟𝛿(𝑟ei𝜃)d𝜃≤12π∫02πlog+𝑛d𝜃≤log𝑛.(14.4.1.2)
Combining (14.4.1.1)(14.4.1.4)(14.4.1.1), (14.4.1.2)(14.4.1.5)(14.4.1.2) gives the desired result. ⁠□

Proposition 14.4.1.3.

If 𝑓 is meromorphic on 𝐷(0,𝑅), then for 0<𝑟<𝑅, letting 𝑐 be the first nonzero coefficient of the innermost Laurent expansion of 𝑓 about the origin,

𝑚(𝑟,𝑓′𝑓)<4log+𝑇(𝑅,𝑓)+4log+log+|1𝑐|+5log+𝑅+6log+1𝑅−𝑟+log+1𝑟+14.
Proof.

By the Poisson–Jensen Formula (Theorem 4.4.4.3Theorem 4.4.4.3Theorem 4.4.4.3), letting 𝜌=12(𝑅+𝑟), for each non-singular point 𝑧∈𝜕𝐷(0,𝑟),

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

where {𝑎𝑘} and {𝑏𝑗} are the respective zeros and poles in the disk. By (4.4.4.4)(4.4.4.15)(4.4.4.4), we have 𝜕𝜕𝑧(ℜ𝔢𝑔(𝑧))=12𝑔′(𝑧) for all holomorphic 𝑔. Applying this with differentiation under the integral sign, we have that

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

Define

𝛿(𝑧)=min({|𝑧−𝑎𝑘|:𝑘∈ℕ≤𝑛(𝜌,0,𝑓)}∪{|𝑧−𝑏𝑗|:𝑗∈ℕ≤𝑛(𝜌,𝑓)}).

Evidently the number of zeros and poles is given by

𝑛=𝑛(𝜌,𝑓)+𝑛(𝜌,0,𝑓).

Since

|𝜌2−𝑎𝑘‾𝑧|≥𝜌2−𝑟|𝑎𝑘|≥𝜌2−𝑟𝜌,|𝜌2−𝑏𝑗‾𝑧|≥𝜌2−𝑟𝜌,

it follows that

|𝑎𝑘‾𝜌2−𝑎𝑘‾𝑧|,|𝑏𝑗‾𝜌2−𝑏𝑗‾𝑧|≤𝜌𝜌2−𝑟𝜌=1𝜌−𝑟,(14.4.1.3)

and additionally,

|1𝑏𝑗−𝑧|≤1𝛿(𝑧),|1𝑎𝑘−𝑧|≤1𝛿(𝑧).(14.4.1.4)

Furthermore,

|12π∫02πlog|𝑓(𝜌ei𝜃)|2𝜌ei𝜃d𝜃(𝜌ei𝜃−𝑧)2|≤12π2𝜌(𝜌−𝑟)2∫02π|log|𝑓(𝜌ei𝜃)||d𝜃=2𝜌(𝜌−𝑟)2[𝑚(𝜌,𝑓)+𝑚(𝜌,1𝑓)].(14.4.1.5)

by Part 4Part 4Part 4 of Proposition 14.1.2Proposition 14.1.2Proposition 14.1.2. Combining (14.4.1.3)(14.4.1.6)(14.4.1.3), (14.4.1.4)(14.4.1.7)(14.4.1.4), (14.4.1.5)(14.4.1.8)(14.4.1.5), we have

|𝑓′(𝑧)𝑓(𝑧)|≤2𝜌(𝜌−𝑟)2[𝑚(𝜌,𝑓)+𝑚(𝜌,1𝑓)]+∑𝑘=1𝑛(𝜌,0,𝑓)(1𝜌−𝑟+1𝛿(𝑧))+∑𝑗=1𝑛(𝜌,𝑓)(1𝜌−𝑟+1𝛿(𝑧))=2𝜌(𝜌−𝑟)2[𝑚(𝜌,𝑓)+𝑚(𝜌,1𝑓)]+𝑛(1𝜌−𝑟+1𝛿(𝑧)).

By Proposition 14.1.5Proposition 14.1.5Proposition 14.1.5, we have 𝑇(𝜌,0,𝑓)=𝑇(𝜌,𝑓)−log|𝑐|, where 𝑐 is the first nonzero coefficient of the innermost Laurent expansion of 𝑓 about the origin. It follows that 𝑚(𝜌,1𝑓)=𝑇(𝜌,𝑓)−log|𝑐|−𝑁(𝜌,0,𝑓) and 𝑚(𝜌,𝑓)=𝑇(𝜌,𝑓)−𝑁(𝜌,𝑓), thus

𝑚(𝜌,1𝑓)+𝑚(𝜌,𝑓)=2𝑇(𝜌,𝑓)−log|𝑐|−𝑁(𝜌,1𝑓)−𝑁(𝜌,𝑓)≤2𝑇(𝜌,𝑓)+2log+|1𝑐|,

and

|𝑓′(𝑧)𝑓(𝑧)|≤4𝜌(𝜌−𝑟)2[𝑇(𝜌,𝑓)+log+|1𝑐|]+𝑛𝑟(𝑟𝜌−𝑟+𝑟𝛿(𝑧)).

By the subadditive properties of Proposition 14.1.2Proposition 14.1.2Proposition 14.1.2, we have

log+|𝑓′(𝑧)𝑓(𝑧)|≤log+[4𝜌(𝜌−𝑟)2[𝑇(𝜌,𝑓)+log+|1𝑐|]]+log+[𝑛𝑟(𝑟𝜌−𝑟+𝑟𝛿(𝑧))]+log2≤log+𝜌+log+[(2𝜌−𝑟)2]+log+[𝑇(𝜌,𝑓)+log+|1𝑐|]+log+𝑛𝑟+log+(𝑟𝜌−𝑟+𝑟𝛿(𝑧))+log2≤log+𝜌+2log+1𝜌−𝑟+log+𝑇(𝜌,𝑓)+log+log+|1𝑐|+log+𝑛𝑟+log+𝑟𝜌−𝑟+log+𝑟𝛿(𝑧)+5log2.

Integrating on |𝑧|=𝑟 with Lemma 14.4.1.2Lemma 14.4.1.2Lemma 14.4.1.2 gives

𝑚(𝑟,𝑓′𝑓)≤log+𝜌+2log+1𝜌−𝑟+log+𝑇(𝜌,𝑓)+log+log+|1𝑐|+log+𝑛𝑟+log+𝑟𝜌−𝑟+12π∫02πlog+𝑟𝛿(𝑟ei𝜃)d𝜃+5log2≤log+𝜌+3log+1𝜌−𝑟+log+𝑇(𝜌,𝑓)+log+log+|1𝑐|+3log+𝑛+log+1𝑟+log+𝑟+12+5log2.(14.4.1.6)

To derive a more useful estimate for 𝑛, we note that

𝑁(𝑅,𝑓)≥∫𝜌𝑅𝑛(𝑥,𝑓)d𝑥𝑥≥∫𝜌𝑅𝑛(𝜌,𝑓)d𝑥𝑅=𝑛(𝜌,𝑓)𝑅−𝜌𝑅,𝑁(𝑅,0,𝑓)≥𝑛(𝜌,0,𝑓)𝑅−𝜌𝑅.

Thus,

𝑛=𝑛(𝜌,𝑓)+𝑛(𝜌,0,𝑓)≤𝑅𝑅−𝜌[𝑁(𝑅,𝑓)+𝑁(𝑅,0,𝑓)]≤𝑅𝑅−𝜌[𝑇(𝑅,𝑓)+𝑇(𝑅,0,𝑓)−𝑚(𝑅,𝑓)−𝑚(𝑅,0,𝑓)]≤𝑅𝑅−𝜌[2𝑇(𝑅,𝑓)+log|1𝑐|]≤2𝑅𝑅−𝜌[𝑇(𝑅,𝑓)+log+|1𝑐|].

Using the log+ subadditivity properties (as with earlier), we have

log+𝑛≤log+2𝑅𝑅−𝜌+log+𝑇(𝑅,𝑓)+log+log+|1𝑐|+log2≤log+𝑅+log+1𝑅−𝜌+log+𝑇(𝑅,𝑓)+log+log+|1𝑐|+2log2

Substituting this into (14.4.1.6)(14.4.1.9)(14.4.1.6), and using 𝑅−𝜌=𝜌−𝑟=𝑅−𝑟2 we have that (recognizing log+𝑟,log+𝜌<log+𝑅)

𝑚(𝑟,𝑓′𝑓)≤log+𝜌+3log+2𝑅−𝑟+log+𝑇(𝜌,𝑓)+log+log+|1𝑐|+log+1𝑟+log+𝑟+12+5log2+3log+𝑅+3log+2𝑅−𝑟+3log+𝑇(𝑅,𝑓)+3log+log+|1𝑐|+6log2<5log+𝑅+17log2+6log+1𝑅−𝑟+4log+𝑇(𝜌,𝑓)+4log+log+|1𝑐|+log+1𝑟+12≤5log+𝑅+17log2+6log+1𝑅−𝑟+4log+𝑇(𝑅,𝑓)+4log+log+|1𝑐|+log+1𝑟+12,
since 𝑇(𝜌,𝑓)≤𝑇(𝑅,𝑓) (Theorem 14.2.3Theorem 14.2.3Theorem 14.2.3). This proves the proposition. ⁠□

Lemma 14.4.1.4 (Borel).

Let 𝑇:[𝑟0,𝑅0)→ℝ be an increasing, continuous function satisfying 𝑇>1 on all of its domain (where 𝑟0<𝑅0≤∞).

  1. If 𝑅0=∞, for 𝑟≥𝑟0 outside a set 𝐸0⊆ℝ≥𝑟0 whose linear measure does not exceed 2 (satisfying ∫𝐸0d𝑟≤2 with respect to the Lebesgue measure1),

    𝑇(𝑟+1𝑇(𝑟))<2𝑇(𝑟)(14.4.1.7)
  2. If 𝑅0<∞, then ∃𝐸0⊆[𝑟0,𝑅0) satisfying ∫𝐸0d𝑟𝑅0−𝑟≤2 such that for 𝑟∈[𝑟0,𝑅0)∖𝐸0,

    𝑇(𝑟+𝑅0−𝑟e𝑇(𝑟))<2𝑇(𝑟)(14.4.1.8)
    Moreover, for any 𝑅,𝜌,𝜌′∈(0,𝑅0) such that 𝑅−𝜌′<e−2(𝑅−𝜌) (implying that 𝜌<𝜌′), ∃𝑟∈(𝜌,𝜌′) such that 𝑟∉𝐸0.
Proof.

We observe the two cases separately.

  1. Assume 𝑅0=∞. Then define 𝑟0′=𝑟0+1𝑇(𝑟0), and

    𝑟1=inf{𝑟>𝑟0′:(14.4.1.7)(14.4.1.10)(14.4.1.7)fails},𝑟1′=𝑟1+1𝑇(𝑟1)>𝑟1,

    and let

    𝑟2=inf{𝑟>𝑟1′:(14.4.1.7)(14.4.1.10)(14.4.1.7)fails},𝑟2′=𝑟2+1𝑇(𝑟2)>𝑟2,

    repeating this process recursively by

    𝑟𝑛=inf{𝑟>𝑟𝑛−1′:(14.4.1.7)(14.4.1.10)(14.4.1.7)fails},𝑟𝑛′=𝑟𝑛+1𝑇(𝑟𝑛)>𝑟𝑛.

    It follows that 𝑟𝑛≥𝑟𝑛−1′>𝑟𝑛−1, and 𝑟𝑛−𝑟𝑛−1≥𝑟𝑛−1′−𝑟𝑛−1.

    Let 𝑁∈ℕ∪{∞} be the largest 𝑛 for which the infimum in 𝑟𝑛 is defined. Observe that by the definition of the infimum, for each 𝑛, (14.4.1.7)(14.4.1.10)(14.4.1.7) must be satisfied throughout each (𝑟𝑛−1′,𝑟𝑛). Indeed, if there exists some value within this interval for which (14.4.1.7)(14.4.1.10)(14.4.1.7) fails, then 𝑟𝑛, which was defined by an infimum, would then be at most this new value, contradicting the assertion that it lay within the interval. It follows that the exceptional set must lie outside of the disjoint union; in other words,

    𝐸0⊆ℝ≥𝑟0∖⋃𝑛=1𝑁(𝑟𝑛−1′,𝑟𝑛)=⋃𝑛=0𝑁[𝑟𝑛,𝑟𝑛′].

    We state without proof that subadditivity holds:

    ∫𝐸0d𝑟≤∑𝑛=0𝑁(𝑟𝑛′−𝑟𝑛).

    By construction, for points sufficiently close to 𝑟𝑛 or at 𝑟𝑛 itself,

    𝑇(𝑟+1𝑇(𝑟))≥2𝑇(𝑟),

    continuity allows (in either case) this inequality to be extended to 𝑟=𝑟𝑛. Then for each 𝑛,

    𝑇(𝑟𝑛′)=𝑇(𝑟𝑛+1𝑇(𝑟𝑛))≥2𝑇(𝑟𝑛),𝑇(𝑟𝑛′)≤𝑇(𝑟𝑛+1)⟹𝑇(𝑟𝑛+1)≥2𝑇(𝑟𝑛).

    Using induction, 𝑇(𝑟𝑛)≥2𝑛𝑇(𝑟0), implying that

    𝑟𝑛′−𝑟𝑛=1𝑇(𝑟𝑛)≤12𝑛𝑇(𝑟0)∑𝑛=0𝑁(𝑟𝑛′−𝑟𝑛)≤1𝑇(𝑟0)∑𝑛=0∞12𝑛=2𝑇(𝑟0)≤2.
  2. Suppose 𝑅0<∞ in the theorem statement. Let 𝑇0(𝜌)=𝑇(𝑅0−e−𝜌), where 𝜌0=log1𝑅0−𝑟0≤𝜌<∞, so that 𝑇0 is an increasing function on [𝜌0,∞). By the result above, ∃𝐸0′⊆[𝜌0,∞) such that

    ∫𝐸0′d𝜌≤2,𝑇0(𝜌+1𝑇0(𝜌))<2𝑇0(𝜌)∀𝜌∉𝐸0′.

    Substitute 𝜌=log1𝑅0−𝑟, 𝑟=𝑅0−e−𝜌, 𝐸0=(𝜌↦𝑅0−e−𝜌)(𝐸0′), so that 𝑇0(𝜌)=𝑇(𝑟), and

    ∫𝐸0d𝑟𝑅0−𝑟≤2,𝑇(𝑅0−(𝑅0−𝑟)e−1𝑇(𝑟))<2𝑇(𝑟)∀𝑟∉𝐸0.

    We are left to bound the inequality to be in the form of (14.4.1.8)(14.4.1.11)(14.4.1.8). For 𝑥∈(0,1),

    e−𝑥<1−e−1e𝑥<1−𝑥e,

    thus for 𝑟 within [𝑟0,𝑅0) outside 𝐸0, we have from e−1𝑇(𝑟)<1−1e𝑇(𝑟). Hence,

    𝑇(𝑅0−(𝑅0−𝑟)e−1𝑇(𝑟))≥𝑇(𝑅0−(𝑅0−𝑟)(1−1e𝑇(𝑟)))=𝑇(𝑟+𝑅0−𝑟e𝑇(𝑟)).

    If 𝜌,𝜌′ are chosen such that 𝑅0−𝜌′<e−2(𝑅0−𝜌), then

    ∫𝜌𝜌′d𝑟𝑅0−𝑟=log(𝑅0−𝜌𝑅0−𝜌′)>log(e2)=2.
    Since ∫𝐸0d𝑟𝑟0−𝑟≤2, there then (𝜌,𝜌′)⊂.≠𝐸0. Thus, ∃𝑟∈(𝜌,𝜌′) such that 𝑟∉𝐸0.□

Theorem 14.4.1.5 (Second Fundamental Theorem of Nevanlinna Theory, Part 2).

  1. If 𝑅0=∞ and 𝑓 has finite order, then Let 𝑓:𝐷(0,𝑅0)→ℂ̂ (0<𝑅0≤∞) be meromorphic and non-constant. Define 𝑆(𝑟,𝑓) as in (14.4.1)(14.4.1)(14.4.1). Then

    𝑆(𝑟,𝑓)=𝒪︀(log𝑇(𝑟,𝑓))+𝒪︀(log𝑟)(†)
    as 𝑟→∞ through all values.
  2. If 𝑅0=∞ and 𝑓 has infinite order, then (†) holds as 𝑟→∞ through all values of 𝑟 outside a set 𝐸 of finite linear measure.
  3. If 𝑅0<∞, then

    𝑆(𝑟,𝑓)=𝒪︀(log+𝑇(𝑟,𝑓)+log1𝑅0−𝑟)(‡)

    as 𝑟→𝑅0− outside a set 𝐸 satisfying

    ∫𝐸d𝑟𝑅0−𝑟<∞.
    Moreover, for any 𝜌,𝜌′∈(0,𝑅0) such that 𝑅0−𝜌′<e−2(𝑅0−𝜌) (implying that 𝜌<𝜌′), ∃𝑟∈(𝜌,𝜌′) such that 𝑟∉𝐸.
Proof.

As a function of 𝑟,

𝑆(𝑟,𝑓)=𝑚(𝑟,𝑓′𝑓)+𝑚(𝑟,𝜙′𝜙)+constant,

where 𝜙(𝑧)=∏𝜈=1𝑞(𝑓(𝑧)−𝑎𝜈), where the constant term does not depend on 𝑟. In all three perceivable cases,

𝑇(𝑟,𝜙)≤∑𝜈=1𝑞𝑇(𝑟,𝑓−𝑎𝜈)=𝑞𝑇(𝑟,𝑓)+𝒪︀(1),log+𝑇(𝑟,𝜙)≤log+𝑇(𝑟,𝑓)+𝒪︀(1)(14.4.1.9)

by Proposition 14.2.5Proposition 14.2.5Proposition 14.2.5 (product-subadditivity), Theorem 14.2.4Theorem 14.2.4Theorem 14.2.4 (first fundamental theorem). In the first case, where 𝑅0=∞, by Proposition 14.4.1.3Proposition 14.4.1.3Proposition 14.4.1.3 with 𝑅=2𝑟,

𝑚(𝑟,𝑓′𝑓)<4log+𝑇(𝑅,𝑓)+𝒪︀(1)+5log+(2𝑟)=𝒪︀(log+𝑇(2𝑟,𝑓))+𝒪︀(log+𝑟).𝑚(𝑟,𝜙′𝜙)<4log+𝑇(𝑅,𝜙)+𝒪︀(1)+5log+(2𝑟)=𝒪︀(log+𝑇(2𝑟,𝜙))+𝒪︀(log+𝑟).

Since 𝑓 has finite order, 𝑇(2𝑟,𝑓)=𝒪︀((2𝑟)𝜌+𝜀)=𝒪︀(𝑟𝜚), so log+𝑇(2𝑟,𝑓)=𝒪︀(log+𝑟), thus as 𝑟→∞, using (14.4.1.9)(14.4.1.12)(14.4.1.9) we have

𝑚(𝑟,𝑓′𝑓)=𝒪︀(log+𝑇(2𝑟,𝑓))+𝒪︀(log+𝑟)=𝒪︀(log𝑟),𝑚(𝑟,𝜙′𝜙)=𝒪︀(log+𝑇(2𝑟,𝜙))+𝒪︀(log+𝑟)=𝒪︀(log𝑟).

Then 𝑆(𝑟,𝑓)=𝒪︀(log𝑟), clearly satisfying (†).

Now assume 𝑓 is not necessarily of finite order and 𝑅0=∞. Then by Proposition 14.4.1.3Proposition 14.4.1.3Proposition 14.4.1.3 with 𝑅=𝑟+1𝑇(𝑟),

𝑚(𝑟,𝑓′𝑓)<𝒪︀(log+𝑇(𝑟+1𝑇(𝑟,𝑓),𝑓))+𝒪︀(1)+𝒪︀(log+𝑟)𝑚(𝑟,𝜙′𝜙)<𝒪︀(log+𝑇(𝑟+1𝑇(𝑟,𝜙),𝜙))+𝒪︀(1)+𝒪︀(log+𝑟)

By Lemma 14.4.1.4Lemma 14.4.1.4Lemma 14.4.1.4, there exist some exceptional sets 𝐸1,𝐸2 each of linear measure not exceeding 2 such that for 𝑟∉𝐸1∪𝐸2,

log+𝑇(𝑟+1𝑇(𝑟,𝑓),𝑓)≤log+𝑇(𝑟,𝑓)+𝒪︀(1)log+𝑇(𝑟+1𝑇(𝑟,𝜙),𝜙)≤log+𝑇(𝑟,𝜙)+𝒪︀(1)

thus for 𝑟→∞ with 𝑟∉𝐸0,

𝑆(𝑟,𝑓)=𝒪︀(log+𝑇(𝑟,𝑓))+𝒪︀(log+𝑟).

Lastly, assume that 𝑅0<∞. Now apply Proposition 14.4.1.3Proposition 14.4.1.3Proposition 14.4.1.3 with 𝑅=𝑟+𝑅0−𝑟e𝑇(𝑟,𝑓) and 𝑅=𝑟+𝑅0−𝑟e𝑇(𝑟,𝜙), so that for 𝑟 outside some exceptional set satisfying ∫𝐸d𝑟𝑅0−𝑟≤4<∞, by Lemma 14.4.1.4Lemma 14.4.1.4Lemma 14.4.1.4,

𝑚(𝑟,𝑓′𝑓)<𝒪︀(log+𝑇(𝑟+𝑅0−𝑟e𝑇(𝑟,𝑓),𝑓))+𝒪︀(1)+𝒪︀(log+(𝑟+𝑅0−𝑟e𝑇(𝑟,𝑓)))+𝒪︀(log+e𝑇(𝑟,𝑓)𝑅0−𝑟),<𝒪︀(log+𝑇(𝑟,𝑓))+𝒪︀(1)+𝒪︀(log+e𝑇(𝑟,𝑓)𝑅0−𝑟)=𝒪︀(log+𝑇(𝑟,𝑓)+log1𝑅0−𝑟),

where the 𝒪︀(log+(𝑟+𝑅0−𝑟e𝑇(𝑟,𝑓))) term has been coalesced to 𝒪︀(1) as 𝑟+𝑅0−𝑟e𝑇(𝑟,𝑓) is bounded.

𝑚(𝑟,𝜙′𝜙)=𝒪︀(log+𝑇(𝑟,𝜙)+log1𝑅0−𝑟)≤𝒪︀(log+𝑇(𝑟,𝑓)+log1𝑅0−𝑟).(by(14.4.1.9)(14.4.1.12)(14.4.1.9))

Therefore,

𝑆(𝑟,𝑓)=𝒪︀(log+𝑇(𝑟,𝑓)+log1𝑅0−𝑟).□

Proposition 14.4.1.6.

If 𝑓:ℂ→ℂ̂ is meromorphic and 𝑇(𝑟,𝑓)=𝒪︀(log𝑟), then 𝑓 is a rational function.
Proof.

We must have (for any 𝑎∈ℂ̂) 𝑁(𝑟,𝑎,𝑓)=𝒪︀(log𝑟). We assert that 𝑓 attains each value finitely many times. Otherwise, for each 𝑘∈ℕ, there exists 𝑟′ such that ∀𝑟>𝑟′, 𝑛(𝑟,𝑎,𝑓)>𝑘. Then

𝑁(𝑟,𝑎,𝑓)=𝑐+∫𝑟′𝑟𝑛(𝑥,𝑎,𝑓)−𝑛(0,𝑎,𝑓)𝑥d𝑥+𝑛(0,𝑎,𝑓)log𝑟>𝑐+𝑘log𝑟.

Thus, 𝑁 eventually grows faster than 𝑘log𝑟 for any 𝑘. It follows that each 𝑎 is attained finitely many times by contradiction. Construct 𝑔=𝒪︀(|𝑧|𝑑) to be a polynomial with its zeros at each pole (finitely many), counting orders, of 𝑓.

Then ℎ=𝑓𝑔 is entire, and furthermore, 𝑇(𝑟,ℎ)≤𝑇(𝑟,𝑓)+𝑇(𝑟,𝑔). Since 𝑇(𝑟,𝑓)=𝒪︀(log𝑟) and

𝑇(𝑟,𝑔)=𝑚(𝑟,𝑔)≤log+𝑀(𝑟,𝑔)=𝒪︀(log𝑟),

then

log𝑀(𝑟,ℎ)≤3𝑇(2𝑟,ℎ)=𝒪︀(log𝑟).(byTheorem 14.2.1.1Theorem 14.2.1.1Theorem 14.2.1.1with𝑅=2𝑟)

Then

𝑀(𝑟,ℎ)≤𝑎𝑟𝑏+𝑐∀𝑟>0,

where 𝑎,𝑏,𝑐 are constants. Thus the growth of ℎ may not exceed that of a polynomial. By Cauchy’s Estimate (Theorem 3.2.3Theorem 3.2.3Theorem 3.2.3), for any natural number 𝑛 and positive 𝑟,

|ℎ(𝑛)(0)|≤𝑛!(𝑎𝑟𝑏+𝑐)𝑟𝑛=𝒪︀(𝑟𝑏−𝑛).

By letting 𝑟→∞, it follows that ℎ(𝑛)(0)=0 for any 𝑛>𝑏. Then there are finitely many terms in the Taylor expansion of ℎ, and therefore ℎ is a polynomial. Consequently 𝑓 is the quotient of two polynomials. ⁠□

Definition 14.4.1.7.

Let 𝑓:𝐷(0,𝑅0)→ℂ̂ be meromorphic for 𝑅0∈ℝ>0∪{∞}. Then 𝑓 is said to be admissible if either of the following are true:

  1. 𝑅0=∞ and 𝑓 is non-constant.
  2. 𝑅0<∞ and lim sup𝑟→𝑅0−𝑇(𝑟,𝑓)log1𝑅0−𝑟=∞.

These definitions ensure that 𝑆(𝑟,𝑓) is generally sufficiently small:

Theorem 14.4.1.8.

An admissible meromorphic function 𝑓:𝐷(0,𝑅0)→ℂ̂ (given for 𝑅0∈ℝ>0∪{∞}) pertains to one of the following cases:

  1. If 𝑅0=∞ and 𝑓 has finite order, then 𝑆(𝑟,𝑓)=ℴ︀(𝑇(𝑟,𝑓)) for 𝑟→𝑅0− through all values.
  2. If 𝑅0=∞ and 𝑓 has infinite order, then 𝑆(𝑟,𝑓)=ℴ︀(𝑇(𝑟,𝑓)) for 𝑟→𝑅0− outside a set 𝐸0 of finite linear measure, which depends on 𝑓 but not on {𝑎𝜈} and 𝑞.
  3. If 𝑅0<∞, then 𝑆(𝑟,𝑓)=ℴ︀(𝑇(𝑟,𝑓)) for 𝑟→𝑅0− through any sequence {𝑟𝑛}𝑛 dependent on 𝑓 but not on {𝑎𝜈} and 𝑞.
Proof.

Assume the conditions of the theorem.

  1. Assume 𝑅0=∞ and 𝑓 has finite order. Then 𝑇(𝑟,𝑓)=𝒪︀(𝑟𝜌+𝜀), 𝑟𝜌−𝜀=ℴ︀(𝑇(𝑟,𝑓)) (assuming that 𝜌>0), so log𝑟=ℴ︀(𝑇(𝑟,𝑓)). Therefore, by Theorem 14.4.1.5Theorem 14.4.1.5Theorem 14.4.1.5, it follows that through all values as 𝑟→∞,

    𝑆(𝑟,𝑓)=𝒪︀(log𝑇(𝑟,𝑓))+𝒪︀(log𝑟)=𝒪︀(log𝑇(𝑟,𝑓))=ℴ︀(𝑇(𝑟,𝑓)).

    If 𝜌=0, either log𝑟=ℴ︀(𝑇(𝑟,𝑓)) or 𝑇(𝑟,𝑓)=𝒪︀(log𝑟). The former case is the same as above.

    In the latter case, Proposition 14.4.1.6Proposition 14.4.1.6Proposition 14.4.1.6 gives that 𝑓 is rational. Hence, as 𝑟→∞, 𝑀(𝑟,𝑓′𝑓),𝑀(𝑟,∑𝜈=1𝑞𝑓′𝑓−𝑎𝜈)→0. Hence for sufficiently large 𝑟, 𝑚(𝑟,𝑓′𝑓) and 𝑚(𝑟,∑𝜈=1𝑞𝑓′𝑓−𝑎𝜈) vanish and 𝑆(𝑟,𝑓)=𝒪︀(1), therefore 𝑆𝑇→0.

  2. Assume 𝑅0=∞ and 𝑓 has infinite order. Then by Theorem 14.4.1.5Theorem 14.4.1.5Theorem 14.4.1.5, it follows that for 𝑟→𝑅0− outside a set 𝐸0 of finite linear measure, 𝑆(𝑟,𝑓)=𝒪︀(log𝑇(𝑟,𝑓))+𝒪︀(log𝑟). Since log𝑇(𝑟,𝑓)log𝑟→∞, then log𝑟=ℴ︀(𝑇(𝑟,𝑓)), and thus 𝑆(𝑟,𝑓)=ℴ︀(𝑇(𝑟,𝑓)) outside this exceptional set.
  3. Assume 𝑅0<∞. Construct two sequences {𝜌𝑛}𝑛,{𝜌𝑛′}𝑛 such that 𝜌𝑛<𝜌𝑛′, 𝜌𝑛,𝜌𝑛′→𝑅0−, and

    lim𝑛→∞𝑇(𝜌𝑛,𝑓)log1𝑅0−𝜌𝑛=∞

    (observe that this is no longer a limit superior) and 𝜌𝑛′=𝑅0−e−2𝑅0−𝜌𝑛2, so that 𝑅0−𝜌𝑛′<e−2(𝑅0−𝜌𝑛).

    Then by Theorem 14.4.1.5Theorem 14.4.1.5Theorem 14.4.1.5, there exists some 𝑟𝑛∈(𝜌𝑛,𝜌𝑛′) such that 𝑟𝑛∉𝐸0. It follows that 𝑅0−𝜌𝑛>𝑅0−𝑟𝑛>𝑅0−𝜌𝑛′=𝑅0−𝜌𝑛2e2. Then for 𝑛→∞,

    1𝑅0−𝜌𝑛=ℴ︀(𝑇(𝜌𝑛))=ℴ︀(𝑇(𝑟𝑛)),

    since 𝑇 is a non-decreasing function of radius. Then as 𝑛→∞,

    𝑆(𝑟𝑛,𝑓)=𝒪︀[log+𝑇(𝑟𝑛,𝑓)+logℴ︀(𝑇(𝑟𝑛,𝑓))]=ℴ︀(𝑇(𝑟𝑛,𝑓)).□
  1. 1″Linear measure“ refers to length. Here, the condition is equivalent to the inequality given by inf{∑𝑘|𝐼𝑘|:𝐸⊆⋃𝑘𝐼𝑘}≤2 where {𝐼𝑘} are finite open intervals.