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.
hp finite elements and spectral elements
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Approximation and Compactness in C(K)
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Céa and Aubin–Nitsche error estimates
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Convergence: Nets and Filters
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Surface Measure, Divergence, and Green Identities
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Harmonic Functions and Mean Values in Rn
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Outward rounded interval and ball arithmetic
- Pointwise Extended-Real Function Products
- Poisson Problems and Interior Harmonic Estimates
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Spectral collocation and Galerkin methods
- Spectral regularization and parameter choice
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Variational crimes and Strang lemmas
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
This page defines variable-degree spaces on matching affine simplicial and tensor-box meshes. It proves the p-explicit simplex inverse trace estimate, an ordinary Sobolev triangle projector, a degree-uniform strong-edge lift, and the resulting varying-degree conforming interpolant with its actual lowest shared-edge degree dependence. It also proves analytic fixed-mesh box p convergence, GLL p-uniform norm equivalence with the exact Strang defect retained, weighted pointwise corner bounds, and the full two-dimensional geometric hp energy rate. The corner proof uses its direct weighted and edge-lift suppliers and does not assume H2 regularity on singular caps. The local estimates concern affine cells. The declared same-frontier curved-mesh prerequisite supplies a separate geometric framework with its own mapping and transfer hypotheses; affine approximation and quadrature claims here do not assert curved-cell consistency.
The diagram records the trace-matching convention for two cells with unequal local degrees. The shared trace lies in the lower-degree face space; geometric adjacency alone does not impose conformity.
\begin{tikzpicture}[scale=0.9]
\draw[thick] (0,0) rectangle (2,1.4);
\draw[thick] (2,0) rectangle (4,1.4);
\draw[dashed] (2,0) -- (2,1.4);
\node at (1,0.75) {$K_1,\ p_1=3$};
\node at (3,0.75) {$K_2,\ p_2=5$};
\node[rotate=90] at (2.28,0.7) {$p_F=\min(p_1,p_2)$};
\draw[<->] (0,-0.25) -- (4,-0.25) node[midway,below] {$h$-refinement changes cell sizes};
\end{tikzpicture}
For a fixed tensor mesh, the integrated Legendre projector gives an explicit coefficient-based p estimate, and a reference-cell analytic derivative bound yields exponential p convergence. For polygonal corner singularities, the proved 2D branch uses nested matching shape-regular geometric corner meshes, at most triangles, and uniform total degree ; it yields an best-approximation and Galerkin energy rate for the stated weighted-analytic class. The general varying-degree Galerkin theorem now carries the local triangle comparison estimates through Céa, retaining each cell diameter, the minimum incident shared-edge degree, the Sobolev regularity and the actual continuity/coercivity constants. For arbitrary degrees at least one, piecewise H2 data already give an explicit first-order h energy estimate; more generally integer regularity gives when the effective trace degree is at least . For cellwise integer regularity , the additional p-dependent bound has times the proved factorial factor, bounded at sufficiently high trace degree by . Both the H1 norm and zero-Dirichlet gradient norm are covered. No optimal p rate or growth estimate for the -dependent constant is asserted.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Endpoint-preserving integrated Legendre projector
Definition
For and , define the degree- Legendre orthogonal projection
For , define the endpoint-anchored integrated projector
If an absolutely continuous function is represented as with , write . The finite sum and integral are defined for every such input; no choice axiom is used in this definition.
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.
Legendre-Gauss-Lobatto nodes are distinct and interior critical points are simple
Statement
For every integer , the Legendre polynomial has exactly simple roots in , and has exactly simple roots in , one between each consecutive pair of roots of . Consequently, the nodes consisting of , , and the roots of are pairwise distinct.
Facts & Assumptions
Given: An integer and the Legendre polynomials .
Legendre polynomials by Rodrigues' formula and their unweighted pairing: is a nonzero degree- polynomial.
Legendre polynomials have explicit norms and weighted derivative orthogonality: is orthogonal in unweighted to every polynomial of degree less than .
Rolle's theorem: if , is continuous on , differentiable at every point of , and , then for some : between two distinct zeros of a differentiable real function there is a zero of its derivative.
Proof
Suppose has only sign-changing roots in and set , with if . At each sign-changing root both and change sign, while at every other real root does not change sign; therefore has one constant sign on and is not identically zero. It is continuous and nonzero on some open interval, so its integral is nonzero. But , and [F2] gives , a contradiction. Thus has at least sign-changing roots in the open interval.
A degree- polynomial cannot have more than distinct roots. The roots obtained in step 1.1 therefore exhaust its degree; each has multiplicity one and there are no other roots. Rolle's theorem [F3] between consecutive roots gives distinct roots of in . Since has degree , these are all its roots and each is simple. None equals an endpoint, so adjoining and gives distinct nodes, including the case where there are no interior critical points.
Weighted Jacobi endpoint kernel on the reference interval
Statement
For an integer , put on and, for , define The quotient extends to a polynomial of degree . These polynomials are pairwise orthogonal in , with Consequently, for every the squared norm of endpoint evaluation on with this weighted norm is exactly .
Facts & Assumptions
Given: Integers and , the weight , and polynomials on .
The factor and its derivatives of orders vanish at both endpoints; integration by parts therefore has no boundary terms.
Proof
Apply Leibniz's rule to the th derivative in the definition. Every term differentiates at most times, so it contains a factor . After division the result is a polynomial. The original factor has degree and leading coefficient ; differentiating times and dividing by the leading term of shows that has degree and leading coefficient . The coefficient of in is , so its th derivative at zero is and .
If has degree below , multiply the Rodrigues formula by and integrate. Integrating by parts times is allowed by [A1] and gives , because . Thus is orthogonal to every lower-degree polynomial, and the degree conclusion in step 1.1 makes the family an orthogonal basis of each polynomial space.
For nonnegative integers , let . The case gives ; for , integration by parts with and gives . Iterating yields . Applying integrations by parts to the Rodrigues formula with gives . Since for some of degree below , where , orthogonality gives .
Write . By the endpoint and norm identities, Cauchy–Schwarz gives . Equality is attained by the polynomial : its endpoint value and squared norm both equal . Hence the evaluation norm squared is exactly the stated value.
Weighted simplex polynomial projection has explicit p-rates
Statement
Let be the reference simplex of Matching affine simplicial meshes and shape regularity, let have nonnegative real entries, and let , where are its barycentric coordinates. Give polynomials the inner product . Put and let in this weighted inner product. For a finite sum , , define
and define as the completion of these finite sums. If , its orthogonal degree truncation obeys
For , . These are estimates in the explicitly coefficient-defined scale ; they do not identify that scale with ordinary unweighted .
Facts & Assumptions
Given: A dimension , , real exponents , and degree .
The reference simplex is a bounded nondegenerate simplex with barycentric coordinates; its matching-mesh and reference-map conventions are fixed by Matching affine simplicial meshes and shape regularity.
is finite-dimensional, and is positive in the open simplex and integrable. Thus its weighted inner product is positive definite on polynomials.
Proof
Since in the interior, a nonzero polynomial cannot have weighted square integral zero: continuity gives a ball on which its absolute value is bounded below by a positive number. Integrability follows from on the bounded simplex. Hence the weighted inner product is positive definite on each finite-dimensional polynomial space. Orthogonal projection onto therefore gives the finite-dimensional orthogonal decomposition . The scale in the Statement is the completion of this orthogonal-sum norm, so its coefficient description and truncation are well-defined.
For a finite sum , orthogonality gives , because is increasing for . Taking square roots proves the tail estimate for finite sums.
Truncation is contractive in every coefficient norm , and finite sums are dense by the definition of the completion. The finite-sum estimate in step 2.1 therefore passes to every . If , each degree layer has , so term by term; summing proves the inverse estimate. Neither argument invokes a derivative norm, which is why neither implies an unweighted Sobolev estimate.
A degree-uniform polynomial edge lift with the strong edge norm
Statement
Assume Countable Choice. Let , let , and let be a real polynomial of degree at most satisfying . Define the polynomial by cancellation at , and put
Then , it equals on , and it vanishes on and . Moreover,
independently of . Permuting the three vertices gives the same bound, up to one fixed constant, for each reference edge. If is a shape-regular affine triangle, is an edge of length , and , the transported lift satisfies
Consequently continuous polynomial data on the three edges of a triangle, each of degree at most the cell degree, have a polynomial extension of that cell degree. The estimate uses the strong edge norm and asserts no optimal trace-lifting bound.
Facts & Assumptions
Given: Countable Choice; the reference triangle; a polynomial with the stated endpoint values; and, for the physical-cell assertion, a shape-regular affine triangle and one of its edges.
A shape-regular affine triangle is a nondegenerate affine simplex with diameter-to-inradius ratio bounded by a fixed constant; its affine map has singular values, determinant, edge Jacobian, and altitude controlled by the cell diameter. (Matching affine simplicial meshes and shape regularity, Shape regularity controls affine simplex geometry)
The Sobolev norm is the norm of the function and its weak first derivatives. (Integer-order Sobolev spaces and their norms)
Fubini applies to the finite integrable polynomial expressions on the reference triangle, and Cauchy–Schwarz bounds the one-dimensional polynomial integral. (Fubini's theorem for L^1 functions on a sigma-finite product, Cauchy–Schwarz: , with equality exactly for dependent pairs)
Countable Choice is the exact assumption used by [F1]; no arbitrary family of polynomial lifts is selected. (The Axiom of Countable Choice ())
Proof
Since , polynomial division gives a polynomial of degree at most when ; for or the endpoint conditions force . Thus has total degree at most . At , , so ; at it is zero; and on one has , so .
Put . Polynomial integration term by term gives , so Cauchy–Schwarz [F3] yields and hence . The identity gives . Also , so . Writing , the slices of are . Therefore and Fubini [F3] justifies the slice integrals. Using the Sobolev norm definition [F2], adding the three inequalities gives , proving the safe constant four.
Permute the reference vertices to obtain a lift on any selected edge; there are only six such affine maps, so the maximum of their fixed norm factors is independent of . Transport the reference estimate by the shape-regular affine map. The gradient change of variables is bounded by [F1], and the reference edge derivative norm is exactly scaled by . The physical norm has one additional factor bounded by by [F1]. This gives both stated estimates.
Let be continuous polynomial data on the three edges, with edge degrees at most . For , continuity makes one constant and that constant extends it. For , let be the affine interpolant of the three vertex values. Each edge residual vanishes at both endpoints and has degree at most . Lift the three residuals separately by step 1.1; each lift vanishes on the other two edges. Their sum plus therefore has trace exactly and degree at most . This works when edge degrees differ and requires no equal-degree assumption.
An ordinary derivative controls the Legendre tail with a factorial ratio
Statement
Assume the Axiom of Choice for the branch. Let be the real Legendre polynomial normalized by , and let be the orthogonal projection onto . For every integer , every integer , and every real-valued ,
For , every integer , and , . For the repeated derivative orthogonality identity is
Facts & Assumptions
Given: The Axiom of Choice; integers in the stated ranges; and a real-valued Sobolev class .
The Axiom of Choice is assumed only for the branch. (The Axiom of Choice)
The Rodrigues Legendre polynomials are mutually orthogonal in , have norm squared , and have degree with nonzero leading coefficient. (Legendre polynomials have explicit norms and weighted derivative orthogonality)
Polynomials are uniformly dense in the continuous real functions on (Polynomials are uniformly dense in for every closed interval), and smooth compactly supported functions are dense in (Smooth compactly supported functions of an open set are dense in ). Thus polynomials are dense in .
Every one-dimensional class on a bounded interval has an absolutely continuous representative satisfying ; this theorem assumes Full Choice. Apply it to . (One-dimensional functions have unique absolutely continuous representatives)
Cauchy–Schwarz makes each displayed polynomial pairing finite. Expanding the norm after subtracting a finite orthogonal projection gives Bessel's inequality without any infinite-dimensional projection theorem. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Proof
Fix and put . For , the polynomial has degree . Integrating by parts times moves the outer derivative block onto a polynomial and gives ; all boundary terms vanish because derivatives of of orders below vanish at both endpoints. The final polynomial paired with has degree at most , so [F1] makes the integral zero. The leading coefficient of is times the leading coefficient of . Orthogonality and the degree statement in [F1] therefore give , where .
For , integrate by parts times and use step 1.1 to obtain The first identity in [F1] makes this zero for and equal to for , proving the repeated derivative orthogonality formula.
Write . The absolutely continuous representatives in [F3] justify integrations by parts; all boundary terms vanish because has endpoint zeros of order . Step 1.1 then gives The functions are mutually orthogonal by step 2.1 and have squared norms . Applying finite Bessel inequalities to and then increasing the finite index set yields
Density [F2] and the best-approximation property of finite orthogonal projections imply in : first approximate by a polynomial and then take at least its degree. Orthogonality [F1] and Pythagoras give . Since increases for , step 3.1 bounds this tail by , which is the stated factorial estimate. When , the same finite Pythagoras identity directly gives contraction.
Analytic derivative bounds give exponential polynomial approximation on a triangle
Statement
Let be the closed reference triangle , where , or the closed interval , and let be real-valued. Write for restrictions of real polynomials of total degree at most on the triangle and degree at most on the interval. Say that is smooth up to when every partial derivative on the interior has a continuous extension to . Suppose that for some and ,
Use . Then constants , depending only on and the fixed reference domain, satisfy
For the interval branch there is also an endpoint-preserving polynomial whose derivative is the orthogonal projection of onto . It satisfies and after changing by constants depending only on .
Facts & Assumptions
Given: The fixed reference interval or triangle, the smoothness and factorial derivative bound in the statement, and .
Taylor's formula with Lagrange remainder holds along every segment contained in an open convex set. (Multivariable Taylor formula with a Lagrange remainder along a line segment)
Cauchy–Schwarz bounds the integral of a derivative over an interval of length one by its norm. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Multi-index order, factorial, monomial powers, and canonical partial derivatives have the conventions in the cited definition. ( maps and multi-index derivative notation in Euclidean space)
The fundamental theorem of calculus gives when is continuously differentiable on the interval, as it is here. (The second fundamental theorem: if is differentiable on with and is integrable, then )
Proof
For and integer define . Then , , and . If for fixed , Chernoff's bound follows directly from for : For sufficiently small fixed , the exponent per is negative uniformly because its derivative at is . Applying the same argument to the complementary lower tail gives exponential smallness of on . Differentiation telescopes to one binomial atom times ; away from the threshold its probability is bounded by the same tail estimate with gap for all sufficiently large , and increasing the constant covers the finitely many smaller . Thus and switch from exponentially small to across a strip of fixed width, and their derivatives outside that strip are .
Choose and a finite coordinate-grid cover of by boxes of radius with centers , . In each coordinate form a left increasing binomial factor with threshold and a right decreasing factor with threshold ; omit the left factor when its threshold is at most zero and the right factor when its threshold is at least one. Their product has degree at most , lies in , equals on the inner box of radius and its first derivatives there are ; outside the outer box of radius its value and first derivatives are . The omitted boundary factors require no suppression on a side where the outer box does not meet .
Let be the total-degree- Taylor polynomial at . When is on the boundary, take limits of interior centers; all derivatives extend continuously to . On the intersection of the outer box and , convexity keeps the Taylor segment inside the triangle, so [F1] and the multinomial formula give after enlarging for small . On all of , the coefficient formula for gives for a fixed depending only on .
Set and . Then and . At every point of some inner box applies, so one factor , together with its first derivatives, is exponentially small there; the product rule and give . Outside the outer box for a fixed , the same product rule gives .
Put . Since , the near-box and far-box bounds of steps 3.1 and 3.2 give Choose fixed with and , and let . Then the right side is at most . Each has degree at most , so has total degree at most . Choose ; for the finitely many with , the zero polynomial and an enlarged constant handle the claim. This proves the exponential estimate for every .
On the interval let be the orthogonal projection of onto and put . The positive-definite finite polynomial Gram matrix gives a unique projection; Pythagoras gives and for every . Orthogonality to constants gives , and [F4] evaluates the latter as . Thus , while by construction. The derivatives of satisfy a factorial bound with fixed constants and , since for . For , apply step 4.1 to with degree ; best approximation of the projection then gives , which is at most after changing constants. For , the derivative contraction and the bound give the same asserted estimate after enlarging . Finally and [F2] bounds its norm by . The derivative and value bounds prove the stated interval estimate.
Weighted analytic polygon functions have corner decay and scaled analytic bounds
Statement
Assume Countable Choice. Let be a bounded open polygonal domain with finitely many straight sides and corner set , with interior angle at each corner strictly between and . Let and write for a vector . For integer , define
where and a zero exponent contributes the factor one. Let for every integer , with real-valued weak derivatives, and suppose constants satisfy
For each fixed there are constants such that the weak class of has a unique representative , smooth up to every open side away from corners, and for ,
On every compact subset of , the derivatives satisfy ordinary factorial bounds . On every closed nondegenerate shape-regular affine triangle with and , whose ratio is bounded above and below by fixed positive constants, where , set . After subtracting a suitable constant from the pullback to the reference triangle of Matching affine simplicial meshes and shape regularity, for every multi-index , with constants uniform over this family. If a closed nondegenerate shape-regular affine triangle with , diameter , has a corner as a vertex, its vertex affine interpolant satisfies
Facts & Assumptions
Given: Countable Choice; the bounded polygon and its finite corner set; the weights ; the ordinary Sobolev class conventions of Integer-order Sobolev spaces and their norms; the stated weighted factorial bounds; and a fixed exponent as above.
Fubini applies to integrable functions on the finite rectangle patches used below. (Fubini's theorem for L^1 functions on a sigma-finite product)
Cauchy–Schwarz controls rectangle integrals, and the affine shape-regular bounds control pullbacks to triangles. (Cauchy–Schwarz: , with equality exactly for dependent pairs, Shape regularity controls affine simplex geometry)
A nonnegative smooth compactly supported bump equal to one on a smaller ball has finite positive integral; after normalization its dilates form an approximate identity. Convolution with each dilate is smooth and converges in together with weak derivatives through order two. (A smooth bump between concentric Euclidean balls, The mollifier family generated by a unit-mass smooth bump, An approximate identity on , A unit-mass smooth bump generates an approximate identity, Every approximate identity converges to the identity in for , Convolution with a mollifier is smooth, and derivatives pass under the integral sign)
Countable Choice is exactly the choice assumption in the mollifier measure interfaces and the selection of the compatible representatives of the countable family of weak derivatives. (The Axiom of Countable Choice ())
A nonempty open rectangle has positive Lebesgue measure; hence continuous representatives that agree almost everywhere agree on the interior and then on the closure. (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included)
Proof
On the unit square, for smooth the one-dimensional identity applied first in and then in gives by [F2]. For extend across by for small , and across by for small ; use the same two formulas in . The coefficients satisfy for values and for first normal derivatives. For a smooth test across , changing variables in the zeroth-order pairing gives , so . For the first normal derivative, the corresponding test combination is , also with . These formulas follow by rewriting the reflected integrals over and applying the chain rule. Multiply each combined test by a cutoff that is zero on and one on before using the weak derivative identity on the original open square. If , then on the strip because ; for any relevant , Cauchy--Schwarz bounds the cutoff error by . Thus the reflected piecewise formulas are the weak derivatives through order two, including mixed derivatives. Changes of variables bound each derivative norm by a fixed multiple of . Reflect successively across the four sides, cut off in the enlarged square, and mollify. For every weak derivative through order two, inserting a translated compactly supported kernel into its weak derivative identity gives on the original square: the sign from integration by parts cancels the sign from differentiating the kernel in its integration variable. Thus [F3] gives smooth approximants converging in . The smooth inequality makes them uniformly Cauchy, yielding a continuous representative and the same bound for every class. Scaling gives on a rectangle of side comparable to ; a parallelogram with fixed aspect ratio has the same estimate after an affine change of variables.
Choose so distinct corner balls of radius are disjoint and each meets only the two sides at its corner. For a point with , choose an interior rectangle, or near one straight side an inward rectangle, of diameter comparable to and lying in . A finite angular cover gives aspect ratios and widths bounded in terms of the fixed corner angles. For each individual weak derivative with , the weighted hypotheses imply on this rectangle. Apply the fixed second-order rectangle extension and estimate of step 1.1 to itself. In particular, the coefficients are not used to extend in arbitrary Sobolev orders and then differentiated across a reflecting side. The extension of each is needed only through order two, so its bound is fixed, independently of . On the annulus the other corner distances are bounded above and below, so at derivative order , . The weighted hypotheses at orders therefore bound , , and respectively by , , and . Fixed affine changes of coordinates contribute at most another fixed base to the power ; the boundedly many extra derivatives and their factorial factors are absorbed into . Multiplying these three norms by as in step 1.1 gives , uniformly up to an open side. On compact patches away from corners the same argument gives ordinary factorial derivative bounds. There apply step 1.1 also to and to each first derivative: their lower-order terms come from , while derivative orders two and three are bounded by the weighted hypotheses since the weights are bounded below on those patches. Thus and its gradient are bounded there, in particular on the fixed radius- arcs. These separately constructed continuous representatives of the weak derivatives agree on overlaps by [F4]. They are compatible as derivatives: on a smaller interior patch mollify itself, so each derivative converges locally in and therefore uniformly by step 1.1 to the representative of that weak derivative; the fundamental theorem along interior line segments passes to these uniform limits. All derivative identities then extend to an open side by continuity. Thus is smooth up to sides away from corners without an arbitrary-order reflected extension.
On the fixed arc of radius about , step 2.1 bounds . Along every ray, the Hessian bound in step 2.1 gives . If this is at most ; if it is at most . Since , both are bounded by for after decreasing if needed. Integrating radially shows that has a limit as and differs from it by at most . Variation along the circular arc of radius is at most , so the radial limits agree for all angles; call the common value . This also proves continuity at the corner. The first-derivative estimate gives the claimed bound for , while step 2.1 gives it for higher orders because .
For a regular triangle in the stated family, when its corner distance is sufficiently small compared with and the fixed upper bound for , all its points lie in a single corner neighborhood; choose the constant there; the pointwise derivative estimate and give after affine pullback and the chain rule. For the remaining triangles, their distance from all corners is bounded below by a fixed positive constant; choose the value at one point of as the constant; the compact-patch derivative bounds and bounded diameter give the same estimate after increasing . The affine geometry factors are controlled by [F2].
Let have vertex and diameter . On dyadic annuli , step 3.1 bounds by , while the area of each annulus is at most . Summing the resulting geometric series gives , hence . Every vertex value differs from by at most ; the barycentric gradients are bounded by and by shape regularity, so the vertex affine interpolant has gradient norm at most . The pointwise value estimate gives both errors at most . The triangle inequality proves the stated seminorm and full bounds.
Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature
Definition
Fix an integer . Let , , and let be the roots of in ; for this interior list is empty. By Legendre-Gauss-Lobatto nodes are distinct and interior critical points are simple these nodes are distinct. Define , set , and define the Legendre–Gauss–Lobatto rule by .
On its tensor rule is . For an affine box map , define the transported rule by . The nodal basis on is the pullback of . The local mass and stiffness forms are respectively and ; any sampled coefficient is evaluated at the same quadrature nodes. Global forms are assembled by summing the cell forms.
Uniform-degree polygon corner spaces have cubic degree-of-freedom growth
Statement
For , let a matching triangulation of a polygon have at most triangles. Assign a uniform total polynomial degree with . The algebraic space of continuous piecewise functions has dimension
where depends only on and . The same upper bound holds for any subspace imposing homogeneous boundary traces. This is an upper count only; it asserts no hp approximation rate.
Facts & Assumptions
Given: Integer , a matching triangulation with , and uniform degree .
Variable-degree conforming hp spaces on matching affine meshes: the continuous polynomial space is a linear subspace of the broken product of its cell polynomial spaces.
Proof
On a triangle, monomials with and form a basis of . Counting by total degree gives .
The broken product over therefore has dimension . By [F1], trace matching and any zero-boundary conditions define a linear subspace, whose dimension cannot exceed the broken dimension. Using and , and , gives for an explicit finite depending only on .
Matching variable-degree polynomial traces give an H1 function
Statement
Assume Countable Choice. On a finite matching affine simplicial mesh or a finite face-to-face affine tensor-box mesh, a piecewise polynomial scalar function whose two traces agree on every interior facet belongs to , and its weak gradient equals its ordinary cellwise polynomial gradient almost everywhere. The simplex degrees may vary by cell; the box degrees may also vary.
Facts & Assumptions
Given: Countable Choice; a finite matching mesh of affine simplices or affine tensor boxes; a real-valued function whose restriction to each cell is a polynomial of its assigned finite degree; equality of the two traces on every interior facet; and a test function .
Variable-degree conforming hp spaces on matching affine meshes: the mesh has finitely many cells, each cell restriction is a polynomial, and the conforming condition is equality of the polynomial traces on every whole shared facet.
Continuous matching piecewise polynomials belong to W1p: under Countable Choice, a finite matching affine simplicial mesh with a single finite polynomial degree and matching traces gives a member of whose weak gradient is cellwise.
Divergence for finite piecewise C1 presentations: under Countable Choice, cellwise Gauss–Green holds for a finite piecewise presentation, and the fluxes on a shared face cancel when the pieces are glued.
A weak derivative is characterized by integration against compactly supported smooth tests, and consists of classes with all first weak derivatives in . (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)
Proof
If the mesh is empty, its domain is empty by the mesh convention and the assertion is immediate. Otherwise, because the mesh and every local degree are finite, and each cellwise first derivative are bounded on each closed cell; a finite union then puts in . If the mesh is simplicial, set . Every restriction lies in , and the trace-matching condition is unchanged. Applying [F2] at the single degree proves the claim on this branch.
Suppose the cells are affine tensor boxes. Fix a coordinate . On each cell, apply [F3] to the smooth field ; its divergence is . Sum the finitely many resulting identities. At an interior face the two outward normals are opposite, because the adjacent cell interiors lie on opposite sides of its supporting hyperplane; the common trace in [F1] therefore makes the two fluxes cancel. The boundary-face terms vanish since has compact support in . Thus .
By [F4], step 1.2 says that is the weak th derivative of . This holds for every coordinate , and step 1.1 supplies ; hence with the stated cellwise weak gradient. Together with the simplex branch of step 1.1 this proves the assertion for both mesh types.
Integrated Legendre projection gives an explicit p-rate in H1
Statement
Assume Countable Choice. Let , , as defined in Legendre weighted spectral-Sobolev scale and projection, identified with its canonical class, and let . Define and by Endpoint-preserving integrated Legendre projector. Then and are absolutely continuous, , and . Moreover, where the displayed error norm is . This coefficient-scale assertion does not identify with an ordinary derivative-based Sobolev norm.
Facts & Assumptions
Given: Countable Choice, , , , and .
Endpoint-preserving integrated Legendre projector: is the degree- endpoint-anchored operator, with the finite Legendre projection.
Legendre weighted spectral-Sobolev scale and projection: is a coefficient completion with weights , so truncation is the finite projection from [F1] and its coefficient norm dominates the coefficient norm.
The indefinite integral of an function is absolutely continuous: the primitive of an function is absolutely continuous.
The indefinite integral of an function is differentiable almost everywhere: under Countable Choice, the derivative of the primitive of an function equals its integrand almost everywhere.
Cauchy–Schwarz: , with equality exactly for dependent pairs: the inner product obeys Cauchy–Schwarz.
Polynomials are uniformly dense in for every closed interval: polynomials are uniformly dense in .
Smooth compactly supported functions of an open set are dense in : is dense in .
Riesz-Fischer completeness of for : under Countable Choice, is complete.
Proof
By [F2], finite Legendre sums span all polynomials. The density facts [F8] and [F9] imply that polynomials are dense in : first approximate an class by a compactly supported smooth function, then approximate that function uniformly on by a polynomial. The coefficient norm at is the ordinary norm on finite Legendre sums by [F2]–[F3], and [F10] makes complete. Hence the identity on finite sums extends to an isometry from onto . Since each spectral weight for is at least its weight, [F3] gives a continuous embedding . Thus has the canonical class in the Statement, and Cauchy–Schwarz [F7] on the interval of length two gives . Then [F5] makes absolutely continuous. The definition [F1] makes the integral of a polynomial of degree at most , hence a degree-at-most- polynomial. By the finite projection formula in [F1] and Legendre orthogonality [F2], is orthogonal to constants, so and the endpoint values agree. The primitive defining is absolutely continuous by [F5].
Apply [F6] to the two primitives in step 1.1; their a.e. derivatives are and , so has derivative . By [F3] the finite projection is the truncation in [F1]; the tail estimate [F4] with gives . Since , ; Cauchy–Schwarz [F7] and integration over an interval of length two give . Therefore , proving the estimate.
Degree-explicit polynomial trace inverse inequality on simplices
Statement
Assume Countable Choice (The Axiom of Countable Choice ()), as required by the affine-scaling supplier used below.
Let be a nondegenerate -simplex, , let be one of its facets, and let . For every ,
If belongs to a shape-regular affine simplex family with and shape bound , then
For , the normal derivative of has degree at most on and satisfies the same inequalities with replaced by . In particular, polynomial normal-flux trace penalties have the explicit scale ; this is an inverse trace bound, not a p-approximation or a DG coercivity theorem.
Facts & Assumptions
Given: Countable Choice, a nondegenerate simplex , a face , an integer , and, for the scaled inequality, a shape-regular family.
Weighted Jacobi endpoint kernel on the reference interval: every degree- polynomial on satisfies .
The altitude from the opposite vertex to is , and the map has volume Jacobian for , .
Shape regularity controls affine simplex geometry: under shape bound , . The supplier assumes Countable Choice.
Fubini's theorem for L^1 functions on a sigma-finite product: the simplex-pyramid parameterization in [F2] permits integrating the bounded polynomial integrand first along and then over .
The mesh and polynomial-degree conventions for affine simplices are those of Variable-degree conforming hp spaces on matching affine meshes; in particular the unit normal to a flat face is constant.
Proof
Fix and let . This is a polynomial of degree at most in , and . Apply [F1] with , then integrate the resulting inequality over . In the map , each tangent direction in is scaled by , while the remaining component is the altitude ; hence the absolute volume Jacobian is , as stated in [F2]. By Fubini [F4], . This proves the exact reference-geometric inequality.
The cellwise normal derivative is a polynomial of degree at most . If it is zero. If , repeat step 1.1 with degree ; the endpoint factor becomes .
In a shape-regular family, apply [F3] to the factor in step 1.1 and in the same argument for . This gives both estimates. The only declared choice assumption is the Countable Choice required by [F3]; [F4] adds no choice hypothesis, and the linewise kernel uses finite-dimensional algebra.
Constructive ordinary Sobolev polynomial approximation on triangles
Statement
Assume the Axiom of Choice. Let , let be an integer, let be an integer, and put and
There is a bounded linear map , where is the restriction of real polynomials in of total degree at most . It is explicitly defined in the proof from the reference-simplex extension, a unique moment polynomial, and finite Legendre projections, and satisfies
Here is independent of and is the product of a fixed reference extension bound, the reference moment-projection bound, and an absolute tensor-projection constant; no useful growth bound in is asserted. For a shape-regular affine triangle of diameter , affine transport gives
If , then . This is a conservative ordinary Sobolev rate; it is neither an optimal estimate nor an analytic growth estimate for .
Facts & Assumptions
Given: Full Choice; the reference triangle ; integers , ; and with weak derivatives and Sobolev norms as in Integer-order Sobolev spaces and their norms.
Full Choice is used by the reference-simplex extension and by the one-dimensional Sobolev representative supplier. (The Axiom of Choice)
The ordinary Legendre projection obeys the factorial derivative-tail estimate for every integer derivative order. The endpoint-anchored operator used below is defined locally from this projection. (An ordinary derivative controls the Legendre tail with a factorial ratio)
The reference simplex has a bounded linear extension ; write . (A reference simplex is an integer-order Sobolev extension domain)
The unique polynomial whose derivative moments through order match those of satisfies . (Bramble–Hilbert approximation on a reference simplex)
Smooth functions on are dense in , and one-dimensional weak derivatives through order have absolutely continuous representatives on the interval. (Compactly supported smooth functions are dense in W^{k,p}(R^n), One-dimensional functions have unique absolutely continuous representatives)
Fubini and Cauchy–Schwarz justify the tensor-section norms and primitive bounds. (Fubini's theorem for L^1 functions on a sigma-finite product, Cauchy–Schwarz: , with equality exactly for dependent pairs)
Affine pullback derivatives and Sobolev seminorms scale with the singular values, determinant, and shape-regularity bound. (Shape regularity controls affine simplex geometry)
The finite-dimensional tensor polynomial space is closed in . (A finite-dimensional normed subspace is closed)
Proof
On define where is the ordinary Legendre projection. Here implies . For , the endpoint values are those of its absolutely continuous representatives from [F4]. The polynomial has degree at most and matches at . Its second derivative is an contraction; integrating twice and using the one-dimensional endpoint estimate gives with absolute . For every integer with , the error has and . Apply the Legendre tail estimate to with derivative order and projection degree ; the factorial ratio is Two integrations of , with Cauchy–Schwarz [F5], give . The same inequality holds for each derivative of order at most two.
Put , apply in each coordinate on , and write . For smooth , Let . For the first term choose , so , , , and . Step 1.1 on the sections of bounds by . For the second term, the uniform bound in step 1.1 bounds its norm by . For each such , choose ; then , , and . Apply the error estimate of step 1.1 to ; it bounds every derivative of order in this sum by . Because , all terms are bounded by . Fubini [F5] and addition over give For the inputs used below, namely restrictions of extensions, choose smooth whole-space approximants by [F4]. The estimate on their differences makes a well-defined limit. Every smooth approximant has image in , so closedness [F7] gives and the same bound for the limit.
Let and . By [F3], . Set and define This map is linear. The first summand has degree at most ; the second lies in . Since on , step 2.1 and [F2]–[F3] yield This identifies the constant as the absolute tensor constant times the fixed extension and moment bounds; no growth in is asserted.
Transport step 3.1 to a shape-regular affine triangle . For and , two-dimensional affine pullback gives for , and by [F6]. This proves the displayed full scaled estimate. Finally, is a product of consecutive integers beginning with . If and , then ; taking square roots yields .
Analytic data converge exponentially under fixed-mesh p refinement
Statement
Assume Countable Choice. Let be partitioned by a fixed finite matching affine tensor-box mesh, and let be smooth on each box. For each cell , let be its pullback to . Assume that for fixed constants and ,
for every multi-index and every cell . Choose any with . For each common degree , tensorize the endpoint-preserving integrated Legendre projector of Endpoint-preserving integrated Legendre projector on each reference cell and transport it to , obtaining . Then the cell traces of agree across every shared face and
The constant may depend on the fixed mesh; the estimate is a p-rate on a fixed mesh and makes no claim about h-refinement.
Facts & Assumptions
Given: Countable Choice; a fixed finite matching affine tensor-box mesh; a globally function smooth on each cell; , , integer , and .
Variable-degree conforming hp spaces on matching affine meshes: is the pullback of degree-at-most- polynomials in each reference coordinate; a trace-matching box space is defined by equality on shared faces.
Endpoint-preserving integrated Legendre projector: the one-coordinate operator is for an absolutely continuous section with square-integrable derivative.
Taylor's Lagrange remainder follows from repeated Rolle steps: for a function on an interval containing and , the degree- Taylor polynomial at zero has remainder bounded by .
Cauchy–Schwarz: , with equality exactly for dependent pairs: Cauchy–Schwarz holds for the inner product on the reference interval and cube.
Legendre polynomials have explicit norms and weighted derivative orthogonality: and the Legendre family is orthogonal with .
The second fundamental theorem: if is differentiable on with and is integrable, then : if a function is differentiable on a compact interval and its derivative is Riemann integrable, the integral of that derivative equals the endpoint increment.
A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral: under Countable Choice, a bounded Riemann-integrable function has the same Riemann and Lebesgue integrals.
Matching variable-degree polynomial traces give an H1 function: under Countable Choice, on a finite matching affine tensor-box mesh, matching polynomial traces give an function with its cellwise weak gradient.
The mixed derivative norm used below is , where differentiates once in each coordinate in and .
Proof
On the reference cube define by applying [F2] in coordinate , holding all other coordinates fixed, and put . Each factor maps degree-at-most- polynomials in its coordinate to the same degree space, so . Fix a smooth one-dimensional section and write . By [F6], is the Riemann integral of from to ; [F7] identifies it with the Lebesgue integral used in [F2] and the coefficient formula [F2] (applied to the continuous products ). Orthogonality [F5] makes the constant coefficient exact, so preserves both endpoints. The bound follows by averaging over and applying Cauchy–Schwarz [F4, F7]; together with this gives uniformly in . Also, if an absolutely continuous vanishes at , then and Cauchy–Schwarz [F4] gives .
Fix and a subset of the coordinate indices. If , then . If , then , whose derivative is and whose value at is zero. Thus in either case the error is controlled by the Legendre projection tail of , where in the first case and in the second. Write and let be its Taylor polynomial at zero through degree . Taylor's Lagrange remainder [F3] bounds on by . Orthogonality of gives , so the projection error is at most . For fixed this is at most : the factorial ratio is bounded by a fixed-degree polynomial in , while decays geometrically. Anchoring at and the one-dimensional Poincare estimate from step 1.1 use [F6, F7] for the continuous error derivative and give the same bound for each mixed derivative of .
The estimate in step 1.1 is stable in every mixed derivative: if a mixed derivative includes coordinate , differentiating there gives the contractive projection ; if it omits , the one-dimensional bound in step 1.1 controls the application of using that derivative and its additional derivative. Summing over the finitely many subsets gives uniformly in . The telescoping identity and step 2.1 now imply .
The one-dimensional projector preserves both endpoints. It commutes with reflection: both the reflected polynomial and the projection of the reflected function have the same derivative, since reflection preserves the polynomial subspace and the inner product, and they have the same value at the left endpoint by preservation of the right endpoint. Coordinate projectors commute under coordinate permutations. On a shared box face the relative affine parameter map is an affine automorphism of the reference cube face: it permutes the supporting facet hyperplanes and preserves their vertices, so its linear part is a signed coordinate permutation. Thus the restrictions of the transported tensor projectors are the same tangential projector applied to the common trace of , and the resulting cell traces match. The conformity result [F8] gives ; since , the local estimates sum to the stated global estimate. Scaling from each reference cell to its physical affine box multiplies the local estimate by a fixed cell-dependent factor; the mesh has finitely many cells, so taking the largest factor gives the global constant .
Constructive varying-degree triangle interpolation in unweighted H1
Statement
Assume Full Choice. Let be a finite matching shape-regular affine triangulation in two dimensions, let each cell have an arbitrary finite total degree , and let satisfy for every cell. For every edge , let be either unit tangent direction and write . For an interior edge , set ; for a boundary edge of , set . Put . There is a linear interpolant in the trace-matching space of Variable-degree conforming hp spaces on matching affine meshes. It preserves any zero boundary edge data: if vanishes on a boundary edge, so does . For every ,
and
The constant is independent of the degrees and their ratios. In particular, if integer , , , and , then
For the factorial factor is at most . The effective degree records the lowest degree among the shared edge traces; no rate independent of neighboring trace degrees is asserted.
Facts & Assumptions
Given: Full Choice; the finite matching shape-regular affine mesh; finite degrees ; a real continuous input with cellwise regularity; and, for the final rate, integer , , and cellwise regularity.
Full Choice is assumed through the Sobolev extension and point-evaluation suppliers used below. (The Axiom of Choice)
The integrated Legendre operator is , where is the orthogonal projection onto ; it is a degree- polynomial and its derivative projection is a contraction. (Endpoint-preserving integrated Legendre projector)
The strong-edge lift constructs a degree-preserving polynomial extension of endpoint-zero edge data, zero on the other two edges, with seminorm and bounds independent of degree. (A degree-uniform polynomial edge lift with the strong edge norm)
The ordinary triangle approximation theorem gives a degree- polynomial with the displayed scaled error and factorial ratio under regularity. (Constructive ordinary Sobolev polynomial approximation on triangles)
On a triangle, the Sobolev trace maps continuously into on each edge, and tangential differentiation commutes with the trace; smooth density justifies the derivative trace identity. In dimension two, also has a unique continuous representative and well-defined vertex values. (Sobolev face traces and Gauss–Green on a reference simplex, Smooth functions are dense in finite-order Sobolev spaces on a reference simplex, Sobolev threshold for Lagrange point evaluations on a reference simplex, Shape regularity controls affine simplex geometry)
Matching polynomial traces on a finite simplicial mesh assemble into an function with the cellwise gradient. (Matching variable-degree polynomial traces give an H1 function, Variable-degree conforming hp spaces on matching affine meshes)
One-dimensional functions have absolutely continuous representatives satisfying the integral formula; Cauchy–Schwarz then gives the endpoint and primitive bounds used for edge values and the zero-boundary polynomial Poincaré estimate. (One-dimensional functions have unique absolutely continuous representatives, Cauchy–Schwarz: , with equality exactly for dependent pairs)
Proof
Justify the Sobolev edge assertion in [F4] from the actual trace theorem, rather than assuming a stronger trace statement. On the reference triangle choose smooth in by its smooth-density supplier. The trace theorem applied to and separately to each gives and in . For every , ordinary one-dimensional integration by parts gives . Passing to the limits proves in distributions and hence , with norm at most . Its continuous edge representative agrees with the continuous representative of : smooth approximants converge uniformly on the edge by the one-dimensional bound [F6], while the point-evaluation supplier in [F4] gives their convergence to at each fixed edge point, including the vertices. Transporting the value trace and the gradient trace separately to yields and . Thus the scaled edge expression in the Statement is bounded by , precisely the scaled quantity used in the final rate.
Fix a single orientation of every geometric edge and affine-transport the operator in [F1] to define . For any , its derivative lies in , so the projection is exact and . For a general absolutely continuous on , the residual is orthogonal to constants, so its integral over is zero; the anchor formula and [F6] therefore show that has both endpoint values of . In particular takes the endpoint values of . For each cell , let be the affine polynomial with the three vertex values of . Each residual has zero endpoints and degree at most . Sum the three lifts from [F2] and put ; it has degree at most and trace on each edge. Let . In the finite-dimensional affine space , choose the unique satisfying for every . Existence and uniqueness follow from the positive-definite Gram matrix of the gradients on : if , the polynomial is constant, and its zero boundary trace forces . If , the system is empty and . Thus the construction is linear and uses only uniquely determined finite systems.
Both cells incident to an edge use the same oriented edge polynomial , so their traces agree and have degree at most . By [F5], the assembled interpolant is in the trace-matching space. If is a boundary edge on which , then , so the interpolant also vanishes there.
Fix and put . Since , [F1] reproduces , so . Its endpoint values are those of . The one-dimensional endpoint estimate from [F4] bounds each vertex value by on any incident edge. Consequently the affine interpolant of the vertex values has bounded by the sum of these three edge terms. On each edge, vanishes at its endpoints. The derivative contraction in [F1] and the preceding endpoint estimate bound its strong edge norm by the same sum. Applying [F2] to the three endpoint-zero residuals and adding the lifts gives with trace and
The polynomial has the same boundary trace as , so . The energy orthogonality in step 1.2 makes the best -seminorm approximation to in the affine space ; hence . This and step 2.2 prove the first estimate. For the full norm, the reference-triangle identity holds because on ; Fubini and Cauchy–Schwarz [F6] give . Also . Decompose , use the triangle inequality and the lift bound from step 2.2, and obtain the displayed full-norm estimate. If , choose from [F3]. The proved edge trace bounds in step 1.1 control every edge term by , proving the stated rate. Finally is the product of consecutive integers beginning at ; taking square roots proves the simplified power bound.
GLL quadrature changes only the top Legendre modes and is p-uniformly equivalent
Statement
For every , the one-dimensional GLL rule integrates all polynomials of degree at most exactly and has positive weights. If , then For every , The same inequalities hold on affine boxes under the transported rule. If a pointwise-defined scalar coefficient is Lebesgue measurable on and satisfies throughout , the sampled form is equivalent to the exact weighted energy with lower factor and upper factor . These are p-uniform stability bounds; they do not bound the Strang consistency defect or equate quadrature with exact Galerkin assembly.
Facts & Assumptions
Given: Integer , dimension , the GLL nodes and weights, and, for the coefficient bound, a pointwise-defined scalar coefficient that is Lebesgue measurable on and has the stated bounds at every point of .
Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature: the nodes are , , and the roots of , and the weights are interpolatory integrals of the degree- cardinal polynomials.
Legendre polynomials by Rodrigues' formula and their unweighted pairing and Legendre polynomials have explicit norms and weighted derivative orthogonality: has degree , leading coefficient , and .
The local tensor polynomial space and affine box conventions are those of Variable-degree conforming hp spaces on matching affine meshes.
Proof
Define ; it vanishes at all GLL nodes and has degree . For , divide any polynomial of degree at most as with and . Integration by parts gives , since the boundary term vanishes and the bracket has degree at most . The quadrature of is also zero because vanishes at every node, while the interpolatory definition integrates exactly. Thus . For , interpolatory exactness through degree is the required degree .
Divide with and . Since the leading coefficient of is , the leading coefficient of is . Integration by parts as in step 1.1 gives . The bracket has degree at most and leading coefficient , so it equals plus a polynomial of degree below ; orthogonality [F2] therefore gives . Since and , it follows that .
Write any degree- polynomial as with . Step 1.1 integrates and exactly, so step 2.1 gives , where . For a cardinal polynomial , by its nodal values, while the displayed identity gives . Thus all quadrature weights are positive and the one-dimensional squared norm ratio is between and .
Expand a tensor polynomial in the orthogonal basis , . The tensor quadrature and exact integral are both diagonal on this basis: every cross term is exact by step 1.1, and each diagonal factor has ratio unless , when step 3.1 bounds it by . Multiplying the coordinate factors proves the mass norm bounds. Each coordinate derivative of a tensor polynomial is still in , so applying the same tensor norm bounds to each component and summing proves the gradient bounds.
An affine change of variables multiplies both exact integrals and the transported quadrature by the same positive Jacobian. Apply the unweighted bounds of step 4.1 to each physical gradient component pulled back to the reference cube. The measurable bounded coefficient makes integrable on the bounded box, and its specified values on define every quadrature sample. Positivity of the weights and the pointwise bounds give and the analogous inequalities for the exact integral; combine them with step 4.1 to obtain the stated weighted comparison. The constants are independent of .
Exponential hp energy convergence for weighted-analytic polygon corners
Statement
Assume Countable Choice. Let be a bounded polygonal open domain with finite corner set and weights . For define ; means componentwise addition. For integer , define
Let consist of real-valued functions in every for which some satisfy
Let be nested finite matching shape-regular affine triangulations of , with at most triangles. Write and . Assume a fixed and satisfy
Let be uniform total polynomial degrees with for fixed . For a fixed union of polygon edges, let be the space of broken piecewise- functions whose polynomial traces agree on every interior edge and vanish on the boundary edges in ; put . This is the corresponding subspace of the variable-degree space in Variable-degree conforming hp spaces on matching affine meshes. For this smoother class, the boundary condition means that the unique continuous representative supplied by Weighted analytic polygon functions have corner decay and scaled analytic bounds vanishes pointwise on the edges in ; no zero condition is imposed on the other edges. If satisfies this boundary condition, then constants , independent of , satisfy
For a bounded coercive conforming Galerkin problem on a Hilbert space , assume is its exact variational solution: for every , with bounded load . If and the norm on is equivalent to the gradient seminorm, Céa's estimate gives the same exponential rate for the energy error, with its actual and norm-equivalence factors included. The constants may depend on the polygon, weights, weighted analytic bounds, mesh shape and grading constants, degree constants, , and the Galerkin coercivity and norm-equivalence constants.
Facts & Assumptions
Given: Countable Choice; the polygon, corners and weights; the full weighted-analytic hypotheses; a nested shape-regular matching mesh sequence with the exact grading and count assumptions; uniform total degrees ; and the fixed boundary-edge set .
Countable Choice is assumed explicitly; no full Choice is used in this proof. (The Axiom of Countable Choice ())
The weighted corner estimates give a continuous representative, corner decay , pointwise derivative bounds, and analytic scaled bounds on regular triangles. (Weighted analytic polygon functions have corner decay and scaled analytic bounds)
The analytic polynomial supplier gives exponential approximation on a reference triangle and an endpoint-preserving interval projector whose derivative is an contraction with exponential error. (Analytic derivative bounds give exponential polynomial approximation on a triangle)
The degree-uniform strong-edge lift extends an endpoint-zero polynomial from one edge, vanishes on the other edges, preserves degree, and has seminorm at most . (A degree-uniform polynomial edge lift with the strong edge norm)
The variable-degree space is the finite matching polynomial space with trace equality; the conformity lemma glues matching polynomial traces into ; and the corner count gives . (Variable-degree conforming hp spaces on matching affine meshes, Matching variable-degree polynomial traces give an H1 function, Uniform-degree polygon corner spaces have cubic degree-of-freedom growth)
Céa's theorem gives for the exact variational solution and its Galerkin solution , under its stated bounded-load, boundedness, coercivity, conformity, and Countable Choice hypotheses. (Céa quasi-optimality for coercive conforming Galerkin problems)
Cauchy–Schwarz controls one-dimensional trace errors and the area estimates on the regular triangles. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Proof
Fix as in [F1]. Call a cell a cap when its closure contains a corner. Since the corner set is finite and distinct corners have positive separation, for all sufficiently large each cap contains at most one corner; its diameter is at most . On a noncap cell with , the mesh condition gives , so [F1] gives uniform scaled analytic derivative bounds after subtracting a suitable constant. If , the compact-away-from-corners bounds in [F1], together with bounded and the fixed , give the same conclusion after enlarging constants. Thus each noncap reference pullback has derivative bounds , where .
For every mesh edge incident to a polygon corner, prescribe the linear interpolant of the two endpoint values of the continuous representative of . All cells sharing such an edge are caps. On every other edge , prescribe the single common endpoint-preserving derivative-projection polynomial from [F2], in one globally fixed edge orientation. The edge lies a distance comparable to its length from any nearby corner: for an edge opposite a cap corner this follows from shape regularity and the altitude bound, and for a noncap neighbor it also follows from the mesh ratio condition. Thus [F1]–[F2] give, on each noncap edge, for each adjoining noncap cell, with comparable scales on both sides. Here the sup bound follows from the endpoint identity and for the endpoint-zero reference error; [F6] justifies the last inequality. On an edge incident to a corner, both adjacent cells are caps, its prescribed linear polynomial shares the exact continuous vertex values, and no tangential regularity of at the corner is used. Every edge polynomial takes the value of at both endpoints. If , these endpoint values and the entire prescribed edge polynomial are zero.
Let be a noncap triangle and choose by transporting the analytic approximation [F2] for the scaled pullback, then adding back its subtracted constant. Thus . Correct its three vertex values by an affine polynomial to obtain matching the prescribed at all vertices; the correction has seminorm at most . On each edge, has zero endpoints, degree at most , and strong edge derivative norm at most . Lift these three residuals separately by [F3]. Their sum does not change the other edge traces, so the resulting has all three prescribed traces and
Let be a cap at corner , with diameter ; for large it contains no other corner. Start with the affine interpolant of the three exact vertex values. By [F1], . Its two edges incident to already have the prescribed linear traces. On the opposite edge , every point has distance comparable to from , so the gradient bound in [F1] and Cauchy–Schwarz [F6] give . The interval derivative projection in [F2] is contractive, and the vertex estimate in [F1] gives the same bound for . This discrepancy vanishes at both endpoints; add its lift from [F3]. The resulting polynomial has all prescribed traces and . No regularity is used on a cap.
Every pair of adjacent local polynomials has common trace ; the boundary traces vanish on . Thus they assemble to by [F4]. Summing squared cell errors from steps 3.1 and 3.2 over at most cells gives for some , because and . The finitely many earlier meshes are handled by and an increase of . Since by [F4], and therefore .
Under the additional Galerkin hypotheses, satisfies for every , and the Galerkin solution satisfies for every . Thus Céa [F5] applies to this same and . Apply it to the best-approximation estimate of step 4.1. Norm equivalence between and the gradient seminorm changes only the stated constant, and the actual factor is retained. This proves the energy-error conclusion.
Cea transfers the fixed-mesh analytic p rate to the energy error
Statement
Assume Countable Choice. On a fixed finite matching affine tensor-box mesh, let with its standard norm, let , and let be a bounded linear functional on . Let solve for all , and let be its conforming Galerkin solution in the common-degree trace-matching tensor space of Variable-degree conforming hp spaces on matching affine meshes. If the analytic hypotheses of Analytic data converge exponentially under fixed-mesh p refinement hold with constants and , then
This is the fixed-mesh analytic branch; it does not assert an h-dependent estimate or an ordinary Sobolev p-rate on simplices.
Facts & Assumptions
Given: Countable Choice; the finite matching affine tensor mesh; as in the Statement; integer ; and the analytic derivative bound and of the fixed-mesh projector theorem.
Matching variable-degree polynomial traces give an H1 function: the trace-matching tensor space is a finite-dimensional subspace of .
Analytic data converge exponentially under fixed-mesh p refinement: there is a trace-matching with .
Céa quasi-optimality for coercive conforming Galerkin problems: under Countable Choice, a bounded coercive form on a Hilbert space and a finite-dimensional conforming subspace have a Galerkin solution satisfying .
For the form in the Statement, Cauchy–Schwarz gives and .
Proof
By [F1], is finite-dimensional and contained in the Hilbert space . The form in [A1] is bounded with and coercive with . The exact solution and bounded functional are among the hypotheses in Given, so [F3] applies and yields . Its only axiom beyond classical real analysis is Countable Choice, stated in Given.
The approximant in [F2] belongs to , so the infimum in step 1.1 is no greater than . Substituting its bound from [F2] proves the stated energy estimate.
Galerkin energy error with local h, trace degree and Sobolev regularity
Statement
Assume the Axiom of Choice. Let be any finite matching shape-regular affine triangulation of a bounded polygonal open set , with shape bound and arbitrary degrees . Set on an interior edge, on a boundary edge, and . Thus the effective degree retains neighboring shared-trace restrictions, without a bound on degree ratios.
Choose and , or and , with Hilbert norm Let be the corresponding conforming hp space, imposing zero boundary traces in the branch. Suppose the real bilinear form and real linear functional satisfy with bounded. Let be the variational solution and its conforming Galerkin solution. Suppose and ; in the zero-boundary branch its continuous representative vanishes on the boundary edges.
For any cellwise comparison polynomials put and Then the actual energy-space error obeys This comparison estimate applies to every degree assignment and the stated piecewise inputs; the comparison polynomials need not match across edges.
For any cellwise integers with and , this also gives the general h-refinement bound In particular every assignment admits the piecewise estimate with .
For the additional explicit p-dependent refinement, let integers satisfy , assume , and put and There are constants independent of all diameters, degrees and degree ratios such that If , one may replace by . For a common regularity , this displays local and the proved conservative trace-degree factor . It does not claim the optimal rate or any bound on growth of as . The separate fixed-mesh tensor-analytic and weighted-corner exponential results remain independent branches.
Facts & Assumptions
Given: AC; the finite matching shape-regular two-dimensional mesh, degrees and either space/norm branch; the actual boundedness and coercivity constants; the exact solution with the stated continuity and cellwise regularity; and the comparison polynomials or the additional ordinary Sobolev assumptions.
Constructive varying-degree triangle interpolation in unweighted H1 gives a single linear trace-matching interpolant , preserving zero boundary edge values, with and . Its local edge trace and tangential-derivative identity are proved there from smooth density and the actual first-order trace theorem.
Constructive ordinary Sobolev polynomial approximation on triangles supplies with , and the stated high-degree simplification.
Matching variable-degree polynomial traces give an H1 function and Variable-degree conforming hp spaces on matching affine meshes give a finite-dimensional conforming space and identify its weak gradients with its cellwise gradients.
Céa quasi-optimality for coercive conforming Galerkin problems gives exact and discrete solvability and the factor under Countable Choice. Integer-order Sobolev spaces are Banach, Zero-boundary Sobolev space as a norm closure and The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction give completeness of the two specified Hilbert norms; AC supplies their choice assumptions.
Bramble–Hilbert approximation on a reference simplex with Sobolev exponent two and supplies a degree- polynomial with reference error bounded by the seminorm. Shape regularity controls affine simplex geometry transports that estimate with the exact factors , .
Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare: on a finite matching simplicial mesh, a conforming piecewise-polynomial function with zero polynomial trace on every boundary facet belongs to .
Proof
Both norm branches are Hilbert: the Sobolev inner product is complete by [F4], the zero-boundary Sobolev closure is closed, and Poincaré makes its gradient norm equivalent to the inherited complete norm. The finite matching polynomial space is finite-dimensional and conforming by [F3]. The given exact form and load therefore meet Céa's precise hypotheses, giving unique variational solutions and .
The interpolant [F1] belongs to the trace-matching space. In the zero-boundary branch, [F1] also gives zero polynomial traces on every boundary facet. Apply [F6] with exponent to obtain , so the interpolant is an admissible comparison in either norm branch. No neighboring degree ratio was used.
Sum the squared cell seminorm bounds in [F1], which gives by [F3]. The full scaled estimate also gives . Their sum with the exact factor bounds . Use as the admissible comparison in step 1.1 and take square roots to obtain the first displayed Galerkin bound. The local comparisons may be chosen independently because the single interpolant was constructed from common edge traces of , rather than by gluing the .
Choose the reference moment polynomial of degree from [F5] and transport it to . The degree condition makes it an admissible . With , scaling gives . The value and derivative edge trace bounds proved in [F1] therefore give the same bound for and . Substitute into step 2.1 to prove the general integer-regularity h estimate, including on every degree assignment.
Under the stronger cellwise assumptions choose from [F2]. The scaled edge trace proved in [F1] gives : its value-edge term is bounded by , and its derivative-edge term by , so exactly the three scaled norms in [F2] occur. Substitution into step 2.1 proves the second displayed bound with . Finally [F2] gives under the stronger degree threshold. This retains the actual trace-degree and regularity constants and concludes both norm branches.
GLL spectral-element energy error retains the quadrature defect
Statement
Assume Countable Choice. Let have a fixed finite matching affine tensor-box mesh with cell degrees , and let be its trace-matching hp space. On use and a bounded load . Define the discrete form on by
using the GLL stiffness and mass forms from Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature. Let solve the exact variational problem and let solve for every , with the exact load restricted to . Define the form defect by Variational-crime settings and consistency defects. Then The stability factor is uniform in all cell degrees. The defect is retained as stated; no aliasing or p-decay estimate is asserted, and GLL assembly is not identified with exact Galerkin assembly.
Facts & Assumptions
Given: Countable Choice; the finite matching affine tensor-box mesh and ; exact ; the GLL form ; and its discrete solution .
Matching variable-degree polynomial traces give an H1 function: the trace-matching hp space is finite-dimensional and contained in .
GLL quadrature changes only the top Legendre modes and is p-uniformly equivalent: on each affine box the GLL quadrature H1 form is bounded above by times and below by times the exact local H1 form, uniformly in its degree.
Variational-crime settings and consistency defects: , while the load defect is defined analogously.
First Strang estimate for conforming perturbed Galerkin problems: under Countable Choice, a coercive exact and discrete form on a finite-dimensional conforming subspace satisfy the first Strang estimate with the form and load defects from [F3].
Cauchy–Schwarz: , with equality exactly for dependent pairs: a positive weighted finite sum obeys Cauchy–Schwarz.
Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature defines the cell stiffness form and mass form used in the displayed discrete form.
Proof
Sum [F2] over cells. For every , and ; Cauchy–Schwarz [F5] for the positive quadrature weights gives . Thus the discrete form is bounded and coercive with , and the exact form has . The exact load is unchanged on , so .
Apply [F4] with , the finite-dimensional conforming subspace from [F1], exact bounded coercive form , GLL form , and the restricted load. Its bound is . Substituting , , and from step 1.1 yields the stated inequality. Countable Choice is the only axiom used by [F4].
5 · Examples, counterexamples and false statements
None yet.
Sources
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, p-version FEM
- Leszek F. Demkowicz, Mathematical Theory of Finite Elements
- Leszek F. Demkowicz, Mathematical Theory of Finite Elements, §3.1.4, Hierarchical Shape Functions
- Martin Vohralík, Finite Element Methods, Chapter 6, hp finite elements
- Lloyd N. Trefethen, Short note on the mass matrix for Gauss-Lobatto grid points
- Tim Warburton and Jan S. Hesthaven, On the Constants in hp-Finite Element Trace Inverse Inequalities
- Matthias Braess and Christoph Schwab, Approximation on polyhedral domains with geometric meshes
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 30: hp Finite Elements
- Martin Vohralík, Finite Element Methods, Chapter 6: hp finite elements
- Shen and Tang, Spectral and High-Order Methods with Applications
- Yanchen He, Paul Houston, Christoph Schwab, and Thomas P. Wihler, Exponential Convergence of hp-ILGFEM, version 1
- Jean-Luc Guermond, MATH 661 Fall 2019, Chapter 32, H1-conforming approximation
- Luca Heltai, Numerical Methods for Partial Differential Equations, Lecture 2
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11, Local interpolation on affine meshes
- Saul A. Teukolsky, Short note on the mass matrix for Gauss-Lobatto grid points
- Lucas Johannes Petrus Timmermans, Analysis of Spectral Element Methods with Application to Incompressible Flow
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VI, Basic error analysis
- Martin Vohralík, Finite Element Methods
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 26, Basic error analysis
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VI, Chapter 27, Error analysis with variational crimes
- Joachim Schöberl, Numerical Methods for Partial Differential Equations