Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-10-02
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 exceptional-radius error notation

Definition

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Under this assumption the Lebesgue measurable subsets of R form a σ-algebra and Lebesgue measure is a complete measure (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

Let f be a nonconstant meromorphic function on C, with characteristic T(r,f) as in Counting, chordal proximity and characteristic. By Order and lower order from the Nevanlinna characteristic, T(r,f)>1 for all sufficiently large r.

An error term for f, written S(r,f), is a function e on a half-line [r0,∞) with r0≥1 for which there are a constant C≥0, a radius r0′≥r0, and a Lebesgue measurable set E⊆[r0′,∞) of finite linear measure, λ(E)<∞, such that

∣e(r)∣≤C(log⁡+T(r,f)+log⁡r)for every r≥r0′ with r∉E.

The notation X(r,f)=S(r,f) means that the function r↦X(r,f) is an error term in this sense; the constant C, the threshold r0′ and the exceptional set E belong to that particular occurrence. No bound is asserted at the radii belonging to E.

Remarks

  • The exceptional set is part of each occurrence. Two occurrences of S(r,f) in one formula may use different constants, thresholds and exceptional sets. A chain of estimates that uses k occurrences may take the union E1∪⋯∪Ek as a common exceptional set; a finite union of sets of finite linear measure again has finite linear measure, and the sum of the constants bounds the sum of the error terms.
  • S(r,f) denotes no single fixed function. Error terms for fixed f are closed under finite real linear combinations on a common half-line, by the finite-union estimate above. The symbol abbreviates "some function satisfying the displayed bound"; replacing the constant or the exceptional set by larger ones produces another valid occurrence of the same symbol.
  • No all-radius bound and no sharper order is implicit. Membership in S(r,f) alone gives no information at exceptional radii and no information beyond the stated bound. The logarithmic-derivative lemma supplies an all-radius O(log⁡r) estimate when f has finite order and an all-radius O(1) estimate when f is rational. These are sufficient hypotheses for those estimates, not necessary ones: for f(z)=ez, f′/f=1 and m0(r,f′/f)=0 at every radius although f is transcendental. No refinement of an arbitrary occurrence of S(r,f) follows solely from the order or rationality of f.
  • The exact use of Countable Choice. It is used only through the published measure interface: finite linear measure of E and its finite unions, and the measurability of the sets of bad radii that occur. Every occurrence of S(r,f) in this page carries the assumption explicitly, and no stronger choice principle is used.

Depends on

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