Notes on Complex Analysis
Export PDFGitHub

§14.2 Properties of 𝑇(𝑟,𝑓) and the First Fundamental Theorem

14.2 Properties of 𝑇(𝑟,𝑓) and the First Fundamental Theorem

Proposition 14.2.1.

If 𝑓𝑘 (𝑘=1,…,𝑛) are meromorphic in 𝐷(0,𝑅), then for 0<𝑟<𝑅,

  1. 𝑁(𝑟,∏𝑘=1𝑛𝑓𝑘)≤∑𝑘=1𝑛𝑁(𝑟,𝑓𝑘).
  2. 𝑁(𝑟,∑𝑘=1𝑛𝑓𝑘)≤∑𝑘=1𝑛𝑁(𝑟,𝑓𝑘) (subadditivity).
  3. 𝑚(𝑟,∏𝑘=1𝑛𝑓𝑘)≤∑𝑘=1𝑛𝑚(𝑟,𝑓𝑘).
  4. 𝑚(𝑟,∑𝑘=1𝑛𝑓𝑘)≤log𝑛+∑𝑘=1𝑛𝑚(𝑟,𝑓𝑘).
  5. 𝑇(𝑟,∏𝑘=1𝑛𝑓𝑘)≤∑𝑘=1𝑛𝑇(𝑟,𝑓𝑘).
  6. 𝑇(𝑟,∑𝑘=1𝑛𝑓𝑘)≤log𝑛+∑𝑘=1𝑛𝑇(𝑟,𝑓𝑘).
Proof.

Let 𝑧 be an arbitrary point in the disk. If 𝑚𝑘 is the pole order of 𝑓𝑘 at 𝑧 (0 if it is not a pole), then the pole order at 𝑧 of ∑𝑘𝑓𝑘 does not exceed max𝑘𝑚𝑘. It is hence clear that 𝑛(𝑟,∑𝑘𝑓𝑘)≤∑𝑘𝑛(𝑟,𝑓𝑘).

Moreover, if {𝑏𝑘(𝑗)}𝑗 are the poles of 𝑓𝑘 in the disk counted according to orders, and {𝑏(𝑗)}𝑗 are the poles of ∑𝑘𝑓𝑘, then

∑𝑘=1𝑛∑𝑗log|𝑟𝑏𝑘(𝑗)|≥∑𝑗log|𝑟𝑏(𝑗)|.

Recognizing that

𝑁(𝑟,∑𝑘𝑓𝑘)=∑𝑗log|𝑟𝑏(𝑗)|+𝑛(0,∑𝑘𝑓𝑘)log𝑟∑𝑘=1𝑛𝑁(𝑟,𝑓𝑘)=∑𝑘=1𝑛∑𝑗log|𝑟𝑏𝑘(𝑗)|+∑𝑘𝑛(0,𝑓𝑘)log𝑟,

Part 2Part 2Part 2 then follows. Since the pole order at 𝑧 of ∏𝑘𝑓𝑘 does not exceed ∑𝑘𝑚𝑘, it also follows that 𝑛(𝑟,∏𝑘𝑓𝑘)≤∑𝑘𝑛(𝑟,𝑓𝑘). The same logic can be applied henceforth to prove Part 1Part 1Part 1.

Part 3Part 3Part 3 and Part 4Part 4Part 4 are clear from Proposition 14.1.2Proposition 14.1.2Proposition 14.1.2. Part 5Part 5Part 5 and Part 6Part 6Part 6 follow the previous inequalities. ⁠□

Theorem 14.2.2.

Let 𝑓:𝐷(0,𝑅)→ℂ̂ be meromorphic such that 𝑓(𝑧)=𝑐𝑧𝑘+𝒪︀(𝑧𝑘+1). For 0<𝑟<𝑅,

