Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Meromorphic Jensen identity with a zero or pole at the centre

Statement

Let a∈C and let f be nonconstant meromorphic. Near 0, write f(z)−a=cazka+higher Laurent terms with ca≠0 and ka∈Z. Then for every r>0,

Mrlog⁡∣f−a∣=log⁡∣ca∣+N(r,a;f)−N(r,∞;f),

where Mr is the angular mean on ∣z∣=r. If that circle contains a zero or pole of f−a, its mean is interpreted by its continuous radial limit.

Facts & Assumptions

Given: A nonconstant meromorphic f on C and a finite target a.

[F1]

Poisson–Jensen expresses the logarithm as the boundary Poisson mean minus zero Green terms plus pole Green terms (Poisson–Jensen formula for a meromorphic function on a disc).

[F2]

The integrated count is N(r,a;f)=n(0,a;f)log⁡r+∫0r(n(t,a;f)−n(0,a;f)) dt/t (Counting, chordal proximity and characteristic).

[F3]

A function holomorphic on a punctured annulus has a locally uniformly convergent Laurent expansion there (Laurent expansion on an annulus).

[F4]

The divisor counts are finite on bounded discs, and N and chordal proximities are finite and continuous at every positive radius (Well-definedness and radius conventions for Nevanlinna quantities).

[F5]

Chordal distance and its logarithmic proximity are given by the normalized formulas in the definition (Counting, chordal proximity and characteristic).

[F6]

An infinite-order zero occurs exactly when the function vanishes on a neighborhood; a finite-order zero has a local factorization (The order of a zero is the exponent in its local holomorphic factorization).

[F7]

A pole has a finite Laurent principal part, and its order is the largest negative exponent (Characterizations of poles).

[F9]

Holomorphic functions on a complex domain that agree on a set with an accumulation point agree everywhere (Identity theorem for holomorphic functions).

[F10]

A meromorphic function is holomorphic away from its pole set (Meromorphic functions on a plane domain).

Proof

technique · apply Poisson–Jensen to $f-a$, isolate the central Green term, and identify the remaining divisor sums with $N(r,a)-N(r,\infty)$
1.1F1given

Fix a radius r with no zero or pole of f−a on its boundary, and write m0=n(0,a;f) and ν0=n(0,∞;f). Applying [F1] to f−a gives its boundary Poisson mean, a negative sum over a-points, and a positive sum over poles; the central Green factor is Gr(z,0)=log⁡(r/∣z∣).

1.2F8F10given

Let P be the pole set and Ω=C∖P. By [F8] and [F10], Ω is open and f is holomorphic there; it is nonempty because a discrete pole set cannot equal C. For any two points of Ω, take a bounded closed disc containing a polygonal path between them in its interior. This disc meets P in finitely many points because P is closed and discrete. Choose small disjoint discs around those finitely many poles, avoiding the path endpoints and containing no other poles; replacing portions of the polygonal path through these discs by arcs in the punctured discs gives a path in Ω. Thus Ω is connected.

1.3F3F7given

If f has a pole at 0 of order ν0, [F3] gives a Laurent expansion on a punctured disc and [F7] makes its first nonzero exponent −ν0; subtracting finite a does not change that leading exponent.

1.4givenalgebra

If f(0) is finite and not equal to a, then f−a is nonzero at 0, so its leading exponent is ka=0=m0−ν0.

2.1F6F7F9step 1.2given

If f(0)=a and the zero of f−a at 0 had infinite order, [F6] would make f−a vanish near 0. By [F9] on the connected domain from step 1.2, it would then vanish on all of Ω; if P is empty this makes f constant, while if P is nonempty it contradicts [F7] at each pole. Thus the order is finite, and [F6] gives f−a=zm0h with h(0)≠0, so its leading exponent is ka=m0.

3.1step 2.1step 1.3step 1.4algebra

The three cases in steps 1.3, 1.4, and 2.1 show that f(z)−a=cazka(1+o(1)) and ka=m0−ν0; hence log⁡∣f(z)−a∣=log⁡∣ca∣+kalog⁡∣z∣+o(1).

4.1F1step 1.1step 3.1algebra

Let z→0 in step 1.1 through nondivisor points. The boundary Poisson mean tends to Mrlog⁡∣f−a∣; every noncentral Green term tends to log⁡(r/∣b∣) or log⁡(r/∣p∣); and the central contribution is −ka(log⁡r−log⁡∣z∣). Comparing with step 3.1 and cancelling kalog⁡∣z∣ yields Mrlog⁡∣f−a∣=log⁡∣ca∣+kalog⁡r+∑0<∣b∣<rmblog⁡(r/∣b∣)−∑0<∣p∣<rνplog⁡(r/∣p∣).

4.2F2F4step 3.1algebra

By [F2] and the finite divisor lists in [F4], integrating each counting step gives N(r,a;f)=m0log⁡r+∑0<∣b∣<rmblog⁡(r/∣b∣) and N(r,∞;f)=ν0log⁡r+∑0<∣p∣<rνplog⁡(r/∣p∣). Since ka=m0−ν0, step 3.1 is exactly log⁡∣ca∣+N(r,a;f)−N(r,∞;f).

5.1F4F5step 4.2∎

For any radius meeting a divisor, the pointwise chordal identity gives Mrlog⁡∣f−a∣=m(r,∞;f)+12log⁡(1+∣a∣2)−m(r,a;f). By [F4]–[F5], this mean is finite and continuous in r; the two counting functions are continuous as well. Taking regular radii to the divisor radius in step 4.2 proves the same identity there by continuous radial limit.

Depends on

Used by

Dependency tree · two levels

43 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