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.

Rational functions are exactly those with logarithmic characteristic

Statement

Let f be a nonconstant meromorphic function on C. Then f is rational if and only if T(r,f)=O(log⁡r)(r→∞). More precisely, if f is rational of degree d≥1, then T(r,f)=dlog⁡r+O(1)(r→∞), for the normalized chordal characteristic.

Facts & Assumptions

Given: A nonconstant meromorphic f on C, with characteristic, closed-disc pole counts, and local pole orders as defined in the cited items.

[F1]

T(r,h)=m(r,∞;h)+N(r,∞;h) (Counting, chordal proximity and characteristic).

[F2]

The integrated pole count is N(r,∞;h)=n(0,∞;h)log⁡r+∫0rn(t,∞;h)−n(0,∞;h)t dt (Counting, chordal proximity and characteristic).

[F3]

If R is a fixed rational map of degree d≥1 and h is nonconstant meromorphic, then T(r,R(h))=dT(r,h)+OR,h(1) (Elementary characteristic laws and fixed rational composition).

[F4]

For meromorphic u,v and r→∞, T(r,uv)≤T(r,u)+T(r,v)+O(1) (Elementary characteristic laws and fixed rational composition).

[F5]

The count n(r,a;h) is finite for each bounded disc (Well-definedness and radius conventions for Nevanlinna quantities).

[F6]

At a pole of order m, the finite nonzero principal part ends in a nonzero c−m(z−a)−m term; in particular its pole order is m (Characterizations of poles).

[F7]

For an entire g and 0<r<R, T0(r,g)≤log⁡+M(r,g)≤R+rR−rT0(R,g), where T0=m0+N(⋅,∞;g) and m0(r,g)=(2π)−1∫02πlog⁡+∣g(reit)∣ dt (Entire-function order agrees with maximum-modulus order).

[F8]

If M bounds ∣g∣ on ∣z∣=r, each Taylor coefficient an of g at 0 satisfies ∣an∣≤M/rn (Cauchy's inequalities bound the Taylor coefficients by the circle supremum).

[F9]

An entire function equals its Taylor series at 0 throughout C (A holomorphic function equals its Taylor series throughout the largest centred disc in its domain).

[F10]

δ(w,∞)=δ(∞,w)=1/1+∣w∣2, so the integrand of m(r,∞;h) is 12log⁡(1+∣h∣2) (Counting, chordal proximity and characteristic).

[F11]

Every nonempty subset of N has a least element (The well-ordering principle), used for the first integer radius with pole count at least M.

Proof

technique · The rational-composition law proves the forward direction. For the reverse, first bound the pole count, then cancel the finite pole divisor and use the entire maximum-modulus estimate and Cauchy inequalities
1.1F1F3F10algebra

The identity function z↦z is entire and has no poles, so [F1, F10] give its characteristic T(r,z)=12log⁡(1+r2)=log⁡r+O(1). If f is rational of degree d≥1, applying [F3] to the composition of f with the identity function gives T(r,f)=dT(r,z)+O(1)=dlog⁡r+O(1), proving the forward implication and the degree formula.

1.2F1F10algebra

Suppose T(r,f)=O(log⁡r), and choose A≥0, r0≥1 so T(r,f)≤Alog⁡r for every r≥r0; by [F1, F10], the integrand defining m(r,∞;f) is nonnegative, hence N(r,∞;f)≤T(r,f)≤Alog⁡r for r≥r0.

2.1F2F5F11step 1.2algebra

Let n0=n(0,∞;f), finite by [F5], and suppose there are infinitely many poles; since each bounded-disc count is finite by [F5], n(k,∞;f) is unbounded over positive integers k. Choose an integer M>max⁡{A,n0} and an integer s>r0, and let RM be the least integer k≥s with n(k,∞;f)≥M; it exists by unboundedness and well-ordering. For R≥RM, closed-disc monotonicity gives n(t,∞;f)≥M on [RM,R] and n(t,∞;f)≥n0 everywhere, so [F2] yields N(R,∞;f)≥n0log⁡R+(M−n0)log⁡(R/RM)=Mlog⁡R−(M−n0)log⁡RM. This contradicts step 1.2 as R→∞ because M>A, proving that f has finitely many poles.

3.1F5F6step 2.1algebra

List the finite poles as p1,…,ps with orders m1,…,ms, and set q(z)=∏j=1s(z−pj)mj, taking q=1 for the empty pole set; at each pj, [F6] gives the exact pole order, so the corresponding zero of q cancels it and g=qf extends holomorphically there, making g entire.

4.1F1F4F7F10step 1.2step 3.1algebra

Put D=∑jmj and Cq=∏j(1+∣pj∣)mj, with D=0, Cq=1 for the empty product; for r≥1 and ∣z∣=r, ∣q(z)∣≤CqrD, so [F1, F10] and 12log⁡(1+∣w∣2)≤log⁡+∣w∣+12log⁡2 give T(r,q)=O(log⁡r). The product law [F4] applied to g=qf and step 1.2 give T(r,g)=O(log⁡r). Define T0(r,g)=m0(r,g)+N(r,∞;g) as in [F7]; since g is entire its pole count vanishes, and [F1, F10] give T0(r,g)≤T(r,g)=O(log⁡r).

5.1F7F8F9step 4.1algebra∎

If g is constant then f=g/q is rational; otherwise [F7] with R=2r gives log⁡+M(r,g)≤3T0(2r,g)=O(log⁡r), hence M(r,g)≤C1rB for some C1>0, B≥0 and all large r. Write g(z)=∑n≥0anzn; for every integer n>B, [F8] gives ∣an∣≤M(r,g)/rn≤C1rB−n→0, so an=0. Thus only finitely many coefficients are nonzero, [F9] makes g a polynomial, and f=g/q is rational.

Depends on

Used by

Dependency tree · two levels

43 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