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 on , as , If is not identically zero, then If is a fixed rational map written with coprime polynomials and , then for nonconstant meromorphic and , A degree-zero rational map is constant and has bounded characteristic after composition with .
Facts & Assumptions
Given: Meromorphic functions on ; counting, proximity, and characteristic are normalized as in Counting, chordal proximity and characteristic.
The normalized chordal distance and the proximity and characteristic are defined by the formulas in Counting, chordal proximity and characteristic.
For nonconstant meromorphic and any finite target , for every (Nevanlinna’s First Main Theorem with exact centre constant).
Every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra by Liouville's theorem); in particular the normalized denominator of degree in step 4.1 has a nonempty finite zero set.
Proof
Define . For every finite , . By [F1], is the mean of , so averaging gives for every meromorphic and .
For complex , and . At each point the pole order of either or is at most the sum of the pole orders of and ; this includes cancellation and the identically zero sum, whose pole order is zero. For , every pole-count weight in [F2] is nonnegative, including the centre weight . Integrating the logarithmic bounds and the divisor bounds gives both upper laws for ; step 1.1 transfers them to .
Suppose first that is nonconstant and not identically zero. Away from its zeros and poles, [F1] gives . The poles of are precisely the zeros of with the same multiplicities. Therefore by [F1] and [F3]. If is a nonzero constant, both characteristics are constant in . This proves the reciprocal law for ; step 1.1 gives the same law for with a bounded error.
Let with and . For sufficiently large , the leading term bounds above and below by positive constant multiples of ; on the remaining compact -disc both and are bounded. Hence uniformly in . Averaging gives . At every pole of of order , the leading term of makes have pole order exactly , and has no other poles. Thus [F2] gives , and step 1.1 yields . If is constant, is constant and has bounded characteristic.
Let be nonconstant of degree , with coprime. The composition is nonconstant: otherwise the connected image of the nonconstant meromorphic map would lie in a finite fiber of . By step 2.2, replacing by changes the characteristic of its composition by only this handles . If , subtract : translating a meromorphic function by a constant changes by a bounded amount and leaves its pole orders unchanged, while has degree less than . Thus it suffices to prove the result when and .
In this normalized case, the nonempty finite zero set of is disjoint from that of . If has zeros, let be one third of the minimum distance between the two finite zero sets; if has none, take any . Let be the union of the open -discs around the zeros of and put . Its closure avoids the zeros of . On , has a positive lower bound and a finite upper bound, so is bounded above and below by positive constant multiples of . On , both and are bounded, including at infinity because . Splitting each circle into the sets where lies in and , these comparisons and the boundedness of on bounded values give . Values at isolated poles are interpreted through their integrable logarithmic singularities.
The pole divisors of and agree. At a point where is finite, a pole occurs exactly when ; coprimality makes there, so its order is the zero order of . At a pole of , the inequalities imply both and , so neither has a pole. Hence [F2] gives . Combining this with step 4.1 yields .
Since is nonconstant, is not identically zero: otherwise the connected image of would lie in the finite zero set of , forcing to be constant. Applying the reciprocal law of step 2.2 and the polynomial law of step 2.3 gives . Step 1.1 transfers this estimate to , while steps 3.1 and 5.1 reduce the original composition to this normalized estimate.
If , is a constant and has no poles; by [F1], for every , 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
- Alexandre Eremenko, Lectures on Nevanlinna Theory, §2, algebraic properties (a)–(d) (standard reference, not scraped)
- Goldberg–Ostrovskii, Value Distribution of Meromorphic Functions, Ch. 1 §6, equations (6.1)–(6.8), Theorems 6.1–6.2 (standard reference, not scraped)