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 be a nonconstant meromorphic function on . Then is rational if and only if More precisely, if is rational of degree , then for the normalized chordal characteristic.
Facts & Assumptions
Given: A nonconstant meromorphic on , with characteristic, closed-disc pole counts, and local pole orders as defined in the cited items.
The integrated pole count is (Counting, chordal proximity and characteristic).
If is a fixed rational map of degree and is nonconstant meromorphic, then (Elementary characteristic laws and fixed rational composition).
For meromorphic and , (Elementary characteristic laws and fixed rational composition).
The count is finite for each bounded disc (Well-definedness and radius conventions for Nevanlinna quantities).
At a pole of order , the finite nonzero principal part ends in a nonzero term; in particular its pole order is (Characterizations of poles).
For an entire and , where and (Entire-function order agrees with maximum-modulus order).
If bounds on , each Taylor coefficient of at satisfies (Cauchy's inequalities bound the Taylor coefficients by the circle supremum).
An entire function equals its Taylor series at throughout (A holomorphic function equals its Taylor series throughout the largest centred disc in its domain).
, so the integrand of is (Counting, chordal proximity and characteristic).
Every nonempty subset of has a least element (The well-ordering principle), used for the first integer radius with pole count at least .
Proof
The identity function is entire and has no poles, so [F1, F10] give its characteristic . If is rational of degree , applying [F3] to the composition of with the identity function gives , proving the forward implication and the degree formula.
Suppose , and choose , so for every ; by [F1, F10], the integrand defining is nonnegative, hence for .
Let , finite by [F5], and suppose there are infinitely many poles; since each bounded-disc count is finite by [F5], is unbounded over positive integers . Choose an integer and an integer , and let be the least integer with ; it exists by unboundedness and well-ordering. For , closed-disc monotonicity gives on and everywhere, so [F2] yields . This contradicts step 1.2 as because , proving that has finitely many poles.
List the finite poles as with orders , and set , taking for the empty pole set; at each , [F6] gives the exact pole order, so the corresponding zero of cancels it and extends holomorphically there, making entire.
Put and , with , for the empty product; for and , , so [F1, F10] and give . The product law [F4] applied to and step 1.2 give . Define as in [F7]; since is entire its pole count vanishes, and [F1, F10] give .
If is constant then is rational; otherwise [F7] with gives , hence for some , and all large . Write ; for every integer , [F8] gives , so . Thus only finitely many coefficients are nonzero, [F9] makes a polynomial, and is rational.
Depends on
- Elementary characteristic laws and fixed rational composition
- Entire-function order agrees with maximum-modulus order
- Counting, chordal proximity and characteristic
- Cauchy's inequalities bound the Taylor coefficients by the circle supremum
- Well-definedness and radius conventions for Nevanlinna quantities
- Characterizations of poles
- A holomorphic function equals its Taylor series throughout the largest centred disc in its domain
- The well-ordering principle
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
- Alexandre Eremenko, Lectures on Nevanlinna Theory, §2, Exercise 1 (standard reference, not scraped)
- Goldberg–Ostrovskii, Value Distribution of Meromorphic Functions, Ch. 1 §6, Theorem 6.1 and Corollary (6.26); §7, Theorem 7.1 (standard reference, not scraped)