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 deficiency and ramification defect relations
Statement
Assume Countable Choice. For every nonconstant meromorphic function on , Also for every , and the set of targets at which either index is positive is at most countable. Sums over mean suprema of finite subsums.
Facts & Assumptions
Given: A nonconstant meromorphic function on ; Countable Choice is assumed (The Axiom of Countable Choice ()).
Deficiency and ramification index: for every sphere target , and , both in ; the target sum is the supremum of finite subsums, and the identities rest on the First Main Theorem with independent of (Nevanlinna deficiency and ramification index, Nevanlinna’s First Main Theorem with exact centre constant).
Second Main Theorem: for every finite set of distinct sphere targets with , outside a set of finite linear measure, where off that set; when is rational the error is at every sufficiently large radius. Moreover for every finite set of distinct sphere targets and , (Nevanlinna Second Main Theorem with ramification and truncation, Ramification count from the derivative divisor).
Growth separation input: , with when is transcendental and when is rational of degree (Transcendental characteristic dominates logarithmic growth).
Countable unions: under Countable Choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ).
Proof
(Per-target bound) Since and for all large , , so , and both indices are nonnegative by [F1].
(Second Main Theorem bound for finite target sets) Let be a finite set of distinct sphere targets with . By [F2], outside a set of finite linear measure; since by [F2], also outside .
(Target sets of at most two points) If then by step 1.1, so the asserted bound holds for every finite target set of at most two points.
(Growth separation) If is transcendental, [F3] gives and , so the general error bound in [F2] satisfies off . If is rational of degree , [F2] supplies the stronger error at every large radius, while [F3] gives ; thus this error divided by also tends to zero.
(Defect bound for finite target sets) For , dividing step 1.2 by and using step 2.2 gives along ; since has finite measure its complement is unbounded, so the lower limit of the left side is at most . As a finite sum of lower limits is at most the lower limit of the sum, ; with step 2.1 this covers every finite target set .
(Supremum over finite sets) By [F1] the total deficiency sum is the supremum of the finite subsums, each of which is at most by step 3.1, so ; since , also .
(The positive set is at most countable) For every integer put ; were , then the finite subsum over any points of would exceed , contradicting step 4.1, so each is finite and hence at most countable. Since , the set where either index is positive equals , a countable union of at most countable sets, which is at most countable by [F4].
Depends on
- Nevanlinna deficiency and ramification index
- Nevanlinna Second Main Theorem with ramification and truncation
- Transcendental characteristic dominates logarithmic growth
- Nevanlinna’s First Main Theorem with exact centre constant
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Ramification count from the derivative divisor
- Countable unions of at most countable sets, assuming $\mathrm{AC}_\omega$
Used by
Dependency tree · two levels
26 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
- A. Goldberg and I. Ostrovskii, Value Distribution of Meromorphic Functions (standard reference, not scraped)
- I. Laine, Complex Analysis III lecture notes (standard reference, not scraped)