Alphabeta Math
Pipeline-generated
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.

✓ 19 results · all verified · 15 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

hp finite elements and spectral elements

1 · Prerequisites

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 O(k) triangles, and uniform total degree pk≃ck; it yields an e−bN1/3 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 s≥2 gives hs−1 when the effective trace degree is at least s−1. For cellwise integer regularity r≥5, the additional p-dependent bound has hr−1 times the proved factorial factor, bounded at sufficiently high trace degree m by (4/m)r−4. Both the H1 norm and zero-Dirichlet gradient norm are covered. No optimal p rate or growth estimate for the r-dependent constant is asserted.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Endpoint-preserving integrated Legendre projector

Definition

For p≥1 and g∈L2(−1,1), define the degree-(p−1) Legendre orthogonal projection

Πp−1g:=∑n=0p−12n+12(∫−11g(t)Pn(t) dt)Pn.

For c∈R, define the endpoint-anchored integrated projector

Ip(c,g)(x):=c+∫−1xΠp−1g(t) dt,−1≤x≤1.

If an absolutely continuous function f is represented as f(x)=f(−1)+∫−1xf′(t) dt with f′∈L2, write Ipf:=Ip(f(−1),f′). The finite sum and integral are defined for every such input; no choice axiom is used in this definition.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Variable-degree conforming hp spaces on matching affine meshes

Definition

Let d≥2 and let T be a finite matching affine simplicial mesh of a bounded polyhedral open set Ω⊂Rd in the sense of Matching affine simplicial meshes and shape regularity. A degree map is a function p:T→N0 with finite values. The broken simplex space associated with (T,p) is

Vbr(T,p):={v∈L2(Ω):v∣K∈PpK(K) for every K∈T},

where pK:=p(K) and Pm(K) denotes restrictions of real polynomials of total degree at most m. 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 F=K∩K′, its trace degree is pF:=min⁡(pK,pK′); equality of the two traces means that their common polynomial belongs to PpF(F).

A matching affine tensor-box mesh is a finite face-to-face partition of a bounded polytope into affine images of [−1,1]d, with pairwise disjoint interiors. For a scalar degree pK on each box, the local tensor space is QpK(K), the pullback of polynomials of degree at most pK 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 F=K∩K′, set pF=min⁡(pK,pK′); its common trace lies in QpF(F) 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 P0⊂⋯⊂Pp (or Q0⊂⋯⊂Qp), with each new layer extending the preceding span. For example, pullbacks of reference monomials x^ν ordered by ∣ν∣ give such a basis for Pp, and tensor monomials ξν ordered by max⁡iνi give one for Qp. This basis convention does not assert stability of a particular basis or projector.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Legendre-Gauss-Lobatto nodes are distinct and interior critical points are simple

Statement

For every integer p≥1, the Legendre polynomial Pp has exactly p simple roots in (−1,1), and Pp′ has exactly p−1 simple roots in (−1,1), one between each consecutive pair of roots of Pp. Consequently, the p+1 nodes consisting of −1, 1, and the roots of Pp′ are pairwise distinct.

Facts & Assumptions

Given: An integer p≥1 and the Legendre polynomials Pn.

[F1]
[F2]

Legendre polynomials have explicit norms and weighted derivative orthogonality: Pp is orthogonal in unweighted L2(−1,1) to every polynomial of degree less than p.

Proof

1.1F1F2givenalgebra

Suppose Pp has only m<p sign-changing roots r1,…,rm in (−1,1) and set q(x)=∏j=1m(x−rj), with q=1 if m=0. At each sign-changing root both Pp and q change sign, while at every other real root Pp does not change sign; therefore Ppq has one constant sign on (−1,1) and is not identically zero. It is continuous and nonzero on some open interval, so its integral is nonzero. But deg⁡q=m<p, and [F2] gives ∫−11Ppq=0, a contradiction. Thus Pp has at least p sign-changing roots in the open interval.

2.1F1F3step 1.1givenalgebra∎

A degree-p polynomial cannot have more than p distinct roots. The p 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 p−1 distinct roots of Pp′ in (−1,1). Since Pp′ has degree p−1, these are all its roots and each is simple. None equals an endpoint, so adjoining −1 and 1 gives p+1 distinct nodes, including the case p=1 where there are no interior critical points.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Weighted Jacobi endpoint kernel on the reference interval

Statement

For an integer d≥1, put wd(t)=(1−t)d−1 on [0,1] and, for n≥0, define ϕn(t):=(−1)nn!(1−t)−(d−1)dndtn(tn(1−t)n+d−1). The quotient extends to a polynomial of degree n. These polynomials are pairwise orthogonal in L2(wd dt), with ϕn(0)=(−1)n,lc⁡(ϕn)=(2n+d−1n),∫01wdϕn2 dt=12n+d. Consequently, for every p≥0 the squared norm of endpoint evaluation q↦q(0) on Pp([0,1]) with this weighted L2 norm is exactly (p+1)(p+d).

Facts & Assumptions

Given: Integers d≥1 and p≥0, the weight wd(t)=(1−t)d−1, and polynomials on [0,1].

[A1]

The factor tn(1−t)n+d−1 and its derivatives of orders 0,…,n−1 vanish at both endpoints; integration by parts therefore has no boundary terms.

Proof

1.1givenA1algebra

Apply Leibniz's rule to the nth derivative in the definition. Every term differentiates (1−t)n+d−1 at most n times, so it contains a factor (1−t)d−1. After division the result is a polynomial. The original factor has degree 2n+d−1 and leading coefficient (−1)n+d−1; differentiating n times and dividing by the leading term (−1)d−1td−1 of (1−t)d−1 shows that ϕn has degree n and leading coefficient (2n+d−1n). The coefficient of tn in tn(1−t)n+d−1 is 1, so its nth derivative at zero is n! and ϕn(0)=(−1)n.

2.1givenA1step 1.1algebra

If r has degree below n, multiply the Rodrigues formula by wdr and integrate. Integrating by parts n times is allowed by [A1] and gives ∫01wd(t)ϕn(t)r(t) dt=1n!∫01tn(1−t)n+d−1r(n)(t) dt=0, because r(n)=0. Thus ϕn 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.

3.1givenA1step 2.1algebra

For nonnegative integers a,b, let B(a,b)=∫01ta(1−t)b dt. The case a=0 gives B(0,b)=1/(b+1); for a≥1, integration by parts with u=ta and dv=(1−t)b dt gives B(a,b)=aB(a−1,b+1)/(b+1). Iterating yields B(a,b)=a!b!/(a+b+1)!. Applying n integrations by parts to the Rodrigues formula with r(t)=tn gives ∫01wdϕntn dt=B(n,n+d−1)=n!(n+d−1)!/(2n+d)!. Since tn=ϕn/κn+r for some r of degree below n, where κn=(2n+d−1n), orthogonality gives ∥ϕn∥L2(wd)2=κnB(n,n+d−1)=1/(2n+d).

4.1step 1.1step 2.1step 3.1algebra∎

Write q=∑n=0pcnϕn. By the endpoint and norm identities, Cauchy–Schwarz gives ∣q(0)∣2=∣∑n=0pcn(−1)n∣2≤(∑n=0p(2n+d))(∑n=0p∣cn∣22n+d)=(p+1)(p+d)∥q∥L2(wd)2. Equality is attained by the polynomial Kp(t,0)=∑n=0p(2n+d)(−1)nϕn(t): its endpoint value and squared norm both equal ∑n=0p(2n+d)=(p+1)(p+d). Hence the evaluation norm squared is exactly the stated value.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Weighted simplex polynomial projection has explicit p-rates

Statement

Let K^ be the reference simplex of Matching affine simplicial meshes and shape regularity, let α=(α0,…,αd) have nonnegative real entries, and let ωα=∏j=0dλjαj, where λj are its barycentric coordinates. Give polynomials the inner product ⟨f,g⟩α=∫K^ωαfg. Put P−1={0} and let En=Pn(K^)⊖Pn−1(K^) in this weighted inner product. For a finite sum u=∑n≥0un, un∈En, define

∥u∥Hαs2:=∑n≥0(1+μn)s∥un∥L2(ωα)2,μn=n(n+d+∣α∣),

and define Hαs as the completion of these finite sums. If m≥ℓ≥0, its orthogonal degree truncation Ppu=∑n=0pun obeys

∥u−Ppu∥Hαℓ≤(1+μp+1)−(m−ℓ)/2∥u∥Hαm.

For q∈Pp(K^), ∥q∥Hαm≤(1+μp)(m−ℓ)/2∥q∥Hαℓ. These are estimates in the explicitly coefficient-defined scale Hαs; they do not identify that scale with ordinary unweighted Hs(K^).

Facts & Assumptions

Given: A dimension d≥2, αj≥0, real exponents m≥ℓ≥0, and degree p≥0.

[F1]

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.

[A1]

Pn(K^) is finite-dimensional, and ωα is positive in the open simplex and integrable. Thus its weighted L2 inner product is positive definite on polynomials.

Proof

1.1F1A1givenalgebra

Since ωα>0 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 αj≥0 on the bounded simplex. Hence the weighted inner product is positive definite on each finite-dimensional polynomial space. Orthogonal projection onto Pn−1 therefore gives the finite-dimensional orthogonal decomposition Pn=E0⊕⋯⊕En. The scale in the Statement is the completion of this orthogonal-sum norm, so its coefficient description and truncation are well-defined.

2.1givenstep 1.1algebra

For a finite sum u=∑un, orthogonality gives ∥u−Ppu∥Hαℓ2=∑n>p(1+μn)ℓ∥un∥α2≤(1+μp+1)ℓ−m∑n>p(1+μn)m∥un∥α2, because μn=n(n+d+∣α∣) is increasing for n≥0. Taking square roots proves the tail estimate for finite sums.

3.1step 1.1step 2.1algebra∎

Truncation is contractive in every coefficient norm Hαs, and finite sums are dense by the definition of the completion. The finite-sum estimate in step 2.1 therefore passes to every u∈Hαm. If q∈Pp, each degree layer has n≤p, so (1+μn)m−ℓ≤(1+μp)m−ℓ term by term; summing proves the inverse estimate. Neither argument invokes a derivative norm, which is why neither implies an unweighted Sobolev estimate.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A degree-uniform polynomial edge lift with the strong edge norm

Statement

Assume Countable Choice. Let p∈N0, let T={(x,y):x>0, y>0, x+y<1}, and let q be a real polynomial of degree at most p satisfying q(0)=q(1)=0. Define the polynomial R(t)=q(t)/t by cancellation at t=0, and put

Lq(x,y)=q(x)−xR(1−y).

Then Lq∈Pp(T), it equals q on y=0, and it vanishes on x=0 and x+y=1. Moreover,

∥Lq∥H1(T)≤4∥q′∥L2(0,1),

independently of p. Permuting the three vertices gives the same bound, up to one fixed constant, for each reference edge. If K is a shape-regular affine triangle, E is an edge of length ℓE, and hK=diam⁡(K), the transported lift satisfies

∣LEq∣H1(K)≤CγℓE1/2∥∂τq∥L2(E),∥LEq∥L2(K)≤CγhKℓE1/2∥∂τq∥L2(E).

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 H1 edge norm and asserts no optimal H1/2 trace-lifting bound.

