Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Constructive varying-degree triangle interpolation in unweighted H1

Statement

Assume Full Choice. Let 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.

Depends on

Used by

Dependency tree · two levels

63 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources