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.
A bounded-domain Dirichlet Green function is unique and positive
Statement
Assume Countable Choice and . Let be bounded, nonempty, open and connected, and suppose a Dirichlet Green function as in Dirichlet Green function for minus Laplacian exists. Then it is unique and for every distinct . No boundary differentiability is needed, and existence is not asserted.
Facts & Assumptions
Given: The objects and hypotheses in the statement, the kernel fixed by Fundamental solution for the positive operator minus Laplacian, and correctors supplied by the Green-function definition.
Countable Choice, written , is an assumption of the Green and kernel conventions used here (The Axiom of Countable Choice ()).
For each pole, the Green definition supplies a corrector with boundary values and away from the pole (Dirichlet Green function for minus Laplacian).
The kernel is for and for , with (Fundamental solution for the positive operator minus Laplacian).
A real function on a bounded open set that is continuous on its closure and has has its closure maximum on the boundary (Weak maximum principle for the laplacian).
If instead , its closure minimum is on the boundary (Weak minimum principle for the laplacian).
For every there is an integer with (For every in a complete ordered field there is a natural with ).
Positive reciprocals reverse strict order: implies (Inverses of positives are positive, and reciprocation reverses order).
The natural logarithm is strictly increasing and onto , and for (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
Positive real powers obey the quotient and exponent laws (The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).
If , deleting one point from a nonempty connected open subset of leaves a nonempty, open, connected, path-connected set (Puncturing a connected open subset of preserves path-connectedness for ).
A harmonic function on a connected domain that attains a global maximum or minimum in the domain is constant (Strong maximum principle for harmonic functions).
For fixed , is harmonic away from , extends continuously to , and has zero boundary trace (Dirichlet Green function for minus Laplacian).
Mathematical induction applies to properties of natural numbers (The principle of mathematical induction).
The order on makes it a totally ordered field (The reals form a totally ordered field).
Positive elements of an ordered field are closed under multiplication; in particular, a product of nonnegative reals is nonnegative (Ordered field, The reals form a totally ordered field).
The Laplacian of a function is the sum of its pure second partial derivatives (The Laplacian of a function and of a vector field).
A function is harmonic exactly when its Laplacian is zero (The Laplacian of a function and of a vector field).
Total derivatives obey sum and scalar rules, and their coordinate partials are obtained by applying them to standard basis vectors; applying these facts twice gives linearity of each second partial of functions (Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives, A total derivative computes every directional derivative, and its matrix is the Jacobian).
Proof
Suppose and are two Green functions with correctors and . For fixed , is , and [F15]–[F16] give , so it is harmonic by [F17]; it is continuous on and zero on . The weak maximum principle [F3] gives , and the weak minimum principle [F4] gives . Hence and for all . This holds for every pole, proving uniqueness.
Fix . Continuity of at gives and such that whenever ; shrink if needed so .
Suppose , put and . For , induction on for the property starts with equality at ; if it holds at , then and by [F13, F14], so it holds at . Thus [F12] gives . By [F8], . Given , [F5] with gives with ; [F6] then gives . Thus implies . This proves as for every .
Suppose and put . For any , surjectivity in [F7] gives with . Apply [F5] to and then [F6] to obtain an integer . Whenever , [F6] gives , so [F7] yields . Hence as in dimension two as well.
By steps 1.3 and 1.4, choose so that whenever . Then on that punctured closed ball. This is the local strict positivity near the pole.
Let with and choose . The set is bounded, open, and contains . A point outside has a neighborhood either contained in or disjoint from , so . By [F11], is harmonic on and continuous on . Its boundary values are zero on and positive on by step 2.1. The weak minimum principle [F4] therefore gives . Points with already have strict positivity by step 2.1, so throughout .
By [F9], is a connected open set. The Green function is harmonic there by [F11], so its negative is harmonic by [F15]–[F17]. Step 3.1 gives there. Assume it vanishes at some [assume-contra]. Then attains its global maximum at that interior point. By [F10] it is constant on the punctured domain, contradicting the strict positivity near from step 2.1. Therefore whenever [contradiction, discharge-contradiction].
The argument treats and all separately, excludes and dimension zero by the hypothesis, and makes no boundary smoothness or existence claim. Countable Choice is retained exactly because the preceding Green and kernel conventions assume it; the maximum principles and puncture argument add no choice principle, and the pointwise thresholds use only the Archimedean property. There is no iff assertion.
Source notes
Teschl §5.4 Theorem 5.21, printed p.124, establishes uniqueness for the classical Dirichlet problem. Lemma 5.23, printed pp.126–127, assumes a bounded connected domain, proves Green positivity by using the blow-up at the pole and a strong minimum principle, and notes that connectedness is required for positivity. The proof here derives the power/log blow-up and punctured-domain connectedness explicitly; it uses weak minimum on the bounded punctured domains and the strong maximum principle on .
Schmidt §2.8 remarks (2)–(3), printed pp.44–45, derives uniqueness from uniqueness of the harmonic corrector and the weak maximum principle, then derives nonpositivity under . Here , so that sign comparison supports nonnegativity only; strict positivity is proved above.
Depends on
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Weak minimum principle for the laplacian
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Dirichlet Green function for minus Laplacian
- Fundamental solution for the positive operator minus Laplacian
- The Laplacian of a $C^2$ function and of a $C^2$ vector field
- Ordered field
- Inverses of positives are positive, and reciprocation reverses order
- Puncturing a connected open subset of $\mathbb{R}^n$ preserves path-connectedness for $n\ge2$
- The principle of mathematical induction
- Sums and scalar multiples of totally differentiable maps are totally differentiable with the expected derivatives
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The reals form a totally ordered field
- The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents
- A total derivative computes every directional derivative, and its matrix is the Jacobian
- Strong maximum principle for harmonic functions
- Weak maximum principle for the laplacian
Used by
Dependency tree · two levels
79 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
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2025 archived author manuscript) (standard reference, not scraped)
- Thomas Schmidt, Partial Differential Equations I (2026) (standard reference, not scraped)