Facts & Assumptions

Given: Countable Choice; the reference triangle; a polynomial q with the stated endpoint values; and, for the physical-cell assertion, a shape-regular affine triangle and one of its edges.

[F1]

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)

[F2]

The Sobolev H1 norm is the L2 norm of the function and its weak first derivatives. (Integer-order Sobolev spaces and their norms)

[F3]

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: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

[A1]

Countable Choice is the exact assumption used by [F1]; no arbitrary family of polynomial lifts is selected. (The Axiom of Countable Choice (ACω))

Proof

1.1givenconstructalgebra

Since q(0)=0, polynomial division gives a polynomial R of degree at most p−1 when p≥1; for p=0 or p=1 the endpoint conditions force q=0. Thus Lq has total degree at most p. At y=0, R(1)=q(1)=0, so Lq=q(x); at x=0 it is zero; and on x+y=1 one has 1−y=x, so xR(1−y)=xR(x)=q(x).

2.1F2F3step 1.1algebra

Put A=∫01∣q′(t)∣2dt. Polynomial integration term by term gives q(t)=∫0tq′(s)ds, so Cauchy–Schwarz [F3] yields t∣R(t)∣2≤∫0t∣q′(s)∣2ds≤A and hence ∫01t∣R(t)∣2dt≤A. The identity tR′(t)=q′(t)−R(t) gives ∫01t3∣R′(t)∣2dt≤2∫01t∣q′∣2+2∫01t∣R∣2≤4A. Also ∣q(t)∣2≤tA, so ∫01∣q∣2≤A. Writing t=1−y, the slices of T are 0<x<t. Therefore ∥∂xLq∥22≤2∫01(1−x)∣q′(x)∣2dx+2∫01t∣R(t)∣2dt≤4A, ∥∂yLq∥22=13∫01t3∣R′(t)∣2dt≤43A, and ∥Lq∥22≤2∫01(1−x)∣q(x)∣2dx+23∫01t3∣R(t)∣2dt≤83A. Fubini [F3] justifies the slice integrals. Using the Sobolev norm definition [F2], adding the three inequalities gives ∥Lq∥H1(T)2≤8A≤16A, proving the safe constant four.

3.1A1F1step 2.1algebra

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 p. 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 ℓE1/2∥∂τq∥L2(E). The physical L2 norm has one additional factor bounded by CγhK by [F1]. This gives both stated estimates.

4.1step 1.1step 3.1constructalgebra∎

Let g be continuous polynomial data on the three edges, with edge degrees at most p. For p=0, continuity makes g one constant and that constant extends it. For p≥1, let a be the affine interpolant of the three vertex values. Each edge residual g∣E−a∣E vanishes at both endpoints and has degree at most p. Lift the three residuals separately by step 1.1; each lift vanishes on the other two edges. Their sum plus a therefore has trace exactly g and degree at most p. This works when edge degrees differ and requires no equal-degree assumption.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

An ordinary derivative controls the Legendre tail with a factorial ratio

Statement

Assume the Axiom of Choice for the k≥1 branch. Let Pn be the real Legendre polynomial normalized by Pn(1)=1, and let ΠN be the L2(−1,1;R) orthogonal projection onto PN(−1,1). For every integer k≥1, every integer N≥k−1, and every real-valued f∈Hk(−1,1),

∥f−ΠNf∥L2(−1,1)≤((N+1−k)!(N+1+k)!)1/2∥f(k)∥L2(−1,1).

For k=0, every integer N≥0, and f∈L2(−1,1), ∥f−ΠNf∥2≤∥f∥2. For n,m≥k the repeated derivative orthogonality identity is

∫−11(1−x2)kPn(k)(x)Pm(k)(x) dx=22n+1(n+k)!(n−k)! δnm.

Facts & Assumptions

Given: The Axiom of Choice; integers k,N in the stated ranges; and a real-valued Sobolev class f∈Hk(−1,1).

[A1]

The Axiom of Choice is assumed only for the k≥1 branch. (The Axiom of Choice)

[F1]

The Rodrigues Legendre polynomials are mutually orthogonal in L2(−1,1), have norm squared 2/(2n+1), and have degree n with nonzero leading coefficient. (Legendre polynomials have explicit norms and weighted derivative orthogonality)

[F2]

Polynomials are uniformly dense in the continuous real functions on [−1,1] (Polynomials are uniformly dense in C([a,b],R) for every closed interval), and smooth compactly supported functions are dense in L2(−1,1) (Smooth compactly supported functions of an open set are dense in L2). Thus polynomials are dense in L2(−1,1).

[F3]

Every one-dimensional W1,2 class on a bounded interval has an absolutely continuous representative satisfying v(y)−v(x)=∫xyDv; this theorem assumes Full Choice. Apply it to f,f′,…,f(k−1). (One-dimensional W1,p functions have unique absolutely continuous representatives)

[F4]

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: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

Proof

1.1F1givenalgebra

Fix k≥1 and put wk(x)=(1−x2)k. For n≥k, the polynomial Qn,k:=Dk(wkDkPn) has degree n. Integrating by parts k times moves the outer derivative block onto a polynomial q and gives ∫Qn,kq=(−1)k∫wkDkPnDkq=∫PnDk(wkDkq); all boundary terms vanish because derivatives of wk of orders below k vanish at both endpoints. The final polynomial paired with Pn has degree at most deg⁡q<n, so [F1] makes the integral zero. The leading coefficient of Qn,k is (−1)k(n+k)!/(n−k)! times the leading coefficient of Pn. Orthogonality and the degree statement in [F1] therefore give Qn,k=(−1)kλn,kPn, where λn,k=(n+k)!/(n−k)!.

2.1F1step 1.1algebra

For n,m≥k, integrate by parts k times and use step 1.1 to obtain ∫−11wkPn(k)Pm(k)=(−1)k∫−11PnDk(wkPm(k))=λm,k∫−11PnPm. The first identity in [F1] makes this zero for n≠m and equal to λn,k2/(2n+1) for n=m, proving the repeated derivative orthogonality formula.

3.1A1F3F4step 1.1step 2.1algebra

Write cn=(f,Pn)L2/∥Pn∥22. The absolutely continuous representatives in [F3] justify k integrations by parts; all boundary terms vanish because wk has endpoint zeros of order k. Step 1.1 then gives ∫−11wkf(k)Pn(k)=λn,kcn∥Pn∥22(n≥k). The functions wk1/2Pn(k) are mutually orthogonal by step 2.1 and have squared norms λn,k∥Pn∥22. Applying finite Bessel inequalities to wk1/2f(k) and then increasing the finite index set yields ∑n≥kλn,k∣cn∣2∥Pn∥22≤∫−11wk∣f(k)∣2≤∥f(k)∥22.

4.1F1F2step 3.1algebra∎

Density [F2] and the best-approximation property of finite orthogonal projections imply ΠMf→f in L2: first approximate f by a polynomial and then take M at least its degree. Orthogonality [F1] and Pythagoras give ∥f−ΠNf∥22=∑n>N∣cn∣2∥Pn∥22. Since λn,k increases for n≥k, step 3.1 bounds this tail by λN+1,k−1∥f(k)∥22, which is the stated factorial estimate. When k=0, the same finite Pythagoras identity directly gives contraction.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Analytic derivative bounds give exponential polynomial approximation on a triangle

Statement

Let S be the closed reference triangle T‾, where T={x,y>0,x+y<1}, or the closed interval [0,1], and let f:S→R be real-valued. Write Pp(S) for restrictions of real polynomials of total degree at most p on the triangle and degree at most p on the interval. Say that f is smooth up to S when every partial derivative on the interior has a continuous extension to S. Suppose that for some M>0 and A≥1,

∥Dαf∥L∞(S)≤MA∣α∣∣α∣!for every multi-index α.

Use ∥g∥W1,∞(S):=∥g∥L∞(S)+∑i=1dim⁡S∥∂ig∥L∞(S). Then constants C,b>0, depending only on A and the fixed reference domain, satisfy

inf⁡q∈Pp(S)∥f−q∥W1,∞(S)≤CMe−bp(p≥1).

For the interval branch there is also an endpoint-preserving polynomial Jpf∈Pp([0,1]) whose derivative is the L2 orthogonal projection of f′ onto Pp−1. It satisfies ∥(Jpf)′∥2≤∥f′∥2 and ∥f−Jpf∥H1≤CMe−bp after changing C,b by constants depending only on A.

Facts & Assumptions

Given: The fixed reference interval or triangle, the smoothness and factorial derivative bound in the statement, and p≥1.

[F1]

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)

[F2]

Cauchy–Schwarz bounds the integral of a derivative over an interval of length one by its L2 norm. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

[F3]

Multi-index order, factorial, monomial powers, and canonical partial derivatives have the conventions in the cited definition. (Ck maps and multi-index derivative notation in Euclidean space)

[F4]

The fundamental theorem of calculus gives ∫01f′(t)dt=f(1)−f(0) when f is continuously differentiable on the interval, as it is here. (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a))

Proof

1.1givenalgebra

For 0<τ<1 and integer n≥1 define Bn,τ(t)=∑j=⌈nτ⌉n(nj)tj(1−t)n−j. Then 0≤B≤1, deg⁡B≤n, and ∣B′∣≤n. If t≤τ−δ for fixed δ>0, Chernoff's bound follows directly from 1j≥nτ≤ez(j−nτ) for z>0: Bn,τ(t)≤e−znτ(1−t+tez)n. For sufficiently small fixed z, the exponent per n is negative uniformly because its derivative at z=0 is t−τ≤−δ. Applying the same argument to the complementary lower tail gives exponential smallness of 1−B on t≥τ+δ. Differentiation telescopes to one binomial atom times n; away from the threshold its probability is bounded by the same tail estimate with gap δ/2 for all sufficiently large n, and increasing the constant covers the finitely many smaller n. Thus B and 1−B switch from exponentially small to 1+O(e−cn) across a strip of fixed width, and their derivatives outside that strip are O(ne−cn).

2.1step 1.1construct

Choose 0<ρ<1/(32A) and a finite coordinate-grid cover of S by boxes of radius ρ with centers ai∈S, 1≤i≤m. In each coordinate form a left increasing binomial factor with threshold ai,j−3ρ/2 and a right decreasing factor with threshold ai,j+3ρ/2; omit the left factor when its threshold is at most zero and the right factor when its threshold is at least one. Their product bi has degree at most 4n, lies in [0,1], equals 1+O(e−cn) on the inner box of radius ρ and its first derivatives there are O(ne−cn); outside the outer box of radius 2ρ its value and first derivatives are O(ne−cn). The omitted boundary factors require no suppression on a side where the outer box does not meet S.

3.1F1F3step 2.1givenalgebra

Let Ti,s be the total-degree-s Taylor polynomial at ai. When ai is on the boundary, take limits of interior centers; all derivatives extend continuously to S. On the intersection of the outer box and S, convexity keeps the Taylor segment inside the triangle, so [F1] and the multinomial formula give ∣f−Ti,s∣+∣∇(f−Ti,s)∣≤CM(s+1)(4Aρ)s≤CM2−s after enlarging C for small s. On all of S, the coefficient formula for Ti,s gives ∣Ti,s∣+∣∇Ti,s∣≤CM(s+1)2Ds for a fixed D>1 depending only on A.

3.2step 2.1algebra

Set wi=bi∏j<i(1−bj) and w0=∏j≤m(1−bj). Then ∑i=0mwi=1 and 0≤wi≤1. At every point of S some inner box applies, so one factor 1−bi, together with its first derivatives, is exponentially small there; the product rule and ∣bj′∣≤Cn give ∥w0∥W1,∞(S)≤Cne−cn. Outside the outer box for a fixed i, the same product rule gives ∣wi∣+∣∇wi∣≤Cne−cn.

4.1step 3.2step 3.1algebraconstruct

Put q=∑i=1mwiTi,s. Since f−q=w0f+∑iwi(f−Ti,s), the near-box and far-box bounds of steps 3.1 and 3.2 give ∥f−q∥W1,∞(S)≤CM{n2−s+n(s+1)2Dse−cn}. Choose fixed ε>0 with ε≤1 and εlog⁡D<c/2, and let s=⌊εn⌋. Then the right side is at most CMe−b0n. Each wi has degree at most 4mn, so q has total degree at most 4mn+s≤(4m+1)n. Choose n=⌊p/(4m+1)⌋; for the finitely many p with n=0, the zero polynomial and an enlarged constant handle the claim. This proves the exponential estimate for every p≥1.

5.1F2F4step 4.1givenalgebra∎

On the interval let P be the L2 orthogonal projection of f′ onto Pp−1 and put Jpf(t)=f(0)+∫0tP(s)ds. The positive-definite finite polynomial Gram matrix gives a unique projection; Pythagoras gives ∥P∥2≤∥f′∥2 and ∥f′−P∥2≤∥f′−r∥2 for every r∈Pp−1. Orthogonality to constants gives ∫01P=∫01f′, and [F4] evaluates the latter as f(1)−f(0). Thus Jpf(1)=f(0)+∫01P=f(1), while Jpf(0)=f(0) by construction. The derivatives of f′ satisfy a factorial bound with fixed constants M′=MA and A′=2A, since (j+1)!≤2jj! for j≥1. For p≥2, apply step 4.1 to f′ with degree p−1; best approximation of the L2 projection then gives ∥f′−P∥2≤CMe−b(p−1), which is at most C′Me−b′p after changing constants. For p=1, the derivative contraction and the bound ∥f′∥2≤MA give the same asserted estimate after enlarging C′. Finally f−Jpf=∫0t(f′−P) and [F2] bounds its L2 norm by ∥f′−P∥2. The derivative and value bounds prove the stated interval estimate.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Weighted analytic polygon functions have corner decay and scaled analytic bounds

Statement

Assume Countable Choice. Let Ω⊂R2 be a bounded open polygonal domain with finitely many straight sides and corner set C={c1,…,cm}, with interior angle at each corner strictly between 0 and 2π. Let 0≤βi<1 and write Φγ(x)=∏i=1m∣x−ci∣γi for a vector γ∈[0,∞)m. For integer k≥2, define

∥v∥Hβk,2(Ω)2=∥v∥H1(Ω)2+∑j=2k∑∣α∣=j∥Φβ+j−2Dαv∥L2(Ω)2,

where (β+j−2)i=βi+j−2 and a zero exponent contributes the factor one. Let u∈Hβk,2(Ω) for every integer k≥2, with real-valued weak derivatives, and suppose constants Cu,du>0 satisfy

∥Φβ+j−2∑∣α∣=j∣Dαu∣∥L2(Ω)≤Cuduj−2(j−2)!(j≥2).

For each fixed 0<a<min⁡i(1−βi) there are constants C,A,R>0 such that the weak class of u has a unique representative u~∈C(Ω‾), smooth up to every open side away from corners, and for 0<r=∣x−ci∣<R,

∣u~(x)−u~(ci)∣≤Cra,∣Dαu~(x)∣≤CA∣α∣∣α∣!ra−∣α∣(∣α∣≥1).

On every compact subset of Ω‾∖C, the derivatives satisfy ordinary factorial bounds ∣Dαu∣≤C0A0∣α∣∣α∣!. On every closed nondegenerate shape-regular affine triangle K⊂Ω‾ with K∘⊂Ω and K∩C=∅, whose ratio hK/dist⁡(K,C) is bounded above and below by fixed positive constants, where dist⁡(K,C)=inf⁡x∈K,c∈C∣x−c∣, set rK=min⁡(R,dist⁡(K,C)). After subtracting a suitable constant from the pullback u^ to the reference triangle of Matching affine simplicial meshes and shape regularity, ∥Dαu^∥∞≤CA1∣α∣∣α∣!rKa for every multi-index α, with constants uniform over this family. If a closed nondegenerate shape-regular affine triangle K⊂Ω‾ with K∘⊂Ω, diameter h<R, has a corner ci as a vertex, its vertex affine interpolant aK satisfies

∣u−aK∣H1(K)≤Cha,∥u−aK∥L2(K)≤Cha+1.

Facts & Assumptions

Given: Countable Choice; the bounded polygon and its finite corner set; the weights βi; the ordinary Sobolev class conventions of Integer-order Sobolev spaces and their norms; the stated weighted factorial bounds; and a fixed exponent a as above.

[F1]

Fubini applies to integrable functions on the finite rectangle patches used below. (Fubini's theorem for L^1 functions on a sigma-finite product)

[F2]

Cauchy–Schwarz controls rectangle integrals, and the affine shape-regular bounds control pullbacks to triangles. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Shape regularity controls affine simplex geometry)

[F3]

A nonnegative smooth compactly supported bump equal to one on a smaller ball has finite positive integral; after normalization its dilates form an L1 approximate identity. Convolution with each dilate is smooth and converges in L2 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 L1 approximate identity on Rn, A unit-mass smooth bump generates an L1 approximate identity, Every L1 approximate identity converges to the identity in Lp for 1≤p<∞, Convolution with a mollifier is smooth, and derivatives pass under the integral sign)

[A1]

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 (ACω))

[F4]

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 Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included)

Proof

1.1A1F1F2F3givenconstruct

On the unit square, for smooth v the one-dimensional identity ∣g(t)∣≤∫01∣g(s)∣ds+∫01∣g′(s)∣ds applied first in x and then in y gives ∥v∥∞≤∥v∥L1+∥vx∥L1+∥vy∥L1+∥vxy∥L1≤∑i,j=01∥∂xi∂yjv∥L2 by [F2]. For v∈H2((0,1)2) extend across x=0 by Ev(x,y)=3v(−x,y)−2v(−2x,y) for small x<0, and across x=1 by Ev(x,y)=3v(2−x,y)−2v(3−2x,y) for small x>1; use the same two formulas in y. The coefficients satisfy 3−2=1 for values and −3+4=1 for first normal derivatives. For a smooth test ϕ across x=0, changing variables in the zeroth-order pairing gives ψ0(t)=ϕ(t)−3ϕ(−t)+2ϕ(−t/2), so ψ0(0)=0. For the first normal derivative, the corresponding test combination is ψ1(t)=ϕ(t)+3ϕ(−t)−4ϕ(−t/2), also with ψ1(0)=0. These formulas follow by rewriting the reflected integrals over t>0 and applying the chain rule. Multiply each combined test by a cutoff that is zero on (0,ε) and one on (2ε,∞) before using the weak derivative identity on the original open square. If ∣χε′∣≤C/ε, then ∣ψjχε′∣≤C on the strip because ψj(t)=O(t); for any relevant g∈L2, Cauchy--Schwarz bounds the cutoff error by C2ε∥g∥L2(0,2ε)≤C2ε∥g∥L2(0,1)→0. 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 ∥v∥H2. 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 Dα(v∗φε)=(Dαv)∗φε 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 H2. The smooth inequality makes them uniformly Cauchy, yielding a continuous representative and the same bound for every H2 class. Scaling gives ∥v∥L∞(Q)≤C(r−1∥v∥2+∥Dv∥2+r∥D2v∥2) on a rectangle of side comparable to r; a parallelogram with fixed aspect ratio has the same estimate after an affine change of variables.

2.1A1F1F2F3F4step 1.1givenalgebra

Choose R>0 so distinct corner balls of radius 4R are disjoint and each meets only the two sides at its corner. For a point x with r=∣x−ci∣<R, choose an interior rectangle, or near one straight side an inward rectangle, of diameter comparable to r and lying in r/2<∣z−ci∣<2r. A finite angular cover gives aspect ratios and widths bounded in terms of the fixed corner angles. For each individual weak derivative gα=Dαu with ∣α∣=j≥2, the weighted hypotheses imply gα∈H2 on this rectangle. Apply the fixed second-order rectangle extension and estimate of step 1.1 to gα itself. In particular, the coefficients 3,−2 are not used to extend u in arbitrary Sobolev orders and then differentiated across a reflecting side. The extension of each gα is needed only through order two, so its bound is fixed, independently of j. On the annulus the other corner distances are bounded above and below, so at derivative order s≥2, Φβ+s−2≥C−srβi+s−2. The weighted hypotheses at orders j,j+1,j+2 therefore bound ∥gα∥2, ∥Dgα∥2, and ∥D2gα∥2 respectively by CAjj!r2−βi−j, CAjj!r1−βi−j, and CAjj!r−βi−j. Fixed affine changes of coordinates contribute at most another fixed base to the power j; the boundedly many extra derivatives and their factorial factors are absorbed into Aj. Multiplying these three norms by r−1,1,r as in step 1.1 gives ∣Dαu(x)∣≤CAjj!r1−βi−j≤CAjj!ra−j, 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 g=u and to each first derivative: their lower-order L2 terms come from u∈H1, while derivative orders two and three are bounded by the weighted hypotheses since the weights are bounded below on those patches. Thus u and its gradient are bounded there, in particular on the fixed radius-R 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 u itself, so each derivative converges locally in H2 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 u is smooth up to sides away from corners without an arbitrary-order reflected extension.

3.1step 2.1algebra

On the fixed arc of radius R about ci, step 2.1 bounds ∇u. Along every ray, the Hessian bound in step 2.1 gives ∣∇u(r,θ)∣≤C+C∫rRt−1−βidt. If βi>0 this is at most Cr−βi; if βi=0 it is at most C(1+∣log⁡r∣). Since a<1−βi, both are bounded by Cra−1 for r<R after decreasing R if needed. Integrating radially shows that u(r,θ) has a limit as r↓0 and differs from it by at most Cra. Variation along the circular arc of radius r is at most Cr⋅ra−1=Cra, so the radial limits agree for all angles; call the common value u(ci). This also proves continuity at the corner. The first-derivative estimate gives the claimed bound for ∣α∣=1, while step 2.1 gives it for higher orders because r1−βi−j≤ra−j.

4.1F2step 2.1step 3.1algebra

For a regular triangle K in the stated family, when its corner distance is sufficiently small compared with R and the fixed upper bound for hK/dist⁡(K,C), all its points lie in a single corner neighborhood; choose the constant u(ci) there; the pointwise derivative estimate and hK/dist⁡(K,C)≍1 give hK∣α∣∥Dαu∥∞≤CA1∣α∣∣α∣!rKa 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 K as the constant; the compact-patch derivative bounds and bounded diameter give the same estimate after increasing C,A1. The affine geometry factors are controlled by [F2].

