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 . For , , the negative outward boundary-slot normal derivative of the ball Green function is . The formula defines a continuous function of on .
Facts & Assumptions
Given: Countable Choice, an integer , a centre , a radius , a point and a boundary point .
With , the fundamental solution is for and (Fundamental solution for the positive operator minus Laplacian).
For a bounded domain carrying a Dirichlet Green function with correctors , the boundary-slot normal derivative at , is , and the Poisson kernel is (Poisson kernel from a Dirichlet Green function).
For with the Dirichlet Green function is for , where , and ; the designated corrector for a pole is for and , and is symmetric (Dirichlet Green function of a Euclidean ball).
is a bounded domain with outward unit normal at every (Euclidean balls are bounded C-one domains with radial outward normal).
when is totally differentiable at and is totally differentiable at (The chain rule for total derivatives: ).
Countable Choice is the standing hypothesis (The Axiom of Countable Choice ()).
Proof
Work under [F6]. Put and , so that and ; for put and , the inversion of , while for the corrector is the constant by [F3]. By [F3] the corrector for the pole is when ; its value at is well defined because and are different points, and is smooth there by [F1]. Also is defined because .
Magnitude identity. Let . From and we get ; multiplying by and using gives , because . Hence .
Vector identity. Let . Adding and subtracting and using gives
The gradient of each term of [F2] at . By [F5] and [F1], the gradient of is for , since and the prefactor is ; hence , and . By step 2.1, .
The boundary-slot derivative. Subtracting the two expressions of step 3.1 and using step 2.2, for .
The case of the centre. For the corrector is the constant of [F3], so by the gradient computation of step 3.1; dotting with gives and , which is exactly the formula .
The Poisson kernel. Dotting step 4.1 with from [F4] gives , because ; hence by [F2], for .
Steps 5.1 and 4.2 give for every and . This explicit expression is continuous on : numerator and denominator are continuous there and the denominator is nonzero at every point of the product because an interior point and a boundary point are never equal, so . Hence the negative boundary-slot normal derivative of the ball Green function is the continuous function displayed in the statement.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Fundamental solution for the positive operator minus Laplacian
- Poisson kernel from a Dirichlet Green function
- Euclidean balls are bounded C-one domains with radial outward normal
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Dirichlet Green function of a Euclidean ball
Used by
- Poisson extension fixes coordinate functions Example
- Quantitative concentration of the ball Poisson kernel Example
- Cap and complement estimate for the ball Poisson integral Lemma
- The ball Poisson kernel is positive and has unit mass Lemma
- Dimension split and the separate Poisson-disc theory Remark
- Continuous Dirichlet problem on a ball Theorem
- Harmonic functions are real analytic Theorem
- Interior derivative estimates for harmonic functions Theorem
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
- Thomas Schmidt, Partial Differential Equations I (2026) (standard reference, not scraped)
- Armin Schikorra, Partial Differential Equations I & II (2025) (standard reference, not scraped)
- Sung-Jin Oh, Lecture Notes for Math 222A: Partial Differential Equations (2023) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2025 archived author manuscript) (standard reference, not scraped)