𝑇(𝑟,𝑓)=12π∫02π𝑁(𝑟,ei𝜃,𝑓)d𝜃+12π∫02πlog|𝑐𝜃|d𝜃=12π∫02π𝑁(𝑟,ei𝜃,𝑓)d𝜃+{log|𝑐|if𝑘<0log+|𝑐|if𝑘=00if𝑘>0,
where 𝑐𝜃 is the first nonzero coefficient of the innermost Laurent expansion of 𝑓−ei𝜃 at the origin.
Proof.

For 𝜃∈[0,2π], from (14.1.2)(14.1.2)(14.1.2) on 𝑓−ei𝜃 (let 𝑐𝜃 be the first nonzero coefficient of the innermost Laurent series) we obtain

log|𝑐𝜃|=𝑁(𝑟,𝑓)−𝑁(𝑟,ei𝜃,𝑓)+12π∫02πlog|𝑓(𝑟ei𝜙−ei𝜃)|d𝜙.

Therefore, by integrating in 𝜃,

12π∫02πlog|𝑐𝜃|d𝜃=𝑁(𝑟,𝑓)−12π∫02π𝑁(𝑟,ei𝜃,𝑓)d𝜃+12π∫02π[∫02πlog|𝑓(𝑟ei𝜙−ei𝜃)|d𝜙]d𝜃.(14.2.1)

For any 𝑤∈ℂ∗,

log+|𝑤|=12π∫02πlog|𝑤−ei𝜃|d𝜃,(14.2.2)

which follows directly from Jensen’s formula on the function 𝑧↦𝑤−𝑧 (by considering when 𝑤∈𝔻‾ and |𝑤|>1). Letting 𝜙∈[0,2π], we have by setting 𝑤=𝑓(𝑟ei𝜙),

log+|𝑓(𝑟ei𝜙)|=12π∫02πlog|𝑓(𝑟ei𝜙)−ei𝜃|d𝜃.

Hence, from absolute convergence we have

𝑚(𝑟,𝑓)=12π∫02π[12π∫02πlog|𝑓(𝑟ei𝜙)−ei𝜃|d𝜃]d𝜙=12π∫02π[12π∫02πlog|𝑓(𝑟ei𝜙)−ei𝜃|d𝜙]d𝜃.

From (14.2.1)(14.2.1)(14.2.1), it follows that

𝑇(𝑟,𝑓)=12π∫02π𝑁(𝑟,ei𝜃,𝑓)d𝜃+12π∫02πlog|𝑐𝜃|d𝜃.

If 𝑓(0)=∞, then subtracting ei𝜃 from 𝑓 does not modify the first nonzero coefficient of the innermost Laurent series (𝑐=𝑐𝜃). Thus, in this case

𝑇(𝑟,𝑓)=12π∫02π𝑁(𝑟,ei𝜃,𝑓)d𝜃+log|𝑐|

Otherwise, 𝑐𝜃=𝑓(0)−ei𝜃 unless this quantity is 0 (cancels), which can happen for at most one 𝜃 value, which is negligible when integrated. Thus by (14.2.2)(14.2.2)(14.2.2),

12π∫02πlog|𝑐𝜃|d𝜃=12π∫02πlog|𝑓(0)−ei𝜃|d𝜃={log+|𝑐|if𝑓(0)≠0,0otherwise.□

Theorem 14.2.3.

For (non-constant) meromorphic 𝑓 in 𝐷(0,𝑅), 𝑇(𝑟,𝑓) is a non-decreasing convex (not necessarily strictly convex) function of log𝑟 (for 0<𝑟<𝑅).
Proof.

Applying d/dlog𝑟 to Theorem 14.2.2Theorem 14.2.2Theorem 14.2.2, we have

d𝑇(𝑟,𝑓)dlog𝑟=12πddlog𝑟∫02π𝑁(𝑟,ei𝜃,𝑓)d𝜃=12π∫02π[𝑛(𝑟,ei𝜃,𝑓)−𝑛(0,ei𝜃,𝑓)𝑟d𝑟dlog𝑟+𝑛(0,ei𝜃,𝑓)]d𝜃=12π∫02π𝑛(𝑟,ei𝜃,𝑓)d𝜃≥0
by Lebesgue’s Dominated Convergence Theorem. Because the counting function 𝑛 is non-decreasing in 𝑟, it is also non-decreasing in log𝑟. ⁠□

Theorem 14.2.4 (First Fundamental Theorem of Nevanlinna Theory).

Let 𝑓 be (non-constant) meromorphic on 𝐷(0,𝑅) where 0<𝑟≤∞. Then for any 𝑎∈ℂ,

𝑇(𝑟,𝑎,𝑓)=𝑇(𝑟,𝑓)−log|𝑐|+𝜀(𝑟,𝑎,𝑓),
where |𝜀(𝑟,𝑎,𝑓)|≤log+|𝑎|+log2 for 0<𝑟<𝑅 and 𝑐 is the first nonzero coefficient of the innermost Laurent series expansion of 𝑓(𝑧)−𝑎 about the origin.
Proof.

Since for 𝑧∈𝜕𝐷(0,𝑟), by the properties of log+ as in Proposition 14.1.2Proposition 14.1.2Proposition 14.1.2,

log+|𝑓(𝑧)−𝑎|≤log+(|𝑓(𝑧)|+|𝑎|)≤log2+log+|𝑓(𝑧)|+log+|𝑎|.

Integrating over 𝜕𝐷(0,𝑟) implies

𝑚(𝑟,𝑓−𝑎)≤log2+𝑚(𝑟,𝑓)+log+|𝑎|.

From

log+|𝑓(𝑧)|≤log+(|𝑓(𝑧)−𝑎|+|𝑎|)≤log2+log+|𝑓(𝑧)−𝑎|+log+|𝑎|,

we obtain

𝑚(𝑟,𝑓)≤log2+𝑚(𝑟,𝑓−𝑎)+log+|𝑎|.

Letting 𝜀(𝑟,𝑎,𝑓)=𝑚(𝑟,𝑓−𝑎)−𝑚(𝑟,𝑓), the two proximity-related inequalities give

|𝜀(𝑟,𝑎,𝑓)|≤log2+log+|𝑎|.

Then by Proposition 14.1.5Proposition 14.1.5Proposition 14.1.5, and the fact that the poles of 𝑓 match those of 𝑓−𝑎 (more importantly, 𝑁(𝑟,𝑓−𝑎)=𝑁(𝑟,𝑓)),

𝑇(𝑟,0,𝑓−𝑎)=𝑁(𝑟,0,𝑓−𝑎)+𝑚(𝑟,0,𝑓−𝑎)=𝑁(𝑟,𝑓−𝑎)+𝑚(𝑟,𝑓−𝑎)−log|𝑐|=𝑁(𝑟,𝑓)+𝑚(𝑟,𝑓−𝑎)−log|𝑐|=𝑁(𝑟,𝑓)+𝑚(𝑟,𝑓)+𝜀(𝑟,𝑎,𝑓)−log|𝑐|=𝑇(𝑟,𝑓)+𝜀(𝑟,𝑎,𝑓)−log|𝑐|.□

For 𝑅=∞, we have

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

which shows that 𝑇 is essentially independent of the choice of 𝑎, except for a bounded 𝒪︀(1) term. Thus, this motivates why 𝑇 is characteristic of 𝑓.

As we have seen before, it is often pedantic and somewhat annoying to account for cases where 𝑓(0) is either zero or infinity, which is a minor grievance in Nevanlinna theory. Expositions from [5] and [3] tend to leave out this tedious treatment. However, here we will make this distinction whenever necessary for completeness.

Corollary 14.2.4.1.

Let 𝑓 be (non-constant) meromorphic on 𝐷(0,𝑅). Then for 0<𝑟≤∞,

12π∫02π𝑚(𝑟,ei𝜃,𝑓)d𝜃≤log2.
Proof.

By the First Fundamental Theorem (Theorem 14.2.4Theorem 14.2.4Theorem 14.2.4), we have

𝑇(𝑟,𝑓)=𝑁(𝑟,ei𝜃,𝑓)+𝑚(𝑟,ei𝜃,𝑓)+log|𝑐𝜃|+𝜀(𝑟,ei𝜃,𝑓),

where |𝜀(𝑟,ei𝜃,𝑓)|≤log2 and 𝑐𝜃 is the first nonzero coefficient of the Laurent expansion for 𝑓−ei𝜃. Hence,

𝑇(𝑟,𝑓)=12π∫02π[𝑁(𝑟,ei𝜃,𝑓)+𝑚(𝑟,ei𝜃,𝑓)+log|𝑐𝜃|+𝜀(𝑟,ei𝜃,𝑓)]d𝜃.

By Theorem 14.2.2Theorem 14.2.2Theorem 14.2.2, we thus have

𝑇(𝑟,𝑓)=𝑇(𝑟,𝑓)−12π∫02πlog|𝑐𝜃|d𝜃+12π∫02π𝑚(𝑟,ei𝜃,𝑓)d𝜃+12π∫02πlog|𝑐𝜃|d𝜃+12π∫02π𝜀(𝑟,ei𝜃,𝑓)d𝜃.
This implies that ∫02π𝑚(𝑟,ei𝜃,𝑓)d𝜃=−∫02π𝜀(𝑟,ei𝜃,𝑓)d𝜃≤2πlog2.□

Remark.

Since 𝑚 is bounded in the integrated sense, if 𝑇 is generally large, then for most values, 𝑁 will be nearly equal to 𝑇.

Proposition 14.2.5.

Let 𝑓,𝑔 be meromorphic on 𝐷(0,𝑅) and suppose 𝑚∈ℕ. For any 0<𝑟<𝑅, the following properties hold:

  1. 𝑇(𝑟,𝑓𝑔)≤𝑇(𝑟,𝑓)+𝑇(𝑟,𝑔).
  2. 𝑇(𝑟,𝑓+𝑔)≤𝑇(𝑟,𝑓)+𝑇(𝑟,𝑔)+𝒪︀(1).
  3. 𝑇(𝑟,1𝑓)=𝑇(𝑟,𝑓)+𝒪︀(1).
  4. 𝑇(𝑟,𝑓𝑛)=𝑛𝑇(𝑟,𝑓).
Proof.

Since

𝑁(𝑟,𝑓𝑔),𝑁(𝑟,𝑓+𝑔)≤𝑁(𝑟,𝑓)+𝑁(𝑟,𝑔),

and by

log+|𝑓𝑔|≤log+|𝑓|+log+|𝑔|,log+|𝑓+𝑔|≤log2+log+|𝑓|+log+|𝑔|,

it follows that

𝑚(𝑟,𝑓𝑔)≤𝑚(𝑟,𝑓)+𝑚(𝑟,𝑔),𝑚(𝑟,𝑓+𝑔)≤𝑚(𝑟,𝑓)+𝑚(𝑟,𝑔)+𝒪︀(1),

and the conclusions of Part 1Part 1Part 1 and Part 2Part 2Part 2. Part 3Part 3Part 3 is a corollary of the First Fundamental Theorem (Theorem 14.2.4Theorem 14.2.4Theorem 14.2.4). Lastly, because a pole of 𝑓𝑛 has order 𝑛 times of that of 𝑓, it follows that 𝑁(𝑟,𝑓𝑛)=𝑛𝑁(𝑟,𝑓). If |𝑓|≥1, it follows that log+|𝑓𝑛|=𝑛log+|𝑓| exactly. If |𝑓|<1, log+|𝑓𝑛|=𝑛log+|𝑓|=0. Hence, 𝑚(𝑟,𝑓𝑛)=𝑛𝑚(𝑟,𝑓).

Adding the two quantities 𝑁 and 𝑚 together gives Part 4Part 4Part 4. ⁠□

We now provide some classical examples of the Nevanlinna characteristic:

  1. Let

    𝑓(𝑧)=𝑐𝑧𝑝+𝑎1𝑧𝑝−1+⋯+𝑎𝑝𝑧𝑞+𝑏1𝑧𝑞−1+⋯+𝑏𝑞,𝑐≠0

    be an arbitrary rational function in reduced form. If 𝑝>𝑞, then for sufficiently large 𝑟, 𝑓→∞ in every direction. This implies log+|1𝑓(𝑧)−𝑎|=0 for any complex 𝑎 and sufficiently large 𝑟 (|𝑧|>𝑟). This implies 𝑚(𝑟,𝑎,𝑓)=0. Additionally, the equation 𝑓(𝑧)=𝑎 has 𝑝 complex solutions by the Fundamental Theorem of Algebra (Theorem 3.3.1Theorem 3.3.1Theorem 3.3.1). Thus, for sufficiently large 𝑟 (𝑟>𝑟′), any |𝑧|>𝑟 has the property that 𝑛(𝑟,𝑎,𝑓)=𝑛(|𝑧|,𝑎,𝑓),

    𝑁(𝑟,𝑎,𝑓)=(∫0𝑟′+∫𝑟′𝑟)𝑛(𝑥,𝑎,𝑓)−𝑛(0,𝑎,𝑓)𝑥d𝑥+𝑛(0,𝑎,𝑓)log𝑟=𝒪︀(1)+(𝑛(𝑟′,𝑎,𝑓)−𝑛(0,𝑎,𝑓))(log𝑟−log(𝑟′))+𝑛(0,𝑎,𝑓)log𝑟=𝑝log𝑟+𝒪︀(1),𝑎≠∞.

    Hence,

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

    Similarly, 𝑇(𝑟,1𝑓)=𝑇(𝑟,𝑓)+𝒪︀(1) by a preceding result. It then follows that if 𝑝<𝑞,

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

    Lastly, the case where 𝑝=𝑞 (derived with 𝑎≠𝑐) is resolvable with

    𝑇(𝑟,𝑓)=𝑝log𝑟+𝒪︀(1)=𝑞log𝑟+𝒪︀(1).

    In all cases,

    𝑇(𝑟,𝑓)=𝑑log𝑟+𝒪︀(1),

    where 𝑑=max(𝑝,𝑞) is defined to be the degree of the rational function 𝑓.

    Unless 𝑓(∞)=𝑎, the proximity function vanishes for sufficiently large 𝑟. In this case, let 𝛼 be the multiplicity at which 𝑓 attains 𝑎 at 𝑧=∞. If 𝑎 is finite,

    𝑚(𝑟,𝑎,𝑓)=12π∫02πlog+|1(𝑟ei𝜃)−𝛼𝒪︀(1)|d𝜃=𝛼log𝑟+𝒪︀(1)𝑁(𝑟,𝑎,𝑓)=(𝑑−𝛼)log𝑟+𝒪︀(1).

    If 𝑓 has a pole of order 𝛼 at ∞, we have likewise that

    𝑚(𝑟,𝑎,𝑓)=𝛼log𝑟+𝒪︀(1),𝑁(𝑟,𝑎,𝑓)=(𝑑−𝛼)log𝑟+𝒪︀(1).
  2. Consider

    exp(𝑧)=exp(𝑟cos𝜃+i𝑟sin𝜃),𝑧=𝑟ei𝜃.

    By its entireness, 𝑁(𝑟,𝑓)=0 for any 𝑟>0, and the proximity is given by

    𝑚(𝑟,𝑓)=12π∫02πlog+|e𝑟ei𝜃|d𝜃=12π(∫0π2+∫3π22π)(𝑟cos𝜃)+d𝜃=𝑟π.

    Therefore,

    𝑇(𝑟)=𝑚(𝑟,𝑓)+𝑁(𝑟,𝑓)=𝑟π.

    Moreover, 𝑚(𝑟,0,𝑓)=𝑟π and 𝑁(𝑟,0,𝑓)=0, whereas for 𝑎∈ℂ∗, the solutions to e𝑧=𝑎 are in the form of 𝑧𝑘=𝑧0+2𝑘πi, where 𝑧0=𝑥0+i𝑦0. The condition |𝑧𝑘|≤𝑟 is equivalent to

    |𝑦0+2𝑘π|2+|𝑥0|2≤𝑟2⟹|𝑦0+2𝑘π|≤𝑟+𝒪︀(1).

    It follows that

    𝑛(𝑟,𝑎,𝑓)=𝑟π+𝒪︀(1)⟹𝑁(𝑟,𝑎,𝑓)=𝑟π+𝒪︀(1),𝑚(𝑟,𝑎,𝑓)=𝒪︀(1).