Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Ω⊆Rn, n≥2, be a bounded C1 domain, let f∈L2(Ω) and let g∈H1/2(∂Ω)=W1/2,2(∂Ω) lie in the trace range of T:H1(Ω)→H1/2(∂Ω) (The sharp trace theorem: boundedness and range in the fractional space, The fractional Sobolev space on a compact C1 boundary). Put I(u)=12∫Ω∣Du∣2 dx−∫Ωfu dx,Kg={u∈H1(Ω):Tu=g}. Then: (i) I is strictly convex, coercive and weakly sequentially lower semicontinuous on Kg (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 u0∈Kg (The direct method for convex integral functionals, Strict convexity gives uniqueness of a minimiser); (ii) u0 is the unique weak solution of the Poisson problem −Δu=f with trace g in the sense of Weak Dirichlet solutions for a divergence-form operator, so that ∫ΩDu0⋅Dφ dx=∫Ωfφ dx for every φ∈H01(Ω) (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 v∈C2(Ω‾) satisfies −Δv=f in Ω and v∣∂Ω=g, then I(v)≤I(w) for every w∈Kg (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 C1 domain Ω⊆Rn, n≥2; f∈L2(Ω); g∈H1/2(∂Ω) in the trace range of T:H1(Ω)→H1/2(∂Ω) with affine class Kg; and the energy I(u)=12∫Ω∣Du∣2dx−∫Ωfu dx.

[F0]

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).

[F1]

The trace operator T is bounded with Tu=u∣∂Ω for continuous u, and H1/2(∂Ω)=W1/2,2(∂Ω) (The Lp trace operator on a bounded C1 domain, The sharp trace theorem: boundedness and range in the fractional space, The fractional Sobolev space on a compact C1 boundary).

[F2]

Kg is nonempty, convex and weakly closed, and equals Rg+H01(Ω) for any right inverse R (The affine Dirichlet trace class is nonempty, convex and weakly closed); ker⁡T=H01(Ω) (The kernel of the trace is the closure of the test functions, Zero-boundary Sobolev space as a norm closure).

[F3]

The direct method for convex integral functionals: with p=2, a Caratheodory integrand convex and lower semicontinuous in (s,ξ) satisfying the upper growth bound with G∈L1(Ω) and the coercivity bound holds, the functional attains its infimum on Kg; if the integrand satisfies the differentiation hypotheses, every minimiser solves the weak Euler-Lagrange equation, and strict convexity of the integrand in (s,ξ) 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).

[F4]

The weak Dirichlet solution of −Δu=f with trace g is a class u∈H1(Ω) with Tu=g and ∫ΩDu⋅Dφ=∫Ωfφ for every φ∈H01(Ω) (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).

[F6]

If v∈C2(Ω‾) satisfies −Δv=f almost everywhere, first Green identity with φ∈Cc∞(Ω) gives ∫ΩDv⋅Dφ=∫Ωfφ because the boundary test vanishes (First Green identity). Holder bounds both pairings by a constant times ∥φ∥H1, so density extends this identity to H01(Ω) (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 v.

[F7]

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

technique · direct, by checking the hypotheses of the convex direct method for the Dirichlet integrand
1.1F5F7givenalgebra

The integrand and its bounds. Put f0(x,s,ξ):=12∣ξ∣2−f(x)s. It is a Caratheodory integrand, jointly convex and continuous in (s,ξ), and the elementary inequality ∣f(x)s∣≤12∣f(x)∣2+12∣s∣2 gives the upper bound f0≤12(1+∣s∣2+∣ξ∣2)+12∣f(x)∣2, admissible with p=2, C=12 and G=12∣f∣2∈L1(Ω).

1.2F5givenalgebra

The coercivity bound with the smallness condition. Fix ε>0 with 2εCP2≤18; Cauchy's inequality ∣f(x)s∣≤ε∣s∣2+14ε∣f(x)∣2 gives f0(x,s,ξ)≥12∣ξ∣2−ε∣s∣2−14ε∣f(x)∣2, which is the coercivity bound with ν=12, c=ε, q=p=2 and h=14ε∣f∣2≥0, h∈L1(Ω); the smallness condition 2p−1cCPp=2εCP2≤18=ν⋅2−p holds by the choice of ε.

2.1F3F2F0step 1.1step 1.2

The direct method applies. By steps 1.1 and 1.2 the integrand satisfies all hypotheses of [F3] with p=2; the class Kg is nonempty, convex and weakly closed by [F2]; hence I attains its infimum at some u0∈Kg, is coercive and weakly sequentially lower semicontinuous on Kg.

3.1F2F3F5F7F0step 2.1algebra

Strict convexity of I on Kg. The functional is I=Q−L with Q(u)=12∥Du∥22 and L(u)=∫fu. The term L is affine. The quadratic term Q is strictly convex on Kg: if u≠v in Kg then D(u−v) does not vanish almost everywhere, because u−v∈H01(Ω) by [F2], and Poincare [F5] would force u−v=0 if D(u−v)=0; consequently Q(λu+(1−λ)v)<λQ(u)+(1−λ)Q(v) for 0<λ<1 by the parallelogram identity. Hence I is strictly convex on the convex set Kg, and the minimiser u0 of step 2.1 is unique by the strict-convexity uniqueness corollary Strict convexity gives uniqueness of a minimiser.

3.2F3F5F0step 2.1

The weak Euler-Lagrange equation. The integrand f0 satisfies the differentiation hypotheses with p=2: f0,s=−f and f0,ξ=ξ are continuous in (s,ξ), ∣f0∣≤12(1+∣s∣2+∣ξ∣2)+12∣f∣2 and ∣f0,s∣+∣f0,ξ∣≤(1+∣s∣+∣ξ∣)+∣f(x)∣ with ∣f∣∈L2(Ω)=Lp′(Ω). Hence the conditional clause of [F3] applies to the minimiser u0: ∫Ω(Du0⋅Dφ−f(x)φ)dx=0 for every φ∈H01(Ω), that is ∫ΩDu0⋅Dφ=∫Ωfφ.

4.1F4F0step 2.1step 3.1step 3.2

Identification with the weak Dirichlet solution. By steps 2.1 and 3.2 the minimiser u0∈H1(Ω) satisfies Tu0=g and ∫ΩDu0⋅Dφ=∫Ωfφ for every φ∈H01(Ω); this is exactly the weak Dirichlet solution of −Δu=f with trace g in the sense of [F4], and by the uniqueness statement of [F4] it is the unique such solution. This proves (i) and (ii).

5.1F1F2F5F6F0step 4.1∎

The classical one-directional principle. Let v∈C2(Ω‾) satisfy −Δv=f in Ω and v∣∂Ω=g. Then Tv=g by [F1] (the trace restricts continuous functions pointwise), so for every w∈Kg the difference η:=w−v has Tη=0, that is η∈H01(Ω) by [F2]. By [F6], applied to the classical solution v, one has ∫ΩDv⋅Dη=∫Ωfη. Expanding the energy, I(w)−I(v)=12∫Ω(∣Dw∣2−∣Dv∣2)dx−∫Ωfη dx=12∫Ω∣Dη∣2dx+∫ΩDv⋅Dη dx−∫Ωfη dx=12∫Ω∣Dη∣2dx≥0, with equality if and only if Dη=0 almost everywhere, that is w=v by [F5]. Hence I(v)≤I(w) for every w∈Kg, the classical Dirichlet principle.

Depends on

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