Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Existence and uniqueness for the weak Dirichlet Poisson problem

Statement

Assume the Axiom of Choice, inherited through the Poincaré supplier named below, together with Countable Choice. Let Ω⊆Rn be open, nonempty and bounded in one direction, with Poincar'e constant CP for W01,2 (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction). For every F∈H−1(Ω) (The negative Sobolev space H−1(Ω)) there is a unique u∈H01(Ω) with ∫Ω∇u⋅∇v‾ dx=F(v)for every v∈H01(Ω), that is, the unique weak solution of −Δu=F with zero boundary values; it satisfies ∥u∥H01≤(1+CP2)∥F∥H−1,and∥Du∥L2≤(1+CP2)1/2∥F∥H−1. Here −Δ is the constant-coefficient operator Lu=−Δu of Uniformly elliptic divergence-form operators and their sesquilinear forms, and the solution is the Lax--Milgram solution for the form a0(u,v)=∫∇u⋅∇v‾.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice; an open, nonempty Ω⊆Rn bounded in one direction, with Poincar'e constant CP for W01,2; the form a0(u,v)=∫Ω∇u⋅∇v‾ dx on H01(Ω); and a functional F∈H−1(Ω), i.e. a bounded conjugate-linear functional on H01(Ω).

[F1]

H01(Ω) is a Hilbert space for the W1,2 inner product, and ∥u∥H012=∥u∥L22+∥Du∥L22 (The Sobolev space H1 is a Hilbert space, Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure).

[F2]

a0 is the principal form with aij=δij, hence bounded on H01 with bound M=1 and coercive with constant α=1/(1+CP2) (The elliptic form is well defined and bounded on H1, Coercivity of the principal Dirichlet form, Uniformly elliptic divergence-form operators and their sesquilinear forms).

[F3]

Poincar'e: ∥u∥L2≤CP∥Du∥L2 on H01, so ∥u∥H01≤(1+CP2)1/2∥Du∥L2 (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction).

[F4]

Lax--Milgram: bounded coercive forms on a Hilbert space with a bounded conjugate-linear datum have a unique solution, with α∥u∥≤∥F∥ for the coercivity constant α (The Lax--Milgram theorem, The negative Sobolev space H−1(Ω), Weak Dirichlet solutions for a divergence-form operator).

[F5]

Energy identity for any solution: testing with itself gives Re⁡a0(u,u)=Re⁡F(u) and α∥u∥H012≤Re⁡a0(u,u), so α∥u∥H01≤∥F∥ (Testing a coercive weak solution with itself gives the energy bound, Complex Lp classes and Euclidean test-function conventions).

Proof

1.1F1F2F4

Existence and uniqueness: by [F2] the form a0 is bounded and coercive on the Hilbert space H01(Ω); applying Lax--Milgram [F4] to the bounded conjugate-linear functional F∈H−1(Ω) gives a unique u∈H01(Ω) with a0(u,v)=F(v) for every v∈H01(Ω), that is, the weak solution of −Δu=F in the sense of the definition.

1.2F2F5algebra

First estimate: by [F5] applied with α=1/(1+CP2), ∥u∥H01≤(1+CP2)∥F∥H−1.

2.1F3F5step 1.2algebra

Gradient estimate: the same substitution read as an identity gives ∥Du∥L22=Re⁡a0(u,u)=Re⁡F(u)≤∥F∥ ∥u∥H01≤(1+CP2)1/2∥F∥ ∥Du∥L2 by Poincar'e [F3]; dividing by ∥Du∥L2 when it is nonzero (and trivially otherwise) gives ∥Du∥L2≤(1+CP2)1/2∥F∥H−1.

3.1step 1.1step 1.2step 2.1∎

Conclusion: for every F∈H−1(Ω) there is a unique weak solution of the zero-boundary Poisson problem, with the two displayed bounds; the solution is the Lax--Milgram solution for a0.

Depends on

Used by

Dependency tree · two levels

73 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