Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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 Second Main Theorem with ramification and truncation

Statement

Assume Countable Choice. Let f be a nonconstant meromorphic function on C and let a1,…,aq be distinct sphere values with q≥3. Then, outside a set of finite linear measure, ∑j=1qm(r,aj;f)+N1(r,f)≤2T(r,f)+S(r,f), equivalently (q−2)T(r,f)≤∑j=1qN(r,aj;f)−N1(r,f)+S(r,f), and consequently (q−2)T(r,f)≤∑j=1qNˉ(r,aj;f)+S(r,f). If f has finite order, the error terms are Of(log⁡r) for every sufficiently large r without exception; if f is rational, they are Of(1) for every sufficiently large r.

Facts & Assumptions

Given: A nonconstant meromorphic f on C, distinct sphere values a1,…,aq with q≥3; Countable Choice is assumed.

[F1]

The proximity m(r,a;g) is the mean of log⁡1δ(g(reit),a), the standard proximity 12π∫02πlog⁡+∣g∣dt differs from m(r,∞;g) by at most 12log⁡2, and T=m(⋅,∞)+N(⋅,∞); N is the centre-regularized count (Counting, chordal proximity and characteristic, Nevanlinna exceptional-radius error notation).

[F2]

First Main Theorem: m(r,a;g)+N(r,a;g)=T(r,g)+C(g,a) with a constant independent of r (Nevanlinna’s First Main Theorem with exact centre constant).

[F3]

Characteristic laws: T(r,gh)≤T(r,g)+T(r,h)+O(1), T(r,g+h)≤T(r,g)+T(r,h)+O(1), T(r,1/h)=T(r,h)+Oh(1) as r→∞ (Elementary characteristic laws and fixed rational composition).

[F4]

Logarithmic-derivative lemma: m0(r,g′/g)=S(r,g) for nonconstant meromorphic g, with Og(log⁡r) at all large radii when g has finite order and Og(1) at all large radii when g is rational; the chordal proximity obeys the same bounds (The lemma on the logarithmic derivative).

[F5]

Ramification identity: N1(r,g)=N(r,0;g′)+2N(r,∞;g)−N(r,∞;g′) for every r>0, and for every finite set of distinct targets A, ∑a∈AN1(r,a;g)≤N1(r,g) when r≥1 (Ramification count from the derivative divisor).

[F6]

N(r,a;g)=Nˉ(r,a;g)+N1(r,a;g), with 0≤N1(r,a;g)≤N(r,a;g) for r≥1 (Truncated value and ramification counts).

[F7]

S(r,g) denotes a term bounded off a set of finite linear measure by C(log⁡+T(r,g)+log⁡r), with C and the threshold belonging to the occurrence; finitely many occurrences may share the union of their exceptional sets (Nevanlinna exceptional-radius error notation).

Proof

technique · separate the targets by a Möbius substitution, dominate the proximity sum by the proximity of $H=\sum_j1/(f-a_j)$, estimate $H$ through the logarithmic derivatives $f'/(f-a_j)$, and convert the derivative counts into $N_1$ by the ramification identity
1.1choosealgebra

(Reduction to finite targets) Among the q+1 distinct sphere points 0,1,…,q at most q belong to {a1,…,aq}; let m be the least one that does not, so m≠∞, and put g:=1/(f−m). Then g is nonconstant meromorphic. For finite aj set aj′:=1/(aj−m), and for aj=∞ set aj′:=0; these are distinct finite values.

1.2F1F6algebra

(Local computation for the substitution) The Möbius map w↦1/(w−m) has local degree one on the sphere, so composition preserves every local degree and ramification multiplicity of f. For each finite target aj, the identity g−aj′=aj−f(f−m)(aj−m) shows that a zero of g−aj′ occurs exactly at f=aj with the same order. If aj=∞, then aj′=0 and g=1/(f−m) has a zero of order t exactly where f has a pole of order t. Thus the target counting functions agree, N(r,aj′;g)=N(r,aj;f) for every sphere target, and the preserved ramification multiplicities give N1(r,g)=N1(r,f).

