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 degree appears as logarithmic characteristic
Example
Let This is a rational map of degree two. For every , its pole count is and its boundary proximity satisfies Consequently,
Facts & Assumptions
Given: The normalized chordal characteristic and the fixed rational composition law for meromorphic functions.
sums local multiplicities on the closed disc ; for these are pole orders (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).
A rational map of degree has (Rational functions are exactly those with logarithmic characteristic).
Verification
Given: The function in the example and the definitions and laws above.
Polynomial division gives . The numerator equals at , so this is the unique pole and it is simple; the numerator and denominator are coprime and their maximum degree is . Also , so ; then for and for . By [F3, F4], (the boundary pole has logarithmic weight ), while for every , .
For , the decomposition gives and . Hence [F2] bounds the pointwise proximity by uniformly on the circle. Averaging gives .
By [F1] and steps 1.1–1.2, . Also, [F1, F2] give because has no poles and on the averaging circle. Since has degree two, [F5] applied to the identity map gives the same ; this agrees with the exact rational degree law [F6].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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) (standard reference, not scraped)