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 positive far-panel quadrature residual and normalized cluster combination
Statement
Let be disjoint nondegenerate compact triangles in a conforming surface mesh, let be supplied with , and set Apply and successive midpoint refinements to and , respectively. The resulting subtriangles have maximum diameters and . Give each subtriangle its area as a positive weight and its centroid as its node, obtaining rules and . Then satisfies Repeated midpoint subdivision makes this residual tend to zero. For exact algebraic panel coordinates, a supplied strict algebraic lower bound for and outward interval evaluation therefore gives an effective certificate at every positive tolerance; for other coordinates the corresponding certified separation and arithmetic bounds are required.
For the physical kernel, if the source nodes have charges in and the target nodes lie in with , then the literal single-cluster evaluator of Single-cluster three-dimensional Laplace multipole evaluator has and target-weight sum . Its contribution to the entry error is at most Add separately certified quadrature, node-evaluation and outward-arithmetic radii. This is a single-cluster estimate, not a multilevel or global complexity result.
Facts & Assumptions
Given: Countable Choice for the underlying trace-space conventions, a conforming mesh, two disjoint panels , a positive lower separation bound , the deterministic midpoint centroid rules, and, when the cluster branch is used, its certified balls and truncation order .
Assume Countable Choice (The Axiom of Countable Choice ()) for the mesh's underlying trace-space conventions. The centroid construction and finite single-cluster estimates below require no additional choice.
The affine surface-patch formula Surface area and scalar surface integrals on a regular patch gives for a panel. Shape-regular surface meshes and conforming P0 densities: each mesh panel is a compact nondegenerate convex triangle, and disjoint panels have positive distance. The midpoint subdivision area sum is checked directly in step 2.1.
The three-dimensional Laplace Newton kernel: the physical kernel is , with .
Mean value theorem on a closed real interval: for a differentiable scalar function on a segment, its increment is bounded by the segment length times the supremum of its derivative.
Single-cluster three-dimensional Laplace multipole evaluator and Three-dimensional Laplace cluster expansion error and work: for source charge sum in and target ball with , the single-cluster truncation error is at most , with only the stated single-cluster arithmetic count.
Proof
Fix a target node , source node , and points , in their subtriangles. The paths and stay in and by convexity. Every pair on either path with the other variable fixed has distance at least . Apply [F3] to and then to ; using [F2] and , gives
One midpoint refinement divides a triangle into four triangles with half-length sides; the determinant of each affine map is , so each new area is one quarter of the old area. Induction gives and . Integrate the pointwise bound of step 1.1 over each and sum; the area sums give .
After midpoint refinements every subtriangle diameter is at most times its initial diameter. Since and the right side of step 2.1 is proportional to , it tends to zero; for every prescribed positive quadrature tolerance a finite suffices. With exact algebraic coordinates, finite arithmetic and a certified strict lower bound for can be enclosed outward to any requested positive radius. If the geometry or arithmetic certificate is absent, no certified numerical result follows from this lemma.
For each target node the hypotheses in [F4] give the displayed uniform single-cluster error. Multiplication by its positive weight and summation bounds the target sum error by times that tail. The source charges must be because the evaluator sums while the physical kernel is . Adding the centroid residual from step 2.1 and the separately certified node-evaluation and outward-arithmetic radii by the triangle inequality proves the stated total entry bound. No cluster conclusion is asserted when .
Depends on
- Shape-regular surface meshes and conforming P0 densities
- The three-dimensional Laplace Newton kernel
- Mean value theorem on a closed real interval
- Single-cluster three-dimensional Laplace multipole evaluator
- Three-dimensional Laplace cluster expansion error and work
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Surface area and scalar surface integrals on a regular patch
Used by
Dependency tree · two levels
21 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)
- Michael O’Neil, Integral Equations and Fast Algorithms, complete course lecture notes (2017) (standard reference, not scraped)