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.

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.

Depends on

Used by

Dependency tree · two levels

32 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