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.
Practical DPG residual is reliable and efficient up to data oscillation
Statement
Assume Countable Choice. Assume the continuous trial-to-test operator is boundedly invertible with lower inf-sup constant , and let be the bounded Fortin map with . For any exact solution and any , define the practical residual estimator and Fortin data oscillation . Then For the stated P1/R3 Poisson Fortin map, , where ; it vanishes for cellwise constant .
Facts & Assumptions
Given: The continuous inf-sup bound, the bounded Fortin map, Countable Choice, and an arbitrary discrete approximation.
Countable Choice is declared for Hilbert Riesz representation. (The Axiom of Countable Choice ())
The DPG trial/test spaces and load functional are fixed by the formulation. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
The practical Fortin map preserves the trial form and has the local mean-preserving approximation bound. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)
The practical quasi-optimality theorem records the continuous inf-sup and boundedness hypotheses used here. (Fortin stability and quasi-optimality for practical DPG)
Hilbert Riesz gives unique representatives of bounded linear functionals and identifies their dual norms with the norms of those representatives. (Riesz representation for Hilbert spaces)
Proof
Let and let represent by Riesz. Choose an orthonormal basis of the finite-dimensional polynomial space and set . Then is orthogonal to , , and . Continuous inf-sup gives .
Riesz gives . For any , Fortin orthogonality gives ; take the dual norm and infimum to obtain the oscillation approximation bound.
Since , . Substitute for ; Fortin orthogonality kills , leaving . Hence . Combine with step 1.1 to get the reliability inequality.
For the Poisson load, mean preservation gives , so . By [F2], each difference is bounded by . Cauchy–Schwarz over cells yields the stated data oscillation; it is zero if every .
Depends on
Used by
Dependency tree · two levels
38 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)
- Carstensen, Demkowicz, and Gopalakrishnan, A Posteriori Error Control for DPG Methods (standard reference, not scraped)