5.1F2step 3.1givenalgebra∎

Let K have vertex ci and diameter h<R. On dyadic annuli 2−j−1h≤∣x−ci∣≤2−jh, step 3.1 bounds ∣∇u∣2 by C(2−j−1h)2a−2, while the area of each annulus is at most C(2−jh)2. Summing the resulting geometric series gives ∥∇u∥L2(K)2≤Ch2a, hence ∥∇u∥2≤Cha. Every vertex value differs from u(ci) by at most Cha; the barycentric gradients are bounded by C/h and ∣K∣≤Ch2 by shape regularity, so the vertex affine interpolant has gradient norm at most Cha. The pointwise value estimate gives both L2 errors at most Cha+1. The triangle inequality proves the stated seminorm and full L2 bounds.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature

Definition

Fix an integer p≥1. Let ξ0=−1, ξp=1, and let ξ1<⋯<ξp−1 be the roots of Pp′ in (−1,1); for p=1 this interior list is empty. By Legendre-Gauss-Lobatto nodes are distinct and interior critical points are simple these p+1 nodes are distinct. Define ℓj(x)=∏0≤i≤p, i≠j(x−ξi)/(ξj−ξi), set wj=∫−11ℓj(x) dx, and define the Legendre–Gauss–Lobatto rule by Qp(f)=∑j=0pwjf(ξj).

On [−1,1]d its tensor rule is Qp⊗d(f)=∑j1,…,jd=0p(wj1⋯wjd)f(ξj1,…,ξjd). For an affine box map FK(ξ)=bK+JKξ, define the transported rule by QK,p(f)=∣det⁡JK∣Qp⊗d(f∘FK). The nodal basis on K is the pullback of ∏r=1dℓjr(ξr). The local mass and stiffness forms are respectively mK,p(v,w)=QK,p(vw) and aK,p(v,w)=QK,p(∇v⋅∇w); any sampled coefficient is evaluated at the same quadrature nodes. Global forms are assembled by summing the cell forms.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniform-degree polygon corner spaces have cubic degree-of-freedom growth

Statement

For k≥1, let a matching triangulation Tk of a polygon have at most C0k triangles. Assign a uniform total polynomial degree pk≥1 with pk≤C1k. The algebraic space of continuous piecewise Ppk functions has dimension

Nk≤C2k3,

where C2 depends only on C0 and C1. 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 k≥1, a matching triangulation Tk with #Tk≤C0k, and uniform degree 1≤pk≤C1k.

[F1]

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

1.1F1givenalgebra

On a triangle, monomials xiyj with i,j≥0 and i+j≤pk form a basis of Ppk. Counting by total degree gives dim⁡Ppk=∑r=0pk(r+1)=(pk+1)(pk+2)/2.

2.1F1step 1.1givenalgebra∎

The broken product over Tk therefore has dimension #Tk(pk+1)(pk+2)/2. By [F1], trace matching and any zero-boundary conditions define a linear subspace, whose dimension cannot exceed the broken dimension. Using #Tk≤C0k and pk≤C1k, and k≥1, gives Nk≤C0k(C1k+1)(C1k+2)/2≤C2k3 for an explicit finite C2 depending only on C0,C1.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 H1(Ω), 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 T of affine simplices or affine tensor boxes; a real-valued function v 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 φ∈Cc∞(Ω).

[F1]

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.

[F2]

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 W1,2 whose weak gradient is cellwise.

[F3]

Divergence for finite piecewise C1 presentations: under Countable Choice, cellwise Gauss–Green holds for a finite piecewise C1 presentation, and the fluxes on a shared face cancel when the pieces are glued.

[F4]

A weak derivative is characterized by integration against compactly supported smooth tests, and H1=W1,2 consists of L2 classes with all first weak derivatives in L2. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)

Proof

1.1F1F2givenchoose

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, v and each cellwise first derivative gi:=∂i(v∣K) are bounded on each closed cell; a finite union then puts v,gi in L2(Ω). If the mesh is simplicial, set p∗=max⁡K∈TpK. Every restriction lies in Pp∗(K), and the trace-matching condition is unchanged. Applying [F2] at the single degree p∗ proves the claim on this branch.

1.2F1F3givenalgebra

Suppose the cells are affine tensor boxes. Fix a coordinate i. On each cell, apply [F3] to the smooth field vφei; its divergence is v ∂iφ+giφ. 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 ∫Ωv ∂iφ=−∫Ωgiφ.

2.1F1F4step 1.1step 1.2algebra∎

By [F4], step 1.2 says that gi is the weak ith derivative of v. This holds for every coordinate i, and step 1.1 supplies v,gi∈L2; hence v∈H1(Ω) with the stated cellwise weak gradient. Together with the simplex branch of step 1.1 this proves the assertion for both mesh types.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Integrated Legendre projection gives an explicit p-rate in H1

Statement

Assume Countable Choice. Let p≥1, s≥0, g∈HLs as defined in Legendre weighted spectral-Sobolev scale and projection, identified with its canonical L2(−1,1) class, and let c∈R. Define u(x)=c+∫−1xg(t) dt and Ipu=Ip(c,g) by Endpoint-preserving integrated Legendre projector. Then u and Ipu are absolutely continuous, Ipu∈Pp, and Ipu(±1)=u(±1). Moreover, ∥u−Ipu∥H1(−1,1)≤5 (1+p(p+1))−s/2∥g∥HLs, where the displayed H1 error norm is (∥u−Ipu∥L22+∥g−Πp−1g∥L22)1/2. This coefficient-scale assertion does not identify HLs with an ordinary derivative-based Sobolev norm.

Facts & Assumptions

Given: Countable Choice, p≥1, s≥0, g∈HLs, and c∈R.

[F1]

Endpoint-preserving integrated Legendre projector: Ip(c,g)=c+∫−1xΠp−1g is the degree-p endpoint-anchored operator, with Πp−1 the finite Legendre projection.

[F2]

Legendre polynomials have explicit norms and weighted derivative orthogonality: ∫−11PnPm=2δnm/(2n+1) and P0=1.

[F3]

Legendre weighted spectral-Sobolev scale and projection: HLs is a coefficient completion with weights (1+n(n+1))s2/(2n+1), so truncation is the finite projection from [F1] and its coefficient norm dominates the s=0 coefficient norm.

[F4]

Legendre weighted projection has its spectral-Sobolev rate: ∥g−ΠNg∥LL2≤(1+(N+1)(N+2))−s/2∥g∥HLs.

[F5]

The indefinite integral of an L1 function is absolutely continuous: the primitive of an L1 function is absolutely continuous.

[F6]

The indefinite integral of an L1 function is differentiable almost everywhere: under Countable Choice, the derivative of the primitive of an L1 function equals its integrand almost everywhere.

[F8]

Polynomials are uniformly dense in C([a,b],R) for every closed interval: polynomials are uniformly dense in C([−1,1]).

[F9]

Smooth compactly supported functions of an open set are dense in L2: Cc∞((−1,1)) is dense in L2(−1,1).

[F10]

Riesz-Fischer completeness of Lp for 1≤p≤∞: under Countable Choice, L2(−1,1) is complete.

Proof

1.1F1F2F3F5F7F8F9F10givenalgebra

By [F2], finite Legendre sums span all polynomials. The density facts [F8] and [F9] imply that polynomials are dense in L2(−1,1): first approximate an L2 class by a compactly supported smooth function, then approximate that function uniformly on [−1,1] by a polynomial. The coefficient norm at s=0 is the ordinary L2 norm on finite Legendre sums by [F2]–[F3], and [F10] makes L2(−1,1) complete. Hence the identity on finite sums extends to an isometry from HL0 onto L2(−1,1). Since each spectral weight for s≥0 is at least its s=0 weight, [F3] gives a continuous embedding HLs→HL0. Thus g has the canonical L2 class in the Statement, and Cauchy–Schwarz [F7] on the interval of length two gives g∈L1. Then [F5] makes u absolutely continuous. The definition [F1] makes Ipu the integral of a polynomial of degree at most p−1, hence a degree-at-most-p polynomial. By the finite projection formula in [F1] and Legendre orthogonality [F2], g−Πp−1g is orthogonal to constants, so ∫Πp−1g=∫g and the endpoint values agree. The primitive defining Ipu is absolutely continuous by [F5].

2.1F1F3F4F6F7step 1.1algebra∎

Apply [F6] to the two primitives in step 1.1; their a.e. derivatives are g and Πp−1g, so e=u−Ipu has derivative e′=g−Πp−1g. By [F3] the finite projection is the truncation in [F1]; the tail estimate [F4] with N=p−1 gives ∥e′∥L2≤(1+p(p+1))−s/2∥g∥HLs. Since e(−1)=0, e(x)=∫−1xe′(t) dt; Cauchy–Schwarz [F7] and integration over an interval of length two give ∥e∥L2≤2∥e′∥L2. Therefore ∥e∥H12=∥e∥L22+∥e′∥L22≤5∥e′∥L22, proving the estimate.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Degree-explicit polynomial trace inverse inequality on simplices

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)), as required by the affine-scaling supplier used below.

Let K be a nondegenerate d-simplex, d≥2, let F be one of its facets, and let p≥0. For every v∈Pp(K),

∥v∥L2(F)2≤(p+1)(p+d)∣F∣d∣K∣∥v∥L2(K)2.

If K belongs to a shape-regular affine simplex family with hK=diam⁡(K) and shape bound σ, then

∥v∥L2(F)2≤Cd,σ(p+1)(p+d)hK∥v∥L2(K)2.

For p≥1, the normal derivative of v has degree at most p−1 on K and satisfies the same inequalities with (p+1)(p+d) replaced by p(p+d−1). In particular, polynomial normal-flux trace penalties have the explicit scale p(p+d−1)/hK; this is an inverse trace bound, not a p-approximation or a DG coercivity theorem.

Facts & Assumptions

Given: Countable Choice, a nondegenerate simplex K, a face F, an integer p≥0, and, for the scaled inequality, a shape-regular family.

[F1]

Weighted Jacobi endpoint kernel on the reference interval: every degree-m polynomial q on [0,1] satisfies ∣q(0)∣2≤(m+1)(m+d)∫01(1−t)d−1∣q(t)∣2 dt.

[F2]

The altitude from the opposite vertex a to F is HF=d∣K∣/∣F∣, and the map x=(1−t)y+ta has volume Jacobian HF(1−t)d−1 for y∈F, 0<t<1.

[F3]

Shape regularity controls affine simplex geometry: under shape bound σ, ∣F∣/∣K∣≤Cd,σ/hK. The supplier assumes Countable Choice.

[F4]

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 t and then over F.

[A1]

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

1.1F1F2F4givenalgebra

