Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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 deficiency and ramification index

Definition

Let f be a nonconstant meromorphic function on C. For a sphere target a∈C^, the deficiency of a is δ(a,f):=lim inf⁡r→∞m(r,a;f)T(r,f)=1−lim sup⁡r→∞N(r,a;f)T(r,f), and the ramification index of a is ε(a,f):=lim inf⁡r→∞N1(r,a;f)T(r,f), with N1(r,a;f) the integrated ramification count at target a, weighting each a-point by its local degree minus one, as in Truncated value and ramification counts. Both indices are well-defined numbers in [0,1] (proved below).

For a set S⊆C^ of targets, the total deficiency sum is defined without choosing an enumeration by ∑a∈S(δ(a,f)+ε(a,f)):=sup⁡{∑a∈A(δ(a,f)+ε(a,f)):A⊆S, A finite}. For finite S this is the ordinary finite sum. No countability of S and no enumeration of S is assumed.

Facts & Assumptions

Given: A nonconstant meromorphic f on C and a sphere target a.

[F1]

m(r,a;f), N(r,a;f) and T(r,f) are finite for every r>0, T is nondecreasing, and T(r,f)>1 for all sufficiently large r (Counting, chordal proximity and characteristic).

[F2]

m(r,a;f)+N(r,a;f)=T(r,f)+C(f,a) with a constant C(f,a) independent of r; in particular m≥0 and N≤T+C(f,a) (Nevanlinna’s First Main Theorem with exact centre constant). Integrated counts are nonnegative for r≥1; their centre term can be negative when r<1.

[F3]

N(r,a;f)=Nˉ(r,a;f)+N1(r,a;f), and 0≤N1(r,a;f)≤N(r,a;f) for r≥1, with N1(r,a;f) the integrated count of a-points weighted by local degree minus one (Truncated value and ramification counts).

[F4]

If f is transcendental then T(r,f)/log⁡r→∞, and if f is rational of degree d≥1 then T(r,f)=dlog⁡r+O(1); in both cases T(r,f)→∞ (Transcendental characteristic dominates logarithmic growth).

Proof

technique · divide the First Main Theorem by $T$ and use that $T\to\infty$, then bound nonnegative numerators by $T$
1.1F4

T(r,f)→∞: this is [F4] in the transcendental case, and in the rational case of degree d≥1 the formula T(r,f)=dlog⁡r+O(1) diverges.

2.1F2step 1.1algebra

Since C(f,a) is a constant and T(r,f)→∞, [F2] gives mT=1+C(f,a)T−NT=1−NT+o(1), hence lim inf⁡rmT=lim inf⁡r(1−NT)=1−lim sup⁡rNT; the two expressions for δ(a,f) agree.

2.2F1F2step 1.1algebra

δ(a,f)∈[0,1]: from [F2], 0≤m≤T+C(f,a) and 0≤N≤T+C(f,a) for r≥1; with T(r,f)>0 for all large r by [F1], dividing by T and taking limits gives 0≤lim inf⁡mT and lim sup⁡NT≤1.

3.1F3step 2.2algebra

ε(a,f)∈[0,1]: for r≥1, [F3] gives 0≤N1(r,a;f)≤N(r,a;f)≤T(r,f)+C(f,a); dividing by T and taking the lower limit gives 0≤ε(a,f)≤lim sup⁡NT≤1.

3.2F2step 2.1algebra

If f omits a, then n(t,a;f)=0 for every t, so N(r,a;f)≡0 and δ(a,f)=1−lim sup⁡0=1; also m(r,a;f)=T(r,f)+C(f,a) by [F2].

4.1given∎

The sum convention is well posed as an extended nonnegative supremum: the collection is nonempty because it contains the empty subsum 0, and if S is finite the supremum is attained at A=S. No enumeration or selection is used.

Depends on

Used by

Dependency tree · two levels

15 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