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.
SIPDG coercivity above the discrete inverse-trace threshold
Statement
Assume Countable Choice. Use the mesh, coefficient field, energy norm, and form of Symmetric interior-penalty DG form and energy seminorm, and let be the constant of Discrete inverse-trace bound for SIPDG coefficient fluxes. If , then Thus the discrete bilinear form is coercive with constant in the broken energy norm. For every , the finite-dimensional SIPDG system has a unique solution. The sufficient threshold depends on the polynomial degree, shape regularity, and coefficient ellipticity bounds; no universal penalty value is asserted.
Facts & Assumptions
Given: Countable Choice; ; symmetric cellwise constant with ellipticity bounds ; a finite matching shape-regular mesh; ; and the SIPDG form and energy norm.
The form is the cell energy minus the two symmetric flux-jump pairings plus . (Symmetric interior-penalty DG form and energy seminorm)
The squared coefficient-flux trace satisfies . (Discrete inverse-trace bound for SIPDG coefficient fluxes)
The broken energy expression is a norm on the finite-dimensional discontinuous polynomial space. (The SIPDG broken energy expression is definite)
Countable Choice is the explicit hypothesis in the inverse-trace and energy-norm suppliers [F2]–[F3]. (The Axiom of Countable Choice ())
The case of Holder's inequality gives . (Holder's inequality for integrals, including the endpoint cases)
Cauchy–Schwarz holds for every finite list of real numbers. (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation)
Proof
Put and . The integral Cauchy–Schwarz inequality [F5] on each facet, followed by [F6] on the finite weighted face sum and [F2] give .
By [F1], . Young's inequality gives , hence .
The coefficient matrix of in any basis of the finite-dimensional space is symmetric by [F1]. If its matrix kernel contained a nonzero vector, the corresponding would satisfy , contradicting [F3] and step 2.1. Therefore the square matrix is injective, hence invertible in finite dimension, so every load has exactly one solution.
Depends on
- Symmetric interior-penalty DG form and energy seminorm
- Discrete inverse-trace bound for SIPDG coefficient fluxes
- The SIPDG broken energy expression is definite
- Holder's inequality for integrals, including the endpoint cases
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
39 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)