Fix y∈F and let qy(t)=v((1−t)y+ta). This is a polynomial of degree at most p in t, and qy(0)=v(y). Apply [F1] with m=p, then integrate the resulting inequality over F. In the map (y,t)↦(1−t)y+ta, each tangent direction in F is scaled by 1−t, while the remaining component is the altitude HF; hence the absolute volume Jacobian is HF(1−t)d−1, as stated in [F2]. By Fubini [F4], ∥v∥L2(F)2≤(p+1)(p+d)∫F∫01(1−t)d−1∣v((1−t)y+ta)∣2 dt dSy=(p+1)(p+d)∣F∣d∣K∣∥v∥L2(K)2. This proves the exact reference-geometric inequality.

2.1A1F1F2step 1.1

The cellwise normal derivative ∂nv=nF⋅∇v is a polynomial of degree at most p−1. If p=0 it is zero. If p≥1, repeat step 1.1 with degree m=p−1; the endpoint factor becomes p(p+d−1).

3.1F3step 1.1step 2.1algebra∎

In a shape-regular family, apply [F3] to the factor ∣F∣/∣K∣ in step 1.1 and in the same argument for ∂nv. This gives both hK−1 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.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Constructive ordinary Sobolev polynomial approximation on triangles

Statement

Assume the Axiom of Choice. Let T={(x,y):x>0, y>0, x+y<1}, let r≥5 be an integer, let p≥2r−4 be an integer, and put n=⌊p/2⌋ and

ηn,r=((n−r+3)!(n+r−5)!)1/2.

There is a bounded linear map Ap,r:Hr(T;R)→Pp(T;R), where Pp(T;R) is the restriction of real polynomials in (x,y) of total degree at most p. It is explicitly defined in the proof from the reference-simplex extension, a unique moment polynomial, and finite Legendre projections, and satisfies

∥u−Ap,ru∥H2(T)≤Crηn,r∣u∣Hr(T).

Here Cr is independent of p 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 r is asserted. For a shape-regular affine triangle K of diameter hK, affine transport gives

(∑j=02hK2j−2∣u−AK,p,ru∣Hj(K)2)1/2≤Cr,γηn,rhKr−1∣u∣Hr(K).

If p≥4(r−2), then ηn,r≤(4/p)r−4. This is a conservative ordinary Sobolev rate; it is neither an optimal p−(r−1) estimate nor an analytic growth estimate for Cr.

Facts & Assumptions

Given: Full Choice; the reference triangle T; integers r≥5, p≥2r−4; and u∈Hr(T;R) with weak derivatives and Sobolev norms as in Integer-order Sobolev spaces and their norms.

[A1]

Full Choice is used by the reference-simplex extension and by the one-dimensional Sobolev representative supplier. (The Axiom of Choice)

[F1]

The ordinary Legendre projection obeys the factorial L2 derivative-tail estimate for every integer derivative order. The endpoint-anchored operator Sn used below is defined locally from this projection. (An ordinary derivative controls the Legendre tail with a factorial ratio)

[F2]

The reference simplex has a bounded linear extension Er:Hr(T)→Hr(R2); write Mr=∥Er∥. (A reference simplex is an integer-order Sobolev extension domain)

[F3]

The unique polynomial Br−1u∈Pr−1 whose derivative moments through order r−1 match those of u satisfies ∥u−Br−1u∥Hr(T)≤Br∣u∣Hr(T). (Bramble–Hilbert approximation on a reference simplex)

[F4]

Smooth functions on R2 are dense in Hr(R2), and one-dimensional weak derivatives through order s−1 have absolutely continuous representatives on the interval. (Compactly supported smooth functions are dense in W^{k,p}(R^n), One-dimensional W1,p functions have unique absolutely continuous representatives)

[F6]

Affine pullback derivatives and Sobolev seminorms scale with the singular values, determinant, and shape-regularity bound. (Shape regularity controls affine simplex geometry)

[F7]

The finite-dimensional tensor polynomial space Qn is closed in H2(I2). (A finite-dimensional normed subspace is closed)

Proof

1.1A1F1F4F5givenconstructalgebra

On I=(−1,1) define Snf(x)=f(−1)+(x+1)f′(−1)+∫−1x(x−t)Πn−2f′′(t) dt, where Πn−2 is the ordinary Legendre L2 projection. Here p≥2r−4 implies n≥r−2≥3. For f∈H2(I), the endpoint values are those of its absolutely continuous representatives from [F4]. The polynomial Snf has degree at most n and matches f,f′ at −1. Its second derivative is an L2 contraction; integrating twice and using the one-dimensional endpoint estimate gives ∥Snf∥H2(I)≤C∥f∥H2(I) with absolute C. For every integer s≥3 with n≥s−1, the error e=f−Snf has e(−1)=e′(−1)=0 and e′′=f′′−Πn−2f′′. Apply the Legendre tail estimate to f′′ with derivative order s−2 and projection degree n−2; the factorial ratio is ρn,s=((n−s+1)!(n+s−3)!)1/2. Two integrations of e′′, with Cauchy–Schwarz [F5], give ∥e∥H2(I)≤Cρn,s∥f(s)∥2. The same inequality holds for each derivative of order at most two.

2.1F1F4F5F7step 1.1algebra

Put Qn=span⁡{xiyj:0≤i,j≤n}, apply Sn in each coordinate on I2, and write Snx,Sny. For smooth U, U−SnxSnyU=(1−Snx)U+Snx(1−Sny)U. Let a+b≤2. For the first term choose sb=r−max⁡(1,b), so sb∈{r−1,r−2}, sb≥3, n≥sb−1, and sb+b≤r. Step 1.1 on the x sections of DybU bounds ∥DxaDyb(1−Snx)U∥2 by Cρn,sb∥DxsbDybU∥2. For the second term, the uniform Hx2 bound in step 1.1 bounds its DxaDyb norm by C∑j=02∥DxjDyb(1−Sny)U∥2. For each such j, choose tj=r−max⁡(1,j)∈{r−1,r−2}; then tj≥3, n≥tj−1, and j+tj≤r. Apply the Hy2 error estimate of step 1.1 to DxjU; it bounds every y derivative of order b≤2 in this sum by Cρn,tj∥DxjDytjU∥2. Because ρn,r−1≤ρn,r−2=ηn,r, all terms are bounded by Cηn,r∥U∥Hr(I2). Fubini [F5] and addition over a+b≤2 give ∥U−SnxSnyU∥H2(I2)≤Cηn,r∥U∥Hr(I2). For the inputs used below, namely restrictions of Hr(R2) extensions, choose smooth whole-space approximants by [F4]. The estimate on their differences makes SnxSnyU a well-defined H2 limit. Every smooth approximant has image in Qn, so closedness [F7] gives SnxSnyU∈Qn and the same bound for the limit.

3.1A1F2F3step 2.1constructalgebra

Let b=Br−1u and w=u−b. By [F3], ∥w∥Hr(T)≤Br∣u∣Hr(T). Set U=(Erw)∣I2 and define Ap,ru=b+(SnxSnyU)∣T. This map is linear. The first summand has degree at most r−1≤p; the second lies in Qn⊆P2n⊆Pp. Since Erw=w on T, step 2.1 and [F2]–[F3] yield ∥u−Ap,ru∥H2(T)≤CMrBrηn,r∣u∣Hr(T). This identifies the constant as the absolute tensor constant times the fixed extension and moment bounds; no growth in r is asserted.

4.1F6step 3.1givenalgebra∎

Transport step 3.1 to a shape-regular affine triangle K. For e=u−AK,p,ru and e^=e∘FK, two-dimensional affine pullback gives ∣e^∣Hj(T)≍j,γhKj−1∣e∣Hj(K) for j=0,1,2, and ∣u^∣Hr(T)≤Cr,γhKr−1∣u∣Hr(K) by [F6]. This proves the displayed full scaled estimate. Finally, ηn,r−2 is a product of 2(r−4) consecutive integers beginning with n−r+4. If p≥4(r−2) and n=⌊p/2⌋, then n−r+4≥p/4; taking square roots yields ηn,r≤(4/p)r−4.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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 u∈C1(Ω‾) be smooth on each box. For each cell K, let u^K be its pullback to [−1,1]d. Assume that for fixed constants M>0 and R>1,

sup⁡x^∈[−1,1]d∣∂νu^K(x^)∣≤M∣ν∣!R−∣ν∣

for every multi-index ν∈N0d and every cell K. Choose any q with R−1<q<1. For each common degree p≥1, tensorize the endpoint-preserving integrated Legendre projector of Endpoint-preserving integrated Legendre projector on each reference cell and transport it to K, obtaining up. Then the cell traces of up agree across every shared face and

∥u−up∥H1(Ω)≤CT,d,R,qMqp.

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 C1 function u smooth on each cell; M>0, R>1, integer p≥1, and R−1<q<1.

[F1]

Variable-degree conforming hp spaces on matching affine meshes: Qp(K) is the pullback of degree-at-most-p polynomials in each reference coordinate; a trace-matching box space is defined by equality on shared faces.

[F2]

Endpoint-preserving integrated Legendre projector: the one-coordinate operator is Ip(f(−1),f′)=f(−1)+∫−1xΠp−1f′ for an absolutely continuous section with square-integrable derivative.

[F3]

Taylor's Lagrange remainder follows from repeated Rolle steps: for a Cp function on an interval containing 0 and x, the degree-(p−1) Taylor polynomial at zero has remainder bounded by sup⁡∣f(p)∣∣x∣p/p!.

[F4]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: Cauchy–Schwarz holds for the L2 inner product on the reference interval and cube.

[F5]

Legendre polynomials have explicit norms and weighted derivative orthogonality: P0=1 and the Legendre family is orthogonal with ∫−11P02=2.

[F6]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): if a function is differentiable on a compact interval and its derivative is Riemann integrable, the integral of that derivative equals the endpoint increment.

[F7]

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.

[F8]

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 H1(Ω) function with its cellwise weak gradient.

[A1]

The mixed derivative norm used below is ∥f∥mix2:=∑S⊆{1,…,d}∥∂Sf∥L2([−1,1]d)2, where ∂S differentiates once in each coordinate in S and ∂∅f=f.

Proof

1.1F2F4F5F6F7givenalgebra

On the reference cube define Ip(j) by applying [F2] in coordinate j, holding all other coordinates fixed, and put Ip=Ip(1)⋯Ip(d). Each factor maps degree-at-most-p polynomials in its coordinate to the same degree space, so Ipu^K∈Qp. Fix a smooth one-dimensional section f and write g=f′. By [F6], f(x)−f(−1) is the Riemann integral of g from −1 to x; [F7] identifies it with the Lebesgue integral used in [F2] and the coefficient formula [F2] (applied to the continuous products gPn). Orthogonality [F5] makes the constant coefficient exact, so Ipf preserves both endpoints. The bound ∣f(−1)∣≤2−1/2∥f∥L2+2∥f′∥L2 follows by averaging f(x)=f(−1)+∫−1xf′ over x and applying Cauchy–Schwarz [F4, F7]; together with ∥Πp−1f′∥2≤∥f′∥2 this gives ∥Ipf∥L2+∥(Ipf)′∥L2≤C∥f∥H1 uniformly in p. Also, if an absolutely continuous w vanishes at −1, then w(x)=∫−1xw′ and Cauchy–Schwarz [F4] gives ∥w∥L2≤2∥w′∥L2.

