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.
Variable-degree conforming hp spaces on matching affine meshes
Definition
Let and let be a finite matching affine simplicial mesh of a bounded polyhedral open set in the sense of Matching affine simplicial meshes and shape regularity. A degree map is a function with finite values. The broken simplex space associated with is
where and denotes restrictions of real polynomials of total degree at most . Its conforming hp space is the subspace of functions whose two polynomial traces agree on every interior facet. The zero-boundary hp space further requires the polynomial trace to vanish on every boundary facet. For an interior facet , its trace degree is ; equality of the two traces means that their common polynomial belongs to .
A matching affine tensor-box mesh is a finite face-to-face partition of a bounded polytope into affine images of , with pairwise disjoint interiors. For a scalar degree on each box, the local tensor space is , the pullback of polynomials of degree at most in each reference coordinate. The conforming box hp space is defined by equality of polynomial traces across every shared face, and its zero-boundary subspace by zero traces on the exterior faces. For a shared face , set ; its common trace lies in in tangential reference coordinates. This definition of tensor boxes does not include curved or non-affine cells.
On either mesh, h-refinement replaces one cell by a finite matching partition of that cell and assigns degrees to the children; p-refinement raises at least one cell degree while leaving the mesh fixed; hp-refinement performs both operations. A local polynomial basis is hierarchical if its ordered degree layers span the nested spaces (or ), with each new layer extending the preceding span. For example, pullbacks of reference monomials ordered by give such a basis for , and tensor monomials ordered by give one for . This basis convention does not assert stability of a particular basis or projector.
Depends on
Used by
- Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature Definition
- A reentrant-corner mode separates fixed-degree h error from hp error Example
- Constructive varying-degree triangle interpolation in unweighted H1 Lemma
- Matching variable-degree polynomial traces give an H1 function Lemma
- Uniform-degree polygon corner spaces have cubic degree-of-freedom growth Lemma
- Analytic data converge exponentially under fixed-mesh p refinement Theorem
- Cea transfers the fixed-mesh analytic p rate to the energy error Theorem
- Degree-explicit polynomial trace inverse inequality on simplices Theorem
- Exponential hp energy convergence for weighted-analytic polygon corners Theorem
- Galerkin energy error with local h, trace degree and Sobolev regularity Theorem
- GLL quadrature changes only the top Legendre modes and is p-uniformly equivalent Theorem
- GLL spectral-element energy error retains the quadrature defect Theorem
Dependency tree · one level
1 result within one dependency step 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
- Leszek F. Demkowicz, Mathematical Theory of Finite Elements, §3.1.4, Hierarchical Shape Functions (standard reference, not scraped)
- Martin Vohralík, Finite Element Methods, Chapter 6, hp finite elements (standard reference, not scraped)