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.
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.
Depends on
- Variable-degree conforming hp spaces on matching affine meshes
- Endpoint-preserving integrated Legendre projector
- A degree-uniform polynomial edge lift with the strong edge norm
- Constructive ordinary Sobolev polynomial approximation on triangles
- Matching variable-degree polynomial traces give an H1 function
- Sobolev face traces and Gauss–Green on a reference simplex
- Sobolev threshold for Lagrange point evaluations on a reference simplex
- Smooth functions are dense in finite-order Sobolev spaces on a reference simplex
- Shape regularity controls affine simplex geometry
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- One-dimensional $W^{1,p}$ functions have unique absolutely continuous representatives
- The Axiom of Choice
Used by
Dependency tree · two levels
63 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
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 30: hp Finite Elements (standard reference, not scraped)
- Martin Vohralík, Finite Element Methods, Chapter 6: hp finite elements (standard reference, not scraped)