2.1A1F2F3F6F7step 1.1givenalgebra

Fix j and a subset S of the coordinate indices. If j∈S, then ∂S(Ip(j)−I)u^K=(Πp−1(j)−I)∂j∂S∖{j}u^K. If j∉S, then ∂S(Ip(j)−I)u^K=(Ip(j)−I)∂Su^K, whose j derivative is (Πp−1(j)−I)∂j∂Su^K and whose value at −1 is zero. Thus in either case the error is controlled by the Legendre projection tail of g=∂j∂Tu^K, where T=S∖{j} in the first case and T=S in the second. Write r=∣T∣≤d−1 and let Tp−1 be its Taylor polynomial at zero through degree p−1. Taylor's Lagrange remainder [F3] bounds ∣g−Tp−1∣ on [−1,1] by M(p+r+1)!R−p−r−1/p!. Orthogonality of Πp−1(j) gives ∥g−Tp−1∥22=∥g−Πp−1(j)g∥22+∥Πp−1(j)g−Tp−1∥22, so the projection error is at most 2M(p+r+1)!R−p−r−1/p!. For fixed d,R,q this is at most Cd,R,qMqp: the factorial ratio is bounded by a fixed-degree polynomial in p, while (Rq)−p decays geometrically. Anchoring at −1 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 (Ip(j)−I)u^K.

3.1step 1.1step 2.1algebra

The estimate in step 1.1 is stable in every mixed derivative: if a mixed derivative includes coordinate j, differentiating Ip(j) there gives the contractive projection Πp−1(j); if it omits j, the one-dimensional H1 bound in step 1.1 controls the application of Ip(j) using that derivative and its additional j derivative. Summing over the finitely many subsets S gives ∥Ip(j)f∥mix≤Cd∥f∥mix uniformly in p. The telescoping identity Ip−I=∑j=1dIp(1)⋯Ip(j−1)(Ip(j)−I) and step 2.1 now imply ∥u^K−Ipu^K∥H1([−1,1]d)≤Cd,R,qMqp.

4.1F1F2F8step 3.1givenalgebra∎

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 L2 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 u, and the resulting cell traces match. The conformity result [F8] gives up∈H1(Ω); since u∈H1(Ω), the local estimates sum to the stated global H1 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 CT,d,R,q.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Constructive varying-degree triangle interpolation in unweighted H1

Statement

Assume Full Choice. Let T be a finite matching shape-regular affine triangulation in two dimensions, let each cell K have an arbitrary finite total degree pK≥1, and let u∈C(Ω‾;R) satisfy u∣K∈H2(K) for every cell. For every edge E, let τE be either unit tangent direction and write ∂τEv=∇v⋅τE. For an interior edge E=K∩K′, set pE=min⁡(pK,pK′); for a boundary edge of K, set pE=pK. Put mK=min⁡E⊂∂KpE. There is a linear interpolant IT,pu in the trace-matching space of Variable-degree conforming hp spaces on matching affine meshes. It preserves any zero boundary edge data: if u vanishes on a boundary edge, so does IT,pu. For every q∈PmK(K;R),

∣u−IT,pu∣H1(K)≤∣u−q∣H1(K)+Cγ∑E⊂∂K(ℓE−1/2∥u−q∥L2(E)+ℓE1/2∥∂τE(u−q)∥L2(E)),

and

hK−1∥u−IT,pu∥L2(K)+∣u−IT,pu∣H1(K)≤Cγ(hK−1∥u−q∥L2(K)+∣u−q∣H1(K)+∑E⊂∂K(ℓE−1/2∥u−q∥L2(E)+ℓE1/2∥∂τE(u−q)∥L2(E))).

The constant is independent of the degrees and their ratios. In particular, if integer r≥5, mK≥2r−4, nK=⌊mK/2⌋, and u∣K∈Hr(K), then

∣u−IT,pu∣H1(K)≤Cr,γhKr−1((nK−r+3)!(nK+r−5)!)1/2∣u∣Hr(K).

For mK≥4(r−2) the factorial factor is at most (4/mK)r−4. The effective degree mK 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 pK≥1; a real continuous input with cellwise H2 regularity; and, for the final rate, integer r≥5, mK≥2r−4, and cellwise Hr regularity.

[A1]

Full Choice is assumed through the Sobolev extension and point-evaluation suppliers used below. (The Axiom of Choice)

[F1]

The integrated Legendre operator is Ijf=f(−1)+∫−1xΠj−1f′, where Πj−1 is the L2 orthogonal projection onto Pj−1; it is a degree-j polynomial and its derivative projection is a contraction. (Endpoint-preserving integrated Legendre projector)

[F2]

The strong-edge lift constructs a degree-preserving polynomial extension of endpoint-zero edge data, zero on the other two edges, with H1 seminorm and L2 bounds independent of degree. (A degree-uniform polynomial edge lift with the strong edge norm)

[F3]

The ordinary triangle approximation theorem gives a degree-p polynomial with the displayed scaled H2 error and factorial ratio under Hr regularity. (Constructive ordinary Sobolev polynomial approximation on triangles)

[F4]

On a triangle, the Sobolev trace maps H2(K) continuously into H1(E) on each edge, and tangential differentiation commutes with the trace; smooth density justifies the derivative trace identity. In dimension two, H2(K) 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)

[F5]

Matching polynomial traces on a finite simplicial mesh assemble into an H1 function with the cellwise gradient. (Matching variable-degree polynomial traces give an H1 function, Variable-degree conforming hp spaces on matching affine meshes)

[F6]

One-dimensional H1 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 W1,p functions have unique absolutely continuous representatives, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

Proof

1.1A1F4F6givenconstructalgebra

Justify the Sobolev edge assertion in [F4] from the actual H1 trace theorem, rather than assuming a stronger trace statement. On the reference triangle choose smooth wj→w in H2 by its smooth-density supplier. The H1 trace theorem applied to wj and separately to each ∂iwj∈H1 gives γEwj→γEw and γE∇wj→γE∇w in L2(E). For every ζ∈Cc∞(E), ordinary one-dimensional integration by parts gives ∫EγEwj ∂τζ=−∫E(γE∇wj⋅τ)ζ. Passing to the L2 limits proves ∂τγEw=γE∇w⋅τ in distributions and hence γEw∈H1(E), with norm at most C∥w∥H2. Its continuous edge representative agrees with the continuous representative of w: smooth approximants converge uniformly on the edge by the one-dimensional H1 bound [F6], while the point-evaluation supplier in [F4] gives their convergence to w at each fixed edge point, including the vertices. Transporting the value trace and the gradient trace separately to K yields ∥w∥L2(E)≤Cγ(hK−1/2∥w∥L2(K)+hK1/2∣w∣H1(K)) and ∥∂τw∥L2(E)≤Cγ(hK−1/2∣w∣H1(K)+hK1/2∣w∣H2(K)). Thus the scaled edge expression in the Statement is bounded by Cγ(hK−1∥w∥2+∣w∣H1+hK∣w∣H2), precisely the scaled H2 quantity used in the final rate.

1.2A1F1F2F6givenconstructalgebra

Fix a single orientation of every geometric edge and affine-transport the operator in [F1] to define gE=IpE(u∣E). For any s∈PpE(E), its derivative lies in PpE−1(E), so the projection is exact and IpEs=s. For a general absolutely continuous f on E, the residual f′−ΠpE−1f′ is orthogonal to constants, so its integral over E is zero; the anchor formula and [F6] therefore show that IpEf has both endpoint values of f. In particular gE takes the endpoint values of u. For each cell K, let aK be the affine polynomial with the three vertex values of u. Each residual dE=gE−aK∣E has zero endpoints and degree at most pE≤pK. Sum the three lifts from [F2] and put GK=aK+∑E⊂∂KLEdE; it has degree at most pK and trace gE on each edge. Let ZK={z∈PpK(K):z∣∂K=0}. In the finite-dimensional affine space GK+ZK, choose the unique Iu∣K satisfying ∫K∇(Iu−u)⋅∇z=0 for every z∈ZK. Existence and uniqueness follow from the positive-definite Gram matrix of the gradients on ZK: if ∫K∣∇z∣2=0, the polynomial z is constant, and its zero boundary trace forces z=0. If ZK={0}, the system is empty and Iu∣K=GK. Thus the construction is linear and uses only uniquely determined finite systems.

2.1F1F5step 1.2givenalgebra

Both cells incident to an edge use the same oriented edge polynomial gE, so their traces agree and have degree at most pE. By [F5], the assembled interpolant is in the trace-matching H1 space. If E is a boundary edge on which u=0, then gE=IpE0=0, so the interpolant also vanishes there.

2.2F1F2F4F6step 1.2algebra

Fix q∈PmK(K) and put w=u−q. Since mK≤pE, [F1] reproduces q∣E, so gE−q∣E=IpE(w∣E). Its endpoint values are those of w. The one-dimensional endpoint estimate from [F4] bounds each vertex value ∣w(v)∣ by C(ℓE−1/2∥w∥L2(E)+ℓE1/2∥∂τEw∥L2(E)) on any incident edge. Consequently the affine interpolant aKw of the vertex values has ∣aKw∣H1(K)+hK−1∥aKw∥L2(K) bounded by the sum of these three edge terms. On each edge, IpE(w∣E)−aKw∣E 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 cK∈PpK(K) with trace gE−q∣E and ∣cK∣H1(K)+hK−1∥cK∥L2(K)≤Cγ∑E⊂∂K(ℓE−1/2∥w∥L2(E)+ℓE1/2∥∂τEw∥L2(E)).

3.1F3F4F6step 1.1step 1.2step 2.2algebra∎

The polynomial q+cK has the same boundary trace as Iu∣K, so z:=q+cK−Iu∈ZK. The energy orthogonality in step 1.2 makes Iu the best H1-seminorm approximation to u in the affine space GK+ZK; hence ∣u−Iu∣H1(K)≤∣u−q−cK∣H1(K)≤∣u−q∣H1(K)+∣cK∣H1(K). This and step 2.2 prove the first estimate. For the full norm, the reference-triangle identity z(x,y)=∫0x∂xz(t,y)dt holds because z=0 on x=0; Fubini and Cauchy–Schwarz [F6] give ∥z∥L2(K)≤CγhK∣z∣H1(K). Also ∣z∣H1(K)≤∣q+cK−u∣H1(K)+∣u−Iu∣H1(K)≤2(∣u−q∣H1(K)+∣cK∣H1(K)). Decompose u−Iu=(u−q)−cK+z, use the triangle inequality and the L2 lift bound from step 2.2, and obtain the displayed full-norm estimate. If u∣K∈Hr(K), choose q=AmK,ru from [F3]. The proved edge trace bounds in step 1.1 control every edge term by Cr,γhKr−1ηnK,r∣u∣Hr(K), proving the stated rate. Finally ηnK,r−2 is the product of 2(r−4) consecutive integers beginning at nK−r+4≥mK/4; taking square roots proves the simplified power bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

GLL quadrature changes only the top Legendre modes and is p-uniformly equivalent

Statement

