Alphabeta Math
TheoremStatement: 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.

The local Second Main Theorem on a punctured disc

Statement

Assume Countable Choice. Let f be nonconstant and meromorphic on the punctured disc 0<∣z−z0∣<r∗; choose 0<ρ<r∗ so that the circle ∣z−z0∣=ρ contains no poles and no preimages of the finitely many distinct targets a1,…,aq of f in the sphere, and put F(w)=f(z0+ρ/w) for ∣w∣>1. Define

mext(R,∞;F)=12π∫02πlog⁡+∣F(Reiθ)∣ dθ,Next(R,a;F)=∫1Rnext(t,a;F) dtt,

where next(t,a;F) counts the a-points of F in 1<∣w∣≤t with full multiplicity (poles when a=∞); put Text(R,F)=mext(R,∞;F)+Next(R,∞;F), and let Nˉext count each point once. Then there are constants C,R0>0 and a measurable set E⊆[R0,∞) of finite linear measure such that for every R≥R0 with R∉E,

(q−2)Text(R,F)≤∑j=1qNˉext(R,aj;F)+C(log⁡+Text(R,F)+log⁡R).

The exact local radius is s=ρ/R, and the image exceptional set {ρ/R:R∈E} has finite linear measure, bounded by ρR0−2∣E∣.

Facts & Assumptions

Given: A nonconstant meromorphic f on D∗={0<∣z−z0∣<r∗}, distinct sphere targets a1,…,aq, a radius 0<ρ<r∗ whose circle ∣z−z0∣=ρ carries no pole and no aj-point of f, and F(w)=f(z0+ρ/w); Countable Choice is assumed (The Axiom of Countable Choice (ACω)).

[F1]

Plane counting and proximity conventions: for meromorphic g on a plane domain, n(r,a;g) is the multiplicity sum of the a-points in ∣z∣≤r, N(r,a;g)=n(0,a;g)log⁡r+∫0rn(t,a;g)−n(0,a;g)tdt, N=Nˉ+N1 with nˉ the number of distinct points and n1 the local-degree surplus, while m(r,a;g)=12π∫02πlog⁡1δ(g(reit),a)dt and T(r,g)=m(r,∞;g)+N(r,∞;g) (Counting, chordal proximity and characteristic, Truncated value and ramification counts).

[F2]

Ramification identity and target sum: for a nonconstant meromorphic g on a plane domain, N1(r,g)=N(r,0;g′)+2N(r,∞;g)−N(r,∞;g′), and for every finite set A of distinct sphere targets ∑a∈AN1(r,a;g)≤N1(r,g) when r≥1; both follow from the same local-degree calculation as Ramification count from the derivative divisor wherever the stated counting functions are defined.

[F3]

Argument principle and winding number: if γ is a closed complex contour and g is meromorphic on a neighbourhood of γ∗ with g≠0 on γ∗, then 12πi∫γg′g=n(g∘γ,0)∈Z; when g is meromorphic on a neighbourhood of a closed disc bounded by a positively oriented circle, the same integral is the winding-weighted preimage count of g−a minus the pole count (The argument-principle integral is the winding number of the image cycle, The argument principle counts preimages of a target value).

[F4]

Möbius maps: every Möbius transformation is a biholomorphism of the Riemann sphere, and any ordered triple of distinct sphere points is carried to (0,1,∞) by a unique Möbius transformation; a biholomorphism preserves local degrees, so composing a meromorphic map with it preserves the target divisors and their multiplicities (Every Möbius transformation is a biholomorphism of the Riemann sphere, A unique Möbius transformation carries any ordered triple of distinct sphere points to any other).

[F5]

Exterior logarithmic-derivative lemma (Lund and Ye, Theorem A2, printed p. 552; Definition A, printed p. 549): for nonconstant g meromorphic in a neighbourhood of the closed exterior {σ≤∣w∣<∞}, σ>0, the logarithmic-derivative mean is Og,σ(max⁡{log⁡+T1(R,g),log⁡R}) outside a set of finite linear measure as R→∞. In their convention m1(R,g)=∫02πlog⁡+∣g(Reiθ)∣dθ, N1(R,∞;g) integrates the pole count in σ≤∣w∣≤t from σ to R, and T1=m1+N1. If the circle ∣w∣=σ has no pole of g, then N1 equals the normalized exterior count based at σ, and m1=2πmext. For σ>1, that count is at most Next(R,∞;g) based at 1, since it omits only the finitely many poles with 1<∣w∣<σ. Hence T1(R,g)≤2πText(R,g) for R≥σ, which gives the required normalized bound in terms of this item's characteristic. The regular inner circle is essential to this comparison.

[F6]

Structural facts: the poles of a meromorphic function on a plane domain form a closed discrete set and are at most countable; a nonzero holomorphic function has only isolated zeros; two holomorphic functions on a domain that agree on a set with an accumulation point in the domain agree everywhere; a holomorphic function on a domain with derivative identically zero is constant (Poles of a meromorphic function form a closed discrete set and are at most countable, Zeros of a nonzero holomorphic function are isolated, Identity theorem for holomorphic functions, A holomorphic function with zero derivative on a domain is constant).

[F7]

Under Countable Choice, a C1 diffeomorphism between open subsets of R maps Lebesgue measurable sets to Lebesgue measurable sets, and for a measurable set B its image measure is ∫B∣S′(R)∣dR (A C^1 diffeomorphism maps Lebesgue measurable sets to Lebesgue measurable sets, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).

Proof

technique · choose the inner circle to avoid poles and target preimages; derive the annular Jensen identity with its fixed inner-circle winding term; normalise the targets by a Möbius map so that all are finite; reuse the partial-fraction separation estimate of the plane Second Main Theorem, estimate the logarithmic derivatives on the exterior domain by the exterior logarithmic-derivative lemma, and use an auxiliary divisor-regular circle when applying the exterior First Main Theorem to the derivative
1.1F6choose

(The regular radius exists) On D∗ the pole set of f is closed and discrete, and for each finite aj the aj-points are isolated: near such a point f is holomorphic, and the zero is isolated unless f−aj vanishes on a neighbourhood, which by [F6] would force f≡aj on the connected domain D∗, contrary to nonconstancy. On each compact annulus 1k+1≤∣z−z0∣≤r∗(1−1k+1) these sets have only finitely many points. Hence only countably many radii meet a pole or a preimage of one of the finitely many targets; using the countable-choice interface (The Axiom of Countable Choice (ACω)) to run through the compact annuli, some 0<ρ<r∗ avoids them.

2.1constructstep 1.1

(Exterior setup) The inversion w↦z0+ρ/w is a biholomorphism of {∣w∣>1} onto {0<∣z−z0∣<ρ}, so F is nonconstant and meromorphic on the neighbourhood {∣w∣>ρ/r∗}⊇{∣w∣≥1} of the closed exterior, and the circle ∣w∣=1 carries no pole and no aj-preimage of F.

3.1F3step 2.1algebra

(Annular Jensen identity) Fix a finite value a with F−a≠0 on ∣w∣=1, put Ma(t)=12π∫02πlog⁡∣F(teiθ)−a∣dθ for t>1, and ka:=12πi∫∣w∣=1F′(w)F(w)−adw∈Z; then for every R>1, Ma(R)−Ma(1)=kalog⁡R+Next(R,a;F)−Next(R,∞;F). Differentiating under the integral gives ddtMa(t)=1t⋅12πi∫∣w∣=tF′(w)F(w)−adw, an integer by [F3]; at a zero of F−a of order e the local factorisation F−a=(w−p)eu raises that winding number by e as t crosses ∣p∣, and at a pole of F of order e the factorisation F−a=(w−p)−eu lowers it by e, so the integral equals ka+next(t,a;F)−next(t,∞;F) for almost every t and integration against dtt yields the identity, which extends to all R>1 by continuity.

4.1F1step 3.1algebra

(Two-sided exterior First Main Theorem) Let g be meromorphic on a neighbourhood of {∣w∣≥1}, and suppose its inner circle contains no pole of g and no point with g=a, where a∈C. Put mext(R,a;g)=12π∫02πlog⁡+1∣g(Reiθ)−a∣dθ. Then mext(R,a;g)+Next(R,a;g)=Text(R,g)+Oa(log⁡R) two-sidedly. Indeed step 3.1 applied to g and the identity log⁡∣g−a∣=log⁡+∣g−a∣−log⁡+1∣g−a∣ give mext(R,a;g)=mext+(R,a;g)−Ma(1)−kalog⁡R−Next(R,a;g)+Next(R,∞;g), and by [F1] the comparison ∣log⁡+∣g−a∣−log⁡+∣g∣∣≤log⁡+∣a∣+log⁡2 is two-sided, so substituting mext(R,∞;g)−Oa(1)≤mext+(R,a;g)≤mext(R,∞;g)+Oa(1) proves the claim. The same Jensen calculation may be anchored at any regular circle ∣w∣=σ>1; its integrated counts differ from those anchored at 1 by O(log⁡R) because only finitely many divisor points lie in 1<∣w∣≤σ.

5.1F4step 2.1step 4.1construct

(Möbius normalisation and characteristic comparison) If q≤2 the asserted inequality is trivial with C=0; assume q≥3. Choose any finite b∉{a1,…,aq} and let M be the Möbius transformation with M(b)=∞, M(a1)=0, M(a2)=1 [F4]; put cj:=M(aj) and G:=M∘F. Then each cj is finite and the cj are distinct; G is nonconstant and meromorphic on a neighbourhood of {∣w∣≥1}, and the circle ∣w∣=1 carries no cj-point of G. By [F4] the cj-divisor of G equals the aj-divisor of F with multiplicities and the poles of G are exactly the b-points of F in ∣w∣>1 with equal orders, so Nˉext(R,cj;G)=Nˉext(R,aj;F) and Next(R,∞;G)=Next(R,b;F). Since M(u)=A/(u−b)+D for constants A≠0,D, mext(R,∞;G)=mext(R,b;F)+O(1). Choose one r1∈(1,2) whose circle avoids the poles and b-points of F, the poles and cj-points of G, and the zeros and poles of G′. These divisors are locally finite in the compact annulus 1≤∣w∣≤2, so only finitely many radii are excluded. Applying step 4.1 at r1 and using its base-radius observation gives mext(R,b;F)+Next(R,b;F)=Text(R,F)+O(log⁡R). Therefore Text(R,G)=Text(R,F)+O(log⁡R) two-sidedly.

6.1step 5.1algebra

(Target separation) Put δ:=min⁡i<j∣ci−cj∣>0 and H:=∑j=1q1G−cj; the pointwise separation estimate of the plane Second Main Theorem Nevanlinna Second Main Theorem with ramification and truncation, valid for an arbitrary meromorphic function and reproduced here in the exterior normalisation, gives ∑j=1qlog⁡+1∣G(w)−cj∣≤log⁡+∣H(w)∣+Cq,δ on every outer circle, with Cq,δ=log⁡2+max⁡{qlog⁡+(4(q−1)/δ),(q−1)log⁡+(2/δ)}; points with G(w)=cj are covered by the convention +∞≤+∞.

6.2F1F2step 5.1algebra

(Exterior ramification bookkeeping) Define N1,ext(R,a;G):=Next(R,a;G)−Nˉext(R,a;G) and N1,ext(R,G):=Next(R,0;G′)+2Next(R,∞;G)−Next(R,∞;G′). The pointwise computation of [F2] applied at each point w of the annulus 1<∣w∣≤R with local degree ew of G gives N1,ext(R,a;G)=∑G(w)=a(ew−1)log⁡R∣w∣, N1,ext(R,G)=∑ew≥2(ew−1)log⁡R∣w∣, hence Next(R,a;G)=Nˉext(R,a;G)+N1,ext(R,a;G) with 0≤N1,ext(R,a;G)≤Next(R,a;G), and ∑j=1qN1,ext(R,cj;G)≤N1,ext(R,G) because each ramified point contributes to at most one of the disjoint target classes.

6.3F5step 5.1algebra

(Exterior logarithmic-derivative bounds) Apply [F5] to G and each G−cj with inner radius σ=r1 from step 5.1. All are nonconstant and meromorphic on a neighbourhood of that closed exterior; its inner circle has no pole or zero of these functions. Thus the source characteristics obey T1(R,G)≤2πText(R,G) and T1(R,G−cj)≤2πText(R,G−cj), with the right sides based at 1. Their pole divisors agree and ∣log⁡+∣G−cj∣−log⁡+∣G∣∣≤log⁡2+log⁡+∣cj∣, so Text(R,G−cj)=Text(R,G)+O(1). Taking the finite union of the q+1 source exceptional sets, we obtain a measurable E of finite linear measure such that mext(R,∞;G′/G) and every mext(R,∞;G′/(G−cj)) are bounded by Cj(log⁡+Text(R,G)+log⁡R) at all sufficiently large R∉E.

7.1step 6.1algebra

(Reduction to logarithmic derivatives) Since H=(HG′)⋅1G′ and HG′=∑j=1qG′G−cj, the pointwise inequalities log⁡+∣uv∣≤log⁡+∣u∣+log⁡+∣v∣ and log⁡+∣∑j≤quj∣≤∑j≤qlog⁡+∣uj∣+log⁡q give mext(R,∞;H)≤mext(R,0;G′)+∑j=1qmext(R,∞;G′/(G−cj))+log⁡q for every R>0.

7.2step 4.1step 6.2F6algebra

(The term mext(0;G′)+N1,ext) By the choice in step 5.1, ∣w∣=r1 contains no zero or pole of G′. Apply the annular Jensen identity of step 4.1 to G′ with inner circle ∣w∣=r1; its counts anchored at r1 differ from Next(R,⋅;G′), anchored at 1, by O(log⁡R), since only finitely many zeros and poles lie in 1<∣w∣≤r1. Thus mext(R,0;G′)=mext(R,∞;G′)+Next(R,∞;G′)−Next(R,0;G′)+O(log⁡R). Adding the definition of N1,ext(R,G) from step 6.2 yields mext(R,0;G′)+N1,ext(R,G)=mext(R,∞;G′)+2Next(R,∞;G)+O(log⁡R).

7.3step 6.3algebra

(Bounding mext(∞;G′)) The pointwise bound log⁡+∣G′∣≤log⁡+∣G∣+log⁡+∣G′/G∣ gives mext(R,∞;G′)≤mext(R,∞;G)+mext(R,∞;G′/G)≤mext(R,∞;G)+C0(log⁡+Text(R,G)+log⁡R) for R large outside the exceptional set of step 6.3.

8.1step 6.1step 7.1step 6.3step 7.2step 7.3algebra

(Ramified exterior Second Main Theorem) Combining steps 6.1, 7.1, 6.3, 7.2 and 7.3, for all large R outside the finite-measure exceptional set E one has ∑j=1qmext(R,cj;G)+N1,ext(R,G)≤2Text(R,G)+C1(log⁡+Text(R,G)+log⁡R): the separation and logarithmic-derivative steps bound the proximity sum by mext(R,0;G′)+C, and steps 7.2 and 7.3 bound mext(R,0;G′) by 2Text(R,G)−N1,ext(R,G)+C1(log⁡+Text+log⁡R).

9.1step 4.1step 5.1step 6.2step 8.1algebra

(Truncated exterior Second Main Theorem) Step 4.1 at the regular radius r1 of step 5.1 gives ∑j=1qmext(R,cj;G)=qText(R,G)−∑j=1qNext(R,cj;G)+O(log⁡R); the base-radius observation in step 4.1 accounts for the divisor terms between radii 1 and r1. Substituting into step 8.1 and using Next(cj)=Nˉext(cj)+N1,ext(cj) together with ∑jN1,ext(R,cj;G)≤N1,ext(R,G) from step 6.2 gives (q−2)Text(R,G)≤∑j=1qNˉext(R,cj;G)+C2(log⁡+Text(R,G)+log⁡R) for all large R∉E.

10.1step 5.1step 9.1algebra

(Transfer back to F) Using Nˉext(R,cj;G)=Nˉext(R,aj;F), the two-sided comparison Text(R,G)=Text(R,F)+O(log⁡R) of step 5.1, and log⁡+Text(R,G)≤log⁡+Text(R,F)+O(log⁡R) for large R, the inequality of step 9.1 becomes (q−2)Text(R,F)≤∑j=1qNˉext(R,aj;F)+C(log⁡+Text(R,F)+log⁡R) for all large R outside E, with a suitably enlarged constant C.

11.1F7step 10.1algebra∎

(The exceptional set in the puncture radius) The substitution s=ρ/R maps [R0,∞) bijectively onto (0,ρ/R0] with ∣dsdR∣=ρR−2≤ρR0−2, so by the change-of-variables formula for a measurable set the image {ρ/R:R∈E} of the exceptional set E of step 6.3 has linear measure at most ρR0−2∣E∣<∞.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

66 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