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.
P1 interpolation scaling on uniformly curved cells
Statement
Assume AC and Countable Choice. In dimension two let , where is a shape-regular affine triangle of diameter comparable to , and extends to a diffeomorphism on a neighborhood of . Assume are uniformly bounded. Let denote its continuous representative and set , the mapped nodal P1 interpolant. For , and , with uniform over the family.
Facts & Assumptions
Given: AC and Countable Choice; a uniformly shape-regular affine triangle family; uniformly bi-Lipschitz cell maps with bounded second derivatives and Jacobian inverse; and .
Local interpolation estimates on shape-regular affine meshes: under Countable Choice and, for automatic nodal boundedness, AC, on a shape-regular affine mesh, the nodal P1 interpolant of an function has error at most and seminorm error at most .
Admissible isoparametric curved cells: admissible maps are diffeomorphisms with positive Jacobian and uniform derivative and inverse bounds.
AC is used for continuous-representative nodal evaluation in [F5] and its automatic nodal-boundedness application in [F1]; Countable Choice is used through [F1] and [F4] (The Axiom of Choice, The Axiom of Countable Choice ()).
C^k boundary flattening preserves local W^{k,p}: under Countable Choice, composition with a diffeomorphism and its inverse having bounded derivatives through order two is bounded on local spaces, with the weak derivatives given by the chain-rule polynomials.
Sobolev threshold for Lagrange point evaluations on a reference simplex: under AC, in dimension , point evaluation is bounded on because , so the nodal values are defined for the continuous representative.
Proof
First apply [F4] to on the interiors of the reference and curved cells. The maps extend to a diffeomorphism on neighborhoods of the compact cell closures, and the stated derivative, inverse-derivative, and Jacobian bounds give with . Now [F5] supplies the unique continuous representative of on , so its three reference-vertex values are defined. The function is continuous on and represents , by the inverse-composition part of [F4]. If is any other continuous representative of on , then is a continuous representative of and equals by [F5]; hence the representative on is unique. Its values at the curved-cell vertices are exactly the pulled-back nodal values. Applying [F4] to the inverse map also gives the uniform and norm bounds needed when the interpolation error is pushed back to .
Apply [F1] to on the affine triangle . The mapped interpolant is exactly because its three nodal values are those of at the three image vertices. The affine estimates give and , using the assumed diameter comparability.
Push the error through using step 1.1. The resulting uniform norm bounds are the two claimed estimates. AC is used in [F5] for the continuous representative and nodal evaluations, including the automatic nodal-boundedness application in [F1]; Countable Choice is used through [F1] and [F4].
Depends on
Used by
Dependency tree · two levels
29 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Part III, Chapter 11 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, §4.2 (standard reference, not scraped)