§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).
If and has finite order, then Let () be meromorphic and non-constant. Define as in (14.4.1). Then
as through all values.- If and has infinite order, then holds as through all values of outside a set of finite linear measure.
If , then
as outside a set satisfying
Moreover, for any such that (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 . Let
for each . It follows that
Proof.
Let . Performing a substitution of , we have , where .
Because the exponential is periodic every , we may assume that is restricted to instead of . The expression gives at most two symmetric solutions (let ).
Evidently, for or ,
so it follows that , and furthermore, all lie in by the geometry of a circle. Since , assuming that , it follows that
Since for , it follows that . Moreover, is an increasing function of ; thus we may replace all instances of with , proving the lemma.
Lemma 14.4.1.2.
Let be (possibly indistinct) complex numbers. Define . It follows that for any ,
Proof.
Define the set
and let . For , , implying that . Define
so that for in the prescribed range, we have
Since , by virtue of Lemma 14.4.1.1 for ,
For , for each we have and thus . It follows that
Combining (14.4.1.1), (14.4.1.2) gives the desired result. Proposition 14.4.1.3.
If is meromorphic on , then for , letting be the first nonzero coefficient of the innermost Laurent expansion of about the origin,
Proof.
By the Poisson–Jensen Formula (Theorem 4.4.4.3), letting , for each non-singular point ,
where and are the respective zeros and poles in the disk. By (4.4.4.4), we have for all holomorphic . Applying this with differentiation under the integral sign, we have that
Define
Evidently the number of zeros and poles is given by
Since
it follows that
and additionally,
Furthermore,
by Part 4 of Proposition 14.1.2. Combining (14.4.1.3), (14.4.1.4), (14.4.1.5), we have
By Proposition 14.1.5, we have , where is the first nonzero coefficient of the innermost Laurent expansion of about the origin. It follows that and , thus
and
By the subadditive properties of Proposition 14.1.2, we have
Integrating on with Lemma 14.4.1.2 gives
To derive a more useful estimate for , we note that
Thus,
Using the subadditivity properties (as with earlier), we have
Substituting this into (14.4.1.6), and using we have that (recognizing )
since (Theorem 14.2.3). This proves the proposition. Lemma 14.4.1.4 (Borel).
Let be an increasing, continuous function satisfying on all of its domain (where ).
If , for outside a set whose linear measure does not exceed 2 (satisfying with respect to the Lebesgue measure1),
If , then satisfying such that for ,
Moreover, for any such that (implying that ), such that .
Proof.
We observe the two cases separately.
Assume . Then define , and
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
, and𝑟 𝑛 ≥ 𝑟 𝑛 − 1 ′ > 𝑟 𝑛 − 1 .𝑟 𝑛 − 𝑟 𝑛 − 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)𝑛 must be satisfied throughout each(14.4.1.10) (14.4.1.7) . Indeed, if there exists some value within this interval for which (14.4.1.7)( 𝑟 𝑛 − 1 ′ , 𝑟 𝑛 ) fails, then(14.4.1.10) (14.4.1.7) , 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:
∫ 𝐸 0 d 𝑟 ≤ ∑ 𝑛 = 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,
, implying that𝑇 ( 𝑟 𝑛 ) ≥ 2 𝑛 𝑇 ( 𝑟 0 ) 𝑟 𝑛 ′ − 𝑟 𝑛 = 1 𝑇 ( 𝑟 𝑛 ) ≤ 1 2 𝑛 𝑇 ( 𝑟 0 ) ∑ 𝑛 = 0 𝑁 ( 𝑟 𝑛 ′ − 𝑟 𝑛 ) ≤ 1 𝑇 ( 𝑟 0 ) ∑ 𝑛 = 0 ∞ 1 2 𝑛 = 2 𝑇 ( 𝑟 0 ) ≤ 2 . Suppose
in the theorem statement. Let𝑅 0 < ∞ , where𝑇 0 ( 𝜌 ) = 𝑇 ( 𝑅 0 − e − 𝜌 ) , so that𝜌 0 = log 1 𝑅 0 − 𝑟 0 ≤ 𝜌 < ∞ is an increasing function on𝑇 0 . By the result above,[ 𝜌 0 , ∞ ) such that∃ 𝐸 0 ′ ⊆ [ 𝜌 0 , ∞ ) ∫ 𝐸 0 ′ d 𝜌 ≤ 2 , 𝑇 0 ( 𝜌 + 1 𝑇 0 ( 𝜌 ) ) < 2 𝑇 0 ( 𝜌 ) ∀ 𝜌 ∉ 𝐸 0 ′ . Substitute
,𝜌 = log 1 𝑅 0 − 𝑟 ,𝑟 = 𝑅 0 − e − 𝜌 , so that𝐸 0 = ( 𝜌 ↦ 𝑅 0 − e − 𝜌 ) ( 𝐸 0 ′ ) , and𝑇 0 ( 𝜌 ) = 𝑇 ( 𝑟 ) ∫ 𝐸 0 d 𝑟 𝑅 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)
. For(14.4.1.11) (14.4.1.8) ,𝑥 ∈ ( 0 , 1 ) e − 𝑥 < 1 − e − 1 e 𝑥 < 1 − 𝑥 e , thus for
within𝑟 outside[ 𝑟 0 , 𝑅 0 ) , we have from𝐸 0 . Hence,e − 1 𝑇 ( 𝑟 ) < 1 − 1 e 𝑇 ( 𝑟 ) 𝑇 ( 𝑅 0 − ( 𝑅 0 − 𝑟 ) e − 1 𝑇 ( 𝑟 ) ) ≥ 𝑇 ( 𝑅 0 − ( 𝑅 0 − 𝑟 ) ( 1 − 1 e 𝑇 ( 𝑟 ) ) ) = 𝑇 ( 𝑟 + 𝑅 0 − 𝑟 e 𝑇 ( 𝑟 ) ) . If
are chosen such that𝜌 , 𝜌 ′ , then𝑅 0 − 𝜌 ′ < e − 2 ( 𝑅 0 − 𝜌 ) Since∫ 𝜌 𝜌 ′ d 𝑟 𝑅 0 − 𝑟 = log ( 𝑅 0 − 𝜌 𝑅 0 − 𝜌 ′ ) > log ( e 2 ) = 2 . , there then∫ 𝐸 0 d 𝑟 𝑟 0 − 𝑟 ≤ 2 . Thus,( 𝜌 , 𝜌 ′ ) ⊂ . ≠ 𝐸 0 such that∃ 𝑟 ∈ ( 𝜌 , 𝜌 ′ ) .𝑟 ∉ 𝐸 0 □
Theorem 14.4.1.5 (Second Fundamental Theorem of Nevanlinna Theory, Part 2).
If
and𝑅 0 = ∞ has finite order, then Let𝑓 (𝑓 : 𝐷 ( 0 , 𝑅 0 ) → ℂ ̂ ) be meromorphic and non-constant. Define0 < 𝑅 0 ≤ ∞ as in (14.4.1)𝑆 ( 𝑟 , 𝑓 ) . Then(14.4.1) (14.4.1) as𝑆 ( 𝑟 , 𝑓 ) = 𝒪︀ ( log 𝑇 ( 𝑟 , 𝑓 ) ) + 𝒪︀ ( log 𝑟 ) ( † ) through all values.𝑟 → ∞ - If
and𝑅 0 = ∞ has infinite order, then𝑓 holds as( † ) through all values of𝑟 → ∞ outside a set𝑟 of finite linear measure.𝐸 If
, then𝑅 0 < ∞ 𝑆 ( 𝑟 , 𝑓 ) = 𝒪︀ ( log + 𝑇 ( 𝑟 , 𝑓 ) + log 1 𝑅 0 − 𝑟 ) ( ‡ ) as
outside a set𝑟 → 𝑅 0 − satisfying𝐸 Moreover, for any∫ 𝐸 d 𝑟 𝑅 0 − 𝑟 < ∞ . such that𝜌 , 𝜌 ′ ∈ ( 0 , 𝑅 0 ) (implying that𝑅 0 − 𝜌 ′ < e − 2 ( 𝑅 0 − 𝜌 ) ),𝜌 < 𝜌 ′ such that∃ 𝑟 ∈ ( 𝜌 , 𝜌 ′ ) .𝑟 ∉ 𝐸
Proof.
As a function of
where
by Proposition 14.2.5
Since
Then
Now assume
By Lemma 14.4.1.4
thus for
Lastly, assume that
where the
Therefore,
Proposition 14.4.1.6.
IfProof.
We must have (for any
Thus,
Then
then
Then
where
By letting
Definition 14.4.1.7.
Let
and𝑅 0 = ∞ is non-constant.𝑓 and𝑅 0 < ∞ .lim sup 𝑟 → 𝑅 0 − 𝑇 ( 𝑟 , 𝑓 ) log 1 𝑅 0 − 𝑟 = ∞
These definitions ensure that
Theorem 14.4.1.8.
An admissible meromorphic function
- If
and𝑅 0 = ∞ has finite order, then𝑓 for𝑆 ( 𝑟 , 𝑓 ) = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) through all values.𝑟 → 𝑅 0 − - If
and𝑅 0 = ∞ has infinite order, then𝑓 for𝑆 ( 𝑟 , 𝑓 ) = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) outside a set𝑟 → 𝑅 0 − of finite linear measure, which depends on𝐸 0 but not on𝑓 and{ 𝑎 𝜈 } .𝑞 - If
, then𝑅 0 < ∞ for𝑆 ( 𝑟 , 𝑓 ) = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) through any sequence𝑟 → 𝑅 0 − dependent on{ 𝑟 𝑛 } 𝑛 but not on𝑓 and{ 𝑎 𝜈 } .𝑞
Proof.
Assume the conditions of the theorem.
Assume
and𝑅 0 = ∞ has finite order. Then𝑓 ,𝑇 ( 𝑟 , 𝑓 ) = 𝒪︀ ( 𝑟 𝜌 + 𝜀 ) (assuming that𝑟 𝜌 − 𝜀 = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) ), so𝜌 > 0 . Therefore, by Theorem 14.4.1.5log 𝑟 = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) , it follows that through all values asTheorem 14.4.1.5 Theorem 14.4.1.5 ,𝑟 → ∞ 𝑆 ( 𝑟 , 𝑓 ) = 𝒪︀ ( log 𝑇 ( 𝑟 , 𝑓 ) ) + 𝒪︀ ( log 𝑟 ) = 𝒪︀ ( log 𝑇 ( 𝑟 , 𝑓 ) ) = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) . If
, either𝜌 = 0 orlog 𝑟 = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) . The former case is the same as above.𝑇 ( 𝑟 , 𝑓 ) = 𝒪︀ ( log 𝑟 ) In the latter case, Proposition 14.4.1.6
gives thatProposition 14.4.1.6 Proposition 14.4.1.6 is rational. Hence, as𝑓 ,𝑟 → ∞ . Hence for sufficiently large𝑀 ( 𝑟 , 𝑓 ′ 𝑓 ) , 𝑀 ( 𝑟 , ∑ 𝜈 = 1 𝑞 𝑓 ′ 𝑓 − 𝑎 𝜈 ) → 0 ,𝑟 and𝑚 ( 𝑟 , 𝑓 ′ 𝑓 ) vanish and𝑚 ( 𝑟 , ∑ 𝜈 = 1 𝑞 𝑓 ′ 𝑓 − 𝑎 𝜈 ) , therefore𝑆 ( 𝑟 , 𝑓 ) = 𝒪︀ ( 1 ) .𝑆 𝑇 → 0 - Assume
and𝑅 0 = ∞ has infinite order. Then by Theorem 14.4.1.5𝑓 , it follows that forTheorem 14.4.1.5 Theorem 14.4.1.5 outside a set𝑟 → 𝑅 0 − of finite linear measure,𝐸 0 . Since𝑆 ( 𝑟 , 𝑓 ) = 𝒪︀ ( log 𝑇 ( 𝑟 , 𝑓 ) ) + 𝒪︀ ( log 𝑟 ) , thenlog 𝑇 ( 𝑟 , 𝑓 ) log 𝑟 → ∞ , and thuslog 𝑟 = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) outside this exceptional set.𝑆 ( 𝑟 , 𝑓 ) = ℴ︀ ( 𝑇 ( 𝑟 , 𝑓 ) ) Assume
. Construct two sequences𝑅 0 < ∞ such that{ 𝜌 𝑛 } 𝑛 , { 𝜌 𝑛 ′ } 𝑛 ,𝜌 𝑛 < 𝜌 𝑛 ′ , and𝜌 𝑛 , 𝜌 𝑛 ′ → 𝑅 0 − lim 𝑛 → ∞ 𝑇 ( 𝜌 𝑛 , 𝑓 ) log 1 𝑅 0 − 𝜌 𝑛 = ∞ (observe that this is no longer a limit superior) and
, so that𝜌 𝑛 ′ = 𝑅 0 − e − 2 𝑅 0 − 𝜌 𝑛 2 .𝑅 0 − 𝜌 𝑛 ′ < e − 2 ( 𝑅 0 − 𝜌 𝑛 ) Then by Theorem 14.4.1.5
, there exists someTheorem 14.4.1.5 Theorem 14.4.1.5 such that𝑟 𝑛 ∈ ( 𝜌 𝑛 , 𝜌 𝑛 ′ ) . It follows that𝑟 𝑛 ∉ 𝐸 0 . Then for𝑅 0 − 𝜌 𝑛 > 𝑅 0 − 𝑟 𝑛 > 𝑅 0 − 𝜌 𝑛 ′ = 𝑅 0 − 𝜌 𝑛 2 e 2 ,𝑛 → ∞ 1 𝑅 0 − 𝜌 𝑛 = ℴ︀ ( 𝑇 ( 𝜌 𝑛 ) ) = ℴ︀ ( 𝑇 ( 𝑟 𝑛 ) ) , since
is a non-decreasing function of radius. Then as𝑇 ,𝑛 → ∞ 𝑆 ( 𝑟 𝑛 , 𝑓 ) = 𝒪︀ [ log + 𝑇 ( 𝑟 𝑛 , 𝑓 ) + log ℴ︀ ( 𝑇 ( 𝑟 𝑛 , 𝑓 ) ) ] = ℴ︀ ( 𝑇 ( 𝑟 𝑛 , 𝑓 ) ) . □