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.
Ultraweak Poisson DPG spaces and plan-consistent bilinear form
Definition
Assume Countable Choice. Let or , bounded connected Lipschitz polyhedral and a finite conforming shape-regular simplicial partition; all fields are real. For a load , put and , with squared broken graph norm . Let be the elementwise trace range of and the elementwise weak normal trace range of , each with global lift infimum norm; range membership is compatibility and normal traces are conservative across interior facets. Set , . For and , define Pairings sum over cell boundaries and use the cell-outward normal. The sign convention is , .
Axiom and interface note
Countable Choice is declared for Sobolev traces. The planar rotation identity is proved locally in Planar rotation carries H(div) normal traces to tangential traces; no 3D H(curl) trace result is imported.
Depends on
- The real H(div) space
- Affine simplicial meshes and RT/BDM spaces
- Weak normal trace by Green duality
- Planar rotation carries H(div) normal traces to tangential traces
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Exact local finite Riesz solves for practical DPG tests Algorithm
- Ideal Poisson DPG trial-to-test Riesz map Algorithm
- P1/R3 practical DPG quasi-optimality and residual estimator for Poisson Corollary
- A smaller constant test space gives a nontrivial practical DPG kernel Counterexample
- A topology-free bounded lifting of every ultraweak Poisson load Lemma
- A uniformly bounded Fortin map for the practical P1/R3 DPG family Lemma
- The ultraweak Poisson DPG bilinear form is bounded Lemma
- The ultraweak Poisson trial operator has trivial kernel Lemma
- Ultraweak Poisson skeleton spaces are Hilbert trace quotients Lemma
- Weak H(div) normal trace surjects onto the scalar trace dual Lemma
- Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra Theorem
- Fortin stability and quasi-optimality for practical DPG Theorem
- Ideal ultraweak Poisson DPG is the energy best approximation Theorem
- Practical DPG residual is reliable and efficient up to data oscillation Theorem
Dependency tree · two levels
26 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)