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 Dirichlet principle for the Poisson equation
Statement
Assume the Axiom of Choice (The Axiom of Choice), the ultrafilter lemma, DC and HB. Let , , be a bounded domain, let and let lie in the trace range of (The sharp trace theorem: boundedness and range in the fractional space, The fractional Sobolev space on a compact boundary). Put Then: (i) is strictly convex, coercive and weakly sequentially lower semicontinuous on (Convex and strictly convex functionals on a convex subset of a real vector space, Proper, coercive and weakly lower semicontinuous extended-real functionals), and attains its infimum at exactly one (The direct method for convex integral functionals, Strict convexity gives uniqueness of a minimiser); (ii) is the unique weak solution of the Poisson problem with trace in the sense of Weak Dirichlet solutions for a divergence-form operator, so that for every (The weak Euler-Lagrange equation for integral functionals with fixed trace, Existence and uniqueness for the weak Dirichlet Poisson problem, The inhomogeneous weak Dirichlet problem by a trace lifting); (iii) the classical one-directional Dirichlet principle holds: if satisfies in and , then for every (First Green identity, Classical solutions satisfy the weak formulation).
Facts & Assumptions
Given: The Axiom of Choice (The Axiom of Choice), the ultrafilter lemma, DC and HB; a bounded domain , ; ; in the trace range of with affine class ; and the energy .
The Axiom of Choice is explicitly assumed here because the trace, trace-kernel and weak-Poisson suppliers used below state their conclusions under AC (The Axiom of Choice).
The trace operator is bounded with for continuous , and (The trace operator on a bounded domain, The sharp trace theorem: boundedness and range in the fractional space, The fractional Sobolev space on a compact boundary).
is nonempty, convex and weakly closed, and equals for any right inverse (The affine Dirichlet trace class is nonempty, convex and weakly closed); (The kernel of the trace is the closure of the test functions, Zero-boundary Sobolev space as a norm closure).
The direct method for convex integral functionals: with , a Caratheodory integrand convex and lower semicontinuous in satisfying the upper growth bound with and the coercivity bound holds, the functional attains its infimum on ; if the integrand satisfies the differentiation hypotheses, every minimiser solves the weak Euler-Lagrange equation, and strict convexity of the integrand in makes the minimiser unique (The direct method for convex integral functionals, The weak Euler-Lagrange equation for integral functionals with fixed trace, Strict convexity gives uniqueness of a minimiser).
The weak Dirichlet solution of with trace is a class with and for every (Weak Dirichlet solutions for a divergence-form operator); such a solution exists and is unique, and agrees with the lifting construction (Existence and uniqueness for the weak Dirichlet Poisson problem, The inhomogeneous weak Dirichlet problem by a trace lifting).
Poincare's inequality on with constant (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction); carries the Sobolev norm and inner product (The notation and the reserved zero-boundary symbol, Integer-order Sobolev spaces and their norms, The Sobolev space is a Hilbert space).
If satisfies almost everywhere, first Green identity with gives because the boundary test vanishes (First Green identity). Holder bounds both pairings by a constant times , so density extends this identity to (Holder's inequality for integrals, including the endpoint cases, Zero-boundary Sobolev space as a norm closure). This does not require the classical solution itself to have zero trace; the zero-trace-only supplier Classical solutions satisfy the weak formulation is therefore not applied to .
The basic definitions: convex and strictly convex functionals, proper coercive weakly lower semicontinuous functionals (Convex and strictly convex functionals on a convex subset of a real vector space, Proper, coercive and weakly lower semicontinuous extended-real functionals).
Proof
The integrand and its bounds. Put . It is a Caratheodory integrand, jointly convex and continuous in , and the elementary inequality gives the upper bound , admissible with , and .
The coercivity bound with the smallness condition. Fix with ; Cauchy's inequality gives , which is the coercivity bound with , , and , ; the smallness condition holds by the choice of .
The direct method applies. By steps 1.1 and 1.2 the integrand satisfies all hypotheses of [F3] with ; the class is nonempty, convex and weakly closed by [F2]; hence attains its infimum at some , is coercive and weakly sequentially lower semicontinuous on .
Strict convexity of on . The functional is with and . The term is affine. The quadratic term is strictly convex on : if in then does not vanish almost everywhere, because by [F2], and Poincare [F5] would force if ; consequently for by the parallelogram identity. Hence is strictly convex on the convex set , and the minimiser of step 2.1 is unique by the strict-convexity uniqueness corollary Strict convexity gives uniqueness of a minimiser.
The weak Euler-Lagrange equation. The integrand satisfies the differentiation hypotheses with : and are continuous in , and with . Hence the conditional clause of [F3] applies to the minimiser : for every , that is .
Identification with the weak Dirichlet solution. By steps 2.1 and 3.2 the minimiser satisfies and for every ; this is exactly the weak Dirichlet solution of with trace in the sense of [F4], and by the uniqueness statement of [F4] it is the unique such solution. This proves (i) and (ii).
The classical one-directional principle. Let satisfy in and . Then by [F1] (the trace restricts continuous functions pointwise), so for every the difference has , that is by [F2]. By [F6], applied to the classical solution , one has . Expanding the energy, , with equality if and only if almost everywhere, that is by [F5]. Hence for every , the classical Dirichlet principle.
Depends on
- The Axiom of Choice
- The direct method for convex integral functionals
- The weak Euler-Lagrange equation for integral functionals with fixed trace
- Strict convexity gives uniqueness of a minimiser
- Convex and strictly convex functionals on a convex subset of a real vector space
- Proper, coercive and weakly lower semicontinuous extended-real functionals
- The affine Dirichlet trace class is nonempty, convex and weakly closed
- Weak Dirichlet solutions for a divergence-form operator
- Existence and uniqueness for the weak Dirichlet Poisson problem
- The inhomogeneous weak Dirichlet problem by a trace lifting
- Classical solutions satisfy the weak formulation
- First Green identity
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- Integer-order Sobolev spaces and their norms
- The $L^p$ trace operator on a bounded $C^1$ domain
- Differentiation of an integral functional under growth domination
- The kernel of the trace is the closure of the test functions
- Zero-boundary Sobolev space as a norm closure
- The fractional Sobolev space on a compact $C^1$ boundary
- The Sobolev space $H^1$ is a Hilbert space
- The sharp trace theorem: boundedness and range in the fractional space
- The notation $H^k$ and the reserved zero-boundary symbol
- Holder's inequality for integrals, including the endpoint cases
Used by
Dependency tree · two levels
123 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 (2026 author manuscript; complete 392-page archived text) (standard reference, not scraped)
- Viktor Grigoryan, Math 246B Partial Differential Equations, UCSB 2011 (complete 31-page course notes) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations, University of Illinois (complete 158-page graduate notes) (standard reference, not scraped)