Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Nevanlinna's Second Main Theorem and Defects: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These computations make the normalisations of the companion page concrete. The exponential omits exactly the two sphere values 0 and ∞, and each nonzero value is attained at a simple arithmetic progression, so its characteristic is r/π+O(1), its deficiencies at 0 and ∞ equal 1, and every other deficiency and ramification index vanishes. For the sine the a-point sets split into two arithmetic progressions, double points at ±1 contribute ramification ε(±1,sin⁡)=12, and the combined defect sum is exactly 2, meeting the defect relation.

The power map zd separates full from reduced counting: N(r,0;zd)=dlog⁡r against Nˉ(r,0;zd)=log⁡r and N1(r,0;zd)=(d−1)log⁡r. Sharpness is exhibited on both sides: the truncated Second Main Theorem has asymptotic equality for ez with the three targets {0,∞,a}, while ez and e−z share four sphere values without being equal, so five shared values are needed for the uniqueness theorem. A lacunary power series with super-exponential exponents — the Hayman counterexample — shows that the finite-measure exceptional set in the logarithmic-derivative lemma cannot be removed, since m0(r,f′/f) is not O(log⁡+T(r,f)+log⁡r) along a sequence of lacunary radii.

The final example gives a normal-family proof of the local Great Picard theorem through the three-value exterior extension lemma.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Exponential omits two sphere values

Example

Assume Countable Choice. The entire function f(z)=ez omits the value 0 and, viewed as a meromorphic map into the Riemann sphere, also omits ∞. Every nonzero finite value a is attained exactly at the simple points b+2πik, k∈Z, where b is any fixed logarithm of a. Thus 0 and ∞ are exactly the two sphere values omitted by f.

Facts & Assumptions

Given: The entire function f(z)=ez; Countable Choice is assumed as in the statement.

[F1]

For every sphere target a, m(r,a;f)+N(r,a;f)=T(r,f)+C(f,a), with C(f,∞)=0 and C(f,a) as in the exact centre-constant form of the First Main Theorem (Nevanlinna’s First Main Theorem with exact centre constant).

[F3]

ker⁡(exp⁡)=2πiZ and ez=ew exactly when z−w∈2πiZ (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ).

[F4]

The complex exponential maps C onto C∖{0} (The complex exponential maps C onto C∖{0}).

Verification

technique · identify the image of the exponential directly and translate the two omitted targets and the attained targets into the counting and proximity terms of the First Main Theorem
1.1F2given

By [F2] the function f is entire, so as a meromorphic sphere map it has no poles: f(z)≠∞ for every z, i.e. f omits ∞; and ∣f(z)∣=eRe⁡z>0, so f omits 0.

1.2F3F4algebra

Let a∈C∖{0} and let b be a logarithm of a, so eb=a by [F4]. For z∈C, by [F3], ez=a holds if and only if ez−b=1, if and only if z−b∈2πiZ, if and only if z=b+2πik for some k∈Z. Hence the preimage of every nonzero finite value is exactly this arithmetic progression in b.

2.1F2step 1.2algebra

At a point z=b+2πik the derivative is f′(z)=ez=a≠0 by [F2] and step 1.2; therefore f−a has a simple zero there, that is, the value a is attained only with multiplicity one.

3.1F1step 1.1step 1.2step 2.1

Combining steps 1.1, 1.2 and 2.1: the two sphere values 0 and ∞ are omitted, and no other sphere value is omitted. In the notation of [F1], for a=0,∞ the counting function N(r,a;f) vanishes identically and the whole characteristic sits in the proximity term, m(r,a;f)=T(r,f)+C(f,a); the corresponding deficiency-one computation is carried out in the companion example on this page devoted to deficiencies of elementary functions.

4.1F1given∎

The argument is choice-free: the only choices made are the fixed logarithm b of a and the integer enumeration of the progression, both of which are data of the example. Countable Choice is carried only because the surrounding Nevanlinna quantities and their exceptional-set interface are stated under it.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-10-02Open item page →

Deficiencies of the exponential and sine

Example

Assume Countable Choice.

  1. For the entire function f(z)=ez one has T(r,f)=rπ+O(1),δ(0,f)=δ(∞,f)=1,δ(a,f)=0 for every a∈C∖{0}. In fact all ramification indices of ez vanish.
  2. For f(z)=sin⁡z one has T(r,f)=2r/π+o(r), in fact T(r,f)=2r/π+O(1), and δ(∞,f)=1 while every finite deficiency vanishes; moreover ε(1,f)=ε(−1,f)=12 and all other ramification indices vanish. Consequently the combined defect sum of sine is ∑a(δ(a,f)+ε(a,f))=2, meeting the general bound of the defect relation.

Facts & Assumptions

Given: The exponential f(z)=ez and the sine f(z)=sin⁡z; Countable Choice is assumed as in the statement, and the computations below are choice-free.

[F1]

Counting and characteristic: N(r,a;h)=n(0,a;h)log⁡r+∫0rn(t,a;h)−n(0,a;h)tdt is the centre-regularized integrated count, T(r,h)=m(r,∞;h)+N(r,∞;h) with the chordal proximity, and an entire h has N(r,∞;h)=0 (Counting, chordal proximity and characteristic).

[F2]

Truncated counts: N(r,a;h)=Nˉ(r,a;h)+N1(r,a;h), where nˉ counts each a-point once and N1 weights each point by its local degree minus one (Truncated value and ramification counts).

[F3]

Deficiency and ramification index: δ(a,h)=lim inf⁡rm(r,a;h)T(r,h)=1−lim sup⁡rN(r,a;h)T(r,h) and ε(a,h)=lim inf⁡rN1(r,a;h)T(r,h), both in [0,1]; if h omits a then δ(a,h)=1; the total deficiency sum over the sphere is the supremum of its finite subsums (Nevanlinna deficiency and ramification index).

[F4]

Defect relation: for every nonconstant meromorphic h on C, ∑a(δ(a,h)+ε(a,h))≤2 (Nevanlinna deficiency and ramification defect relations).

[F6]

Quadratic proximity comparison: with m0(r,h)=12π∫02πlog⁡+∣h(reit)∣dt the standard proximity and δ(w,∞)=1/1+∣w∣2 the chordal distance to infinity, one has log⁡+∣w∣≤12log⁡(1+∣w∣2)≤log⁡+∣w∣+12log⁡2 for every w, hence m0(r,h)≤m(r,∞;h)≤m0(r,h)+12log⁡2 for every meromorphic h (Counting, chordal proximity and characteristic).

[F7]

Complex sine and cosine: sin⁡z=exp⁡(iz)−exp⁡(−iz)2i and cos⁡z=exp⁡(iz)+exp⁡(−iz)2; both are entire, sin⁡′=cos⁡ and cos⁡′=−sin⁡ (Complex sine, cosine, hyperbolic sine, and hyperbolic cosine from the complex exponential, Complex sine, cosine, hyperbolic sine, and hyperbolic cosine are entire with their standard derivatives).

[F10]

Fundamental theorem of algebra: every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra by Liouville's theorem).

Verification

technique · compute the characteristic and counting functions of the two explicit entire functions, read off the deficiencies and ramification indices from the definitions, and add the nonzero contributions to obtain the defect sums
1.1F1F5F6algebra

(Exponential: characteristic) By [F1] and [F6], for the entire function ez one has m0(r,ez)≤T(r,ez)≤m0(r,ez)+12log⁡2. For z=reit the modulus formula [F5] gives log⁡+∣ez∣=max⁡(0,rcos⁡t)=rcos⁡+t, and ∫02πcos⁡+t dt=∫−π/2π/2cos⁡t dt=2, so m0(r,ez)=r2π⋅2=rπ. Hence T(r,ez)=rπ+O(1).

1.2F2F5algebra

(Exponential: a-point counts) By [F5] the kernel of the exponential is 2πiZ and every nonzero value is attained, so for fixed a≠0 and a logarithm b of a the a-points of ez are exactly the points b+2πik, k∈Z, and they are simple because (ez)′=ez≠0 there. The number of k∈Z with ∣b+2πik∣≤t is tπ+O(1) for large t: writing b=u+iv, the condition is ∣v+2πk∣≤t2−u2, a nonempty integer interval of length tπ+O(1). Therefore n(t,a;ez)=tπ+O(1) and N(r,a;ez)=Nˉ(r,a;ez)=rπ+O(log⁡r) with N1(r,a;ez)=0.

1.3F5F6F7F9algebra

(Sine: characteristic) By [F7] sine is entire, so [F6] gives m0(r,sin⁡)≤T(r,sin⁡)≤m0(r,sin⁡)+12log⁡2. For z=reit the definition [F7] and the modulus formula [F5] give ∣sin⁡z∣≤12(e∣Im⁡z∣+e−∣Im⁡z∣)≤e∣Im⁡z∣=er∣sin⁡t∣, so log⁡+∣sin⁡z∣≤r∣sin⁡t∣ and m0(r,sin⁡)≤r2π∫02π∣sin⁡t∣ dt=2rπ by [F7]. Conversely, ∣sin⁡z∣≥12(e∣Im⁡z∣−e−∣Im⁡z∣)≥14er∣sin⁡t∣ whenever r∣sin⁡t∣≥1, so log⁡+∣sin⁡z∣≥r∣sin⁡t∣−log⁡4 on that set, and since the integrand is nonnegative everywhere, m0(r,sin⁡)≥12π∫02π(r∣sin⁡t∣−log⁡4) dt=2rπ−log⁡4. Hence T(r,sin⁡)=2rπ+O(1).

1.4F5F7F10algebra

(Sine: reduction to a quadratic) Fix a∈C; putting w=eiz, one has sin⁡z=a if and only if w2−2iaw−1=0, because eiz≠0 and multiplying w−w−12i=a by 2iw is reversible. If q(w)=w2−2iaw−1 has a double root w, then w=ia and w2=−1, forcing a2=1; so for a≠±1 the polynomial q has two distinct roots w1,w2, and q(0)=−1 shows both are nonzero. By [F7] a root w1≠0 exists, and w2:=−1/w1 is a second root, since w12−2iaw1−1=0 gives q(−1/w1)=w1−2(1+2iaw1−w12)=0.

1.5F8F7algebra

(Sine: simplicity away from ±1) At a solution of sin⁡z=a with w=eiz one has cos⁡z=w+w−12=w2+12w by [F7], which vanishes exactly when w=±i by [F7]; then sin⁡z=w−w−12i equals 1 for w=i and −1 for w=−i. Hence for a≠±1 no a-point has cos⁡z=0, and since sin⁡′=cos⁡ by [F7] every a-point is simple.

2.1F1F3F5step 1.1step 1.2

(Exponential: deficiencies) Since ez is entire, N(r,∞;ez)=0 and [F3] gives δ(∞,ez)=1; since ez≠0 for all z the value 0 is omitted and [F3] gives δ(0,ez)=1; for 0≠a∈C step 1.2 gives N(r,a;ez)T(r,ez)→1, hence δ(a,ez)=1−lim sup⁡rN(r,a;ez)T(r,ez)=0.

2.2F2F3step 1.2

(Exponential: ramification indices) For finite a≠0 all a-points of ez are simple by step 1.2, so N1(r,a;ez)=0 and ε(a,ez)=0; for a=0 the counting function is identically zero, so ε(0,ez)=0; and N1(r,∞;ez)=0 because ez has no poles, so ε(∞,ez)=0.

2.3F5step 1.4algebra

(Sine: the a-point progressions) With wj≠0 as in step 1.4, fix bj with ebj=wj by [F5]; then eiz=wj if and only if iz−bj∈2πiZ, that is, z∈−ibj+2πZ by [F5]. Hence for a≠±1 the solutions of sin⁡z=a are exactly the two disjoint arithmetic progressions −ib1+2πZ and −ib2+2πZ.

2.4F1F2F7F8step 1.4algebra

(Sine: the values ±1) For a=1 the quadratic of step 1.4 is q(w)=(w−i)2, so sin⁡z=1 if and only if eiz=i, that is, z∈π2+2πZ; at these points cos⁡z=0 by [F7] and sin⁡′′=−sin⁡=−1≠0 by [F7], so each is a double point: n(t,1;sin⁡)=2tπ+O(1) with multiplicity and nˉ(t,1;sin⁡)=tπ+O(1), whence N(r,1;sin⁡)=2rπ+O(log⁡r), Nˉ(r,1;sin⁡)=rπ+O(log⁡r) and N1(r,1;sin⁡)=rπ+O(log⁡r). The same computation with −i and the progression −π2+2πZ gives the analogous statements for a=−1.

3.1F1F2step 2.3step 1.5algebra

