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.
Polynomial inverse and discrete trace inequalities
Statement
Assume Countable Choice. Fix polynomial degree , , and integers . Let the shape-regular affine simplex family be as in Matching affine simplicial meshes and shape regularity. For every cell in that family, there is a constant independent of cell size such that, for every and every facet , Use . Constants may depend on and the family shape regularity bound, but not on or .
Facts & Assumptions
Given: Countable Choice, the fixed reference simplex, a shape-regular affine mesh family, polynomial degree , the displayed exponents, and a cell polynomial .
On the fixed finite-dimensional polynomial space, when , and every facet norm is bounded by the cell norm, for all . (Polynomial derivative and face norms are controlled on a reference simplex)
Under an affine map, order- Sobolev seminorms acquire factors on pullback and on pushforward. Its oriented face area vector is . (Affine pullback of weak derivatives and Sobolev seminorms, Gauss–Green formula on an affine simplex)
Shape regularity gives , , , and each facet Jacobian is comparable to . (Shape regularity controls affine simplex geometry)
The reference polynomial norm result [F1] uses Sobolev norms whose definition assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
Pull back to . By [F1], and for each reference facet; finitely many facets allow one constant.
Apply the affine derivative estimates [F2] in both directions and then [F3]. For the cell inequality the total factor is bounded by For the face inequality it is bounded by the physical face Jacobian to power times the inverse cell Jacobian to power , namely . These are the two claimed estimates.
Depends on
- Matching affine simplicial meshes and shape regularity
- Reference finite elements and unisolvent degrees of freedom
- Polynomial derivative and face norms are controlled on a reference simplex
- Shape regularity controls affine simplex geometry
- Gauss–Green formula on an affine simplex
- Affine pullback of weak derivatives and Sobolev seminorms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Discrete inverse-trace bound for SIPDG coefficient fluxes Lemma
- Local inverse trace bound for a polynomial normal flux Lemma
- Reduction of the P1 residual estimator after marked refinement Lemma
- L2 projections are uniformly W1p-stable on quasi-uniform conforming meshes Theorem
- Local approximation and reproduction of the P1 moment interpolant Theorem
- Residual reliability and local efficiency for P1 AFEM Theorem
Dependency tree · two levels
22 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, Chapter 12 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4 (standard reference, not scraped)