Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

The canonical Green kernel of a plane domain

Definition

Let Ω⊂C be a proper plane domain, that is, a nonempty connected open set with Ω≠C (A complex domain is a nonempty connected open subset of C), and let a∈Ω. Moduli are those of Real and imaginary parts, complex conjugation, and modulus, and harmonicity is that of Plane harmonic functions.

Logarithmic-pole candidates. A function u:Ω∖{a}→R is a logarithmic-pole candidate at a when:

  1. u(z)≥0 for every z∈Ω∖{a};
  2. u is harmonic on Ω∖{a};
  3. u+log⁡∣z−a∣ extends harmonically across a: there is a harmonic function h on Ω with h(z)=u(z)+log⁡∣z−a∣(z∈Ω∖{a}).

The function h in clause 3 is the harmonic corrector of u at a; it is unique when it exists, because two harmonic functions on the connected open set Ω that agree on the nonempty open set Ω∖{a} agree on Ω.

Order. Candidates at a are compared pointwise on Ω∖{a}.

Canonical Green function. Suppose the family of candidates at a is nonempty. Its canonical Green function is its pointwise least member, when such a member exists: a candidate g with g≤u pointwise on Ω∖{a} for every candidate u. A pointwise least member is unique, and it is written z↦gΩ(z,a). If the family is empty, or if it is nonempty but has no pointwise least member, then gΩ(⋅,a) is not defined by this definition. The domain Ω is called Greenian when gΩ(⋅,a) exists for every a∈Ω.

The coefficient of log⁡∣z−a∣ is fixed to equal exactly one, so for the canonical kernel the corrector ha:=gΩ(⋅,a)+log⁡∣⋅−a∣ is harmonic on all of Ω and finite at a.

Remarks

  • Leastness is a genuine restriction. On the punctured disc Ω=D∖{0} with a≠0, if gΩ(⋅,a) exists then for every t>0 the function z↦gΩ(z,a)+tlog⁡(1/∣z∣) is another logarithmic-pole candidate at a. The added term is nonnegative on Ω and harmonic there by Logarithmic modulus is harmonic off its centre, so the corrector still extends harmonically across a≠0. The new candidate is strictly larger on Ω. Thus the candidate clauses alone do not designate a unique function on this domain; the pointwise least-member clause does.

  • Promised boundary behaviour. On a bounded domain the canonical kernel has zero limit at every regular boundary point, in the sense of Barriers and regular boundary points, and no pointwise limit is required or asserted at an irregular boundary point. Both statements are proved later on this page together with the existence theorem; they are not part of the definition and are not assumed here.

  • Normalization relative to the PDE kernel. The published kernel Φ(w)=−(2π)−1log⁡∣w∣ of Fundamental solution for the positive operator minus Laplacian satisfies 2πΦ(w)=−log⁡∣w∣, so twice-π times a Dirichlet Green function of that PDE page is a logarithmic-pole candidate with logarithmic coefficient one whenever the PDE correctors exist. The identification of the two normalizations, and the distributional identity −Δz gΩ(z,a)=2π δa, are not part of this definition: they are proved later on this page from that supplier.

  • Properness. The setting is a proper domain, Ω≠C; nothing below asserts the existence of a canonical kernel on the whole plane.

Depends on

Used by

Dependency tree · two levels

27 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