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.
A direct Strang-type energy error estimate for SIPDG
Statement
Assume Countable Choice and the mesh, coefficient, penalty, and exact-solution hypotheses of Exact consistency of the symmetric interior-penalty DG form and SIPDG coercivity above the discrete inverse-trace threshold. Let be the unique discrete solution, so for every . Let be the constant in Discrete inverse-trace bound for SIPDG coefficient fluxes and put . Then for every , Consequently . The augmented approximation term retains the face-flux trace needed to bound the SIP consistency terms; no approximation rate is asserted without a separate bound on that term.
Facts & Assumptions
Given: Countable Choice; the exact solution and discrete solution satisfying the equations in the Statement; the coercivity threshold; and the mesh-dependent expressions and .
The form and energy expressions are defined on , which contains the cellwise exact solution and the broken polynomials. (Symmetric interior-penalty DG form and energy seminorm)
For the stated piecewise exact solution, for every . (Exact consistency of the symmetric interior-penalty DG form)
For every , . (Discrete inverse-trace bound for SIPDG coefficient fluxes)
The form obeys on , and is a seminorm there. (Boundedness of the SIPDG form in the augmented norm)
Countable Choice is used by the inverse-trace and physical-simplex Green suppliers [F3]–[F4]. (The Axiom of Countable Choice ())
Proof
The exact solution is cellwise and are broken polynomials, so and belong to . The boundedness constant for their form pairing is by [F5].
Fix and set . If , then is immediate. Otherwise, coercivity [F2], the discrete equation and exact consistency [F3] give . By [F4] and , . Apply [F5] and step 1.1 to obtain . Dividing by proves .
Since is a seminorm on by [F5], its triangle inequality and step 2.1 give . This holds for every , so taking the infimum proves both assertions.
Depends on
- Symmetric interior-penalty DG form and energy seminorm
- SIPDG coercivity above the discrete inverse-trace threshold
- Exact consistency of the symmetric interior-penalty DG form
- Discrete inverse-trace bound for SIPDG coefficient fluxes
- Boundedness of the SIPDG form in the augmented norm
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VIII, Chapter 38: Discontinuous Galerkin (standard reference, not scraped)
- Douglas N. Arnold, Franco Brezzi, Bernardo Cockburn, and L. Donatella Marini, Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems, SIAM Journal on Numerical Analysis 39(5) (2002) (standard reference, not scraped)