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.
Certified touching-panel and disjoint-panel quadrature for the Laplace P0 matrix
Statement
Assume the Axiom of Choice and Countable Choice, and let be panels of the conforming surface triangulation in Shape-regular surface meshes and conforming P0 densities. For put and define The integral is absolutely convergent. If is the single-layer operator of Calderon boundary operators and trace conventions, then
For coincident panels, panels sharing a full edge, and panels sharing a vertex, the exact affine parameter integral for has a finite decomposition into integrals where , each is smooth on a neighborhood of , and every integral is the Duffy-transformed case with exponent . The decomposition includes every singular-face dimension: in each four-simplex of the finite decomposition the zero face may have dimension , , or . If and are disjoint, their positive separation instead gives one smooth reference-triangle integral with the same exponent .
The constructions supply explicit lower bounds for every denominator and explicit derivative bounds for every required amplitude. Given exact algebraic panel coordinates and any positive absolute tolerance , the finite nested Gaussian procedure described in the proof terminates with an outward-certified value satisfying . For other coordinate representations, the procedure has the same guarantee when certified finite incidence, nondegeneracy, separation, and arithmetic bounds are supplied as input. It makes no termination claim for deciding incidences from an uncertified arbitrary-real oracle.
Facts & Assumptions
Given: The Axiom of Choice and Countable Choice, a conforming finite triangular surface mesh, panels , the normalized Newton kernel, and the weak single-layer matrix entry.
Assume Countable Choice (The Axiom of Countable Choice ()). It supplies the choice hypotheses of the analytical and Gaussian-rule suppliers in [F3], [F6] and [F8]; the positive rules themselves come from [F6]. The prescribed precision-refinement procedure is deterministic and uses no additional choice.
The Axiom of Choice: the Axiom of Choice is required by the trace/lifting and weak single-layer mapping suppliers used for the weak-pairing identity.
Shape-regular surface meshes and conforming P0 densities: each panel is a compact nondegenerate convex triangle; two panels are equal, meet in a common full edge, meet in a common vertex, or are disjoint; and .
The three-dimensional single layer is bounded and coercive and Calderon boundary operators and trace conventions: under the Axiom of Choice and Countable Choice, is bounded, and is the common weak trace of the single-layer potential; for bounded that potential agrees off with the normalized Newton-kernel integral.
The H1 trace and lifting theorem on a compact Lipschitz boundary: the trace from local functions into the fixed space is bounded; a continuous representative has its pointwise restriction as its trace.
The reference-triangle Duffy map from a vertex and The Duffy map turns a vertex singularity into an integrable radial weight: the reference-triangle Duffy map sends to , with an absolutely convergent integral for .
Weighted product Gauss quadrature after the Duffy transform and The Duffy weighted product rule has an explicit bound using pure coordinate derivatives: for , the positive weighted product rule has the stated derivative error bound for amplitudes with the indicated pure derivatives.
A tensor product of two positive Gaussian rules has a derivative error bound: the tensor Gaussian remainder is bounded by its pure derivative constants; taking a constant second-coordinate amplitude yields the one-variable midpoint specialization.
Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, Dominated convergence, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, and A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not: nonnegative and dominated product integrals may be interchanged or passed to limits, and the stated injective smooth and affine changes of variables carry their Jacobians.
For an affine regular panel parametrization , surface integration has constant Gram factor . Thus panel area and panel integrals pull back by ; the panel edges are parameter-boundary null sets. This surface formula, rather than a three-dimensional volume substitution, supplies the two factors in step 1.1. (Surface area and scalar surface integrals on a regular patch)
Proof
Parametrize and by affine maps and from . Their constant surface Jacobians are and . With on , the nonnegative change of variables in [F8] gives , initially allowing an infinite value. The zero set is the parameterized diagonal of and has dimension , , or for coincident, edge-sharing, or vertex-sharing panels.
Cut by each non-identically-zero coordinate hyperplane . Enumerate each cell’s finitely many vertices by active boundary-hyperplane sets, discarding infeasible intersections. The at most eight resulting full-dimensional sign cells cover up to their boundaries; those boundaries are contained in finitely many hyperplanes and have four-dimensional measure zero by Fubini in [F8]. For any and interior point of a sign cell, for , so every belongs to that cell's closure. The simultaneous zero set of its signed nonnegative affine coordinates is therefore a nonempty face.
Triangulate each cell by pulling from a global vertex ordering that lists all vertices in first and uses the same induced order on shared faces. The pulling induction is complete: for any point other than the first vertex, extend the segment from that vertex through the point to its last point in the cell; the exit point lies on a facet not containing the first vertex, so cones over those facets cover the cell, and overlaps occur only on their boundaries. Induction triangulates those facets and the common induced ordering makes adjacent cell triangulations agree. Every full-dimensional cell has a vertex in its nonempty face , hence its first vertex is in ; each resulting four-simplex therefore has a zero vertex. In a simplex with signed affine coordinates nonnegative, their common zero set is exactly the convex hull of the zero vertices, so the zero face has dimension , covering all three contact types including coincident panels.
In a resulting four-simplex , order the vertices so exactly lie in , put and , and define on the opposite face . That face contains no zero of , so compactness gives . The join coordinates , with , , and , are one-to-one in the interiors and have absolute Jacobian : the independent directions scale by , the independent directions by , and the radial column supplies . Also .
The kernel times this Jacobian has radial factor . For , and , so . This is finite because . For , split the unit square into its two triangles and swap coordinates on one to get with . For , maps onto with determinant one. For , set , , on ; the remaining barycentric coordinate is and the Jacobian is . Thus each case is a finite sum of reference-triangle integrals, including all zero-face dimensions, and each transformed amplitude is smooth near because its denominator is bounded below by . The coefficients include the positive factor from step 1.1 and the positive simplex determinants and radial factors above.
The positive bound is effectively certifiable from the finitely many vectors . Enumerate every nonempty face of their convex hull and solve the finite affine normal equations for the point nearest zero on its affine span, retaining feasible barycentric coordinates; a global minimizer lies in the relative interior of a smallest face and has zero tangential derivative there, so this enumeration finds the minimum. Row-reduce degenerate systems and include their lower-dimensional faces. Positivity follows from the zero-face characterization in step 4.1. For algebraic panel coordinates, exact algebraic comparisons and interval refinement yield a rational . For each polynomial parameterization whose admissible domain lies in a unit cube and whose image lies in the image under of the opposite face, set on that admissible domain, , out-of-range , and . The product and chain rules inductively give ; hence bounds each required derivative there, since the absolute coefficient sum bounds a polynomial on the containing unit cube. Compose the triangle coordinates with the Duffy map before using a full square as the admissible domain; no positive denominator bound is asserted on an extension outside that image. Apply the finite Leibniz rule to polynomial prefactors such as and add the bounds for finite amplitude sums before using these estimates for . Differentiation under the finite integral in the map is justified by these uniform bounds and the fundamental theorem of calculus.
For each smooth reference amplitude in step 5.1, the Duffy map from [F5] gives , . With , the positive product rule in [F6] has error at most , since . The derivative bounds are computed in step 6.1; add the separately certified node-value, fiber, and outward-arithmetic radii with the coefficients .
This bound gives effective termination. Fix and subdivide into similar triangles of maximum diameter ; after affine pullback the second pure derivatives of are bounded by , so the positive-rule errors sum to after multiplying by the affine Jacobians, whose sum is one. Indeed, has , so the pure second-derivative chain rules contain only the Hessian of and two factors from the affine map, each of size . Its nonzero mixed derivative is not part of the Gaussian remainder used here. In the fiber, composite midpoint quadrature on equal subintervals has error at most by the one-variable Gaussian remainder [F7]. Choose so these bounds consume less than half the requested tolerance, then refine outward interval enclosures for the remaining half. Exact algebraic input makes incidence, determinant, and strict-positive denominator decisions finite; every refinement terminates because the certified lower bounds are positive. With other coordinate formats, require supplied certified incidence, nondegeneracy, separation, and arithmetic bounds; absent or failed certificates return uncertified.
If are disjoint, . The parameter kernel is smooth on with denominator at least . Compose with the Duffy parameterizations of both triangles; it is polynomial on a product of unit squares and still has norm at least , so the recurrence of step 6.1 with a rational lower bound below supplies explicit uniform derivatives. Integrating over defines ; differentiation under this finite integral is justified by those uniform bounds, and the simplex mass is . The affine map sends the outer triangle to . Evaluate each inner integral by the positive composite Duffy rule; its error bound is uniform in . Apply the outer rule of step 7.1 to . Subdividing both reference triangles and using their computed second-derivative bounds makes the inner errors uniformly in and the outer error ; positivity and bounded total weight let these errors add. Thus the disjoint smooth fallback terminates at every positive tolerance, with its two numerical radii charged separately.
To identify the double integral with the weak matrix entry, use barycentric coordinates and cutoffs on each panel. They are bounded by one and converge almost everywhere and in to the panel indicator. By [F1], each cutoff is an density and the fixed chart norm controls , so these cutoffs converge in by duality; boundedness of in [F3] gives . For the trace identification, a finite union of planar faces satisfies ; dyadic annuli imply . Splitting at distance and using gives continuity modulus for each bounded cutoff potential throughout a bounded neighborhood of : the area and near-integral bounds are uniform for ambient target points, and the same near/far split applies there. By [F3] the off-surface kernel integral represents its weak potential; by [F4] its continuous restriction is its Sobolev trace, and Fubini [F8] identifies the pairing with the cutoff double integral. Absolute integrability from the touching-panel calculation in step 5.1 and the disjoint case in step 8.2 dominates these integrands, so dominated convergence gives for coincident, edge-sharing, vertex-sharing, and disjoint panels.
Depends on
- Shape-regular surface meshes and conforming P0 densities
- The Axiom of Choice
- The H1 trace and lifting theorem on a compact Lipschitz boundary
- The three-dimensional Laplace Newton kernel
- The three-dimensional single layer is bounded and coercive
- Calderon boundary operators and trace conventions
- The reference-triangle Duffy map from a vertex
- The Duffy map turns a vertex singularity into an integrable radial weight
- Weighted product Gauss quadrature after the Duffy transform
- The Duffy weighted product rule has an explicit bound using pure coordinate derivatives
- A tensor product of two positive Gaussian rules has a derivative error bound
- Tonelli and Fubini for the completed product, with only almost-everywhere section measurability
- Dominated convergence
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Surface area and scalar surface integrals on a regular patch
Used by
Dependency tree · two levels
116 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)