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 derivative and face norms are controlled on a reference simplex
Statement
Assume Countable Choice. Let , be the reference simplex, let be a finite dimensional -space of polynomial functions on it, let be any facet, and let integer . For there is a finite constant such that For every pair of integers , there is also a finite constant such that For finitely many facets, one constant works for all of them. In particular, every linear degree-of-freedom functional on is bounded with respect to the norm.
Facts & Assumptions
Given: Countable Choice; the reference simplex has nonempty interior and finite positive volume; has a finite ordered basis; Sobolev norms use the finite-derivative convention of Integer-order Sobolev spaces and their norms, and degrees of freedom use Reference finite elements and unisolvent degrees of freedom.
If a finite-dimensional real vector space has positive dimension, choose an ordered basis and pull both norms back to . The theorem on makes those pullbacks equivalent, and transporting the inequalities gives equivalence on ; the zero-dimensional case is immediate. (For all norms on are equivalent, Equivalent norms, and the dictionary with equivalent metrics)
On every finite-dimensional complex normed space, any two complex norms are equivalent. (All norms on a finite-dimensional complex normed space are equivalent, Equivalent complex norms)
A degree of freedom is a linear functional on the finite-dimensional polynomial space. (Reference finite elements and unisolvent degrees of freedom)
The Sobolev-space norm convention assumes Countable Choice. (The Axiom of Countable Choice ())
The canonical open simplex and its facets are defined by Matching affine simplicial meshes and shape regularity; in particular the cell has nonempty interior and positive finite volume, and each facet is a bounded nondegenerate simplex of positive finite surface measure.
Proof
The cell expression is a norm on . If it is zero, then for finite the continuous polynomial vanishes almost everywhere, and for it vanishes essentially everywhere. In either case, if it were nonzero at an interior point, continuity would make it bounded away from zero on an interior ball of positive measure, a contradiction. It therefore vanishes on the open simplex and hence is the zero polynomial, since its finite Taylor expansion at any interior point is exact.
If , all displayed estimates and functional bounds hold immediately, so assume . The expression is a norm: it is nonnegative, homogeneous and subadditive, and forces the cell norm to vanish, so the preceding argument gives . For real coefficients apply [F1], and for complex coefficients apply [F2], to and ; norm equivalence gives . Taking the maximum over the finitely many facets proves their uniform estimate. By [F3], any degree-of-freedom functional is linear on ; it is bounded for by finite-dimensional norm equivalence and hence by .
If , the second estimate is immediate. If , the second estimate is the derivative part of step 2.1 with its order there set to . If , let be the polynomials of degree at most . The seminorm vanishes exactly on : every monomial of degree at least has a nonzero derivative of order , and every derivative of order kills lower-degree monomials. It is therefore a norm on the finite- dimensional quotient . If this quotient is zero, then the target seminorm vanishes on all of because , so the estimate is immediate. Otherwise add the target seminorm to the quotient norm; it is well-defined because it also vanishes on . The sum is another norm. Applying [F1] or [F2] to these two norms bounds the target seminorm by the order- seminorm. This proves the second estimate.
Depends on
- Matching affine simplicial meshes and shape regularity
- Reference finite elements and unisolvent degrees of freedom
- Integer-order Sobolev spaces and their norms
- For $n \ge 1$ all norms on $\mathbb{R}^n$ are equivalent
- All norms on a finite-dimensional complex normed space are equivalent
- Equivalent norms, and the dictionary with equivalent metrics
- Equivalent complex norms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Quasi-uniform finite-element mass inverses have summable graph decay Lemma
- Local approximation and reproduction of the P1 moment interpolant Theorem
- Local interpolation estimates on shape-regular affine meshes Theorem
- Polynomial inverse and discrete trace inequalities Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
Dependency tree · two levels
50 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)