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.

Separated-radius Poisson–Jensen derivative bound

Statement

Let f be a nonconstant meromorphic function on C, let 0<α<1, and let 2≤r<R. Denote by m0 the standard proximity, m0(r,f′/f)=12π∫02πlog⁡+∣f′(reit)/f(reit)∣ dt, with the logarithmic singularities interpreted as an integrable angular integrand. Then there are constants Cf,α<∞ (depending only on f and α) and Cα<∞ (depending only on α) with m0(r,f′/f)≤Cf,α+Cα(log⁡+T(R,f)+log⁡R+log⁡+1R−r). No limit R↓r is asserted: the bound depends on the separation R−r.

Facts & Assumptions

Given: A nonconstant meromorphic f on C, 0<α<1 and radii 2≤r<R.

[F1]

Poisson–Jensen formula on ∣z∣<s: for meromorphic h on a neighbourhood of ∣z∣≤s with no zero or pole on ∣z∣=s, log⁡∣h(z)∣=12π∫02πPs(z,seit)log⁡∣h(seit)∣dt−∑mbGs(⋅) contributions of the zeros and poles, with Gs(z,a)=log⁡∣s2−aˉzs(z−a)∣; at a divisor radius the identity is the limit through regular radii (Poisson–Jensen formula for a meromorphic function on a disc).

[F2]

Counting, proximity and characteristic: for finite w, log⁡1δ(w,∞)=12log⁡(1+∣w∣2); T=m(⋅,∞)+N(⋅,∞); the centre-regularized count is N(r,a;h)=n(0,a;h)log⁡r+∫0rn(t,a;h)−n(0,a;h)tdt (Counting, chordal proximity and characteristic). The bounds log⁡+∣w∣≤12log⁡(1+∣w∣2) and log⁡+∣1/w∣≤12log⁡(1+∣w∣−2) control the two standard proximities separately.

[F3]

First Main Theorem for nonconstant meromorphic h, with exact centre constant: m(r,a;h)+N(r,a;h)=T(r,h)+C(h,a) for every sphere target a, with C(h,∞)=0; for finite a and h(z)−a=cazka+…, C(h,a)=12log⁡(1+∣a∣2)−log⁡∣ca∣ (Nevanlinna’s First Main Theorem with exact centre constant). In particular m(r,a;h)≤T(r,h)+C(h,a).

[F4]

Characteristic laws: T(r,1/h)=T(r,h)+Oh(1) and T(r,gh)≤T(r,g)+T(r,h)+O(1) as r→∞ (Elementary characteristic laws and fixed rational composition).

[F5]

n(r,a;h) is finite on bounded discs, and N(⋅,a;h) and m(⋅,a;h) are finite and continuous; for s<R, N(R,a;h)−N(s,a;h)=∫sRn(t,a;h)dtt (Well-definedness and radius conventions for Nevanlinna quantities).

[F6]

A zero of finite order k at the centre factors as h(z)=zkg(z) with g holomorphic and g(0)≠0 (The order of a zero is the exponent in its local holomorphic factorization).

[F7]

At a pole, the reciprocal has a zero of the same order (Characterizations of poles).

[F8]

On a probability space, Jensen's integral inequality for the convex function x↦−log⁡(1+x) gives Elog⁡(1+X)≤log⁡(1+EX) for nonnegative integrable X; the logarithm is integrable since log⁡(1+X)≤X (Jensen's integral inequality for a probability measure).

Proof

technique · normalize the centre value; differentiate the Poisson–Jensen formula; bound the boundary kernel by the characteristic and the divisor kernels by $1/|z-c|$; use $\alpha$-power angular means and Jensen's inequality to obtain the proximity bound
1.1F4F6F7algebra

(Reduction to centre value 1) Let k∈Z be the signed order of f at 0 (negative for a pole), and write f(z)=czkh(z) with c≠0, h meromorphic on C, and h(0)=1. The local zero and pole factorizations justify this form; when k=0, take c=f(0). Then f′/f=k/z+h′/h. The proximity sum inequality gives, for r≥2, m0(r,f′/f)≤m0(r,h′/h)+log⁡+(∣k∣/r)+log⁡2≤m0(r,h′/h)+log⁡+∣k∣+log⁡2, where the k/z term is zero when k=0. If h is constant then h≡1, so f′/f=k/z and m0(r,f′/f)≤log⁡+∣k∣ for r≥2, proving the stated bound directly with a constant depending on f. In all subsequent steps assume h is nonconstant. The characteristic laws and the direct rational-map estimate T(R,c−1z−k)=∣k∣log⁡R+Of(1) for R≥2 give T(R,h)≤T(R,f)+∣k∣log⁡R+Of(1).

1.2F2F3algebra

(Vanishing centre constants) For h with h(0)=1, [F3] gives C(h,0)=12log⁡1−log⁡1=0 and C(h,∞)=0, hence m(s,0;h)+N(s,0;h)=T(s,h)=m(s,∞;h)+N(s,∞;h). For every w one has log⁡+∣w∣≤12log⁡(1+∣w∣2) and log⁡+1∣w∣≤12log⁡(1+∣w∣−2), so taking angular means gives 12π∫02π∣log⁡∣h(seit)∣∣dt≤m(s,0;h)+m(s,∞;h)≤2T(s,h).

1.3F1F5algebra

(Differentiated Poisson–Jensen) Let 0<r<s<R with ∣z∣=s carrying no zero or pole of h; [F1] applies on ∣z∣<s. Differentiation in z of [F1], whose boundary kernel and Green kernels are smooth for ∣z∣<s and whose divisor sum is finite, gives for ∣z∣<s h′(z)h(z)=12π∫02πlog⁡∣h(seit)∣2seit(seit−z)2 dt+∑h(c)=0s2−∣c∣2(s2−cˉz)(z−c)−∑p poles2−∣p∣2(s2−pˉz)(z−p), the divisor sums running over the zeros and poles in ∣z∣<s with multiplicity; at a radius s meeting the divisor, take regular sj↓s and pass to the limit using the continuity of [F5].

1.4algebra

(Angular integral of one kernel) For any c and every φ one has ∣reiφ−c∣≥r∣sin⁡φ∣ after rotating c to ∣c∣: indeed r2−2r∣c∣cos⁡φ+∣c∣2−r2sin⁡2φ=(rcos⁡φ−∣c∣)2≥0. Hence, using sin⁡φ≥2φ/π on [0,π/2], 12π∫02πdφ∣reiφ−c∣α≤12πrα∫02πdφ∣sin⁡φ∣α≤2(1−α)rα.

2.1step 1.3algebra

(Kernel bounds) For ∣z∣=r<s: ∣2seit(seit−z)2∣≤2s(s−r)2; and for a divisor point c with ∣c∣<s, using ∣s2−cˉz∣≥s2−∣c∣r, ∣s2−∣c∣2(s2−cˉz)(z−c)∣=(s+∣c∣)(s−∣c∣)∣s2−cˉz∣ ∣z−c∣≤s+∣c∣s⋅1∣z−c∣≤2∣z−c∣, because (s−∣c∣)ss2−r∣c∣≤1 for 0≤∣c∣<s and r<s.

3.1F5step 1.2step 1.3step 2.1algebra

(Pointwise bound) Combining steps 1.3 and 2.1 with step 1.2 at ∣z∣=r, ∣h′(z)h(z)∣≤2s(s−r)2⋅2T(s,h)+2∑∣c∣<s1∣z−c∣=4sT(s,h)(s−r)2+2Σ(z), where the last sum extends over all zeros and poles of h in ∣z∣<s (each repeated according to multiplicity) and is finite by [F5].

4.1step 3.1algebra

(α-power mean) Fix α∈(0,1). By (x+y)α≤xα+yα for x,y≥0, 12π∫02π∣h′(reiφ)h(reiφ)∣αdφ≤(4sT(s,h)(s−r)2)α+2α2π∫02πΣ(reiφ)αdφ, and Σ(reiφ)α≤∑∣c∣<s∣reiφ−c∣−α again by the subadditivity for exponent α<1.

4.2F3F5step 3.1algebra

(Counting the divisor) Let n(s;0,∞):=n(s,0;h)+n(s,∞;h). From [F5], N(R,a;h)−N(s,a;h)≥n(s,a;h)log⁡(R/s) for a=0,∞; by [F3], N(R,a;h)≤T(R,h)+C(h,a), and log⁡Rs≥R−sR for s<R. With s:=R+r2 this gives n(s,a;h)≤2R (T(R,h)+C(h,a))R−r, hence n(s;0,∞)≤4R T(R,h)R−r+Ch′ for a constant Ch′≥0.

5.1F8step 1.2step 4.1step 4.2algebra

(Proximity bound) On normalized angular measure put X(φ):=∣h′(reiφ)/h(reiφ)∣α, defined arbitrarily at its measure-zero singularities. Step 4.1 gives X∈L1, so log⁡(1+X)∈L1. For u≥0, log⁡+u≤α−1log⁡(1+uα); applying this pointwise and [F8] to X yields m0(r,h′/h)≤1αlog⁡(1+12π∫02πX(φ) dφ). For s=R+r2, steps 4.1 and 4.2 bound the integral mean by Aα+B, where A:=16RT(R,h)(R−r)2,B:=2α+1(1−α)rα(4RT(R,h)R−r+Ch′). Thus m0(r,h′/h)≤α−1log⁡(1+Aα+B). Since r≥2, log⁡(1+Aα+B)≤log⁡3+log⁡+A+log⁡+B, while log⁡+A≤log⁡+T(R,h)+log⁡R+2log⁡+1R−r+log⁡16 and log⁡+B≤Cα+Ch+log⁡+T(R,h)+log⁡R+log⁡+1R−r. Absorbing fixed terms into Ch,α and enlarging Cα proves the required bound.

6.1step 1.1step 5.1algebra∎

(Undoing the normalization) By step 1.1, T(R,h)≤T(R,f)+Of(log⁡R) and log⁡+T(R,h)≤log⁡+T(R,f)+log⁡R+Of(1) for R≥2 after enlarging the fixed constants, by continuity on any remaining compact radius interval; absorbing the constants depending on f (including log⁡+∣k∣ and the fixed normalization terms) into Cf,α and the numerical factors into Cα yields m0(r,f′/f)≤Cf,α+Cα(log⁡+T(R,f)+log⁡R+log⁡+1R−r) for all 2≤r<R.

Depends on

Used by

Dependency tree · two levels

33 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