Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

Canonical Green kernels are unique, symmetric and domain monotone

Statement

Assume Countable Choice. Let Ω be a Greenian plane domain (The canonical Green kernel of a plane domain). Then:

  1. a canonical Green kernel is unique: if a pointwise least logarithmic-pole candidate at a∈Ω exists, it is unique, so the notation gΩ(⋅,a) is unambiguous;
  2. symmetry: gΩ(z,a)=gΩ(a,z) for all distinct a,z∈Ω;
  3. domain monotonicity: if Ω1⊆Ω2 are Greenian plane domains and a,z∈Ω1 are distinct, then gΩ1(z,a)≤gΩ2(z,a). The inequality is in this direction: enlarging the domain increases the Green kernel.

Countable Choice is used only through the cited bounded-domain existence theorem and the cited PDE Green symmetry theorem.

Facts & Assumptions

Given: Countable Choice (The Axiom of Countable Choice (ACω)); a Greenian plane domain Ω (The canonical Green kernel of a plane domain), so Ω is a nonempty connected open set with Ω≠C (A complex domain is a nonempty connected open subset of C); harmonicity in the sense of Plane harmonic functions; and distinct points x,y∈Ω in the symmetry part.

[F1]

A logarithmic-pole candidate at a on a proper plane domain is a nonnegative function on Ω∖{a} that is harmonic there and whose sum with log⁡∣z−a∣ extends harmonically across a; the canonical Green function is the pointwise least candidate, when such a member exists, a pointwise least member is unique, and Ω is Greenian when gΩ(⋅,a) exists for every a∈Ω (The canonical Green kernel of a plane domain).

[F2]

Assume Countable Choice. If D is a bounded complex domain and p∈D, then with Fp(z):=−log⁡∣z−p∣, bp:=Fp∣∂D and hp:=Hbp one has gD(z,p)=Fp(z)−hp(z) is the canonical positive Green kernel of D at p, and −ΔzTgD(⋅,p)=2πδp as distributions on D (Green functions exist on all bounded plane domains).

[F3]

Every plane domain admits an increasing sequence D1⊆D2⊆⋯ of relatively compact connected open subsets whose boundaries are real-analytic regular in the one-sided sense: for every ζ∈∂Dj there are a neighbourhood U of ζ and a real-analytic function g of one real variable with, after relabelling the two coordinate axes if necessary, ∂Dj∩U={(x,y)∈U:y=g(x)} and Dj∩U one of the two connected components of U∖{(x,y)∈U:y=g(x)}. Every compact K⊆Ω lies in Dj for all sufficiently large j, and if A⊆Ω is finite the sequence may be chosen with A⊆D1 (Analytic-boundary exhaustion of a plane domain).

[F4]

Let D be a bounded complex domain whose boundary is a compact real-analytic curve, locally parametrized by a real-analytic γ with γ′(0)≠0 and D on one side. Then for a∈D the Perron corrector ha:=−log⁡∣⋅−a∣−gD(⋅,a) extends to a function of class C2 on D‾; consequently gD(⋅,a)=−log⁡∣⋅−a∣−ha extends to a C2 function on D‾∖{a} whose trace on ∂D is identically zero (Green correctors are smooth at analytic boundaries).

[F5]

Assume Countable Choice. Let n≥2 and let Ω⊂Rn be a bounded C1 domain carrying a Dirichlet Green function GΩ for −Δ whose designated harmonic correctors satisfy Hy∈C2(Ω‾); then GΩ(x,y)=GΩ(y,x) for all distinct x,y (Symmetry of the Dirichlet Green function).

[F6]

Assume Countable Choice. A Dirichlet Green function for −Δ on Ω is a function GΩ on pairs of distinct points such that for each pole y there is a harmonic Hy with Hy=Φ(⋅−y) on ∂Ω and GΩ(x,y)=Φ(x−y)−Hy(x), such that GΩ(⋅,y) is harmonic off y with zero boundary trace, and such that −ΔTGΩ(⋅,y)=δy in D′(Ω) (Dirichlet Green function for minus Laplacian).

[F7]

A bounded C1 domain is a nonempty bounded open set whose boundary is locally, after a rigid change of coordinates, the graph of a C1 function with the set locally exactly the corresponding subgraph; connectedness is not required (Bounded C1 domains and their outward normals).

[F8]

Assume Countable Choice and n≥2. The fundamental solution is Φ(x)=∣x∣2−n/((n−2)ωn−1) for n≥3 and Φ(x)=−(2π)−1log⁡∣x∣ for n=2, x≠0 (Fundamental solution for the positive operator minus Laplacian).

[F9]

An increasing sequence of harmonic functions on a complex domain either tends to +∞ at every point or converges locally uniformly to a harmonic limit (An increasing harmonic sequence converges locally uniformly to a harmonic limit or diverges to +infinity).

[F10]

A harmonic function on a punctured disc that is bounded on that punctured disc extends harmonically across the puncture (A bounded harmonic function near an isolated puncture extends harmonically).

[F11]

Countable Choice: every family (Xn) of nonempty sets indexed by N has a choice function (The Axiom of Countable Choice (ACω)).

[F12]

The function log⁡∣⋅∣ is harmonic on C∖{0} (Logarithmic modulus is harmonic off its centre), and precomposition of a harmonic function with a holomorphic map is harmonic (Plane harmonicity is preserved by holomorphic and antiholomorphic changes of coordinate); hence z↦log⁡∣z−p∣ is harmonic on C∖{p}.

[F13]

A harmonic function is C2 with Δu=0 (Plane harmonic functions), and finite sums of C2 functions are C2 with linear Laplacian (Ck Euclidean maps are closed under componentwise algebra and composition); hence sums and differences of harmonic functions are harmonic.

[F14]

Assume Countable Choice. The map f↦Tf is complex-linear from Lloc1 into distributions, distributional differentiation is linear and continuous on D′(Ω), and it extends classical smooth differentiation (Locally integrable functions embed in distributions, Distributional differentiation is continuous and commutes).

[F15]

A real-analytic function of one real variable is locally the sum of a convergent power series (A real-analytic function on an open subset of R is locally represented by a convergent real power series), and such sums have derivatives of every order (A power-series sum is infinitely differentiable inside its radius and satisfies an=f(n)(c)/ι(n!) at its centre); hence a real-analytic function is C1.

Proof

technique · direct
1.1F1

By [F1] the canonical Green function on a Greenian Ω is defined as the pointwise least member of the family of logarithmic-pole candidates at a, and the definition records that a pointwise least member is unique; hence whenever it exists it is unique, as claimed in clause 1.

1.2F1

Domain monotonicity. Let Ω1⊆Ω2 be Greenian plane domains and let a,z∈Ω1 be distinct. The restriction of gΩ2(⋅,a) to Ω1∖{a} is a logarithmic-pole candidate at a on Ω1: it is nonnegative, it is harmonic on Ω1∖{a}⊆Ω2∖{a}, and the corrector gΩ2(⋅,a)+log⁡∣⋅−a∣ agrees with a harmonic function on Ω2 by [F1] whose restriction to Ω1 is harmonic, so the sum extends harmonically across a inside Ω1. Leastness of gΩ1(⋅,a) gives gΩ1(z,a)≤gΩ2(z,a), which is clause 3.

1.3F3F11

Symmetry setup. Assume Countable Choice and fix distinct x,y∈Ω. Apply [F3] with the finite set A={x,y}: there are relatively compact connected open subsets D1⊆D2⊆⋯ of Ω with {x,y}⊆D1, real-analytic regular one-sided boundaries, and every compact subset of Ω contained in Dj for all large j.

2.1F3F4F7F15step 1.3

For each j, Dj is a bounded complex domain, its boundary is a compact real-analytic curve in the sense of [F4], and Dj is a bounded C1 domain in the sense of [F7]. Indeed Dj is nonempty, open, connected and relatively compact, hence bounded; for ζ∈∂Dj the regularity of [F3] provides U and a real-analytic g with ∂Dj∩U={(x,y)∈U:y=g(x)} and Dj∩U equal to one of the two components of U∖{(x,y)∈U:y=g(x)}. Parametrizing that graph, after translating the parameter, by γ(t):=(t,g(t)) gives a real-analytic curve with γ′(t)=(1,g′(t))≠0 for which Dj∩U is one of the two components of U∖γ, so [F4] applies; and since g is C1 by [F15], after relabelling the axes and if necessary reflecting one of them the boundary is locally a C1 graph with Dj locally the corresponding subgraph, which is the structure required by [F7].

2.2F1F3step 1.2step 1.3

Fix a pole p∈{x,y} and z∈Ω∖{p}. Since the sequence exhausts Ω and z is an interior point, z∈Dj for all large j, and {p}⊆D1; step 1.2 applied to the Greenian domains Dj⊆Dj+1 shows gDj(z,p)≤gDj+1(z,p), and applied to Dj⊆Ω it shows gDj(z,p)≤gΩ(z,p), a finite bound by [F1]. Hence the limit up(z):=lim⁡j→∞gDj(z,p) exists and lies in [0,gΩ(z,p)].

3.1F2F4step 2.1

For each j and each pole p∈{x,y} the canonical kernel gDj(⋅,p) exists by [F2] because Dj is a bounded complex domain, and [F4] applied to D=Dj shows that the Perron corrector hp(j):=−log⁡∣⋅−p∣−gDj(⋅,p) is harmonic on Dj, extends to C2(Dj‾), and that gDj(⋅,p)=−log⁡∣⋅−p∣−hp(j) extends to a C2 function on Dj‾∖{p} with trace identically zero on ∂Dj.

