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.
Shape-regular surface meshes and conforming P0 densities
Definition
Let be a polyhedral boundary as in Lipschitz polyhedral boundary, orientation, and trace spaces. A conforming surface triangulation is a finite collection of nondegenerate closed planar triangles covering , with disjoint relative interiors, such that two distinct triangles meet only in a common full edge, a common vertex, or not at all. For , write and let be the radius of the largest disk contained in ; the family is shape regular if , and quasi-uniform if for .
The conforming P0 density space is . The continuous inclusion follows because each chart Bessel norm controls its L2 norm and the fixed partition is finite. Hence every defines a bounded functional on ; thus . This inclusion makes the single-layer Galerkin method conforming in its energy space.
Depends on
Used by
- Certified near-quadrature and far-multipole matrix assembly Algorithm
- A positive far-panel quadrature residual and normalized cluster combination Lemma
- Certified touching-panel and disjoint-panel quadrature for the Laplace P0 matrix Lemma
- P0 averages approximate smooth densities in H negative one half Lemma
- A certified matrix defect transfers to a Galerkin error bound Theorem
- P0 Galerkin BEM for the single layer is well posed and quasioptimal Theorem
Dependency tree · two levels
8 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
- Francisco-Javier Sayas, First Steps in the Boundary Element Method (2015 lecture notes) (standard reference, not scraped)
- Martin Costabel, Boundary Integral Operators on Lipschitz Domains: Elementary Results (1988) (standard reference, not scraped)