Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Finite-measure growth increment lemma

Statement

Assume Countable Choice. Let u:[r0,∞)→[1,∞) be continuous, nondecreasing and unbounded, and let ε>0. Then there is a Lebesgue measurable set E⊆[r0,∞) of finite linear measure such that for every r∈[r0,∞)∖E u(r+u(r)−1−ε)<u(r)+1. In particular the lemma applies to u(r)=T(r,f) for a nonconstant meromorphic f after increasing r0 so that T(r,f)>1 there.

Facts & Assumptions

Given: A continuous, nondecreasing, unbounded u:[r0,∞)→[1,∞) and ε>0; Countable Choice is assumed.

[F1]

Under Countable Choice, the Lebesgue measurable sets of R form a σ-algebra, Lebesgue measure is complete, and every elementary set (a finite union of half-open intervals) is Lebesgue measurable of the expected length (Nevanlinna exceptional-radius error notation, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume).

[F2]

Lebesgue measure is countably subadditive on measurable sets: if E1,E2,… are measurable with measurable union, then λ(⋃jEj)≤∑jλ(Ej) (Finite and countable subadditivity of measures).

[F3]

For every real exponent p>1 the series ∑m≥1m−p converges (The p-series for a real exponent p converges exactly when p is greater than one).

[F4]

Ahlfors–Shimizu: T(r,f)=TAS(r,f)+C∞(f), where TAS is finite and nondecreasing and is convex as a function of log⁡r; hence T(⋅,f) is continuous and nondecreasing, and T(r,f)>1 for all sufficiently large r (Ahlfors–Shimizu area form of the characteristic, Nevanlinna exceptional-radius error notation).

[F5]

f is rational if and only if T(r,f)=O(log⁡r); for rational f of degree d≥1, T(r,f)=dlog⁡r+O(1) (Rational functions are exactly those with logarithmic characteristic).

Proof

technique · split the failure set according to the integer level of $u$; the first crossing radii $s_m$ of the levels $m$ give an explicit cover of the failure set by intervals of lengths $m^{-1-\varepsilon}$, whose total length is a convergent series
1.1F1givenchoose

For every integer m≥1 the superlevel set {r≥r0:u(r)≥m} is closed in [r0,∞), and it is nonempty for m≤lim⁡r→∞u(r)=∞; let sm be its least element, and put m0:=⌈u(r0)⌉. Then sm≤sm+1.

1.2givenalgebra

(Failure set) Put φ(t):=t−1−ε and F:={r≥r0:u(r+φ(u(r)))≥u(r)+1}. The function r↦u(r+φ(u(r)))−u(r)−1 is continuous on [r0,∞) because u and φ are continuous; hence F is closed in [r0,∞).

1.3F4F5given

(Application to T) Let f be a nonconstant meromorphic function. By [F4] the function T(⋅,f) is continuous and nondecreasing in r (the constant C∞(f) is additive). It is also unbounded: T has a limit because it is nondecreasing, and if that limit were finite then T(r,f)=O(log⁡r) for large r; [F5] would then make f rational of some degree d≥1, and the same item gives T(r,f)=dlog⁡r+O(1)→∞, a contradiction, while constant f is excluded. Increasing r0 so that T(r0,f)≥1, the lemma applies to u=T(⋅,f).

2.1F1F2F3step 1.1algebra

(Measurability and finite measure of the cover) Every bounded closed interval [a,b] is a countable intersection of half-open intervals (a−1/n,b], hence Lebesgue measurable by [F1]; the same intervals cover it with measures tending to b−a, so λ([a,b])≤b−a. Set E:=[r0,∞)∩([r0,sm0]∪⋃m≥m0[sm+1−m−1−ε,sm+1]). This set is measurable, is contained in [r0,∞), and by [F2] λ(E)≤sm0−r0+∑m≥m0m−1−ε<∞ by [F3] and ε>0.

2.2givenstep 1.1algebra

If m>u(r0) then sm>r0 and u(sm)=m: by definition u(sm)≥m, and if u(sm)>m then by continuity u>m on a left neighbourhood of sm inside [r0,∞), contradicting minimality. If m=u(r0) the same holds with sm=r0.

3.1givenstep 2.2step 1.2step 1.1algebra

(Cover of the failure set) Recall m0=⌈u(r0)⌉ from step 1.1 and let r∈F with r≥sm0. Write m:=⌊u(r)⌋≥m0. Then u(r)∈[m,m+1), so r≥sm and r<sm+1. Moreover u(r)≥m, so by step 2.2, u(r+φ(u(r)))≥u(r)+1≥m+1=u(sm+1); monotonicity of u then forces r+φ(u(r))≥sm+1, i.e. r≥sm+1−φ(u(r))≥sm+1−φ(m). Hence F∩[sm0,∞)⊆⋃m≥m0[sm+1−m−1−ε, sm+1]∪[r0,sm0].

4.1step 3.1step 2.1algebra

(Conclusion off E) If r≥r0 and r∉E, then r∉[r0,sm0], so r>sm0; since r lies in no interval [sm+1−m−1−ε,sm+1] with m≥m0 either, step 3.1 gives r∉F: unwinding the definition of F, u(r+φ(u(r)))<u(r)+1, as required.

5.1F1given∎

The argument selects nothing: each sm is the least element of a nonempty closed set, and the covering intervals are defined from the sm and the given constants. Countable Choice is used only through the published Lebesgue measure interface of [F1].

Depends on

Used by

Dependency tree · two levels

46 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