1.3F1constructalgebra

(Finite-target setup) Henceforth a1,…,aq are finite and distinct; put δ:=min⁡i<j∣ai−aj∣>0 and H:=∑j=1q1/(f−aj). For each fixed finite a, the chordal proximity m(r,a;f) differs from m0(r,1/(f−a)) by at most a constant depending on a: writing w=f−a, the ratio 1+∣w+a∣2/max⁡(1,∣w∣) is bounded above and below by positive constants depending only on a. Thus the finite number of conversions below contributes only Oa1,…,aq(1).

1.4choosealgebra

(Target separation) At every point z at most one index j satisfies ∣f(z)−aj∣<δ/2, since two such indices would give ∣ai−aj∣<δ; write uj:=1/(f(z)−aj) and M:=max⁡j∣uj∣=∣uj∗∣. If M≤max⁡{1,4(q−1)/δ}, then ∑jlog⁡+∣uj∣≤qlog⁡+max⁡{1,4(q−1)/δ}≤log⁡+∣H(z)∣+qlog⁡+(4(q−1)/δ). If M>max⁡{1,4(q−1)/δ}, then ∣f(z)−aj∗∣<δ/2, so ∣uj∣≤2/δ<M/2 for every j≠j∗, whence ∣H(z)∣≥M−∑j≠j∗∣uj∣>M/2 and ∑jlog⁡+∣uj∣≤log⁡M+(q−1)log⁡+(2/δ)≤log⁡+∣H(z)∣+log⁡2+(q−1)log⁡+(2/δ). In both cases ∑j=1qlog⁡+∣1f(z)−aj∣≤log⁡+∣H(z)∣+Cq,δ with Cq,δ:=log⁡2+max⁡{qlog⁡+(4(q−1)/δ), (q−1)log⁡+(2/δ)}.

1.5algebra

(Reduction to logarithmic derivatives) Since H=(f′H)⋅(1/f′) and f′H=∑jf′/(f−aj), the pointwise inequalities log⁡+∣uv∣≤log⁡+∣u∣+log⁡+∣v∣ and log⁡+∣∑j=1quj∣≤∑j=1qlog⁡+∣uj∣+log⁡q give m(r,∞;H)≤m(r,∞;1/f′)+∑j=1qm(r,∞;f′/(f−aj))+log⁡q for every r>0.

1.6F1F2F5algebra

(The term m(1/f′)+N1) Since f is nonconstant, f′≢0. If f′ is nonconstant, [F2] gives m(r,0;f′)=T(r,f′)−N(r,0;f′)+Of(1); if f′=c≠0 is constant, the same relation follows directly from the definitions, since N(r,0;f′)=0 and m(r,0;c)=T(r,c)−log⁡∣c∣. In either case [F5] and T(r,f′)=m(r,∞;f′)+N(r,∞;f′) give m(r,0;f′)+N1(r,f)=m(r,∞;f′)+2N(r,∞;f)+Of(1), using N1(r,f)=N(r,0;f′)+2N(r,∞;f)−N(r,∞;f′).

2.1F2F3step 1.2suffices

(Characteristic transfer) T(r,g)=T(r,1/(f−m))=T(r,f−m)+Of(1)=T(r,f)+Of(1) by [F3]; consequently by [F2], m(r,aj′;g)=T(r,g)−N(r,aj′;g)+C(g,aj′)=T(r,f)−N(r,aj;f)+Of(1)=m(r,aj;f)+Of(1), and the finite sum of Of(1) errors is absorbed into S(r,f) for all large r; hence it suffices to prove the inequalities for finite distinct targets.

2.2F1step 1.3step 1.4algebra

