Notes on Complex Analysis
Export PDFGitHub

§14.5.2 Functions Sharing Values

14.5.2 Functions Sharing Values

In Nevanlinna’s explanation of the various applications of the Second Fundamental Theorem, he proved:

Theorem 14.5.2.1 (Nevanlinna’s Five-Value Theorem).

Let 𝑓1,𝑓2 be two meromorphic, admissible functions on 𝐷(0,𝑅0) (𝑅0<∞). For each 𝑎∈ℂ̂, let 𝐸1(𝑎)={𝑧:𝑓1(𝑧)=𝑎}, 𝐸2(𝑎)={𝑧:𝑓2(𝑧)=𝑎}. Then if 𝐸1(𝑎)≡𝐸2(𝑎) for at least five different values1 of 𝑎∈ℂ̂, then 𝑓1≡𝑓2.

If 𝑓1,𝑓2 are two merely meromorphic (not necessarily admissible) functions on ℂ and if 𝐸1(𝑎)≡𝐸2(𝑎) for at least five different values of 𝑎∈ℂ̂, then either 𝑓1≡𝑓2 everywhere or they are both constant.

Proof.

Assume that five values 𝑎1 to 𝑎5 exist for which 𝐸1(𝑎1)=𝐸2(𝑎1),…,𝐸1(𝑎5)=𝐸2(𝑎5). Without loss of generality, assume they are finite (otherwise a Möbius transformation can be utilized to map a value outside these five to the infinity point).

Because

𝑁‾(𝑟,𝑎𝜈,𝑓1)=𝑁‾(𝑟,𝑎𝜈,𝑓2)

for 𝜈=1,…,5, 0<𝑟<𝑅0, quantify this value by 𝑁𝜈(𝑟). We now assume that 𝑓1∉≡𝑓2. Now each shared value corresponds to an infinity of Ψ=1/(𝑓2−𝑓1).

Now assuming that 𝑓1, 𝑓2 are not identically equal, we have

∑𝜈=15𝑁𝜈(𝑟)≤𝑁(𝑟,Ψ)≤𝑇(𝑟,Ψ)=𝑇(𝑟,𝑓2−𝑓1)+𝒪︀(1)≤𝑇(𝑟,𝑓1)+𝑇(𝑟,𝑓2)+𝒪︀(1)

trivially by the First Fundamental Theorem (Theorem 14.2.4Theorem 14.2.4Theorem 14.2.4) and the properties of the characteristic. Applying (14.5.1.1)(14.5.1.1)(14.5.1.1) gives

4𝑇(𝑟,𝑓𝑗)−𝑆(𝑟,𝑓𝑗)≤𝑁‾(𝑟,𝑓𝑗)+∑𝜈=15𝑁𝜈(𝑟)−𝑁0(𝑟,0,𝑓𝑗′)𝑗=1,2,3𝑇(𝑟,𝑓𝑗)≤𝑆(𝑟,𝑓𝑗)+∑𝜈=15𝑁𝜈(𝑟).

Summing this inequality for both values of 𝑗 and applying the upper bound gives

𝑇(𝑟,𝑓1)+𝑇(𝑟,𝑓2)≤13[𝑆(𝑟,𝑓1)+𝑆(𝑟,𝑓2)]+23∑𝜈=15𝑁𝜈(𝑟)≤13[𝑆(𝑟,𝑓1)+𝑆(𝑟,𝑓2)]+23[𝑇(𝑟,𝑓1)+𝑇(𝑟,𝑓2)]+𝒪︀(1).

If 𝑅0<∞, then outside a set 𝐸0 of logarithmic measure not exceeding 4, or ∫𝐸0d𝑟𝑅0−𝑟≤4, by the Second Fundamental Theorem estimates (Theorem 14.4.1.5Theorem 14.4.1.5Theorem 14.4.1.5) and the fact that log+𝑇(𝑟,𝑓)=ℴ︀(𝑇(𝑟,𝑓)),

(1−ℴ︀(1))[𝑇(𝑟,𝑓1)+𝑇(𝑟,𝑓2)]≤𝒪︀(log1𝑅0−𝑟)⟹lim sup𝑟→𝑅0−𝑟∉𝐸0𝑇(𝑟,𝑓𝑗)log1𝑅0−𝑟=𝒪︀(1).

We now aim to extend this outside of 𝐸0.

For any 𝑟∗∈𝐸0, let 𝑟′∈{𝑟𝑛} be the infimum of values exceeding 𝑟∗ not in 𝐸0. If 𝑟∗=𝑟′, then arbitrarily close to 𝑟∗, there are points for which the limit superior assertion holds. By continuity, this holds at 𝑟∗ as well.

Hence, assume 𝑟′>𝑟∗. Then [𝑟∗,𝑟𝑛)⊆𝐸0, we must have ∫𝑟∗𝑟𝑛d𝑟𝑅0−𝑟=log(𝑅0−𝑟∗𝑅0−𝑟′)≤4, so log(1𝑅0−𝑟∗)≥log(1𝑅0−𝑟′)−4. Since log(1𝑅0−𝑟) is continuous and non-vanishing for 𝑟 sufficiently close to 𝑅0 and 𝑇 is non-decreasing,

𝑇(𝑟∗,𝑓𝑗)log1𝑅0−𝑟∗≤𝑇(𝑟′,𝑓𝑗)log1𝑅0−𝑟′(1+4log1𝑅0−𝑟′−4)=𝒪︀(𝑇(𝑟′,𝑓𝑗)log1𝑅0−𝑟′).

This shows that

lim sup𝑟→𝑅0−𝑇(𝑟,𝑓𝑗)log1𝑅0−𝑟=𝒪︀(1),

which contradicts the admissibility of 𝑓𝑗. Hence, our original assumption that 𝑓1≢𝑓2 is false, completing the first statement of the theorem.

On the other hand, if 𝑅0=∞, then outside a set 𝐸0 of linear measure not exceeding 4, by the Second Fundamental Theorem estimates (Theorem 14.4.1.5Theorem 14.4.1.5Theorem 14.4.1.5), 𝑆(𝑟,𝑓𝑗)=ℴ︀(𝑇(𝑟,𝑓𝑗)), and thus

𝑇(𝑟,𝑓1)+𝑇(𝑟,𝑓2)≤ℴ︀(𝑇(𝑟,𝑓1))+ℴ︀(𝑇(𝑟,𝑓2))+𝒪︀(1)⟹𝑇(𝑟,𝑓1)+𝑇(𝑟,𝑓2)=𝒪︀(1).

Then 𝑓1,𝑓2 are constant, or the assumption that 𝑓1≢𝑓2 was false. This concludes the theorem. ⁠□

Remark.

The functions 𝑓1:𝑧↦exp(𝑧) and 𝑓2:𝑧↦exp(−𝑧) imply that five cannot be sharpened to four. Indeed,

𝐸1(0)=𝐸2(0)=⌀=𝐸1(∞)=𝐸2(∞),
𝐸1(1)=𝐸2(1)={2πi𝑘}𝑘∈ℤ,

and

𝐸1(−1)=𝐸2(−1)={2πi𝑘+πi}𝑘∈ℤ.
It can be verified algebraically that 0, ∞, 1, −1 are the only “shared” values; the first two are omitted values while any solution must satisfy e2𝑧=1, which corresponds to points where exp attains 1 and −1.

The recent developments of Nevanlinna has generalized preexisting results to more arbitrary domains such as annuli. A generalization of the Five-Value theorem on annuli is given in [6].

Further results on Nevanlinna theory, such as the value distribution of derivatives, the Ahlfors’ theory, and the proofs of the theorems given at the end of Section 8Section 8Section 8, we refer to [5].

  1. 1The compared sets are allowed to be empty (in this case both functions omit 𝑎), and we do not consider the multiplicities at each potential solution. For instance, for 𝑓1(𝑧)=𝑧 and 𝑓1(𝑧)=𝑧2, 0 is a shared value.