(Sine: counting for a≠±1) For a fixed c∈C, the number of k∈Z with ∣c+2πik∣≤t is tπ+O(1) as t→∞: the condition is ∣2πk+Im⁡c∣≤t2−(Re⁡c)2, an integer interval of length tπ+O(1). The two disjoint progressions of step 2.3 therefore give n(t,a;sin⁡)=2tπ+O(1), and by step 1.5 all a-points are simple, so N(r,a;sin⁡)=Nˉ(r,a;sin⁡)=2rπ+O(log⁡r) and N1(r,a;sin⁡)=0.

4.1F2F3step 1.3step 3.1step 2.4

(Sine: deficiencies and ramification indices) Since sine is entire, N(r,∞;sin⁡)=0, so δ(∞,sin⁡)=1 by [F3]. For every finite a, steps 3.1 and 2.4 give N(r,a;sin⁡)T(r,sin⁡)→1 because T(r,sin⁡)=2rπ+O(1) by step 1.3, so δ(a,sin⁡)=1−lim sup⁡rNT=0. For a∉{1,−1} step 3.1 gives N1(r,a;sin⁡)=0, so ε(a,sin⁡)=0, including a=0; and ε(∞,sin⁡)=0 because the N1-count at ∞ vanishes for an entire function; while for a=±1 step 2.4 gives N1(r,a;sin⁡)T(r,sin⁡)→r/π2r/π=12, so ε(1,sin⁡)=ε(−1,sin⁡)=12.

5.1F3F4step 4.1algebra

(Sine: combined defect sum) By step 4.1 the only nonzero terms of the total deficiency sum of [F3] are δ(∞,sin⁡)=1, ε(1,sin⁡)=12 and ε(−1,sin⁡)=12; the supremum of finite subsums is therefore 1+12+12=2, so the combined defect sum of sine equals 2, in agreement with the general upper bound of [F4].

6.1F3F4step 2.1step 2.2algebra∎

(Exponential: combined defect sum) For ez steps 2.1 and 2.2 give the only nonzero terms δ(0,ez)=δ(∞,ez)=1, so its combined defect sum is 2 as well, again with equality in the bound of [F4].

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-10-02Open item page →

Full and truncated counting differ for a power map

Example

Let d≥2 be an integer, f(z)=zd and r>1. Then N(r,0;f)=dlog⁡r,Nˉ(r,0;f)=log⁡r,N1(r,0;f)=(d−1)log⁡r, while T(r,f)=dlog⁡r+O(1). In particular the full count strictly exceeds the truncated count, and N=Nˉ+N1 holds with every term explicit.

Facts & Assumptions

Given: An integer d≥2, the function f(z)=zd and a radius r>1.

[F1]

Counting conventions: n(t,0;f) is the multiplicity of the zero of f in ∣z∣≤t, and N(r,0;f)=n(0,0;f)log⁡r+∫0rn(t,0;f)−n(0,0;f)tdt (Counting, chordal proximity and characteristic).

[F2]

Truncated counts: nˉ(t,0;f) counts the distinct zeros once, n1(t,0;f) weights each zero by local degree minus one, and Nˉ, N1 use the same centre-regularized integral as N; moreover N=Nˉ+N1 (Truncated value and ramification counts).

[F3]

For a rational function of degree d≥1, T(r,f)=dlog⁡r+O(1) (Rational functions are exactly those with logarithmic characteristic).

Verification

technique · read the three centre-regularized counts directly from the unique zero at the origin and compare with the rational degree formula
1.1givenalgebra

The function f(z)=zd has exactly one zero, at z=0, of order d. Hence for every t≥0: n(t,0;f)=d, nˉ(t,0;f)=1 and n1(t,0;f)=d−1.

2.1F1step 1.1algebra

Centre regularisation of the first count: n(0,0;f)=d, so N(r,0;f)=dlog⁡r+∫0rd−dtdt=dlog⁡r for every r>0.

2.2F2step 1.1algebra

For the truncated counts the centre values are 1 and d−1 respectively, so Nˉ(r,0;f)=1⋅log⁡r+∫0r1−1tdt=log⁡r and N1(r,0;f)=(d−1)log⁡r.

3.1F2step 2.1step 2.2algebra

Consistency: dlog⁡r=log⁡r+(d−1)log⁡r, in agreement with N=Nˉ+N1; and N(r,0;f)=dlog⁡r>log⁡r=Nˉ(r,0;f) because d≥2 and log⁡r>0.