For every p≥1, the one-dimensional GLL rule integrates all polynomials of degree at most 2p−1 exactly and has positive weights. If f=∑n=0panPn, then Qp(f2)−∫−11f2=2(p+1)p(2p+1)ap2. For every v∈Qp([−1,1]d), ∥v∥L22≤Qp⊗d(v2)≤3d∥v∥L22,∥∇v∥L22≤Qp⊗d(∣∇v∣2)≤3d∥∇v∥L22. The same inequalities hold on affine boxes under the transported rule. If a pointwise-defined scalar coefficient a:K‾→R is Lebesgue measurable on K and satisfies 0<a‾≤a(x)≤a‾ throughout K‾, the sampled form QK,p(a∣∇v∣2) is equivalent to the exact weighted energy ∫Ka∣∇v∣2 with lower factor a‾/a‾ and upper factor 3da‾/a‾. 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 p≥1, dimension d≥1, the GLL nodes and weights, and, for the coefficient bound, a pointwise-defined scalar coefficient a:K‾→R that is Lebesgue measurable on K and has the stated bounds at every point of K‾.

[F1]

Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature: the nodes are −1, 1, and the roots of Pp′, and the weights are interpolatory integrals of the degree-p cardinal polynomials.

[F2]

Legendre polynomials by Rodrigues' formula and their unweighted pairing and Legendre polynomials have explicit norms and weighted derivative orthogonality: Pn has degree n, leading coefficient κn>0, and ∫−11PnPm=2δnm/(2n+1).

[A1]

The local tensor polynomial space and affine box conventions are those of Variable-degree conforming hp spaces on matching affine meshes.

Proof

1.1F1F2givenalgebra

Define g(x)=(x2−1)Pp′(x); it vanishes at all GLL nodes and has degree p+1. For p≥2, divide any polynomial f of degree at most 2p−1 as f=gr+s with deg⁡r≤p−2 and deg⁡s≤p. Integration by parts gives ∫−11gr=−∫−11Pp(2xr+(x2−1)r′)=0, since the boundary term vanishes and the bracket has degree at most p−1. The quadrature of gr is also zero because g vanishes at every node, while the interpolatory definition integrates s exactly. Thus Qp(f)=∫f. For p=1, interpolatory exactness through degree p=1 is the required degree 2p−1=1.

2.1F1F2step 1.1algebra

Divide Pp2=gr+s with deg⁡r=p−1 and deg⁡s≤p. Since the leading coefficient of g is pκp, the leading coefficient of r is κp/p. Integration by parts as in step 1.1 gives ∫gr=−∫Pp(2xr+(x2−1)r′). The bracket has degree at most p and leading coefficient (p+1)κp/p, so it equals (p+1)Pp/p plus a polynomial of degree below p; orthogonality [F2] therefore gives ∫gr=−(p+1)∥Pp∥22/p. Since Qp(gr)=0 and Qp(s)=∫s, it follows that Qp(Pp2)−∫Pp2=−∫gr=(p+1)∥Pp∥22/p=2(p+1)/(p(2p+1)).

3.1F1F2step 1.1step 2.1algebra

Write any degree-p polynomial as f=apPp+r with deg⁡r<p. Step 1.1 integrates r2 and Ppr exactly, so step 2.1 gives Qp(f2)=∫f2+δpap2, where δp=2(p+1)/(p(2p+1))>0. For a cardinal polynomial ℓj, Qp(ℓj2)=wj by its nodal values, while the displayed identity gives wj=∫ℓj2+δpap(ℓj)2>0. Thus all quadrature weights are positive and the one-dimensional squared norm ratio is between 1 and 2+1/p≤3.

4.1A1step 1.1step 3.1givenalgebra

Expand a tensor polynomial in the orthogonal basis ∏r=1dPνr(ξr), 0≤νr≤p. 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 1 unless νr=p, when step 3.1 bounds it by 3. Multiplying the d coordinate factors proves the mass norm bounds. Each coordinate derivative of a tensor polynomial is still in Qp, so applying the same tensor norm bounds to each component and summing proves the gradient bounds.

5.1A1step 4.1givenalgebra∎

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 a∣∇v∣2 integrable on the bounded box, and its specified values on K‾ define every quadrature sample. Positivity of the weights and the pointwise bounds give a‾ Q(∣∇v∣2)≤Q(a∣∇v∣2)≤a‾ Q(∣∇v∣2) 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 p.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Exponential hp energy convergence for weighted-analytic polygon corners

Statement

Assume Countable Choice. Let Ω⊂R2 be a bounded polygonal open domain with finite corner set C={c1,…,cm} and weights 0≤βi<1. For γ∈[0,∞)m define Φγ(x)=∏i∣x−ci∣γi; β+j−2 means componentwise addition. For integer k≥2, define

∥v∥Hβk,2(Ω)2=∥v∥H1(Ω)2+∑j=2k∑∣α∣=j∥Φβ+j−2Dαv∥22.

Let Bβ2(Ω) consist of real-valued functions in every Hβk,2(Ω) for which some Cu,du>0 satisfy

∥Φβ+k−2∑∣α∣=k∣Dαu∣∥2≤Cuduk−2(k−2)!(k≥2).

Let (Tk)k≥1 be nested finite matching shape-regular affine triangulations of Ω, with at most C0k triangles. Write hT=diam⁡(T) and dist⁡(T,C)=inf⁡x∈T,c∈C∣x−c∣. Assume a fixed 0<σ<1 and C1>0 satisfy

σ≤hTdist⁡(T,C)≤σ−1(T‾∩C=∅),hT≤C1σk(T‾∩C≠∅).

Let pk∈N be uniform total polynomial degrees with c0k≤pk≤c1k for fixed 0<c0≤c1. For a fixed union ΓD of polygon edges, let Vk be the space of broken piecewise-Ppk functions whose polynomial traces agree on every interior edge and vanish on the boundary edges in ΓD; put Nk=dim⁡Vk. 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 ΓD; no zero condition is imposed on the other edges. If u∈Bβ2(Ω) satisfies this boundary condition, then constants C,b>0, independent of k, satisfy

inf⁡vk∈Vk∥∇(u−vk)∥L2(Ω)≤Ce−bNk1/3.

For a bounded coercive conforming Galerkin problem on a Hilbert space V⊂H1(Ω), assume u∈V is its exact variational solution: a(u,v)=F(v) for every v∈V, with bounded load F. If Vk⊂V and the norm on V is equivalent to the gradient seminorm, Céa's estimate gives the same exponential rate for the energy error, with its actual M/α and norm-equivalence factors included. The constants may depend on the polygon, weights, weighted analytic bounds, mesh shape and grading constants, degree constants, ΓD, 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 c0k≤pk≤c1k; and the fixed boundary-edge set ΓD.

[A1]

Countable Choice is assumed explicitly; no full Choice is used in this proof. (The Axiom of Countable Choice (ACω))

[F1]

The weighted corner estimates give a continuous representative, corner decay ∣u−u(ci)∣≤Cra, pointwise derivative bounds, and analytic scaled bounds on regular triangles. (Weighted analytic polygon functions have corner decay and scaled analytic bounds)

[F2]

The analytic polynomial supplier gives exponential W1,∞ approximation on a reference triangle and an endpoint-preserving interval projector whose derivative is an L2 contraction with exponential H1 error. (Analytic derivative bounds give exponential polynomial approximation on a triangle)

[F3]

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 CℓE1/2∥∂τq∥2. (A degree-uniform polynomial edge lift with the strong edge norm)

[F4]

The variable-degree space is the finite matching polynomial space with trace equality; the conformity lemma glues matching polynomial traces into H1; and the corner count gives Nk≤CNk3. (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)

[F5]

Céa's theorem gives ∥u−uk∥V≤(M/α)inf⁡vk∈Vk∥u−vk∥V for the exact variational solution u and its Galerkin solution uk, under its stated bounded-load, boundedness, coercivity, conformity, and Countable Choice hypotheses. (Céa quasi-optimality for coercive conforming Galerkin problems)

[F6]

Cauchy–Schwarz controls one-dimensional trace errors and the area estimates on the regular triangles. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

Proof

1.1A1F1givenalgebra

Fix 0<a<min⁡i(1−βi) 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 k each cap contains at most one corner; its diameter is at most C1σk. On a noncap cell T with dT=dist⁡(T,C)<R, the mesh condition gives σ≤hT/dT≤σ−1, so [F1] gives uniform scaled analytic derivative bounds after subtracting a suitable constant. If dT≥R, the compact-away-from-corners bounds in [F1], together with bounded hT and the fixed rT=R, give the same conclusion after enlarging constants. Thus each noncap reference pullback has derivative bounds CrTaA1∣α∣∣α∣!, where rT=min⁡(R,dT).

2.1F1F2F6step 1.1givenconstruct

For every mesh edge incident to a polygon corner, prescribe the linear interpolant of the two endpoint values of the continuous representative of u. All cells sharing such an edge are caps. On every other edge E, prescribe the single common endpoint-preserving derivative-projection polynomial gE 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, ∥u−gE∥L∞(E)+ℓE1/2∥∂τ(u−gE)∥L2(E)≤CrTae−bpk for each adjoining noncap cell, with comparable scales on both sides. Here the sup bound follows from the endpoint identity and ∥e∥∞≤∥e′∥L1≤∥e′∥L2 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 u at the corner is used. Every edge polynomial takes the value of u at both endpoints. If E⊂ΓD, these endpoint values and the entire prescribed edge polynomial are zero.

3.1F2F3step 1.1step 2.1algebra

Let T be a noncap triangle and choose qT∈Ppk(T) by transporting the analytic approximation [F2] for the scaled pullback, then adding back its subtracted constant. Thus ∥u−qT∥∞+hT∥∇(u−qT)∥∞≤CrTae−bpk. Correct its three vertex values by an affine polynomial to obtain q~T matching the prescribed gE at all vertices; the correction has H1 seminorm at most CrTae−bpk. On each edge, gE−q~T∣E has zero endpoints, degree at most pk, and strong edge derivative norm at most CrTae−bpk. Lift these three residuals separately by [F3]. Their sum does not change the other edge traces, so the resulting vT∈Ppk(T) has all three prescribed traces and ∣u−vT∣H1(T)≤CrTae−bpk≤Ce−bpk.

3.2F1F2F3F6step 1.1step 2.1algebra

Let T be a cap at corner ci, with diameter hT; for large k it contains no other corner. Start with the affine interpolant aT of the three exact vertex values. By [F1], ∣u−aT∣H1(T)≤ChTa. Its two edges incident to ci already have the prescribed linear traces. On the opposite edge E, every point has distance comparable to hT from ci, so the gradient bound in [F1] and Cauchy–Schwarz [F6] give ℓE1/2∥∂τu∥L2(E)≤ChTa. The interval derivative projection in [F2] is contractive, and the vertex estimate in [F1] gives the same bound for gE−aT∣E. This discrepancy vanishes at both endpoints; add its lift from [F3]. The resulting polynomial has all prescribed traces and ∣u−vT∣H1(T)≤ChTa≤Cσak. No H2 regularity is used on a cap.

4.1F4step 3.1step 3.2givenalgebra

