Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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.

Riesz measure of a log modulus records the holomorphic zeros

Statement

Assume Dependent Choice. Let Ω⊆C be a complex domain and let f be holomorphic on Ω, not identically zero on any connected component of Ω. Put u:=log⁡∣f∣, subharmonic on Ω (The logarithm of the modulus of a holomorphic function is subharmonic), with Riesz measure μu=(2π)−1Δu (Distributional Riesz measure of a plane subharmonic function). Then

μu=∑a∈Z(f)ord⁡a(f) δa,

where Z(f)={a∈Ω:f(a)=0}, the integers ord⁡a(f)≥1 are the vanishing orders (The order of a zero is the exponent in its local holomorphic factorization) and δa is the unit Dirac measure at a (The Dirac set function at a point); the sum is a locally finite positive measure on Ω. In particular log⁡∣f∣ has no Riesz mass on Ω∖Z(f).

Facts & Assumptions

Given: a complex domain Ω, a holomorphic f on Ω not identically zero on any component, the function u=log⁡∣f∣, and Dependent Choice.

[F1]

A holomorphic function on a complex domain that vanishes on a neighbourhood of a point vanishes identically: that neighbourhood supplies an accumulating set of zeros for Identity theorem for holomorphic functions. Thus the given nonzero f cannot have infinite order anywhere, since infinite order is equivalent to local vanishing by The order of a zero is the exponent in its local holomorphic factorization. For a∈Ω, a holomorphic function has finite order m=ord⁡a(f) at a exactly when f(z)=(z−a)mg(z) on a neighbourhood of a with g holomorphic and g(a)≠0; f(a)=0 holds exactly when m≥1, and if m=0 then f≠0 near a (The order of a zero is the exponent in its local holomorphic factorization).

[F2]

The function u=log⁡∣f∣ is subharmonic on Ω (The logarithm of the modulus of a holomorphic function is subharmonic); a zero-free holomorphic h on a disc admits h=exp⁡L with L holomorphic (A nonvanishing holomorphic function on a disc has a holomorphic logarithm); a holomorphic function on an open set is smooth, and its real part is C2 with Δ(Re⁡L)=0 wherever L is holomorphic (Holomorphic functions are real analytic and smooth in their two real coordinates, The C2 real and imaginary parts of a holomorphic function satisfy Laplace's equation and form a harmonic-conjugate pair).

[F3]

Under Dependent Choice the Riesz functional μu(φ)=(2π)−1∫ΩuΔφ dA is a positive Radon measure, and it is the unique positive Radon measure representing μu on Cc∞(Ω) (The distributional Riesz functional of a subharmonic function is a positive Radon measure, Distributional Riesz measure of a plane subharmonic function); moreover (2π)−1∫log⁡∣z−a∣ Δφ dA=φ(a) for every φ∈Cc∞(C), that is, μlog⁡∣⋅−a∣=δa (Distributional Laplacian of a compact logarithmic potential); Dependent Choice yields Countable Choice (Dependent choice implies countable choice).

[F4]

For h∈C2 on an open set, ΔTh=TΔh; in particular if Δh=0 pointwise then ∫hΔφ dA=0 for every compactly supported smooth test function φ (Distributional differentiation is continuous and commutes).

[F5]

A δa is a probability measure concentrated at a, finite or countable nonnegative sums of measures are measures, and every bounded infinite subset of R2≅C has an accumulation point (The Dirac set function at a point, Nonnegative scalar multiples and countable weighted sums of measures are measures, For n≥1 every bounded sequence in Rn has a convergent subsequence).

[F6]

If a compact C lies in an open set U⊆R2, there is a smooth compactly supported cutoff in U equal to 1 on a neighbourhood of C (Test function cutoffs and euclidean localization).

[F7]

Under Countable Choice, every Borel measure finite on compact sets on a second-countable locally compact Hausdorff space is Radon (Locally finite Borel measures on second-countable LCH spaces are regular); Dependent Choice supplies Countable Choice by Dependent choice implies countable choice.

Verification

technique · direct
1.1F1given

Let a∈Ω with f(a)=0 and let m:=ord⁡a(f)≥1 by [F1]. By [F1] there are a disc D(a,r)⊆Ω and a holomorphic zero-free g on it with f(z)=(z−a)mg(z), so f(z)≠0 for 0<∣z−a∣<r: every zero of f is isolated.

1.2F6given

Fix φ∈Cc∞(Ω). If φ=0 the identity is immediate; otherwise put K0:=supp⁡φ. For each x∈K0 there are concentric relatively compact discs V⋐D⋐Ω with x∈V and D‾ containing at most one zero of f, since zeros are isolated. These smaller discs form an open cover of K0; compactness gives finitely many pairs (Vi,Di) with the Vi covering K0. By [F6], choose βi∈Cc∞(Di) with βi≥0 and βi=1 on a neighbourhood of Vi‾. On W:=⋃iVi the sum S:=∑iβi is positive. Define φi:=φβi/S on W and zero off W; since K0⋐W, each φi∈Cc∞(Di), and ∑iφi=φ.

2.1step 1.1F5F7F8

Let K⊆Ω be compact and suppose it contained infinitely many distinct zeros of f. By [F5] the infinite bounded set Z(f)∩K has an accumulation point z∗∈K⊆Ω; continuity gives f(z∗)=0, contradicting the isolation of zeros from step 1.1. Thus each compact subset meets Z(f) finitely. Since Ω is second-countable and every zero is isolated, Z(f) is at most countable: assign each zero the least element of a fixed enumerated basis that contains it and no other zero; distinct zeros receive distinct basis elements. The countable sum λ:=∑a∈Z(f)ord⁡a(f) δa is a positive Borel measure by [F5], locally finite by the compact finiteness just proved. The open set Ω is second-countable and locally compact Hausdorff by [F8]; Dependent Choice supplies the Countable Choice of [F7], so λ is Radon.

2.2step 1.2F1F2F3F4

For each Di from step 1.2, either f has no zero, or it has exactly one zero ai of order mi. In the latter case the local factorization [F1] extends Fi(z):=f(z)/(z−ai)mi holomorphically and without zeros throughout Di; in the zero-free case set Fi:=f and mi:=0. Then u=milog⁡∣z−ai∣+log⁡∣Fi∣ on Di when mi>0, and u=log⁡∣Fi∣ when mi=0. By [F2], log⁡∣Fi∣ is harmonic, so its Riesz functional vanishes by [F4]; the point-mass normalization [F3] therefore gives μu(φi)=miφi(ai)=∫φi dλ when mi>0, and both sides are zero when mi=0.

3.1step 1.2step 2.2

Summing the local identities of step 2.2 over the finite partition φ=∑iφi from step 1.2 gives μu(φ)=∑iμu(φi)=∑i∫φi dλ=∫φ dλ for every φ∈Cc∞(Ω).

4.1step 2.1step 3.1F3∎

Since λ is a positive Radon measure by step 2.1 that represents μu on all smooth compactly supported tests, the uniqueness clause of [F3] gives μu=λ=∑a∈Z(f)ord⁡a(f)δa, which is the asserted formula; in particular every compact subset of Ω∖Z(f) carries no λ-mass, so log⁡∣f∣ has no Riesz mass off the zero set.

Remarks

The vanishing order is exactly the Riesz mass. Step 3.1 shows the mass at a zero a is the order m=ord⁡a(f), not merely a positive integer: the factor mlog⁡∣z−a∣ contributes mδa through the normalization Δlog⁡∣z−a∣=2πδa, while the zero-free factor F contributes nothing.

Finite local cover. Each compact test support is covered by finitely many discs on which the zero divisor has at most one point. A finite smooth partition subordinate to this cover reduces the distributional identity to the local factorization at each zero.

Choice. Dependent Choice is used through Countable Choice in the Riesz representation, kernel-normalization and local-regularity suppliers, and through the Bolzano–Weierstrass accumulation step. The finite cover, cutoffs, factorization and harmonicity calculations use no further choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

170 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