Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

Exceptional radii cannot be removed from the logarithmic-derivative estimate

Statement refuted

Assume Countable Choice. There exists an entire function f of infinite order, together with radii rn→∞, such that m0(rn,f′/f)≠O(log⁡+T(rn,f)+log⁡rn), i.e. the quotient of m0(rn,f′/f) by log⁡+T(rn,f)+log⁡rn is unbounded along rn. Thus the exceptional-radius set in the lemma on the logarithmic derivative cannot simply be erased and replaced by an estimate valid at every radius.

Facts & Assumptions

Given: Countable Choice is assumed as in the statement.

[F1]

The standard proximity is m0(r,g)=12π∫02πlog⁡+∣g(reit)∣dt, while T(r,g)=m(r,∞;g)+N(r,∞;g) uses chordal proximity. For entire g, N(r,∞;g)=0 and m0(r,g)≤T(r,g)≤m0(r,g)+12log⁡2 by the chordal comparison (Counting, chordal proximity and characteristic, Elementary characteristic laws and fixed rational composition). Also m0(r,f′/f)=12π∫02πlog⁡+∣f′(reit)/f(reit)∣dt is the standard proximity in the logarithmic-derivative lemma (Nevanlinna exceptional-radius error notation).

[F2]

Weierstrass test: a series of functions that is dominated on every compact set by a convergent numerical series converges locally uniformly (Weierstrass M-test for complex-valued function series).

Counterexample

technique · build the Hayman lacunary series $\sum_n(z/r_n)^{\lambda_n}$ with super-exponentially growing exponents, estimate it from above and its derivative from below on the lacunary circles, and compare the standard proximity of $f'/f$ with the characteristic of $f$
1.1constructalgebra

Set rn:=2n−1 and define integers λ1:=2, λn+1:=4nλn2nλn+n+1 for n≥1. Then λn is strictly increasing with λn>n and λn≥2n, and λn+1≥4nλn2nλn≥16nλn for every n.

2.1step 1.1algebra

Consequences for ν≥2: log⁡λν≥log⁡(4(ν−1)λν−1)+(ν−1)λν−1log⁡2≥(ν−1)λν−1log⁡2, and λν−1→∞, so log⁡λν/ν→∞ and log⁡λν/λν−1→∞. Hence ν=o(log⁡λν), log⁡ν=o(log⁡λν) and λν−1=o(log⁡λν).

2.2F2F3step 1.1construct

Define coefficients aj:=rn−λn when j=λn for some n, and aj:=0 otherwise; strict increase of λn makes this unambiguous. On ∣z∣≤R, all but finitely many nonzero terms of ∑j≥0ajzj are bounded by 2−λn, and ∑n2−λn<∞. Thus [F2] gives absolute uniform convergence on every such disc; the power series has infinite radius and its nonzero terms, in increasing degree order, are precisely f(z):=∑n≥1(z/rn)λn. By [F3], f is entire and f′(z)=∑n≥1λnrn(z/rn)λn−1; this is the differentiated power series with zero coefficients omitted. Its coefficient of z2 is r1−2=1, so f is nonconstant.

3.1F1step 1.1step 2.2algebra

(Upper bound on lacunary circles) For ν≥2 and ∣z∣=rν, the n-th term of f has modulus 2(ν−n)λn for n<ν, modulus 1 for n=ν, and modulus 2−(n−ν)λn for n>ν. In the first block each modulus is at most 2λν−1: for n≤ν−2 one has (ν−n)λn≤(ν−1)λν−2≤λν−1 by step 1.1, while n=ν−1 gives exponent λν−1 exactly. Hence the first block is at most (ν−1)2λν−1, and the tail is at most ∑m≥12−m=1. So ∣f(z)∣≤(ν−1)2λν−1+2 and m0(rν,f)≤log⁡((ν−1)2λν−1+2)≤λν−1log⁡2+log⁡(2(ν−1)).

3.2F1step 1.1step 2.1step 2.2algebra

(Lower bound for the derivative) For ν≥2 and ∣z∣=rν: the ν-th term of f′ has modulus λν/rν; the earlier terms satisfy ∑n<νλnrn(rνrn)λn−1=1rν∑n<νλn2(ν−n)λn≤(ν−1)λν−12(ν−1)λν−1rν≤λν4rν by step 1.1; and the later terms satisfy ∑n>νλnrn(rνrn)λn−1=1rν∑m≥1λν+m2−mλν+m≤2rν because λν+m≥2 makes each summand at most 2−m. Hence ∣f′(z)∣≥1rν(λν−λν4−2)≥λν2rν for all ν, so m0(rν,f′)≥log⁡λν−log⁡2−(ν−1)log⁡2≥12log⁡λν for all large ν by step 2.1.

4.1F1step 2.1step 3.1step 3.2algebra

(Standard proximity of the quotient) For finite complex u,v≠0 one has log⁡+∣u/v∣≥log⁡+∣u∣−log⁡+∣v∣; taking angular means gives m0(rν,f′/f)≥m0(rν,f′)−m0(rν,f)≥12log⁡λν−λν−1log⁡2−log⁡(2(ν−1))≥13log⁡λν for all large ν, by step 2.1.

4.2F1step 2.1step 3.1algebra

(Comparison scale) By step 3.1 and [F1], log⁡+T(rν,f)+log⁡rν=O(λν−1+ν+log⁡ν)=o(log⁡λν) by step 2.1.

4.3F1step 1.1step 2.1step 2.2algebra

(Infinite order) At ∣z∣=rν+1=2rν the ν-th term of f equals 2λν, the terms with n<ν sum to at most 2λν−1 by step 1.1 (each of the ν−1 terms has exponent (ν+1−n)λn≤2λν−1, and (ν−1)22λν−1≤2λν−1 because λν−1≥2λν−1+log⁡2(ν−1) whenever λν≥16(ν−1)λν−1 and λν−1≥2ν−1), and the terms with n>ν sum to at most 2 as in step 3.1. Hence ∣f∣≥2λν−1−2≥2λν−2 on that circle, so m0(rν+1,f)≥(λν−2)log⁡2 and [F1] gives T(rν+1,f)≥m0(rν+1,f). By step 2.1, log⁡λν/ν→∞; since log⁡rν+1=νlog⁡2, this gives log⁡T(rν+1,f)/log⁡rν+1→∞, so f has infinite order.

5.1step 4.1step 4.2algebra

Combining steps 4.1 and 4.2, m0(rν,f′/f)log⁡+T(rν,f)+log⁡rν≥log⁡λν/3o(log⁡λν)→∞ along rν→∞; hence m0(rν,f′/f) is not O(log⁡+T(rν,f)+log⁡rν).

6.1givendischarge-construct∎

The construction is explicit: the exponents are given by a closed recursion, the radii are rν=2ν−1, and no selection beyond the displayed formulas occurs. Countable Choice is carried only as in the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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