Every pair of adjacent local polynomials has common trace gE; the boundary traces vanish on ΓD. Thus they assemble to vk∈Vk by [F4]. Summing squared cell errors from steps 3.1 and 3.2 over at most C0k cells gives ∥∇(u−vk)∥2≤Ck(e−bpk+σak)≤C′e−ηk for some η>0, because pk≥c0k and 0<σ<1. The finitely many earlier meshes are handled by vk=0 and an increase of C′. Since Nk≤CNk3 by [F4], k≥CN−1/3Nk1/3 and therefore inf⁡v∈Vk∥∇(u−v)∥2≤Ce−bNk1/3.

5.1F5step 4.1givenalgebra∎

Under the additional Galerkin hypotheses, u satisfies a(u,v)=F(v) for every v∈V, and the Galerkin solution uk∈Vk satisfies a(uk,vk)=F(vk) for every vk∈Vk. Thus Céa [F5] applies to this same u and uk. Apply it to the best-approximation estimate of step 4.1. Norm equivalence between ∥⋅∥V and the gradient seminorm changes only the stated constant, and the actual M/α factor is retained. This proves the energy-error conclusion.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 V=H1(Ω) with its standard norm, let a(v,w)=∫Ω(∇v⋅∇w+vw), and let F be a bounded linear functional on V. Let u∈V solve a(u,w)=F(w) for all w∈V, and let up 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 M,R and R−1<q<1, then

∥u−up∥H1(Ω)≤CT,d,R,qMqp.

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; a,F,u,V as in the Statement; integer p≥1; and the analytic derivative bound and q of the fixed-mesh projector theorem.

[F1]

Matching variable-degree polynomial traces give an H1 function: the trace-matching tensor space is a finite-dimensional subspace of H1(Ω).

[F2]

Analytic data converge exponentially under fixed-mesh p refinement: there is a trace-matching up∗∈Vp with ∥u−up∗∥H1≤CT,d,R,qMqp.

[F3]

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 ∥u−up∥V≤(Ma/αa)inf⁡vp∈Vp∥u−vp∥V.

[A1]

For the form in the Statement, Cauchy–Schwarz gives ∣a(v,w)∣≤∥v∥H1∥w∥H1 and a(v,v)=∥v∥H12.

Proof

1.1A1F1F3given

By [F1], Vp is finite-dimensional and contained in the Hilbert space V. The form in [A1] is bounded with Ma=1 and coercive with αa=1. The exact solution and bounded functional are among the hypotheses in Given, so [F3] applies and yields ∥u−up∥H1≤inf⁡vp∈Vp∥u−vp∥H1. Its only axiom beyond classical real analysis is Countable Choice, stated in Given.

2.1F2step 1.1algebra∎

The approximant up∗ in [F2] belongs to Vp, so the infimum in step 1.1 is no greater than ∥u−up∗∥H1. Substituting its bound from [F2] proves the stated energy estimate.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Galerkin energy error with local h, trace degree and Sobolev regularity

Statement

Assume the Axiom of Choice. Let T be any finite matching shape-regular affine triangulation of a bounded polygonal open set Ω⊂R2, with shape bound γ and arbitrary degrees pK≥1. Set pE=min⁡(pK,pK′) on an interior edge, pE=pK on a boundary edge, and mK=min⁡E⊂∂KpE. Thus the effective degree retains neighboring shared-trace restrictions, without a bound on degree ratios.

Choose χ=1 and V=H1(Ω), or χ=0 and V=H01(Ω), with Hilbert norm ∥v∥V2=∣v∣H1(Ω)2+χ∥v∥L2(Ω)2. Let VT,p be the corresponding conforming hp space, imposing zero boundary traces in the χ=0 branch. Suppose the real bilinear form a and real linear functional F satisfy ∣a(v,w)∣≤Ma∥v∥V∥w∥V,a(v,v)≥αa∥v∥V2,αa>0, with F bounded. Let u∈V be the variational solution and uT,p its conforming Galerkin solution. Suppose u∈C(Ω‾) and u∣K∈H2(K); in the zero-boundary branch its continuous representative vanishes on the boundary edges.

For any cellwise comparison polynomials qK∈PmK(K) put wK=u−qK and JK(qK)=∣wK∣H1(K)+∑E⊂∂K(ℓE−1/2∥wK∥L2(E)+ℓE1/2∥∂τEwK∥L2(E)),RK(qK)=hK−1∥wK∥L2(K)+JK(qK). Then the actual energy-space error obeys ∥u−uT,p∥V≤MaαaCγ(∑K∈T[JK(qK)2+χhK2RK(qK)2])1/2. This comparison estimate applies to every degree assignment and the stated piecewise H2 inputs; the comparison polynomials need not match across edges.

For any cellwise integers sK≥2 with mK≥sK−1 and u∣K∈HsK(K), this also gives the general h-refinement bound ∥u−uT,p∥V≤Maαa(∑KCsK,γ2(1+χhK2)hK2(sK−1)∣u∣HsK(K)2)1/2. In particular every assignment pK≥1 admits the piecewise H2 estimate with sK=2.

For the additional explicit p-dependent refinement, let integers rK≥5 satisfy mK≥2rK−4, assume u∣K∈HrK(K), and put nK=⌊mK/2⌋ and ηK=((nK−rK+3)!(nK+rK−5)!)1/2. There are constants CrK,γ independent of all diameters, degrees and degree ratios such that ∥u−uT,p∥V≤Maαa(∑K∈TCrK,γ2(1+χhK2)hK2(rK−1)ηK2∣u∣HrK(K)2)1/2. If mK≥4(rK−2), one may replace ηK by (4/mK)rK−4. For a common regularity r, this displays local hKr−1 and the proved conservative trace-degree factor mK−(r−4). It does not claim the optimal p−(r−1) rate or any bound on growth of Cr,γ as r→∞. 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.

[F1]

Constructive varying-degree triangle interpolation in unweighted H1 gives a single linear trace-matching interpolant Iu, preserving zero boundary edge values, with ∣u−Iu∣H1(K)≤CγJK(qK) and hK−1∥u−Iu∥L2(K)+∣u−Iu∣H1(K)≤CγRK(qK). Its local H2 edge trace and tangential-derivative identity are proved there from smooth density and the actual first-order trace theorem.

[F2]

Constructive ordinary Sobolev polynomial approximation on triangles supplies qK=AK,mK,rKu with (∑j=02hK2j−2∣u−qK∣Hj(K)2)1/2≤CrK,γhKrK−1ηK∣u∣HrK(K), and the stated high-degree simplification.

[F3]

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.

[F4]

Céa quasi-optimality for coercive conforming Galerkin problems gives exact and discrete solvability and the factor Ma/αa 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.

[F5]

Bramble–Hilbert approximation on a reference simplex with Sobolev exponent two and r=sK≥2 supplies a degree-(sK−1) polynomial with reference H2 error bounded by the HsK seminorm. Shape regularity controls affine simplex geometry transports that estimate with the exact factors hKj−1, j=0,1,2.

[F6]

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 H01(Ω).

Proof

1.1F3F4given

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 ∥u−uT,p∥V≤(Ma/αa)inf⁡v∈VT,p∥u−v∥V.

1.2F1F3F4F6constructalgebra

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 2 to obtain Iu∈H01(Ω), so the interpolant is an admissible comparison in either norm branch. No neighboring degree ratio was used.

2.1F1F3step 1.1step 1.2algebra

Sum the squared cell seminorm bounds in [F1], which gives ∣u−Iu∣H1(Ω)2≤Cγ2∑KJK(qK)2 by [F3]. The full scaled estimate also gives ∥u−Iu∥L2(Ω)2≤Cγ2∑KhK2RK(qK)2. Their sum with the exact factor χ bounds ∥u−Iu∥V2. Use Iu 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 u, rather than by gluing the qK.

3.1F1F5step 2.1algebra

Choose the reference moment polynomial of degree sK−1 from [F5] and transport it to K. The degree condition makes it an admissible qK∈PmK(K). With wK=u−qK, scaling gives hK−1∥wK∥2+∣wK∣H1+hK∣wK∣H2≤CsK,γhKsK−1∣u∣HsK(K). The value and derivative edge trace bounds proved in [F1] therefore give the same bound for JK and RK. Substitute into step 2.1 to prove the general integer-regularity h estimate, including sK=2 on every degree assignment.

4.1F1F2step 2.1algebra∎

Under the stronger cellwise assumptions choose qK from [F2]. The scaled edge trace proved in [F1] gives JK(qK),RK(qK)≤CrK,γhKrK−1ηK∣u∣HrK(K): its value-edge term is bounded by C(hK−1∥wK∥2+∣wK∣H1), and its derivative-edge term by C(∣wK∣H1+hK∣wK∣H2), so exactly the three scaled norms in [F2] occur. Substitution into step 2.1 proves the second displayed bound with (1+χhK2). Finally [F2] gives ηK≤(4/mK)rK−4 under the stronger degree threshold. This retains the actual trace-degree and regularity constants and concludes both norm branches.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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 pK≥1, and let Vp be its trace-matching hp space. On V=H1(Ω) use a(v,w)=∫Ω(∇v⋅∇w+vw) and a bounded load F. Define the discrete form on Vp by

ap(vp,wp)=∑K∈T(aK,pK(vp∣K,wp∣K)+mK,pK(vp∣K,wp∣K)),

using the GLL stiffness and mass forms from Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature. Let u solve the exact variational problem and let up∈Vp solve ap(up,wp)=F(wp) for every wp∈Vp, with the exact load restricted to Vp. Define the form defect δa,p by Variational-crime settings and consistency defects. Then ∥u−up∥H1(Ω)≤inf⁡vp∈Vp(2∥u−vp∥H1(Ω)+δa,p(vp)). 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 pK≥1; exact a,F,u; the GLL form ap; and its discrete solution up.

[F1]

Matching variable-degree polynomial traces give an H1 function: the trace-matching hp space is finite-dimensional and contained in H1(Ω).

[F2]

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 3d times and below by 1 times the exact local H1 form, uniformly in its degree.

[F3]

Variational-crime settings and consistency defects: δa,p(vp)=sup⁡wp≠0∣a(vp,wp)−ap(vp,wp)∣/∥wp∥H1, while the load defect is defined analogously.

[F4]

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].

[F6]

Legendre-Gauss-Lobatto nodes, weights, and tensor quadrature defines the cell stiffness form aK,pK and mass form mK,pK used in the displayed discrete form.

Proof

1.1F1F2F3F5F6givenalgebra

Sum [F2] over cells. For every vp∈Vp, a(vp,vp)=∥vp∥H12 and ap(vp,vp)≥∥vp∥H12; Cauchy–Schwarz [F5] for the positive quadrature weights gives ∣ap(vp,wp)∣≤3d∥vp∥H1∥wp∥H1. Thus the discrete form is bounded and coercive with αp≥1, and the exact form has M=1. The exact load is unchanged on Vp, so δF,p=0.

2.1F1F3F4step 1.1givenalgebra∎

Apply [F4] with V=H1(Ω), the finite-dimensional conforming subspace from [F1], exact bounded coercive form a, GLL form ap, and the restricted load. Its bound is inf⁡vp∈Vp((1+M/αp)∥u−vp∥+(δa,p(vp)+δF,p)/αp). Substituting M=1, αp≥1, and δF,p=0 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