Alphabeta Math
TheoremStatement: 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 defect relations

Statement

Assume Countable Choice. For every nonconstant meromorphic function f on C, ∑a∈C^(δ(a,f)+ε(a,f))≤2,and hence∑a∈C^δ(a,f)≤2. Also δ(a,f)+ε(a,f)≤1 for every a∈C^, and the set of targets at which either index is positive is at most countable. Sums over C^ mean suprema of finite subsums.

Facts & Assumptions

Given: A nonconstant meromorphic function f on C; Countable Choice is assumed (The Axiom of Countable Choice (ACω)).

[F1]

Deficiency and ramification index: for every sphere target a, δ(a,f)=lim inf⁡r→∞m(r,a;f)T(r,f)=1−lim sup⁡r→∞N(r,a;f)T(r,f) and ε(a,f)=lim inf⁡r→∞N1(r,a;f)T(r,f), both in [0,1]; the target sum is the supremum of finite subsums, and the identities rest on the First Main Theorem m(r,a;f)+N(r,a;f)=T(r,f)+C(f,a) with C(f,a) independent of r (Nevanlinna deficiency and ramification index, Nevanlinna’s First Main Theorem with exact centre constant).

[F2]

Second Main Theorem: for every finite set A of distinct sphere targets with ∣A∣≥3, ∑a∈Am(r,a;f)+N1(r,f)≤2T(r,f)+S(r,f) outside a set of finite linear measure, where S(r,f)≤C(log⁡+T(r,f)+log⁡r) off that set; when f is rational the error is Of(1) at every sufficiently large radius. Moreover for every finite set A of distinct sphere targets and r≥1, ∑a∈AN1(r,a;f)≤N1(r,f) (Nevanlinna Second Main Theorem with ramification and truncation, Ramification count from the derivative divisor).

[F3]

Growth separation input: T(r,f)→∞, with T(r,f)/log⁡r→∞ when f is transcendental and T(r,f)=dlog⁡r+O(1) when f is rational of degree d≥1 (Transcendental characteristic dominates logarithmic growth).

[F4]

Countable unions: under Countable Choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ACω).

Proof

technique · bound each combined index by one, apply the ramified Second Main Theorem to finite target sets, divide by the characteristic and pass to the lower limit using growth separation, take the supremum over finite target sets, and finish the countability clause with a threshold union
1.1F1algebra

(Per-target bound) Since N1(r,a;f)≤N(r,a;f) and T(r,f)>0 for all large r, ε(a,f)=lim inf⁡rN1(r,a;f)T(r,f)≤lim inf⁡rN(r,a;f)T(r,f)≤lim sup⁡rN(r,a;f)T(r,f)=1−δ(a,f), so δ(a,f)+ε(a,f)≤1, and both indices are nonnegative by [F1].

1.2F2algebra

(Second Main Theorem bound for finite target sets) Let A be a finite set of distinct sphere targets with ∣A∣≥3. By [F2], ∑a∈Am(r,a;f)+N1(r,f)≤2T(r,f)+S(r,f) outside a set E of finite linear measure; since ∑a∈AN1(r,a;f)≤N1(r,f) by [F2], also ∑a∈A(m(r,a;f)+N1(r,a;f))≤2T(r,f)+S(r,f) outside E.

2.1step 1.1algebra

(Target sets of at most two points) If ∣A∣≤2 then ∑a∈A(δ(a,f)+ε(a,f))≤∣A∣≤2 by step 1.1, so the asserted bound holds for every finite target set of at most two points.

2.2F1F2F3step 1.2algebra

(Growth separation) If f is transcendental, [F3] gives T(r,f)/log⁡r→∞ and T(r,f)→∞, so the general error bound in [F2] satisfies S(r,f)/T(r,f)→0 off E. If f is rational of degree d≥1, [F2] supplies the stronger error Of(1) at every large radius, while [F3] gives T(r,f)=dlog⁡r+O(1)→∞; thus this error divided by T also tends to zero.

3.1step 2.1step 1.2step 2.2algebra

(Defect bound for finite target sets) For ∣A∣≥3, dividing step 1.2 by T(r,f) and using step 2.2 gives ∑a∈A(m(r,a;f)T(r,f)+N1(r,a;f)T(r,f))≤2+o(1) along r∉E; since E has finite measure its complement is unbounded, so the lower limit of the left side is at most 2. As a finite sum of lower limits is at most the lower limit of the sum, ∑a∈A(δ(a,f)+ε(a,f))≤2; with step 2.1 this covers every finite target set A.

4.1F1step 3.1algebra

(Supremum over finite sets) By [F1] the total deficiency sum is the supremum of the finite subsums, each of which is at most 2 by step 3.1, so ∑a(δ(a,f)+ε(a,f))≤2; since δ≥0, also ∑aδ(a,f)≤2.

5.1F4step 4.1algebra∎

(The positive set is at most countable) For every integer k≥1 put Fk={a∈C^:δ(a,f)+ε(a,f)>1/k}; were ∣Fk∣≥2k+1, then the finite subsum over any 2k+1 points of Fk would exceed 2k+1k=2+1k>2, contradicting step 4.1, so each Fk is finite and hence at most countable. Since δ+ε≥0, the set where either index is positive equals ⋃k≥1Fk, a countable union of at most countable sets, which is at most countable by [F4].

Depends on

Used by

Dependency tree · two levels

26 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