4.1F3step 2.1step 2.2algebra∎

The rational degree of zd is d, so [F3] gives T(r,f)=dlog⁡r+O(1); thus T=N(r,0;f)+O(1) while the truncated count is smaller by (d−1)log⁡r. The truncated count omits the weight (d−1)log⁡r of the multiple zero. Replacing the full count by the truncated count in the First Main Theorem therefore changes its equality by this unbounded term. In a Second Main Theorem inequality with truncated counts on the right, replacing them by the larger full counts preserves the inequality but gives a weaker bound.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-10-02Open item page →

Exceptional radii cannot be removed from the logarithmic-derivative estimate

Statement refuted

Assume Countable Choice. There exists an entire function f of infinite order, together with radii rn→∞, such that m0(rn,f′/f)≠O(log⁡+T(rn,f)+log⁡rn), i.e. the quotient of m0(rn,f′/f) by log⁡+T(rn,f)+log⁡rn is unbounded along rn. Thus the exceptional-radius set in the lemma on the logarithmic derivative cannot simply be erased and replaced by an estimate valid at every radius.

Facts & Assumptions

Given: Countable Choice is assumed as in the statement.

[F1]

The standard proximity is m0(r,g)=12π∫02πlog⁡+∣g(reit)∣dt, while T(r,g)=m(r,∞;g)+N(r,∞;g) uses chordal proximity. For entire g, N(r,∞;g)=0 and m0(r,g)≤T(r,g)≤m0(r,g)+12log⁡2 by the chordal comparison (Counting, chordal proximity and characteristic, Elementary characteristic laws and fixed rational composition). Also m0(r,f′/f)=12π∫02πlog⁡+∣f′(reit)/f(reit)∣dt is the standard proximity in the logarithmic-derivative lemma (Nevanlinna exceptional-radius error notation).

[F2]

Weierstrass test: a series of functions that is dominated on every compact set by a convergent numerical series converges locally uniformly (Weierstrass M-test for complex-valued function series).

Counterexample

technique · build the Hayman lacunary series $\sum_n(z/r_n)^{\lambda_n}$ with super-exponentially growing exponents, estimate it from above and its derivative from below on the lacunary circles, and compare the standard proximity of $f'/f$ with the characteristic of $f$
1.1constructalgebra

Set rn:=2n−1 and define integers λ1:=2, λn+1:=4nλn2nλn+n+1 for n≥1. Then λn is strictly increasing with λn>n and λn≥2n, and λn+1≥4nλn2nλn≥16nλn for every n.

2.1step 1.1algebra

Consequences for ν≥2: log⁡λν≥log⁡(4(ν−1)λν−1)+(ν−1)λν−1log⁡2≥(ν−1)λν−1log⁡2, and λν−1→∞, so log⁡λν/ν→∞ and log⁡λν/λν−1→∞. Hence ν=o(log⁡λν), log⁡ν=o(log⁡λν) and λν−1=o(log⁡λν).

2.2F2F3step 1.1construct

Define coefficients aj:=rn−λn when j=λn for some n, and aj:=0 otherwise; strict increase of λn makes this unambiguous. On ∣z∣≤R, all but finitely many nonzero terms of ∑j≥0ajzj are bounded by 2−λn, and ∑n2−λn<∞. Thus [F2] gives absolute uniform convergence on every such disc; the power series has infinite radius and its nonzero terms, in increasing degree order, are precisely f(z):=∑n≥1(z/rn)λn. By [F3], f is entire and f′(z)=∑n≥1λnrn(z/rn)λn−1; this is the differentiated power series with zero coefficients omitted. Its coefficient of z2 is r1−2=1, so f is nonconstant.

3.1F1step 1.1step 2.2algebra

(Upper bound on lacunary circles) For ν≥2 and ∣z∣=rν, the n-th term of f has modulus 2(ν−n)λn for n<ν, modulus 1 for n=ν, and modulus 2−(n−ν)λn for n>ν. In the first block each modulus is at most 2λν−1: for n≤ν−2 one has (ν−n)λn≤(ν−1)λν−2≤λν−1 by step 1.1, while n=ν−1 gives exponent λν−1 exactly. Hence the first block is at most (ν−1)2λν−1, and the tail is at most ∑m≥12−m=1. So ∣f(z)∣≤(ν−1)2λν−1+2 and m0(rν,f)≤log⁡((ν−1)2λν−1+2)≤λν−1log⁡2+log⁡(2(ν−1)).

3.2F1step 1.1step 2.1step 2.2algebra

(Lower bound for the derivative) For ν≥2 and ∣z∣=rν: the ν-th term of f′ has modulus λν/rν; the earlier terms satisfy ∑n<νλnrn(rνrn)λn−1=1rν∑n<νλn2(ν−n)λn≤(ν−1)λν−12(ν−1)λν−1rν≤λν4rν by step 1.1; and the later terms satisfy ∑n>νλnrn(rνrn)λn−1=1rν∑m≥1λν+m2−mλν+m≤2rν because λν+m≥2 makes each summand at most 2−m. Hence ∣f′(z)∣≥1rν(λν−λν4−2)≥λν2rν for all ν, so m0(rν,f′)≥log⁡λν−log⁡2−(ν−1)log⁡2≥12log⁡λν for all large ν by step 2.1.

4.1F1step 2.1step 3.1step 3.2algebra

(Standard proximity of the quotient) For finite complex u,v≠0 one has log⁡+∣u/v∣≥log⁡+∣u∣−log⁡+∣v∣; taking angular means gives m0(rν,f′/f)≥m0(rν,f′)−m0(rν,f)≥12log⁡λν−λν−1log⁡2−log⁡(2(ν−1))≥13log⁡λν for all large ν, by step 2.1.

4.2F1step 2.1step 3.1algebra

(Comparison scale) By step 3.1 and [F1], log⁡+T(rν,f)+log⁡rν=O(λν−1+ν+log⁡ν)=o(log⁡λν) by step 2.1.

4.3F1step 1.1step 2.1step 2.2algebra

(Infinite order) At ∣z∣=rν+1=2rν the ν-th term of f equals 2λν, the terms with n<ν sum to at most 2λν−1 by step 1.1 (each of the ν−1 terms has exponent (ν+1−n)λn≤2λν−1, and (ν−1)22λν−1≤2λν−1 because λν−1≥2λν−1+log⁡2(ν−1) whenever λν≥16(ν−1)λν−1 and λν−1≥2ν−1), and the terms with n>ν sum to at most 2 as in step 3.1. Hence ∣f∣≥2λν−1−2≥2λν−2 on that circle, so m0(rν+1,f)≥(λν−2)log⁡2 and [F1] gives T(rν+1,f)≥m0(rν+1,f). By step 2.1, log⁡λν/ν→∞; since log⁡rν+1=νlog⁡2, this gives log⁡T(rν+1,f)/log⁡rν+1→∞, so f has infinite order.

5.1step 4.1step 4.2algebra

Combining steps 4.1 and 4.2, m0(rν,f′/f)log⁡+T(rν,f)+log⁡rν≥log⁡λν/3o(log⁡λν)→∞ along rν→∞; hence m0(rν,f′/f) is not O(log⁡+T(rν,f)+log⁡rν).

6.1givendischarge-construct∎

The construction is explicit: the exponents are given by a closed recursion, the radii are rν=2ν−1, and no selection beyond the displayed formulas occurs. Countable Choice is carried only as in the statement.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-10-02Open item page →

The coefficient q minus two is sharp

Example

Assume Countable Choice. Let f(z)=ez and fix the three distinct sphere targets 0,∞,a, where a∈C∖{0}. Then T(r,f)=rπ+O(1),Nˉ(r,a;f)=rπ+O(log⁡r). Consequently the truncated Second Main Theorem with q=3, (q−2)T(r,f)≤∑j=1qNˉ(r,aj;f)+S(r,f), holds here with both sides of the same leading term r/π: it is asymptotically an equality, and its coefficient q−2 cannot be increased.

Facts & Assumptions

Given: f(z)=ez, a fixed nonzero finite value a, and the three distinct targets 0,∞,a; Countable Choice is assumed as in the statement (The Axiom of Countable Choice (ACω)).

[F1]

Counting and characteristic: m(r,∞;f)=12π∫02πlog⁡1δ(f(reit),∞)dt=12π∫02π12log⁡(1+∣f(reit)∣2)dt, T(r,f)=m(r,∞;f)+N(r,∞;f), and Nˉ(r,b;f) is the centre-regularized integral of the number of distinct b-points (Counting, chordal proximity and characteristic).

[F2]

The exponential: 0 and ∞ are omitted by ez; for every nonzero finite a and any fixed logarithm b of a, the a-points are exactly b+2πik, k∈Z, and each of them is simple (Exponential omits two sphere values).

[F3]

Truncated Second Main Theorem: for nonconstant meromorphic h on C and distinct sphere targets b1,…,bq, q≥3, (q−2)T(r,h)≤∑jNˉ(r,bj;h)+S(r,h) outside a set of finite linear measure, where S(r,h)≤C(log⁡+T(r,h)+log⁡r) off that set (Nevanlinna Second Main Theorem with ramification and truncation).

Verification

technique · compute the characteristic and the counting function of the exponential directly, apply the truncated Second Main Theorem with three targets, and compare leading terms to see that the coefficient cannot be raised
1.1F1algebra

(Characteristic) Since ez is entire, N(r,∞;f)=0 and T(r,f)=m(r,∞;f)=12π∫02π12log⁡(1+e2rcos⁡t)dt by [F1] and ∣ereit∣=ercos⁡t. On cos⁡t>0 one has 12log⁡(1+e2rcos⁡t)=rcos⁡t+O(e−2rcos⁡t), and on cos⁡t≤0 the integrand is bounded by 12log⁡2; integrating over the half circle cos⁡t>0 whose measure is π gives m(r,∞;f)=rπ+O(1), hence T(r,f)=rπ+O(1).

1.2F1F2algebra

(Counting the a-points) Fix a logarithm b of a, so that by [F2] the a-points are the simple points b+2πik, k∈Z. Hence n(t,a;f)=#{k∈Z:∣b+2πik∣≤t}=tπ+O(1) for all large t: writing b=u+iv, the condition is ∣v+2πk∣≤t2−u2, an interval for k of length t/π+O(1), so the count differs from t/π by O(1). Since every a-point is simple, Nˉ(r,a;f)=N(r,a;f)=n(0,a;f)log⁡r+∫0rn(t,a;f)−n(0,a;f)tdt=rπ+O(log⁡r).

2.1F3step 1.1step 1.2algebra

(Truncated Second Main Theorem with three targets) The targets 0,∞,a are distinct sphere values, and 0 and ∞ are omitted by [F2], so Nˉ(r,0;f)=Nˉ(r,∞;f)=0. By [F3] with q=3, for all large r outside a set E of finite linear measure, T(r,f)≤Nˉ(r,a;f)+S(r,f) with S(r,f)≤C(log⁡+T(r,f)+log⁡r)≤C′log⁡r outside E, because T(r,f)=rπ+O(1) is O(r).

3.1step 1.1step 1.2step 2.1algebra∎

(Asymptotic equality and sharpness) By steps 1.1 and 1.2, for r∉E the right side of the q=3 inequality is rπ+O(log⁡r) while the left side is rπ+O(1); both sides therefore have the same leading term r/π, so the inequality is asymptotically an equality for these three targets. If the coefficient could be increased, there would be a constant c>1 such that c T(r,f)≤∑jNˉ(r,aj;f)+S(r,f) for the same three targets and all large r outside a finite-measure set; steps 1.1 and 1.2 would then give crπ+O(1)≤rπ+O(log⁡r), that is (c−1)rπ=O(log⁡r), which is impossible as r→∞. Hence the coefficient q−2 cannot be increased.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-10-02Open item page →

A normal-family proof of Great Picard

Example

Let f be meromorphic on 0<∣z−z0∣<r∗ with an isolated essential singularity at z0. The exterior three-value extension lemma rules out three sphere values omitted on any punctured neighbourhood of z0. Consequently every sphere value is attained infinitely often in every punctured neighbourhood, with at most two exceptions. If f is holomorphic there, at most one finite value is exceptional.

Facts & Assumptions

Given: Such a punctured-disc meromorphic function f.

[F1]

If a meromorphic function G on ∣w∣>R omits three fixed distinct sphere values on ∣w∣>R1 for some R1>R, then G extends meromorphically across infinity (Three omitted values force exterior extension).

Verification

technique · invert the puncture and apply the three-value extension lemma
1.1F1givendischarge-contradiction

