Notes on Complex Analysis
Export PDFGitHub

§14.1 Nevanlinna’s Counting, Proximity, and Characteristic Functions

14.1 Nevanlinna’s Counting, Proximity, and Characteristic Functions

Let 𝑓:𝐷(0,𝑅)→ℂ̂ be meromorphic with a Laurent expansion

𝑓(𝑧)=∑𝑗=𝑘∞𝑐𝑗𝑧𝑗

where 𝑐=𝑐𝑘 and 𝑐≠0, such that the annulus of convergence has an inner radius of 0 (we effectively take the innermost expansion). Then 𝑧↦𝑓(𝑧)/𝑧𝑘 is holomorphic on a neighborhood of 0 and is nonzero at 0. By Jensen’s formula (Theorem 4.4.4.2Theorem 4.4.4.2Theorem 4.4.4.2) on 𝑓(𝑧)/𝑧𝑘,

log|𝑟𝑚−𝑛𝑏1𝑏2⋯𝑏𝑛𝑎1𝑎2⋯𝑎𝑚|+𝑘log𝑟=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃−log|𝑐|,(14.1.1)

where 𝑎1,…,𝑎𝑚 and 𝑏1,…,𝑏𝑛 are the zeros and poles of 𝑓 in 𝐷(0,𝑟)‾⊂𝐷(0,𝑅) excluding those at 0, ordered in non-decreasing moduli. Observe that

log|𝑟𝑚𝑎1𝑎2⋯𝑎𝑚|=log|𝑎2𝑎1(𝑎3𝑎2)2⋯(𝑎𝑚𝑎𝑚−1)𝑚−1(𝑟𝑎𝑚)𝑚|=(∑𝑗=1𝑚−1𝑗∫|𝑎𝑗||𝑎𝑗+1|+𝑚∫|𝑎𝑚|𝑟)d𝑥𝑥.

For any 𝑗∈ℕ and 𝑥 such that |𝑎𝑗|≤𝑥<|𝑎𝑗+1|, the number of zeros (multiplicities counted) of 𝑓 within 𝐷(0,𝑥)‾, denoted 𝑛(𝑥,0,𝑓), is trivially equal to 𝑛(𝑥,0,𝑓)=𝑗+𝑘 if 𝑘>0, since the zero at 0 has multiplicity 𝑘 and the other zeros in 𝐷(0,𝑥)‾ are 𝑎1,…,𝑎𝑗; thus,

log|𝑟𝑚𝑎1𝑎2⋯𝑎𝑚|={∫0𝑟𝑛(𝑥,0,𝑓)−𝑘𝑥d𝑥if𝑘>0∫0𝑟𝑛(𝑥,0,𝑓)𝑥d𝑥otherwise

In either case, this quantity is given by

log|𝑟𝑚𝑎1𝑎2⋯𝑎𝑚|=∫0𝑟𝑛(𝑥,0,𝑓)−𝑛(0,0,𝑓)𝑥d𝑥.

Letting 𝑛(𝑥,∞,𝑓) denote the number of poles, counting orders, in 𝐷(0,𝑥)‾, we obtain similarly

log|𝑟𝑛𝑏1𝑏2⋯𝑏𝑛|=∫0𝑟𝑛(𝑥,∞,𝑓)−𝑛(0,∞,𝑓)𝑥d𝑥.

Definition 14.1.1.

For 𝑎∈ℂ̂, define the Nevanlinna counting function by

𝑁(𝑟,𝑎,𝑓)=∫0𝑟𝑛(𝑥,𝑎,𝑓)−𝑛(0,𝑎,𝑓)𝑥d𝑥+𝑛(0,𝑎,𝑓)log𝑟,

where 𝑛(𝑥,𝑎,𝑓) counts the number of times 𝑓 attains 𝑎 in 𝐷(0,𝑥)‾, counting orders (multiplicities of zeros of 𝑓−𝑎, or poles of 𝑓 if 𝑎=∞). In the event that 𝑎 is elided, assume 𝑎=∞.

Then (14.1.1)(14.1.1)(14.1.1) is simply

𝑁(𝑟,0,𝑓)−𝑁(𝑟,∞,𝑓)=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃−log|𝑐|.(14.1.2)

Define the nonnegative part of the logarithm, denoted log+(𝑥), to be

log+(𝑥)=max{log(𝑥),0}.

Proposition 14.1.2 (Properties of log+).

The following properties hold:

  1. log+𝑥≥log𝑥 for 𝑥>0.
  2. log+𝑥≤log+𝑦 for 𝑥≤𝑦 (non-decreasing).
  3. log𝑥=log+𝑥−log+(1𝑥) for 𝑥>0.
  4. |log𝑥|=log+𝑥+log+(1𝑥) for 𝑥>0.
  5. log+∏𝑘𝑥𝑘≤∑𝑘log+𝑥𝑘 for (finitely many) positive 𝑥𝑘.
  6. log+∑𝑘=1𝑛𝑥𝑘≤log𝑛+∑𝑘=1𝑛log+𝑥𝑘 for (finitely many) positive 𝑥𝑘.
Proof.

The first five properties are trivial. We now prove Part 6Part 6Part 6. Observing that 𝑥𝑘≤elog+𝑥𝑘, it follows that

log+∑𝑘=1𝑛𝑥𝑘≤log+∑𝑘=1𝑛elog+𝑥𝑘≤log+𝑛+log+(emax𝑘log+𝑥𝑘)=log𝑛+max𝑘log+𝑥𝑘.

The last step uses the fact that log+ is simply log when the argument ≥1. ⁠□

Definition 14.1.3.

For 𝑟>0, 𝑎∈ℂ, define the Nevanlinna proximity function by

𝑚(𝑟,𝑎,𝑓)=12π∫02πlog+|1𝑓(𝑟ei𝜃)−𝑎|d𝜃

and

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

in the infinite case. Observe that 𝑚(𝑟,𝑎,𝑓)=𝑚(𝑟,1𝑓−𝑎).

Since

log+|𝑓(𝑟ei𝜃)|−log+|1𝑓(𝑟ei𝜃)|=log|𝑓(𝑟ei𝜃)|.

this implies

𝑚(𝑟,∞,𝑓)−𝑚(𝑟,0,𝑓)=12π∫02πlog|𝑓(𝑟ei𝜃)|d𝜃.

Then (14.1.2)(14.1.2)(14.1.2) can be written as:

𝑁(𝑟,0,𝑓)+𝑚(𝑟,0,𝑓)=𝑁(𝑟,∞,𝑓)+𝑚(𝑟,∞,𝑓)−log|𝑐|.(14.1.3)

Definition 14.1.4.

This motivates the sum 𝑇(𝑟,𝑓), known as the Nevanlinna characteristic, defined by 𝑇(𝑟,𝑓)=𝑚(𝑟,𝑓)+𝑁(𝑟,𝑓) (we will also use the notation 𝑇(𝑟,𝑎,𝑓)=𝑚(𝑟,𝑎,𝑓)+𝑁(𝑟,𝑎,𝑓)).

Then (14.1.3)(14.1.3)(14.1.3) can be rewritten as:

Proposition 14.1.5.

For any (non-constant) meromorphic 𝑓 on 𝐷(0,𝑅) with the innermost Laurent series 𝑓(𝑧)=∑𝑗=𝑘∞𝑐𝑗𝑧𝑗 and any 0<𝑟<𝑅,

𝑇(𝑟,0,𝑓)=𝑇(𝑟,∞,𝑓)−log|𝑐𝑘|.