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.
P1/R3 practical DPG quasi-optimality and residual estimator for Poisson
Statement
Assume Countable Choice. Let be any bounded connected Lipschitz polygon, including polygons with holes, and let be any finite conforming shape-regular triangular mesh. Use the exact two-dimensional P1/R3 practical family selected in PE30: volume fields and ; compatible global scalar traces of degree at most two on facets, zero on boundary facets; conservative global normal traces of degree at most one; and broken tests , with the graph inner product inherited from . The local Fortin projection is that of A uniformly bounded Fortin map for the practical P1/R3 DPG family, and is its operator norm bound. For each , the continuous ultraweak solution and practical solution exist uniquely, with For every , put , where is the dual of with its induced norm, and . Then and where and is the cellwise constant from the Fortin map's mean-preserving local estimate. The constants , , and are independent of mesh size for the fixed domain and shape-regular family. The practical corollary is two-dimensional; the continuous graph theorem also covers dimension three.
Facts & Assumptions
Given: Countable Choice, a bounded connected Lipschitz polygon, a finite conforming shape-regular triangular mesh, and .
Countable Choice is the hypothesis for the cited Hilbert and Riesz interfaces. (The Axiom of Countable Choice ())
The continuous graph theorem gives bounded invertibility and primal and adjoint inf-sup constants at least on every connected Lipschitz polygon, with no simple-connectivity assumption. (Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra)
The local P1/R3 Fortin map applies on shape-regular triangular meshes, has , preserves scalar cell means, and satisfies the local approximation bound. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)
The DPG bilinear form is bounded with . (The ultraweak Poisson DPG bilinear form is bounded)
The conditional practical-DPG theorem gives a unique discrete solution and quasi-optimality under the stated continuous inf-sup and Fortin hypotheses. (Fortin stability and quasi-optimality for practical DPG)
The conditional residual theorem gives reliability, efficiency and the Fortin data-oscillation estimate under the same hypotheses. (Practical DPG residual is reliable and efficient up to data oscillation)
The load is , the test norm includes , and the scalar skeleton trace is the trace of a global field. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)
Proof
Since , [F1] gives the unique continuous solution . The mesh and discrete spaces satisfy [F2] exactly: the dimension is two, the mesh is triangular, and the compatible scalar trace vanishes on boundary facets. Apply [F4] with ; using [F3] in its quasi-optimal constant gives the stated unique practical solution and factor . For , both solutions are zero by these uniqueness conclusions.
For any , apply [F5] with the same and Fortin map [F2]. Its reliability and efficiency inequalities give
For , cell-mean preservation gives , hence The local approximation bound in [F2] and Cauchy–Schwarz over cells give the displayed estimate. In particular the oscillation is zero when is cellwise constant. All constants depend on the fixed domain, polynomial degrees and mesh shape regularity, not on ; the graph proof makes no topological restriction, while this Fortin family is only the dimension-two branch.
Depends on
- Ultraweak Poisson DPG spaces and plan-consistent bilinear form
- Adjoint graph inf-sup for ultraweak Poisson on connected Lipschitz polyhedra
- The ultraweak Poisson DPG bilinear form is bounded
- A uniformly bounded Fortin map for the practical P1/R3 DPG family
- Fortin stability and quasi-optimality for practical DPG
- Practical DPG residual is reliable and efficient up to data oscillation
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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)