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 for every broken test on a bounded connected Lipschitz domain, then .
Facts & Assumptions
Given: The DPG spaces, Countable Choice, and the zero pairing hypothesis.
Countable Choice is declared for Sobolev traces. (The Axiom of Countable Choice ())
The form separates broken tests and fixes global trace ranges. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Compatible traces are traces of global H1_0 and H(div) fields. (Ultraweak Poisson skeleton spaces are Hilbert trace quotients)
Cell normal traces satisfy Green’s identity. (Weak normal trace by Green duality)
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)
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)
Homogeneous Dirichlet Poincare holds. (A bounded-domain Poincare inequality for H1-zero fields)
Proof
Compactly supported vector tests on each cell give distributionally; compactly supported scalar tests give . Thus , , and both identities hold cellwise.
With , the first local equation and [F3] give for every . Surjectivity [F4] makes the scalar trace classes equal. The second local equation gives for every , so those normal-trace functionals are equal as well.
Take a global H1_0 lift of . On each cell, has zero scalar trace, hence belongs to ; zero-extending compactly supported approximants and summing over the finite mesh shows , so . Take a global H(div) lift of . The cell field has zero weak normal trace on every cell. Summing its local Green identities against restrictions of shows its piecewise divergence is its global distributional divergence; thus it glues to H(div), and . Now and ; the weak Green identity tested with gives . By [F6], , then and both trace components vanish.
Depends on
- Ultraweak Poisson DPG spaces and plan-consistent bilinear form
- Ultraweak Poisson skeleton spaces are Hilbert trace quotients
- Weak normal trace by Green duality
- A bounded-domain Poincare inequality for H1-zero fields
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Weak H(div) normal trace surjects onto the scalar trace dual
- The real H(div) space
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
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
- Jay Gopalakrishnan and Weifeng Qiu, An analysis of the practical DPG method (standard reference, not scraped)
- Leszek Demkowicz and Jay Gopalakrishnan, Analysis of the DPG method for the Poisson equation (standard reference, not scraped)
- Leszek Demkowicz, Mathematical Theory of Finite Elements (standard reference, not scraped)
- C. Carstensen, L. Demkowicz, and J. Gopalakrishnan, A Posteriori Error Control for DPG Methods (standard reference, not scraped)