Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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 ultraweak Poisson trial operator has trivial kernel

Statement

Assume Countable Choice. In the spaces of Ultraweak Poisson DPG spaces and plan-consistent bilinear form, if b(x,y)=0 for every broken test on a bounded connected Lipschitz domain, then x=(σ,u,u^,σ^n)=0.

Facts & Assumptions

Given: The DPG spaces, Countable Choice, and the zero pairing hypothesis.

[A1]

Countable Choice is declared for Sobolev traces. (The Axiom of Countable Choice (ACω))

[F1]

The form separates broken tests and fixes global trace ranges. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

Compatible traces are traces of global H1_0 and H(div) fields. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)

[F3]

Cell normal traces satisfy Green’s identity. (Weak normal trace by Green duality)

[F4]

The weak normal trace surjects onto the dual of the scalar trace quotient, so these functionals separate scalar trace classes. (Weak H(div) normal trace surjects onto the scalar trace dual)

[F5]

Sobolev first derivatives and divergence are defined distributionally, and H1_0 is the H1 closure of compactly supported smooth functions. (The real H(div) space, Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)

[F6]

Homogeneous Dirichlet Poincare holds. (A bounded-domain Poincare inequality for H1-zero fields)

Proof

1.1F1F5givenalgebra

Compactly supported vector tests on each cell give σ+∇u=0 distributionally; compactly supported scalar tests give divσ=0. Thus u∣K∈H1(K), σ∣K∈H(div;K), and both identities hold cellwise.

2.1F1F3F4step 1.1algebra

With σ=−∇u, the first local equation and [F3] give ⟨u^−u∣∂K,γnτ⟩=0 for every τ∈H(div;K). Surjectivity [F4] makes the scalar trace classes equal. The second local equation gives ⟨σ^n−γnσ,v⟩=0 for every v∈H1(K), so those normal-trace functionals are equal as well.

3.1A1F2F3F5F6step 1.1step 2.1algebra∎

Take a global H1_0 lift u0 of u^. On each cell, u−u0 has zero scalar trace, hence belongs to H01(K); zero-extending compactly supported approximants and summing over the finite mesh shows u−u0∈H01(Ω), so u∈H01(Ω). Take a global H(div) lift σ0 of σ^n. The cell field σ−σ0 has zero weak normal trace on every cell. Summing its local Green identities against restrictions of Cc∞(Ω) shows its piecewise L2 divergence is its global distributional divergence; thus it glues to H(div), and σ∈H(div;Ω). Now σ=−∇u and divσ=0; the weak Green identity tested with u∈H01 gives ∥∇u∥22=0. By [F6], u=0, then σ and both trace components vanish.

Depends on

Used by

Dependency tree · two levels

35 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