(Means) Taking angular means of step 1.4 and using the integrability of the logarithmic singularities and the finite-target comparison of step 1.3 gives ∑j=1qm(r,aj;f)≤m(r,∞;H)+Ca1,…,aq for every r>0.

3.1F4F7step 2.2step 1.5algebra

(Logarithmic derivative of the shifted functions) For each j the function f−aj is nonconstant meromorphic and (f−aj)′/(f−aj)=f′/(f−aj), so [F4] gives m(r,∞;f′/(f−aj))=S(r,f−aj); since T(r,f−aj)≤T(r,f)+Of(1) by [F3], we have S(r,f−aj)≤S(r,f)+Of(1), and likewise m(r,f′/f)=S(r,f); taking the union of the exceptional sets of these q+1 occurrences gives a set E of finite linear measure such that ∑j=1qm(r,aj;f)≤m(r,∞;1/f′)+q S(r,f)+Of(1) for every r∉E.

4.1F4step 3.1algebra

(Bounding m(f′)) The pointwise bound log⁡+∣f′∣≤log⁡+∣f∣+log⁡+∣f′/f∣ gives m(r,∞;f′)≤m(r,∞;f)+m(r,f′/f)≤m(r,∞;f)+S(r,f) for r∉E.

5.1step 3.1step 1.6step 4.1algebra

(Conclusion of the finite-target case) Combining steps 3.1, 1.6 and 4.1 for r∉E gives ∑jm(r,aj;f)+N1(r,f)≤m(r,∞;f)+2N(r,∞;f)+qS(r,f)+Of(1)=T(r,f)+N(r,∞;f)+qS(r,f)+Of(1)=2T(r,f)−m(r,∞;f)+qS(r,f)+Of(1)≤2T(r,f)+qS(r,f)+Of(1), and the constant is absorbed into the error term, so ∑j=1qm(r,aj;f)+N1(r,f)≤2T(r,f)+S(r,f) outside E.

6.1F2F5F6F7step 5.1algebra

(Equivalent forms) By [F2], ∑j=1qm(r,aj;f)=qT(r,f)−∑j=1qN(r,aj;f)+Of(1); substituting into step 5.1 and absorbing Of(1) yields (q−2)T(r,f)≤∑j=1qN(r,aj;f)−N1(r,f)+S(r,f) outside E. Conversely, rearranging this displayed bound using the same equality from [F2] recovers step 5.1 up to Of(1); [F7] absorbs that bounded term into an error of the same class, enlarging the finite-measure exceptional set if needed, so the first two displayed inequalities are equivalent. Moreover N(r,aj;f)=Nˉ(r,aj;f)+N1(r,aj;f) and ∑jN1(r,aj;f)≤N1(r,f) by [F5] and [F6], so ∑jN(r,aj;f)−N1(r,f)≤∑jNˉ(r,aj;f) and (q−2)T(r,f)≤∑j=1qNˉ(r,aj;f)+S(r,f) outside E.

7.1F2F3F4step 3.1step 6.1

(Refinements) If f has finite order then g=1/(f−m) and every f−aj have finite order with characteristics T(r,f)+Of(1), so the errors in step 3.1 are Of(log⁡r) at every large radius by [F4], and all other errors above are Of(1) by [F2] and [F3]; hence the inequalities hold with Of(log⁡r) at every sufficiently large r, with no exceptional set in this case. If f is rational the same argument gives Of(1) at every sufficiently large r, again with no exceptional set.

8.1step 1.1step 1.2step 2.1step 6.1step 7.1∎

(Unwinding) Applying the finite-target argument of steps 1.3–7.1 to the transform of step 1.1 and transferring back by steps 1.2 and 2.1 proves the three displayed inequalities for the original targets, including the case in which some aj equals ∞; the finite union E of the exceptional sets of the finitely many logarithmic-derivative applications still has finite linear measure, and all conversion constants are absorbed into S(r,f).

Depends on

Used by

Dependency tree · two levels

29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources