Alphabeta Math
TheoremStatement: 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 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.

Depends on

Used by

Dependency tree · two levels

87 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