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 , let , and let be a real polynomial of degree at most satisfying . Define the polynomial by cancellation at , and put
Then , it equals on , and it vanishes on and . Moreover,
independently of . Permuting the three vertices gives the same bound, up to one fixed constant, for each reference edge. If is a shape-regular affine triangle, is an edge of length , and , the transported lift satisfies
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 edge norm and asserts no optimal trace-lifting bound.
Facts & Assumptions
Given: Countable Choice; the reference triangle; a polynomial with the stated endpoint values; and, for the physical-cell assertion, a shape-regular affine triangle and one of its edges.
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)
The Sobolev norm is the norm of the function and its weak first derivatives. (Integer-order Sobolev spaces and their norms)
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: , with equality exactly for dependent pairs)
Countable Choice is the exact assumption used by [F1]; no arbitrary family of polynomial lifts is selected. (The Axiom of Countable Choice ())
Proof
Since , polynomial division gives a polynomial of degree at most when ; for or the endpoint conditions force . Thus has total degree at most . At , , so ; at it is zero; and on one has , so .
Put . Polynomial integration term by term gives , so Cauchy–Schwarz [F3] yields and hence . The identity gives . Also , so . Writing , the slices of are . Therefore and Fubini [F3] justifies the slice integrals. Using the Sobolev norm definition [F2], adding the three inequalities gives , proving the safe constant four.
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 . 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 . The physical norm has one additional factor bounded by by [F1]. This gives both stated estimates.
Let be continuous polynomial data on the three edges, with edge degrees at most . For , continuity makes one constant and that constant extends it. For , let be the affine interpolant of the three vertex values. Each edge residual vanishes at both endpoints and has degree at most . Lift the three residuals separately by step 1.1; each lift vanishes on the other two edges. Their sum plus therefore has trace exactly and degree at most . This works when edge degrees differ and requires no equal-degree assumption.
Depends on
- Matching affine simplicial meshes and shape regularity
- Integer-order Sobolev spaces and their norms
- Shape regularity controls affine simplex geometry
- Fubini's theorem for L^1 functions on a sigma-finite product
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 30: hp Finite Elements (standard reference, not scraped)
- Martin Vohralík, Finite Element Methods, Chapter 6: hp finite elements (standard reference, not scraped)