Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Elementary characteristic laws and fixed rational composition

Statement

For meromorphic f,g on C, as r→∞, T(r,fg)≤T(r,f)+T(r,g)+O(1),T(r,f+g)≤T(r,f)+T(r,g)+O(1). If f is not identically zero, then T(r,1/f)=T(r,f)+Of(1). If R=P/Q is a fixed rational map written with coprime polynomials and d=max⁡(deg⁡P,deg⁡Q), then for nonconstant meromorphic f and d≥1, T(r,R(f))=d T(r,f)+OR,f(1). A degree-zero rational map is constant and has bounded characteristic after composition with f.

Facts & Assumptions

Given: Meromorphic functions on C; counting, proximity, and characteristic are normalized as in Counting, chordal proximity and characteristic.

[F1]

The normalized chordal distance and the proximity and characteristic are defined by the formulas in Counting, chordal proximity and characteristic.

[F2]

N(r,a;h)=n(0,a;h)log⁡r+∫0r(n(t,a;h)−n(0,a;h)) dt/t (Counting, chordal proximity and characteristic).

[F3]

For nonconstant meromorphic h and any finite target a, m(r,a;h)+N(r,a;h)=T(r,h)+C(h,a) for every r>0 (Nevanlinna’s First Main Theorem with exact centre constant).

[F4]

Every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra by Liouville's theorem); in particular the normalized denominator Q of degree d≥1 in step 4.1 has a nonempty finite zero set.

Proof

technique · Compare the chordal characteristic with $T_0=m_0+N_\infty$, where $m_0(r,h)$ is the circular mean of $\log^+|h|$. Prove the algebraic laws for $T_0$, then transfer them across the uniformly bounded normalization difference
1.1F1algebra

Define T0(r,h)=m0(r,h)+N(r,∞;h). For every finite w, log⁡+∣w∣≤12log⁡(1+∣w∣2)≤log⁡+∣w∣+12log⁡2. By [F1], m(r,∞;h) is the mean of 12log⁡(1+∣h∣2), so averaging gives 0≤T(r,h)−T0(r,h)≤12log⁡2 for every meromorphic h and r>0.

2.1F1F2step 1.1algebra

For complex x,y, log⁡+∣xy∣≤log⁡+∣x∣+log⁡+∣y∣ and log⁡+∣x+y∣≤log⁡+∣x∣+log⁡+∣y∣+log⁡2. At each point the pole order of either fg or f+g is at most the sum of the pole orders of f and g; this includes cancellation and the identically zero sum, whose pole order is zero. For r≥1, every pole-count weight in [F2] is nonnegative, including the centre weight log⁡r. Integrating the logarithmic bounds and the divisor bounds gives both upper laws for T0; step 1.1 transfers them to T.

2.2F1F3step 1.1algebra

Suppose first that f is nonconstant and not identically zero. Away from its zeros and poles, [F1] gives log⁡(1/δ(f,0))=12log⁡(1+∣f∣2)−log⁡∣f∣=12log⁡(1+∣1/f∣2). The poles of 1/f are precisely the zeros of f with the same multiplicities. Therefore T(r,1/f)=m(r,0;f)+N(r,0;f)=T(r,f)+C(f,0) by [F1] and [F3]. If f is a nonzero constant, both characteristics are constant in r. This proves the reciprocal law for T; step 1.1 gives the same law for T0 with a bounded error.

2.3F1F2step 1.1algebra

Let P(w)=apwp+⋯+a0 with p≥1 and ap≠0. For sufficiently large ∣w∣, the leading term bounds ∣P(w)∣ above and below by positive constant multiples of ∣w∣p; on the remaining compact w-disc both log⁡+∣P(w)∣ and plog⁡+∣w∣ are bounded. Hence log⁡+∣P(w)∣=plog⁡+∣w∣+OP(1) uniformly in w. Averaging gives m0(r,P(f))=pm0(r,f)+OP(1). At every pole of f of order λ, the leading term of P makes P(f) have pole order exactly pλ, and P(f) has no other poles. Thus [F2] gives N(r,∞;P(f))=pN(r,∞;f), and step 1.1 yields T(r,P(f))=pT(r,f)+OP(1). If P is constant, P(f) is constant and has bounded characteristic.

3.1step 2.2algebra

Let R=P/Q be nonconstant of degree d≥1, with P,Q coprime. The composition R(f) is nonconstant: otherwise the connected image of the nonconstant meromorphic map f:C→C^ would lie in a finite fiber of R. By step 2.2, replacing R by 1/R changes the characteristic of its composition by only OR,f(1); this handles deg⁡P=d>deg⁡Q. If deg⁡P=deg⁡Q=d, subtract c=R(∞): translating a meromorphic function by a constant changes m0 by a bounded amount and leaves its pole orders unchanged, while P−cQ has degree less than d. Thus it suffices to prove the result when deg⁡Q=d and deg⁡P<d.

4.1F4step 3.1algebra

In this normalized case, the nonempty finite zero set of Q is disjoint from that of P. If P has zeros, let ϵ be one third of the minimum distance between the two finite zero sets; if P has none, take any ϵ>0. Let Γ be the union of the open ϵ-discs around the zeros of Q and put Ω=C^∖Γ. Its closure avoids the zeros of P. On Γ‾, ∣P∣ has a positive lower bound and a finite upper bound, so ∣R∣=∣P/Q∣ is bounded above and below by positive constant multiples of ∣1/Q∣. On Ω, both R and 1/Q are bounded, including at infinity because deg⁡P<deg⁡Q. Splitting each circle into the sets where f lies in Γ and Ω, these comparisons and the boundedness of log⁡+ on bounded values give m0(r,R(f))=m0(r,1/Q(f))+OR(1). Values at isolated poles are interpreted through their integrable logarithmic singularities.

5.1F2step 3.1step 4.1algebra

The pole divisors of R(f) and 1/Q(f) agree. At a point where f is finite, a pole occurs exactly when Q(f)=0; coprimality makes P(f)≠0 there, so its order is the zero order of Q(f). At a pole of f, the inequalities deg⁡P<deg⁡Q=d imply both R(f)→0 and 1/Q(f)→0, so neither has a pole. Hence [F2] gives N(r,∞;R(f))=N(r,∞;1/Q(f)). Combining this with step 4.1 yields T0(r,R(f))=T0(r,1/Q(f))+OR(1).

6.1step 1.1step 2.2step 2.3step 3.1step 5.1algebra

Since f is nonconstant, Q(f) is not identically zero: otherwise the connected image of f would lie in the finite zero set of Q, forcing f to be constant. Applying the reciprocal law of step 2.2 and the polynomial law of step 2.3 gives T0(r,1/Q(f))=T0(r,Q(f))+OQ,f(1)=dT0(r,f)+OQ,f(1). Step 1.1 transfers this estimate to T, while steps 3.1 and 5.1 reduce the original composition to this normalized estimate.

7.1F1algebra∎

If d=0, R is a constant c and R(f) has no poles; by [F1], T(r,R(f))=12log⁡(1+∣c∣2) for every r, which is bounded.

Depends on

Used by

Dependency tree · two levels

17 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