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.
Nevanlinna Second Main Theorem with ramification and truncation
Statement
Assume Countable Choice. Let be a nonconstant meromorphic function on and let be distinct sphere values with . Then, outside a set of finite linear measure, equivalently and consequently If has finite order, the error terms are for every sufficiently large without exception; if is rational, they are for every sufficiently large .
Facts & Assumptions
Given: A nonconstant meromorphic on , distinct sphere values with ; Countable Choice is assumed.
The proximity is the mean of , the standard proximity differs from by at most , and ; is the centre-regularized count (Counting, chordal proximity and characteristic, Nevanlinna exceptional-radius error notation).
First Main Theorem: with a constant independent of (Nevanlinna’s First Main Theorem with exact centre constant).
Characteristic laws: , , as (Elementary characteristic laws and fixed rational composition).
Logarithmic-derivative lemma: for nonconstant meromorphic , with at all large radii when has finite order and at all large radii when is rational; the chordal proximity obeys the same bounds (The lemma on the logarithmic derivative).
Ramification identity: for every , and for every finite set of distinct targets , when (Ramification count from the derivative divisor).
, with for (Truncated value and ramification counts).
denotes a term bounded off a set of finite linear measure by , with and the threshold belonging to the occurrence; finitely many occurrences may share the union of their exceptional sets (Nevanlinna exceptional-radius error notation).
Proof
(Reduction to finite targets) Among the distinct sphere points at most belong to ; let be the least one that does not, so , and put . Then is nonconstant meromorphic. For finite set , and for set ; these are distinct finite values.
(Local computation for the substitution) The Möbius map has local degree one on the sphere, so composition preserves every local degree and ramification multiplicity of . For each finite target , the identity shows that a zero of occurs exactly at with the same order. If , then and has a zero of order exactly where has a pole of order . Thus the target counting functions agree, for every sphere target, and the preserved ramification multiplicities give .
(Finite-target setup) Henceforth are finite and distinct; put and . For each fixed finite , the chordal proximity differs from by at most a constant depending on : writing , the ratio is bounded above and below by positive constants depending only on . Thus the finite number of conversions below contributes only .
(Target separation) At every point at most one index satisfies , since two such indices would give ; write and . If , then . If , then , so for every , whence and . In both cases with .
(Reduction to logarithmic derivatives) Since and , the pointwise inequalities and give for every .
(The term ) Since is nonconstant, . If is nonconstant, [F2] gives ; if is constant, the same relation follows directly from the definitions, since and . In either case [F5] and give using .
(Characteristic transfer) by [F3]; consequently by [F2], , and the finite sum of errors is absorbed into for all large ; hence it suffices to prove the inequalities for finite distinct targets.
(Means) Taking angular means of step 1.4 and using the integrability of the logarithmic singularities and the finite-target comparison of step 1.3 gives for every .
(Logarithmic derivative of the shifted functions) For each the function is nonconstant meromorphic and , so [F4] gives ; since by [F3], we have , and likewise ; taking the union of the exceptional sets of these occurrences gives a set of finite linear measure such that for every .
(Bounding ) The pointwise bound gives for .
(Conclusion of the finite-target case) Combining steps 3.1, 1.6 and 4.1 for gives , and the constant is absorbed into the error term, so outside .
(Equivalent forms) By [F2], ; substituting into step 5.1 and absorbing yields outside . Conversely, rearranging this displayed bound using the same equality from [F2] recovers step 5.1 up to ; [F7] absorbs that bounded term into an error of the same class, enlarging the finite-measure exceptional set if needed, so the first two displayed inequalities are equivalent. Moreover and by [F5] and [F6], so and outside .
(Refinements) If has finite order then and every have finite order with characteristics , so the errors in step 3.1 are at every large radius by [F4], and all other errors above are by [F2] and [F3]; hence the inequalities hold with at every sufficiently large , with no exceptional set in this case. If is rational the same argument gives at every sufficiently large , again with no exceptional set.
(Unwinding) Applying the finite-target argument of steps 1.3–7.1 to the transform of step 1.1 and transferring back by steps 1.2 and 2.1 proves the three displayed inequalities for the original targets, including the case in which some equals ; the finite union of the exceptional sets of the finitely many logarithmic-derivative applications still has finite linear measure, and all conversion constants are absorbed into .
Depends on
- Counting, chordal proximity and characteristic
- Nevanlinna exceptional-radius error notation
- Truncated value and ramification counts
- The lemma on the logarithmic derivative
- Ramification count from the derivative divisor
- Nevanlinna’s First Main Theorem with exact centre constant
- Elementary characteristic laws and fixed rational composition
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
29 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
- Goldberg–Ostrovskii, Value Distribution of Meromorphic Functions (standard reference, not scraped)
- Alexandre Eremenko, Lectures on Nevanlinna Theory (standard reference, not scraped)
- I. Laine, Complex Analysis III lecture notes (standard reference, not scraped)