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.
Curved-domain geometry approximation errors
Definition
Let be a bounded reference domain and let be cellwise admissible maps with matching traces, positive Jacobians, and common image topology. The exact and approximate domains are and . Define and . A geometry approximation claim must separately state bounds on , both Jacobian lower bounds, and boundary-trace compatibility; none follows from the word “isoparametric.”
Tensor convention
The transformed Laplace tensors associated with these maps are and wherever the maps are differentiable. Boundary lifting error and data error are separate quantities and are not included in or .
Depends on
Used by
- Delaunay-seeded curved uniform NVB refinement Algorithm
- A parabolic shear has certified linear geometry approximations Example
- Opposite diagonals conserve mass under a curved shear Example
- Cofactor, surface-Jacobian, and normal perturbation bounds Lemma
- Derivative geometry error controls the Laplace tensor defect Lemma
- Geometry error bounds a pulled-back boundary-lift residual Lemma
- Matching simplex subdivisions give a NURBS knot-cell geometry interface Lemma
- P1 approximation of a parabolic shear map Lemma
- Quality and finite termination for the curved square NVB family Theorem
- Remap error separates source, target and geometry approximation Theorem
- Strang error bound for a parabolic isoparametric P1 family Theorem
Dependency tree · two levels
2 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 2023, Part III, Chapter 8 (standard reference, not scraped)
- Gerald Dziuk and Charles M. Elliott, Finite element methods for surface PDEs, Acta Numerica 22 (2013) (standard reference, not scraped)