Suppose three distinct sphere values are omitted on 0<∣z−z0∣<ρ for some 0<ρ<r∗. The function G(w):=f(z0+ρ/w) is meromorphic on ∣w∣>1 and omits the same three values there. By [F1] with R=1 and R1=2, it extends meromorphically across infinity; inversion then extends f meromorphically across z0, contrary to essentiality.

2.1step 1.1choosecases

If three distinct values each occurred only finitely often in some punctured neighbourhood, take a radius inside all three neighbourhoods and then shrink it below the distance to the finitely many preimages there. If the combined preimage set is empty, any smaller radius works. The three values would all be omitted on the smaller punctured disc, contrary to step 1.1. Hence at most two sphere values are exceptional.

3.1step 2.1algebra∎

If f is holomorphic on the punctured disc, it omits ∞, so step 2.1 leaves at most one exceptional finite value.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Four shared values do not force equality

Example

Assume Countable Choice. The distinct nonconstant entire functions F(z)=ez and G(z)=e−z share exactly the four distinct sphere values 0,∞,1,−1 ignoring multiplicity: both omit 0 and ∞, and their preimage sets of 1 and of −1 agree, {z:ez=1}={z:e−z=1}=2πiZ,{z:ez=−1}={z:e−z=−1}=iπ(2Z+1). No other sphere value is shared. Since F≠G, the five distinct shared values required by the five-value uniqueness theorem Nevanlinna five-value uniqueness theorem cannot be reduced to four.

Facts & Assumptions

Given: The functions F(z)=ez and G(z)=e−z; Countable Choice is assumed as in the statement, and the computation below is choice-free.

[F1]

Five-value theorem: if two nonconstant meromorphic functions on C share five distinct sphere values ignoring multiplicity, that is, the preimage sets of each value agree, then they are identically equal (Nevanlinna five-value uniqueness theorem).

[F2]

Fibres of the exponential: ker⁡(exp⁡)=2πiZ, and ez=ew exactly when z−w∈2πiZ; moreover eiπ=−1 (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ).

[F4]

The complex exponential maps C onto C∖{0} (The complex exponential maps C onto C∖{0}).

[F5]

Sharing ignoring multiplicity concerns the sets of points only: nˉ counts each preimage once and multiplicities are discarded (Truncated value and ramification counts), exactly the convention in the statement of [F1].

Verification

technique · compute the four preimage sets that the two exponentials have in common, verify that no further value is shared, and observe that the functions are distinct
1.1F3F5

(Omitted values) By [F3] both F and G are entire and never vanish; hence the preimage set of 0 is empty for both, and the preimage set of ∞, that is, the pole set, is empty for both as well. Thus 0 and ∞ are shared values in the sense of [F5] with empty preimage sets.

1.2F2algebra

(The value 1) By [F2], ez=1 if and only if z∈2πiZ; and e−z=1 if and only if −z∈2πiZ, which is the same set. Hence the two 1-point sets agree and equal 2πiZ.

1.3F2algebra

(The value −1) By [F2] and eiπ=−1, ez=−1 if and only if z−iπ∈2πiZ, that is, z∈iπ(2Z+1); and e−z=−1 if and only if −z∈iπ(2Z+1), that is, z∈iπ(2Z+1) as well, because −iπ(2k+1)=iπ(2(−k−1)+1). Hence the two (−1)-point sets agree.

1.4F2algebra

(Distinctness) If F=G then e=e−1, hence e2=1=e0, so by [F2] the number 2 would lie in 2πiZ; but 2 is real and nonzero while every element of 2πiZ is purely imaginary. Thus F≠G.

1.5F2F4algebra

(No other shared value) Let a∈C^∖{0,∞,1,−1} be a shared value in the sense of [F5]. Since a≠0,∞ we may fix b with eb=a by [F4]; the preimage sets of a under F and G are b+2πiZ and −b+2πiZ by [F2], and agreement forces b∈−b+2πiZ, hence 2b∈2πiZ; then a2=e2b=1 by [F2], so a=±1, contrary to the choice of a. Hence the shared sphere values of F and G are exactly 0,∞,1,−1, four in number.

2.1F1step 1.1step 1.2step 1.3step 1.4step 1.5∎

(Sharpness) Steps 1.1-1.5 exhibit two distinct nonconstant meromorphic functions sharing exactly four distinct sphere values ignoring multiplicity, while [F1] guarantees equality as soon as five distinct values are shared. Therefore the number five in the five-value theorem is optimal.

Sources