3.2F1F9F3step 2.2

The limit up is harmonic on Ω∖{p}. Let W⊆Ω∖{p} be nonempty, open and relatively compact; by [F3] there is j0 with W‾⊆Dj0, so (gDj0+n(⋅,p)∣W)n≥0 is an increasing sequence of harmonic functions on W bounded above by gΩ(⋅,p), which is finite by [F1]. The first alternative of [F9] is therefore impossible and the second applies: the limit is harmonic on W and the convergence is locally uniform there. As W is arbitrary, up is harmonic on Ω∖{p}.

4.1F2F6F8F14step 2.1step 3.1

For each j, Gj:=gDj/(2π) with correctors Hp(j):=hp(j)/(2π) is a Dirichlet Green function for −Δ on Dj in the sense of [F6] with designated C2(Dj‾) correctors. Correctors: for z∈Dj∖{p}, Φ(z−p)−Hp(j)(z)=−12πlog⁡∣z−p∣−12πhp(j)(z)=12π(−log⁡∣z−p∣−hp(j)(z))=12πgDj(z,p)=Gj(z,p) by [F8] and step 3.1, and Hp(j) is harmonic with Hp(j)=Φ(⋅−p) on ∂Dj because gDj(⋅,p) has zero boundary trace; harmonicity off the pole and the zero trace of Gj(⋅,p) are step 3.1. Dirac identity: by [F2] and step 2.1, −ΔTgDj(⋅,p)=2πδp in D′(Dj), and linearity of the embedding and of distributional differentiation [F14] gives −ΔTGj(⋅,p)=12π(−ΔTgDj(⋅,p))=δp.

4.2F1F10F12F13step 3.1step 2.2step 3.2

The limit up is a logarithmic-pole candidate at p on Ω: it is nonnegative by step 2.2, harmonic by step 3.2, and Φp:=up+log⁡∣⋅−p∣ is harmonic on Ω∖{p} by [F12] and [F13]. Near p the function Φp is bounded: below, up≥gD1(⋅,p) by step 2.2, so Φp≥gD1(z,p)+log⁡∣z−p∣=−hp(1)(z) by step 3.1, and hp(1)∈C2(D1‾) is bounded on a neighbourhood of p; above, up≤gΩ(⋅,p) by step 2.2, so Φp≤gΩ(z,p)+log⁡∣z−p∣, and the right-hand side is harmonic on Ω, hence bounded on a neighbourhood of p by [F13]. Thus Φp is harmonic and bounded on a punctured disc about p, and [F10] extends it harmonically across p; so up+log⁡∣⋅−p∣ extends harmonically to Ω and up is a candidate in the sense of [F1].

5.1F5step 2.1step 4.1

Symmetry on the exhaustion domains. [F5] applies to the bounded C1 domain Dj of step 2.1, to the Dirichlet Green function Gj of step 4.1 and to its correctors Hp(j)∈C2(Dj‾): hence Gj(u,v)=Gj(v,u) for all distinct u,v∈Dj, and multiplying by 2π, gDj(u,v)=gDj(v,u).

5.2F1step 2.2step 4.2

Identification of the limit. Leastness of gΩ(⋅,p) among the candidates on the Greenian domain Ω [F1] gives gΩ(⋅,p)≤up, while step 2.2 gives up(z)≤gΩ(z,p) for every z∈Ω∖{p}; hence up=gΩ(⋅,p), that is lim⁡jgDj(z,p)=gΩ(z,p) for every z∈Ω∖{p}.

6.1step 5.1step 5.2

Symmetry. Step 5.1 gives gDj(x,y)=gDj(y,x) for every j. Taking j→∞ and applying step 5.2 with p=y on the left and with p=x on the right yields gΩ(x,y)=gΩ(y,x), which is clause 2 for the given pair; as x,y were arbitrary distinct points of Ω, symmetry holds throughout.

7.1F2F5F11step 1.1step 1.2step 2.2step 3.1step 3.2step 4.2step 5.1step 5.2step 6.1∎

Choice accounting and scope. Countable Choice is used exactly through the bounded-domain existence theorem [F2], applied to each Dj in step 3.1, and through the PDE Green symmetry theorem [F5] in step 5.1; the exhaustion [F3], the monotone bound of step 2.2, the Harnack limit of step 3.2, the removable-singularity step 4.2 and the comparison steps 1.1-1.2 and 5.2 use no choice principle. Steps 1.1-1.2, 6.1 establish the three clauses: 1.1 the uniqueness, 1.2 the domain monotonicity for arbitrary Greenian pairs, and 6.1 the symmetry for the Greenian Ω fixed in step 1.3.

Depends on

Used by

Dependency tree · two levels

154 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