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

Poisson kernel of a Euclidean ball

Statement

Assume Countable Choice and n≥3. For x∈BR(a), y∈∂BR(a), the negative outward boundary-slot normal derivative of the ball Green function is PR,a(x,y)=(R2−∣x−a∣2)/(Rωn−1∣x−y∣n). The formula defines a continuous function of (x,y) on BR(a)×∂BR(a).

Facts & Assumptions

Given: Countable Choice, an integer n≥3, a centre a∈Rn, a radius R>0, a point x∈BR(a) and a boundary point y∈∂BR(a).

[F1]

With ωn−1=∣Sn−1∣>0, the fundamental solution is Φ(z)=∣z∣2−n/((n−2)ωn−1) for z≠0 and n≥3 (Fundamental solution for the positive operator minus Laplacian).

[F2]

For a bounded C1 domain Ω carrying a Dirichlet Green function GΩ with correctors Hp∈C2(Ω‾), the boundary-slot normal derivative at x∈Ω, y∈∂Ω is ∂νyGΩ(x,y):=Dz(Φ(z−x)−Hx(z))∣z=y⋅νΩ(y), and the Poisson kernel is PΩ(x,y):=−∂νyGΩ(x,y) (Poisson kernel from a Dirichlet Green function).

[F3]

For BR(a) with n≥3 the Dirichlet Green function is G(x,z)=Φ(x−z)−(R/∣z−a∣)n−2Φ(x−z∗) for z≠a, where z∗=a+R2(z−a)/∣z−a∣2, and G(x,a)=Φ(x−a)−Φ(R); the designated corrector for a pole p is Hp(z)=(R/∣p−a∣)n−2Φ(z−p∗) for p≠a and Ha(z)=Φ(R), and G is symmetric (Dirichlet Green function of a Euclidean ball).

[F4]

BR(a) is a bounded C1 domain with outward unit normal ν(y)=(y−a)/R at every y∈∂BR(a) (Euclidean balls are bounded C-one domains with radial outward normal).

[F5]

D(g∘f)(p)=Dg(f(p))∘Df(p) when f is totally differentiable at p and g is totally differentiable at f(p) (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[F6]

Countable Choice ACω is the standing hypothesis (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF1F2F3F6

Work under [F6]. Put u:=x−a and w:=y−a, so that ∣u∣<R and ∣w∣=R; for x≠a put κx:=(R/∣u∣)n−2 and x∗:=a+R2u/∣u∣2, the inversion of x, while for x=a the corrector is the constant Ha=Φ(R) by [F3]. By [F3] the corrector for the pole x is Hx(z)=κxΦ(z−x∗) when x≠a; its value at y is well defined because x∗∉BR(a) and y∈∂BR(a) are different points, and Φ is smooth there by [F1]. Also DzΦ(z−x)∣z=y is defined because y≠x.

2.1givenstep 1.1algebra

Magnitude identity. Let x≠a. From x∗−a=R2u/∣u∣2 and y−x∗=(y−a)−R2u/∣u∣2 we get ∣y−x∗∣2=∣w∣2−2R2⟨w,u⟩/∣u∣2+R4/∣u∣2; multiplying by ∣u∣2 and using ∣w∣2=R2 gives ∣u∣2∣y−x∗∣2=R2∣u∣2−2R2⟨u,w⟩+R4=R2∣x−y∣2, because ∣x−y∣2=∣u−w∣2=∣u∣2−2⟨u,w⟩+R2. Hence ∣u∣∣y−x∗∣=R∣x−y∣>0.

2.2givenstep 1.1algebra

Vector identity. Let x≠a. Adding and subtracting u and using x∗−a=R2u/∣u∣2 gives (x−y)+∣u∣2R2(y−x∗)=(u−w)+∣u∣2R2(w−R2u∣u∣2)=u−w+∣u∣2wR2−u=−(1−∣u∣2R2)(y−a)=−R2−∣x−a∣2R2(y−a).

3.1step 2.1F1F5algebra

The gradient of each term of [F2] at z=y. By [F5] and [F1], the gradient of Φ is ∇Φ(ζ)=−∣ζ∣−nζ/ωn−1 for ζ≠0, since ∇∣ζ∣2−n=(2−n)∣ζ∣−nζ and the prefactor is 1/((n−2)ωn−1); hence DzΦ(z−x)∣z=y=−(∣y−x∣−n(y−x))/ωn−1=∣x−y∣−n(x−y)/ωn−1, and Dz[κxΦ(z−x∗)]∣z=y=−κx∣y−x∗∣−n(y−x∗)/ωn−1. By step 2.1, κx∣y−x∗∣−n=(R/∣u∣)n−2(∣u∣/R)n∣x−y∣−n=(∣u∣2/R2)∣x−y∣−n.

4.1step 2.2step 3.1algebra

The boundary-slot derivative. Subtracting the two expressions of step 3.1 and using step 2.2, Dz(Φ(z−x)−Hx(z))∣z=y=1ωn−1∣x−y∣−n[(x−y)+∣u∣2R2(y−x∗)]=−R2−∣x−a∣2ωn−1R2∣x−y∣n(y−a) for x≠a.

4.2step 3.1F1F2F3F4algebra

The case of the centre. For x=a the corrector is the constant Ha=Φ(R) of [F3], so Dz(Φ(z−a)−Ha)∣z=y=∇Φ(y−a)=−R−n(y−a)/ωn−1 by the gradient computation of step 3.1; dotting with ν(y)=(y−a)/R gives ∂νyG(a,y)=−R−n⋅R/ωn−1=−R1−n/ωn−1 and PR,a(a,y)=R1−n/ωn−1, which is exactly the formula (R2−∣a−a∣2)/(Rωn−1∣a−y∣n)=R2/(Rωn−1Rn).

5.1step 4.1F2F4algebra

The Poisson kernel. Dotting step 4.1 with ν(y)=(y−a)/R from [F4] gives ∂νyG(x,y)=−(R2−∣x−a∣2)(y−a)⋅(y−a)ωn−1R3∣x−y∣n=−R2−∣x−a∣2Rωn−1∣x−y∣n, because (y−a)⋅(y−a)=R2; hence by [F2], PR,a(x,y)=−∂νyG(x,y)=(R2−∣x−a∣2)/(Rωn−1∣x−y∣n) for x≠a.

6.1step 5.1step 4.2F2algebra∎

Steps 5.1 and 4.2 give PR,a(x,y)=(R2−∣x−a∣2)/(Rωn−1∣x−y∣n) for every x∈BR(a) and y∈∂BR(a). This explicit expression is continuous on BR(a)×∂BR(a): numerator and denominator are continuous there and the denominator Rωn−1∣x−y∣n is nonzero at every point of the product because an interior point x and a boundary point y are never equal, so ∣x−y∣>0. Hence the negative boundary-slot normal derivative of the ball Green function is the continuous function displayed in the statement.

Depends on

Used by

Dependency tree · two levels

48 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